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