Results 1  10
of
61
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 513 (22 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
An introduction to substructural logics
, 2000
"... Abstract: This is a history of relevant and substructural logics, written for the Handbook of the History and Philosophy of Logic, edited by Dov Gabbay and John Woods. 1 1 ..."
Abstract

Cited by 176 (17 self)
 Add to MetaCart
(Show Context)
Abstract: This is a history of relevant and substructural logics, written for the Handbook of the History and Philosophy of Logic, edited by Dov Gabbay and John Woods. 1 1
Finiteness spaces
 Mathematical Structures in Computer Science
, 1987
"... We investigate a new denotational model of linear logic based on the purely relational model. In this semantics, webs are equipped with a notion of “finitary ” subsets satisfying a closure condition and proofs are interpreted as finitary sets. In spite of a formal similarity, this model is quite dif ..."
Abstract

Cited by 66 (14 self)
 Add to MetaCart
(Show Context)
We investigate a new denotational model of linear logic based on the purely relational model. In this semantics, webs are equipped with a notion of “finitary ” subsets satisfying a closure condition and proofs are interpreted as finitary sets. In spite of a formal similarity, this model is quite different from the usual models of linear logic (coherence semantics, hypercoherence semantics, the various existing game semantics...). In particular, the standard fixpoint operators used for defining the general recursive functions are not finitary, although the primitive recursion operators are. This model can be considered as a discrete version of the Köthe space semantics introduced in a previous paper: we show how, given a field, each finiteness space gives rise to a vector space endowed with a linear topology, a notion introduced by Lefschetz in 1942, and we study the corresponding model where morphisms are linear continuous maps (a version of Girard’s quantitative semantics with coefficients in the field). We obtain in that way a new model of the recently introduced differential lambdacalculus. Notations. If S is a set, we denote by M(S) = N S the set of all multisets over S. If µ ∈ M(S), µ denotes the support of µ which is the set of all a ∈ S such that µ(a) ̸ = 0. A multiset is finite if it has a finite support. If a1,..., an are elements of some given set S, we denote by [a1,..., an] the corresponding multiset over S. The usual operations on natural numbers are extended to multisets pointwise. If (Si)i∈I are sets, we denote by πi the ith projection πi: ∏ j∈I Sj → Si.
Topological Incompleteness and Order Incompleteness of the Lambda Calculus
 ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
, 2001
"... A model of the untyped lambda calculus induces a lambda theory, i.e., a congruence relation on λterms closed under ff and ficonversion. A semantics (= class of models) of the lambda calculus is incomplete if there exists a lambda theory which is not induced by any model in the semantics. In th ..."
Abstract

Cited by 29 (18 self)
 Add to MetaCart
(Show Context)
A model of the untyped lambda calculus induces a lambda theory, i.e., a congruence relation on λterms closed under ff and ficonversion. A semantics (= class of models) of the lambda calculus is incomplete if there exists a lambda theory which is not induced by any model in the semantics. In this paper we introduce a new technique to prove the incompleteness of a wide range of lambda calculus semantics, including the strongly stable one, whose incompleteness had been conjectured by BastoneroGouy [6, 7] and by Berline [9]. The main results of the paper are a topological incompleteness theorem and an order incompleteness theorem. In the first one we show the incompleteness of the lambda calculus semantics given in terms of topological models whose topology satisfies a property of connectedness. In the second one we prove the incompleteness of the class of partially ordered models with finitely many connected components w.r.t. the Alexandroff topology. A further result of the paper is a proof of the completeness of the semantics of the lambda calculus given in terms of topological models whose topology is nontrivial and metrizable.
Correspondence between Operational and Denotational Semantics
 Handbook of Logic in Computer Science
, 1995
"... This course introduces the operational and denotational semantics of PCF and examines the relationship between the two. Topics: Syntax and operational semantics of PCF, Activity Lemma, undefinability of parallel or; Context Lemma (first principles proof) and proof by logical relations Denotational ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
This course introduces the operational and denotational semantics of PCF and examines the relationship between the two. Topics: Syntax and operational semantics of PCF, Activity Lemma, undefinability of parallel or; Context Lemma (first principles proof) and proof by logical relations Denotational semantics of PCF induced by an interpretation; (standard) Scott model, adequacy, weak adequacy and its proof (by a computability predicate) Domain Theory up to SFP and Scott domains; non full abstraction of the standard model, definability of compact elements and full abstraction for PCFP (PCF + parallel or), properties of orderextensional (continuous) models of PCF, Milner's model and Mulmuley's construction (excluding proofs) Additional topics (time permitting): results on pure simplytyped lambda calculus, Friedman 's Completeness Theorem, minimal model, logical relations and definability, undecidability of lambda definability (excluding proof), dIdomains and stable functions Homepa...
Projecting Sequential Algorithms on Strongly Stable Functions
 Annals of Pure and Applied Logic
, 1993
"... We relate two sequential models of PCF: the sequential algorithm model due to Berry and Curien and the strongly stable model due to Bucciarelli and the author. More precisely, we show that all the morphisms araising in the strongly stable model of PCF are sequential in the sense that they are the ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
(Show Context)
We relate two sequential models of PCF: the sequential algorithm model due to Berry and Curien and the strongly stable model due to Bucciarelli and the author. More precisely, we show that all the morphisms araising in the strongly stable model of PCF are sequential in the sense that they are the "extensional projections" of some sequential algorithms. We define a model of PCF where morphisms are "extensional" sequential algorithms and prove that any equation between PCF terms which holds in this model also holds in the strongly stable model.