A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\)

DOI10.1016/S0304-3975(97)00038-8zbMath0908.03021MaRDI QIDQ1127535

Thomas Drakengren

Publication date: 13 August 1998

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

zbMATH Keywords

canonical representationlambda calculuscompact elementsreflexive domains

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items (1)

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniqueness of Scott's reflexive domain in \(P\omega \)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Isomorphisms and nonisomorphisms of graph models
• Data Types as Lattices
• A Powerdomain Construction

This page was built for publication: A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\)