A uniform approach to domain theory in realizability models

DOI10.1017/S0960129597002387zbMath0934.03081OpenAlexW1989069191MaRDI QIDQ4366768

John Longley, Alex K. Simpson

Publication date: 6 April 2000

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129597002387

zbMATH Keywords

domainscompletenessdivergencesubobject classifierKleisli categorypartial morphismcombinatory algebracategory of assemblieslift monad

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Combinatory logic and lambda calculus (03B40) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Related Items (12)

Non-deterministic effects in a realizability model ⋮ The intrinsic topology of Martin-Löf universes ⋮ Computational adequacy for recursive types in models of intuitionistic set theory ⋮ A synthetic theory of sequential domains ⋮ Parallelism in realizability models ⋮ On the Semantics of Intensionality ⋮ Comparing free algebras in topological and classical domain theory ⋮ Domains in \(H\) ⋮ Unnamed Item ⋮ Axioms and (counter)examples in synthetic domain theory ⋮ The sequentially realizable functionals ⋮ A Convenient Category of Domains

This page was built for publication: A uniform approach to domain theory in realizability models