Lambda‐Calculus Models and Extensionality
From MaRDI portal
Publication:3900018
DOI10.1002/malq.19800261902zbMath0453.03015OpenAlexW1972921902MaRDI QIDQ3900018
Publication date: 1980
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19800261902
Related Items
The interpretation of unsolvable λ-terms in models of untyped λ-calculus, An investigation into functions as processes, Intersection types and lambda models, A characterization of F-complete type assignments, Intersection type assignment systems, The abstract variable-binding calculus, Type theories, normal forms, and \(D_{\infty}\)-lambda-models, On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, Enlargements of functional algebras for the lambda calculus, Categorical models of the differential λ-calculus, A category-theoretic characterization of functional completeness, The semantics of entailment omega, An irregular filter model, Filter models with polymorphic types, Comparing models of the intensional typed \(\lambda\)-calculus, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, Lambda abstraction algebras: representation theorems, Preface to the special volume, A filter lambda model and the completeness of type assignment, A semantic basis for Quest, Computability in higher types, P\(\omega\) and the completeness of type assignment, On the construction of stable models of untyped \(\lambda\)-calculus, Recursive Domain Equations of Filter Models, Logical Semantics for Stability, Extensional models for polymorphism, On combinatory algebras and their expansions, On functions preserving levels of approximation: A refined model construction for various lambda calculi, A finite equational axiomatization of the functional algebras for the lambda calculus, Simple Easy Terms, The completeness theorem for typing lambda-terms, On the algebraic models of lambda calculus, Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms, Completeness of type assignment in continuous lambda models, Term-generic logic, Essential and relational models
