The insensitivity theorem for nonreducing reflexive types
DOI10.1016/0022-0000(83)90049-1zbMATH Open0537.68035OpenAlexW2060254233MaRDI QIDQ792755FDOQ792755
Authors: Egidio Astesiano, Gerardo Costa
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
Recommendations
programming languagestyped lambda calculusabstract semanticsapplicative language modellingfree continuous algebrasreducing type
Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40) Hierarchies of computability and definability (03D55) Abstract data types; algebraic specification (68Q65) Higher-type and set recursion theory (03D65)
Cites Work
- Initial Algebra Semantics and Continuous Algebras
- Data Types as Lattices
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Fully abstract models of typed \(\lambda\)-calculi
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication: The insensitivity theorem for nonreducing reflexive types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792755)