Fully abstract submodels of typed lambda calculi

DOI10.1016/0022-0000(86)90041-3zbMath0633.03006OpenAlexW2058690978MaRDI QIDQ1095880

Ketan D. Mulmuley

Publication date: 1986

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(86)90041-3

zbMATH Keywords

typed lambda calculusfully abstract model\(\omega\)-algebraic complete latticealgebraic submodel

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models of other mathematical theories (03C65) Lattices (06B99) Combinatory logic and lambda calculus (03B40)

Related Items

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

Cites Work

• The congruence of two programming language definitions
• Fully abstract models of typed \(\lambda\)-calculi
• Infinite trees in normal form and recursive equations having a unique solution
• A Powerdomain Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item