scientific article
From MaRDI portal
Publication:3661543
zbMath0515.03004MaRDI QIDQ3661543
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Philosophical and critical aspects of logic and foundations (03A05) Combinatory logic and lambda calculus (03B40)
Related Items (max. 100)
A theory for nondeterminism, parallelism, communication, and concurrency ⋮ A characterization of F-complete type assignments ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Unnamed Item ⋮ Algebras and combinators ⋮ Domain theory in logical form ⋮ Lambda abstraction algebras: representation theorems ⋮ Towards Lambda Calculus Order-Incompleteness ⋮ Univalence as a principle of logic ⋮ Infinite \(\lambda\)-calculus and types ⋮ A finite equational axiomatization of the functional algebras for the lambda calculus ⋮ The completeness theorem for typing lambda-terms ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ On the algebraic models of lambda calculus ⋮ Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms ⋮ Completeness of type assignment in continuous lambda models ⋮ Set-theoretical and other elementary models of the \(\lambda\)-calculus ⋮ Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result
This page was built for publication:
