Uniqueness of Scott's reflexive domain in \(P\omega \)

DOI10.1016/0304-3975(96)00102-8zbMath0873.03014OpenAlexW2063983720MaRDI QIDQ672137

Thomas Drakengren

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(96)00102-8

zbMATH Keywords

codings of the \(P\omega\) modelextensional model in \(P\omega\)pure \(\lambda\)-calculus

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items (3)

A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\) ⋮ Uniqueness of Scott's reflexive domain in \(P\omega \) ⋮ A coinductive completeness proof for the equivalence of recursive types

Cites Work

• Unnamed Item
• Uniqueness of Scott's reflexive domain in \(P\omega \)
• The lambda calculus, its syntax and semantics
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Isomorphisms and nonisomorphisms of graph models
• Data Types as Lattices
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus

This page was built for publication: Uniqueness of Scott's reflexive domain in \(P\omega \)