Building domains from graph models

DOI10.1017/S0960129500001481MaRDI QIDQ4279258zbMATH OpenOpenAlexFDO

Authors Wesley Phoa

Publication date 26 July 1994

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

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

zbMATH Keywords

\(\lambda\)-calculusbounded quantificationcategories of PERsdomain equationspartial equivalence relations over graph modelspolymorphic typespowerdomain constructionspredomainsrealizability topossubtypingsynthetic domain theory

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Categorical logic, topoi (03G30) Topoi (18B25) Semantics in the theory of computing (68Q55)

Recommendations

• From term models to domains
• From term models to domains
• Domains via graphs
• Extensional PERs

Cites work

• A small complete category
• Data Types as Lattices
• scientific article; zbMATH DE number 431770 (Why is no real title available?)
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(8)

• Extensional PERs
• From term models to domains
• Computational adequacy for recursive types in models of intuitionistic set theory
• scientific article; zbMATH DE number 4181330 (Why is no real title available?)
• From term models to domains
• The Sierpinski object in the Scott realizability topos
• Domains via graphs
• An exper model for Quest

This page was built for publication: Building domains from graph models

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