A uniform approach to domain theory in realizability models
From MaRDI portal
Publication:4366768
DOI10.1017/S0960129597002387zbMath0934.03081MaRDI QIDQ4366768
Publication date: 6 April 2000
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
domains; completeness; divergence; subobject classifier; Kleisli category; partial morphism; combinatory algebra; category of assemblies; lift monad
68Q55: Semantics in the theory of computing
03G30: Categorical logic, topoi
18D15: Closed categories (closed monoidal and Cartesian closed categories, etc.)
03B40: Combinatory logic and lambda calculus
18C20: Eilenberg-Moore and Kleisli constructions for monads
Related Items
Domains in \(H\), A synthetic theory of sequential domains, Comparing free algebras in topological and classical domain theory, Axioms and (counter)examples in synthetic domain theory, The sequentially realizable functionals, Computational adequacy for recursive types in models of intuitionistic set theory, A Convenient Category of Domains