What is a model of the lambda calculus?

DOI10.1016/S0019-9958(82)80087-9zbMath0507.03002OpenAlexW1978856319MaRDI QIDQ4744243

Albert R. Meyer

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(82)80087-9

zbMATH Keywords

model theorylambda calculuscombinatory logic

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (45)

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

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