A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
From MaRDI portal
Publication:4094853
DOI10.1112/JLMS/S2-12.3.361zbMATH Open0329.02010OpenAlexW2036605992MaRDI QIDQ4094853FDOQ4094853
Authors: Martin Hyland
Publication date: 1976
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-12.3.361
Cited In (36)
- On infinite \(\eta\)-expansion
- Strong normalization from an unusual point of view
- Lazy Lambda calculus: Theories, models and local structure characterization
- Title not available (Why is that?)
- Full abstraction and recursion
- On the construction of stable models of untyped \(\lambda\)-calculus
- Relational graph models, Taylor expansion and extensionality
- Classical lambda calculus in modern dress
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- Algebraic interpretation of lambda calculus with resources
- Aλδ-calculus with an algorithmicδ
- \(\mathbb{T}^\omega\) as a universal domain
- Intersection types for \(\lambda\)-trees
- A syntactical proof of the operational equivalence of two \(\lambda\)-terms
- A characterization of F-complete type assignments
- Completeness of type assignment in continuous lambda models
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Polymorphic type inference and containment
- Innocent game models of untyped \(\lambda\)-calculus
- On the semantics of the call-by-name CPS transform
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Title not available (Why is that?)
- Böhm's theorem for resource lambda calculus through Taylor expansion
- Infinitary lambda calculus and discrimination of Berarducci trees.
- Definability and full abstraction
- From Böhm's Theorem to Observational Equivalences
- Invertible terms in the lambda calculus
- Order-incompleteness and finite lambda reduction models
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory
- Easiness in graph models
- Parametric \(\lambda \)-theories
- A General Class of Models of $\mathcal{H}^*$
- Some reasons for generalising domain theory
- Call-by-value Solvability
- Title not available (Why is that?)
This page was built for publication: A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4094853)