Extensional PERs

DOI10.1016/0890-5401(92)90019-CzbMATH Open0762.18006MaRDI QIDQ1193589FDOQ1193589

Authors: S. Singh 

Publication date: 27 September 1992

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

Recommendations

• scientific article; zbMATH DE number 4181330
• A note on ``Extensional PERs
• Building domains from graph models
• From term models to domains
• scientific article; zbMATH DE number 956835

zbMATH Keywords

Cartesian closed categoryTuring machinessemantics of programming languagescategory of domainspartial equivalence relations

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized Banach-Mazur functionals in the topos of recursive sets

Cited In (15)

• Domains in \(H\)
• A new framework for declarative programming
• Synthetic domain theory in type theory: another logic of computable functions
• Lifting theorems for Kleisli categories
• Independence of the induction principle and the axiom of choice in the pure calculus of constructions
• Partial map classifiers and partial cartesian closed categories
• Title not available (Why is that?)
• Computational adequacy for recursive types in models of intuitionistic set theory
• From term models to domains
• Title not available (Why is that?)
• A note on ``Extensional PERs
• Inheritance as implicit coercion
• Monads and algebras in the semantics of partial data types
• Some economic applications of Scott domains
• An exper model for Quest

This page was built for publication: Extensional PERs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193589)