The insensitivity theorem for nonreducing reflexive types

DOI10.1016/0022-0000(83)90049-1zbMath0537.68035OpenAlexW2060254233MaRDI QIDQ792755

Gerardo Costa, Egidio Astesiano

Publication date: 1983

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(83)90049-1

zbMATH Keywords

programming languagestyped lambda calculusabstract semanticsapplicative language modellingfree continuous algebrasreducing type

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40) Higher-type and set recursion theory (03D65) Hierarchies of computability and definability (03D55)

Uses Software

• Unnamed Item

Cites Work

• Fully abstract models of typed \(\lambda\)-calculi
• Data Types as Lattices
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Initial Algebra Semantics and Continuous Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The insensitivity theorem for nonreducing reflexive types