scientific article; zbMATH DE number 3813583

MaRDI QIDQ3661543zbMATH OpenFDO

Authors Dana Scott

Publication date 1980

zbMATH Keywords

combinatory logicmodelslambda calculus

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Combinatory logic and lambda calculus (03B40)

Cited in

(19)

• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Gentzen-Mints-Zucker duality
• Univalence as a principle of logic
• Domain theory in logical form
• A theory for nondeterminism, parallelism, communication, and concurrency
• A finite equational axiomatization of the functional algebras for the lambda calculus
• Completeness of type assignment in continuous lambda models
• A characterization of F-complete type assignments
• Algebras and combinators
• Infinite \(\lambda\)-calculus and types
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Models of the lambda calculus: an introduction
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• On the algebraic models of lambda calculus
• The completeness theorem for typing lambda-terms
• Towards lambda calculus order-incompleteness
• On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
• Weak completeness of type assignment in -calculus models: A generalization of Hindley's result
• Lambda abstraction algebras: representation theorems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661543)