From computation to foundations via functions and application: The -calculus and its webbed models

DOI10.1016/S0304-3975(00)00057-8zbMATH Open0949.68049OpenAlexW1974315746MaRDI QIDQ1583485FDOQ1583485

Authors: Chantal Berline 

Publication date: 26 October 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00057-8

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

zbMATH Keywords

graph modelscalculusmap theoryequational extensions of calculusmodels of untyped calculuswebbed models

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Set theory. An introduction to independence proofs
• Petri nets, event structures and domains. I
• Domain theory in logical form
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• LCF considered as a programming language
• Title not available (Why is that?)
• Toward useful type-free theories. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The system \({\mathcal F}\) of variable types, fifteen years later
• Title not available (Why is that?)
• Data Types as Lattices
• Title not available (Why is that?)
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Some new results on easy lambda-terms
• Isomorphism and equational equivalence of continuous \(\lambda\)-models
• Consistency of a \(\lambda\)-theory with \(n\)-tuples and easy term
• Title not available (Why is that?)
• A filter lambda model and the completeness of type assignment
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Forcing in stable models of untyped \(\lambda\)-calculus
• Classical recursion theory. The theory of functions and sets of natural numbers
• Title not available (Why is that?)
• Complete restrictions of the intersection type discipline
• Title not available (Why is that?)
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Approximate Reduction and Lambda Calculus Models
• The Mechanical Evaluation of Expressions
• Map theory
• Lambda-calculi for (strict) parallel functions
• Infinite \(\lambda\)-calculus and types
• Title not available (Why is that?)
• Full abstraction in the lazy lambda calculus
• Classical logic, storage operators and second-order lambda-calculus
• Title not available (Why is that?)
• Universal retractions on \(DI\)-domains
• A set of postulates for the foundation of logic. II
• The Expressiveness of Simple and Second-Order Type Structures
• Can programming be liberated from the von Neumann style?
• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of F-complete type assignments
• Functionality in Combinatory Logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Impact of the Lambda Calculus in Logic and Computer Science
• A semantics for static type inference
• Isomorphisms and nonisomorphisms of graph models
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the construction of stable models of untyped \(\lambda\)-calculus
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A type-free system extending (ZFC)
• Title not available (Why is that?)
• A \(\kappa\)-denotational semantics for map theory in ZFC+SI
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strong stability and the incompleteness of stable models for \(\lambda\)-calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Origins of Recursive Function Theory
• A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\)
• The inconsistency of certain formal logics
• A theory of sequentiality
• Title not available (Why is that?)
• Title not available (Why is that?)
• A syntactical proof of the operational equivalence of two \(\lambda\)-terms
• About classical logic and imperative programming
• The interpretation of unsolvable λ-terms in models of untyped λ-calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (18)

• Title not available (Why is that?)
• A relational semantics for parallelism and non-determinism in a functional setting
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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
• 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)