Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus

DOI10.1016/0890-5401(90)90064-OzbMath0825.68447MaRDI QIDQ1813498

Bard Bloom

Publication date: 25 June 1992

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

Mathematics Subject Classification ID

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

Related Items (5)

Fully abstract translations between functional languages ⋮ Labelled reductions, runtime errors, and operational subsumption ⋮ A first order logic of effects ⋮ From operational to denotational semantics ⋮ A stable programming language

Cites Work

• Expressibility of functionals in D. Scott's LCF language
• Fully abstract submodels of typed lambda calculi
• The lambda calculus, its syntax and semantics
• Fully abstract models of typed \(\lambda\)-calculi
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Data Types as Lattices
• What is a model of the lambda calculus?
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus