From computation to foundations via functions and application: The -calculus and its webbed models
From MaRDI portal
Publication:1583485
DOI10.1016/S0304-3975(00)00057-8zbMATH Open0949.68049OpenAlexW1974315746MaRDI QIDQ1583485FDOQ1583485
Recommendations
- Models of the lambda calculus: an introduction
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- The Impact of the Lambda Calculus in Logic and Computer Science
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory
- scientific article; zbMATH DE number 3875232
Cites work
- scientific article; zbMATH DE number 2185665 (Why is no real title available?)
- scientific article; zbMATH DE number 3831284 (Why is no real title available?)
- scientific article; zbMATH DE number 3648679 (Why is no real title available?)
- scientific article; zbMATH DE number 3427306 (Why is no real title available?)
- scientific article; zbMATH DE number 3889502 (Why is no real title available?)
- scientific article; zbMATH DE number 3858394 (Why is no real title available?)
- scientific article; zbMATH DE number 4147469 (Why is no real title available?)
- scientific article; zbMATH DE number 3813583 (Why is no real title available?)
- scientific article; zbMATH DE number 3916224 (Why is no real title available?)
- scientific article; zbMATH DE number 4087629 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 3783068 (Why is no real title available?)
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 46869 (Why is no real title available?)
- scientific article; zbMATH DE number 47007 (Why is no real title available?)
- scientific article; zbMATH DE number 92599 (Why is no real title available?)
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- scientific article; zbMATH DE number 3532923 (Why is no real title available?)
- scientific article; zbMATH DE number 3532924 (Why is no real title available?)
- scientific article; zbMATH DE number 3556025 (Why is no real title available?)
- scientific article; zbMATH DE number 3594646 (Why is no real title available?)
- scientific article; zbMATH DE number 1333596 (Why is no real title available?)
- scientific article; zbMATH DE number 1333599 (Why is no real title available?)
- scientific article; zbMATH DE number 1342275 (Why is no real title available?)
- scientific article; zbMATH DE number 1354162 (Why is no real title available?)
- scientific article; zbMATH DE number 482822 (Why is no real title available?)
- scientific article; zbMATH DE number 512776 (Why is no real title available?)
- scientific article; zbMATH DE number 599151 (Why is no real title available?)
- scientific article; zbMATH DE number 599171 (Why is no real title available?)
- scientific article; zbMATH DE number 599579 (Why is no real title available?)
- scientific article; zbMATH DE number 1531357 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 3806938 (Why is no real title available?)
- scientific article; zbMATH DE number 786488 (Why is no real title available?)
- scientific article; zbMATH DE number 794258 (Why is no real title available?)
- scientific article; zbMATH DE number 883584 (Why is no real title available?)
- scientific article; zbMATH DE number 906954 (Why is no real title available?)
- scientific article; zbMATH DE number 937379 (Why is no real title available?)
- scientific article; zbMATH DE number 1456951 (Why is no real title available?)
- scientific article; zbMATH DE number 3291106 (Why is no real title available?)
- scientific article; zbMATH DE number 3349775 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- A \(\kappa\)-denotational semantics for map theory in ZFC+SI
- A characterization of F-complete type assignments
- A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\)
- A filter lambda model and the completeness of type assignment
- A semantics for static type inference
- A set of postulates for the foundation of logic. II
- A syntactical proof of the operational equivalence of two \(\lambda\)-terms
- A theory of sequentiality
- A type-free system extending (ZFC)
- About classical logic and imperative programming
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Approximate Reduction and Lambda Calculus Models
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Can programming be liberated from the von Neumann style?
- Classical logic, storage operators and second-order lambda-calculus
- Classical recursion theory. The theory of functions and sets of natural numbers
- Complete restrictions of the intersection type discipline
- Consistency of a \(\lambda\)-theory with \(n\)-tuples and easy term
- Data Types as Lattices
- Domain theory in logical form
- Forcing in stable models of untyped \(\lambda\)-calculus
- Full abstraction in the lazy lambda calculus
- Functionality in Combinatory Logic
- Infinite \(\lambda\)-calculus and types
- Isomorphism and equational equivalence of continuous \(\lambda\)-models
- Isomorphisms and nonisomorphisms of graph models
- LCF considered as a programming language
- Lambda-calculi for (strict) parallel functions
- Map theory
- On the construction of stable models of untyped \(\lambda\)-calculus
- Origins of Recursive Function Theory
- Petri nets, event structures and domains. I
- Set theory. An introduction to independence proofs
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Some new results on easy lambda-terms
- Strong stability and the incompleteness of stable models for \(\lambda\)-calculus
- The Expressiveness of Simple and Second-Order Type Structures
- The Impact of the Lambda Calculus in Logic and Computer Science
- The Mechanical Evaluation of Expressions
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- The inconsistency of certain formal logics
- The interpretation of unsolvable λ-terms in models of untyped λ-calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The system \({\mathcal F}\) of variable types, fifteen years later
- Toward useful type-free theories. I
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Universal retractions on \(DI\)-domains
Cited in
(18)- A relational semantics for parallelism and non-determinism in a functional setting
- Title not available (Why is no real title available?)
- Effective λ-models versus recursively enumerable λ-theories
- Compositional characterisations of \(\lambda\)-terms using intersection types
- Relational graph models, Taylor expansion and extensionality
- Graph easy sets of mute lambda terms
- Models of the lambda calculus: an introduction
- Building continuous webbed models for system F
- A synthetic axiomatization of map theory
- Towards lambda calculus order-incompleteness
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory
- Easiness in graph models
- A Relational Model of a Parallel and Non-deterministic λ-Calculus
- An irregular filter model
- Easy lambda-terms are not always simple
- Relational graph models at work
- Some reasons for generalising domain theory
- Graph lambda theories
This page was built for publication: From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583485)
