The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martín Hötzel Escardó: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martín Hötzel Escardó
    Compactness in Topology and Computation. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:379- [Conf]
  2. Andrej Bauer, Martín Hötzel Escardó, Alex K. Simpson
    Comparing Functional Paradigms for Exact Real-Number Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:488-500 [Conf]
  3. Martín Hötzel Escardó
    Recursion and Induction on the Real Line. [Citation Graph (0, 0)][DBLP]
    Theory and Formal Methods, 1994, pp:259-282 [Conf]
  4. Abbas Edalat, Martín Hötzel Escardó
    Integration in Real PCF. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:382-393 [Conf]
  5. Martín Hötzel Escardó, Ho Weng Kin
    Operational Domain Theory and Topology of a Sequential Programming Language. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:427-436 [Conf]
  6. Martín Hötzel Escardó, Alex K. Simpson
    A Universal Characterization of the Closed Euclidean Interval. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:115-128 [Conf]
  7. Martín Hötzel Escardó, Thomas Streicher
    Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:376-386 [Conf]
  8. J. Raymundo Marcial-Romero, Martín Hötzel Escardó
    Semantics of a Sequential Language for Exact Real-Number Computation. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:426-435 [Conf]
  9. Dusko Pavlovic, Martín Hötzel Escardó
    Calculus in Coinductive Form. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:408-417 [Conf]
  10. Peter John Potts, Abbas Edalat, Martín Hötzel Escardó
    Semantics of Exact Real Arithmetic. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:248-257 [Conf]
  11. Ben Cohen, Martin Escardo, Klaus Keimel
    The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:566-575 [Conf]
  12. Martín Hötzel Escardó
    Joins in the Frame of Nuclei. [Citation Graph (0, 0)][DBLP]
    Applied Categorical Structures, 2003, v:11, n:2, pp:117-124 [Journal]
  13. Martín Hötzel Escardó
    Compactly generated Hausdorff locales. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:137, n:1-3, pp:147-163 [Journal]
  14. Martín Hötzel Escardó
    Hausdorff compactifications of topological function spaces via the theory of continuous lattices. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:40, n:, pp:- [Journal]
  15. Martín Hötzel Escardó
    Effective and sequential definition by cases on the reals via infinite signed-digit numerals. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:13, n:, pp:- [Journal]
  16. Martín Hötzel Escardó
    On the Compact-regular Coreflection of a Stably Locally Compact Locale. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:20, n:, pp:- [Journal]
  17. Martín Hötzel Escardó, Bob Flagg
    Semantic Domains, Injective Spaces and Monads. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:20, n:, pp:- [Journal]
  18. Martín Hötzel Escardó, Achim Jung
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:73, n:, pp:1-2 [Journal]
  19. Martín Hötzel Escardó, Achim Jung, Michael W. Mislove
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:155, n:, pp:1-3 [Journal]
  20. Abbas Edalat, Martín Hötzel Escardó
    Integration in Real PCF. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:160, n:1-2, pp:128-166 [Journal]
  21. Martín Hötzel Escardó, Thomas Streicher
    In Domain Realizability, not all Functionals on C[-1, 1] are Continuous. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:S1, pp:41-44 [Journal]
  22. Martín Hötzel Escardó, Martin Hofmann, Thomas Streicher
    On the non-sequential nature of the interval-domain model of real-number computation. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2004, v:14, n:6, pp:803-814 [Journal]
  23. Jirí Adámek, Martín Hötzel Escardó, Martin Hofmann
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:294, n:1/2, pp:1- [Journal]
  24. Lars Birkedal, Martín Hötzel Escardó, Achim Jung, Giuseppe Rosolini
    Preface: Recent Developments in Domain Theory: A collection of papers in honour of Dana S. Scott. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:316, n:1, pp:1-2 [Journal]
  25. Martín Hötzel Escardó
    PCF Extended with Real Numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:162, n:1, pp:79-115 [Journal]
  26. Martín Hötzel Escardó, Thomas Streicher
    Induction and Recursion on the Partial Real Line with Applications to Real PCF. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:210, n:1, pp:121-157 [Journal]
  27. Frédéric De Jaeger, Martín Hötzel Escardó, Gabriele Santini
    On the computational content of the Lawson topology. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:357, n:1-3, pp:230-240 [Journal]
  28. Martin Escardo
    Infinite sets that admit fast exhaustive search. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:443-452 [Conf]
  29. J. Raymundo Marcial-Romero, Martín Hötzel Escardó
    Semantics of a sequential language for exact real-number computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:1-2, pp:120-141 [Journal]

  30. Theory and Practice of Higher-type Computation (Tutorial). [Citation Graph (, )][DBLP]


  31. Computability of Continuous Solutions of Higher-Type Equations. [Citation Graph (, )][DBLP]


  32. The Peirce Translation and the Double Negation Shift. [Citation Graph (, )][DBLP]


  33. Computational Interpretations of Analysis via Products of Selection Functions. [Citation Graph (, )][DBLP]


  34. Exhaustible sets in higher-type computation [Citation Graph (, )][DBLP]


  35. Synthetic Topology: of Data Types and Classical Spaces. [Citation Graph (, )][DBLP]


  36. Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.155secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002