Extensional PERs

DOI10.1016/0890-5401(92)90019-CzbMath0762.18006MaRDI QIDQ1193589

S. Singh

Publication date: 27 September 1992

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

Turing machinespartial equivalence relationsCartesian closed categorysemantics of programming languagescategory of domains

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Topoi (18B25) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Categories of spans/cospans, relations, or partial maps (18B10)

Related Items (11)

Lifting theorems for Kleisli categories ⋮ Computational adequacy for recursive types in models of intuitionistic set theory ⋮ Partial map classifiers and partial cartesian closed categories ⋮ A new framework for declarative programming ⋮ An exper model for Quest ⋮ Inheritance as implicit coercion ⋮ Monads and algebras in the semantics of partial data types ⋮ Some economic applications of Scott domains ⋮ Independence of the induction principle and the axiom of choice in the pure calculus of constructions ⋮ Domains in \(H\) ⋮ From term models to domains

Cites Work

• Generalized Banach-Mazur functionals in the topos of recursive sets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extensional PERs