What is a model of the lambda calculus?

Cited In (45)

Kripke-style models for typed lambda calculus
Primitive recursive functional with dependent types
A relative PCF-definability result for strongly stable functions and some corollaries
Title not available (Why is that?)
Functional programming with combinators
Title not available (Why is that?)
Logical semantics for stability
Type inference, abstract interpretation and strictness analysis
A Filter Model for the λμ-Calculus
On the construction of stable models of untyped \(\lambda\)-calculus
Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus
Quantitative domains and infinitary algebras
Extensional models for polymorphism
Type inference with simple subtypes
A finite equational axiomatization of the functional algebras for the lambda calculus
Computability in higher types, P\(\omega\) and the completeness of type assignment
On combinatory algebras and their expansions
Completeness of type assignment in continuous lambda models
Type theories, normal forms, and \(D_{\infty}\)-lambda-models
Polymorphic type inference and containment
Call-by-value combinatory logic and the lambda-value calculus
Infinite \(\lambda\)-calculus and types
The interpretation of unsolvable λ-terms in models of untyped λ-calculus
A category-theoretic characterization of functional completeness
Inheritance as implicit coercion
The semantics of second-order lambda calculus
A generalized Kahn Principle for abstract asynchronous networks
On the algebraic models of lambda calculus
Applications of type theory
An algebraic semantics of higher-order types with subtypes
Topology, domain theory and theoretical computer science
Intersection and union types
Title not available (Why is that?)
Proof-functional connectives and realizability
Towards lambda calculus order-incompleteness
A note on the proof theory of the \(\lambda \Pi\)-calculus
The untyped computational \(\lambda \)-calculus and its intersection type discipline
Full abstraction and the Context Lemma (preliminary report)
The abstract variable-binding calculus
Correctness of procedure representations in higher-order assembly language
Easy lambda-terms are not always simple
Enlargements of functional algebras for the lambda calculus
Representation of varieties in combinatory algebras
Higher-order order-sorted algebras
Lambda abstraction algebras: representation theorems

This page was built for publication: What is a model of the lambda calculus?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744243)