From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
type: Item
instance of: scholarly article
title: From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
zbMATH Open document ID: 0949.68049
DOI: 10.1016/S0304-3975(00)00057-8
published in: Theoretical Computer Science
publication date: 2000-10-26T00:00:00Z
Mathematics Subject Classification ID: 68N18
zbMATH DE Number: 1521868
zbMATH Keywords: calculus
zbMATH Keywords: models of untyped calculus
zbMATH Keywords: webbed models
zbMATH Keywords: equational extensions of calculus
zbMATH Keywords: map theory
zbMATH Keywords: graph models
author: Chantal Berline
MaRDI profile type: Publication
cites work: Domain theory in logical form
cites work: Full abstraction in the lazy lambda calculus
cites work: Q4954440
cites work: Can programming be liberated from the von Neumann style?
cites work: Q3206926
cites work: Complete restrictions of the intersection type discipline
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: The Impact of the Lambda Calculus in Logic and Computer Science
cites work: A filter lambda model and the completeness of type assignment
cites work: Strong stability and the incompleteness of stable models for \(\lambda\)-calculus
cites work: Q4886631
cites work: Q4896520
cites work: Infinite \(\lambda\)-calculus and types
cites work: Some new results on easy lambda-terms
cites work: Q4513574
cites work: A \(\kappa\)-denotational semantics for map theory in ZFC+SI
cites work: Q4160405
cites work: Lambda-calculi for (strict) parallel functions
cites work: A theory of sequentiality
cites work: A set of postulates for the foundation of logic. II
cites work: Q3036694
cites work: Q3221961
cites work: Type theories, normal forms, and \(D_{\infty}\)-lambda-models
cites work: Functionality in Combinatory Logic
cites work: Q4263864
cites work: A syntactical proof of the operational equivalence of two \(\lambda\)-terms
cites work: A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\)
cites work: A characterization of F-complete type assignments
cites work: Q4281469
cites work: Q4847018
cites work: Q4018065
cites work: Q4842969
cites work: Toward useful type-free theories. I
cites work: A type-free system extending (ZFC)
cites work: The Expressiveness of Simple and Second-Order Type Structures
cites work: Q5625124
cites work: The system \({\mathcal F}\) of variable types, fifteen years later
cites work: Q3994895
cites work: Q4879947
cites work: Universal retractions on \(DI\)-domains
cites work: Map theory
cites work: Q5573940
cites work: Q4260372
cites work: Q3024839
cites work: Q3816053
cites work: An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
cites work: Q4722037
cites work: A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
cites work: Q4128535
cites work: Q3691635
cites work: Consistency of a \(\lambda\)-theory with \(n\)-tuples and easy term
cites work: Q4297417
cites work: Q4297437
cites work: Isomorphism and equational equivalence of continuous \(\lambda\)-models
cites work: The interpretation of unsolvable λ-terms in models of untyped λ-calculus
cites work: Forcing in stable models of untyped \(\lambda\)-calculus
cites work: On the construction of stable models of untyped \(\lambda\)-calculus
cites work: Q3214888
cites work: Origins of Recursive Function Theory
cites work: The inconsistency of certain formal logics
cites work: Q3997016
cites work: Q4274979
cites work: Q4297779

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Classical logic, storage operators and second-order lambda-calculus

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: About classical logic and imperative programming

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q3477935

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Set theory. An introduction to independence proofs

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: The Mechanical Evaluation of Expressions

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q3326830

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Petri nets, event structures and domains. I

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Classical recursion theory. The theory of functions and sets of natural numbers

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q3997125

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q4268477

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q4260369

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: LCF considered as a programming language

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q4749207

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: A semantics for static type inference

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q4068054

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Isomorphisms and nonisomorphisms of graph models

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q5649639

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q4109652

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q4109651

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Data Types as Lattices

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q3661543

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q3960746

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q3959414

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Q3969890

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (cites work)
cites work: Approximate Reduction and Lambda Calculus Models

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (full work available at URL)
full work available at URL: s0304-3975(00)00057-8

From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (OpenAlex ID)
OpenAlex ID: W1974315746