Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
From MaRDI portal
Publication:1050334
DOI10.1016/0168-0072(83)90030-1zbMath0513.03009OpenAlexW2070032247MaRDI QIDQ1050334
No author found.
Publication date: 1983
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(83)90030-1
Related Items
Infinitary lambda calculus and discrimination of Berarducci trees. ⋮ Eager functions as processes ⋮ A computable expression of closure to efficient causation ⋮ The interpretation of unsolvable λ-terms in models of untyped λ-calculus ⋮ Easy lambda-terms are not always simple ⋮ Graph easy sets of mute lambda terms ⋮ Easiness in graph models ⋮ Games characterizing Levy-Longo trees ⋮ A characterization of F-complete type assignments ⋮ On reduction-based process semantics ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\) ⋮ Highlights in infinitary rewriting and lambda calculus ⋮ Unnamed Item ⋮ Algebraic interpretation of lambda calculus with resources ⋮ Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications ⋮ Sets with structure, mappings and fixed point property: fixed point structures ⋮ A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus ⋮ A category-theoretic characterization of functional completeness ⋮ Graph lambda theories ⋮ Finite type structures within combinatory algebras ⋮ An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus ⋮ From Böhm's Theorem to Observational Equivalences ⋮ On the observational theory of the CPS-calculus ⋮ Computability in higher types, P\(\omega\) and the completeness of type assignment ⋮ Intersection types for \(\lambda\)-trees ⋮ Isomorphisms and nonisomorphisms of graph models ⋮ Lazy Lambda calculus: Theories, models and local structure characterization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Comparing Böhm-Like Trees ⋮ Applications of infinitary lambda calculus ⋮ Type inference with recursive types: Syntax and semantics ⋮ On combinatory algebras and their expansions ⋮ Effective λ-models versus recursively enumerable λ-theories ⋮ Infinite \(\lambda\)-calculus and types ⋮ Semantics for dual and symmetric combinatory calculi ⋮ Building continuous webbed models for system F ⋮ 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 ⋮ Discrimination by parallel observers: the algorithm. ⋮ Set-theoretical and other elementary models of the \(\lambda\)-calculus ⋮ The infinitary lambda calculus of the infinite eta Böhm trees
Cites Work
- On combinatory algebras and their expansions
- The lambda calculus, its syntax and semantics
- Algebras and combinators
- A filter lambda model and the completeness of type assignment
- Lambda‐Calculus Models and Extensionality
- Data Types as Lattices
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
