scientific article; zbMATH DE number 3813583

zbMATH Open0515.03004MaRDI QIDQ3661543FDOQ3661543

Authors: Dana Scott 

Publication date: 1980

Title of this publication is not available (Why is that?)

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 (18)

• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Title not available (Why is that?)
• Univalence as a principle of logic
• Domain theory in logical form
• Towards Lambda Calculus Order-Incompleteness
• A finite equational axiomatization of the functional algebras for the lambda calculus
• A theory for nondeterminism, parallelism, communication, and concurrency
• A characterization of F-complete type assignments
• Completeness of type assignment in continuous lambda models
• Algebras and combinators
• Infinite \(\lambda\)-calculus and types
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• 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
• On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory
• Weak completeness of type assignment in \(\lambda\)-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)