Publication:2844075

zbMath1270.68082MaRDI QIDQ2844075

Martín Hötzel Escardó

Publication date: 27 August 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066104051357

Mathematics Subject Classification ID

54D30: Compactness

68N15: Theory of programming languages

54A05: Topological spaces and generalizations (closure spaces, etc.)

68Q55: Semantics in the theory of computing

68Q65: Abstract data types; algebraic specification

68-02: Research exposition (monographs, survey articles) pertaining to computer science

06B35: Continuous lattices and posets, applications

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

54-02: Research exposition (monographs, survey articles) pertaining to general topology

03D75: Abstract and axiomatic computability and recursion theory

Related Items

Quotienting the delay monad by weak bisimilarity, On computability and disintegration, Brouwer's fixed-point theorem in real-cohesive homotopy type theory, Continuous Domain Theory in Logical Form, Computability of Subsets of Metric Spaces, Admissibly Represented Spaces and Qcb-Spaces, Synthetic topology in Homotopy Type Theory for probabilistic programming, Partiality and Container Monads, Probability, valuations, hyperspace: Three monads on top and the support as a morphism, An induction theorem and Ekeland's variational principle in partial metric spaces with applications, Computable analysis with applications to dynamic systems, A Hofmann-Mislove theorem for Bitopological Spaces, Every metric space is separable in function realizability, On the topological aspects of the theory of represented spaces, De groot duality for represented spaces, Approaching metric domains, The equivalence of bar recursion and open recursion, Lax algebra meets topology, Metric spaces in synthetic topology, Generalized metric spaces: a survey, A Hofmann-Mislove theorem for bitopological spaces, Operational domain theory and topology of sequential programming languages, A topological view on algebraic computation models, On fixed-point theorems in synthetic computability, On the computability of the set of automorphisms of the unit square, Topological theories and closed objects, Compactness in locales and in formal topology, Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting, A Convenient Category of Domains, Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract), Unnamed Item