Results 1  10
of
42
On Köthe sequence spaces and linear logic
 Mathematical Structures in Computer Science
, 2001
"... We present a category of locally convex topological vector spaces which is a model of propositional classical linear logic, based on the standard concept of Kothe sequence spaces. In this setting, the spaces interpreting the exponential have a quite simple structure of commutative Hopf algebra. The ..."
Abstract

Cited by 31 (9 self)
 Add to MetaCart
We present a category of locally convex topological vector spaces which is a model of propositional classical linear logic, based on the standard concept of Kothe sequence spaces. In this setting, the spaces interpreting the exponential have a quite simple structure of commutative Hopf algebra. The coKleisli category of this linear category is a cartesian closed category of entire mappings. This work provides a simple setting where typed calculus and dierential calculus can be combined; we give a few examples of computations. 1
Wellfounded Trees and Dependent Polynomial Functors
 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2004
"... We set out to study the consequences of the assumption of types of wellfounded trees in dependent type theories. We do so by investigating the categorical notion of wellfounded tree introduced in [16]. Our main result shows that wellfounded trees allow us to define initial algebras for a wide class ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
We set out to study the consequences of the assumption of types of wellfounded trees in dependent type theories. We do so by investigating the categorical notion of wellfounded tree introduced in [16]. Our main result shows that wellfounded trees allow us to define initial algebras for a wide class of endofunctors on locally cartesian closed categories.
Böhm trees, Krivine machine and the Taylor expansion of ordinary lambdaterms
, 2005
"... We show that, given an ordinary lambdaterm and a normal resource lambdaterm which appears in the normal form of its Taylor expansion, the unique resource term of the Taylor expansion of the ordinary lambdaterm reducing to this normal resource term can be obtained by running a version of the Krivi ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
We show that, given an ordinary lambdaterm and a normal resource lambdaterm which appears in the normal form of its Taylor expansion, the unique resource term of the Taylor expansion of the ordinary lambdaterm reducing to this normal resource term can be obtained by running a version of the Krivine abstract machine.
A Concurrent Model for Linear Logic
"... We build a realizability model for linear logic using a namepassing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and modal logics, and yields a new type system for process calculi that ensures termination while allowing significantly con ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We build a realizability model for linear logic using a namepassing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and modal logics, and yields a new type system for process calculi that ensures termination while allowing significantly concurrent behaviours. Then we study how embeddings of intuitionistic and classical logics into linear logic induce typed translations of λ and λµ calculi in which new concurrent instructions can be introduced, thus sketching the basis for a CurryHoward interpretation of linear and classical proofs in terms of concurrent interaction.
Mathematical models of computational and combinatorial structures. Invited address for Foundations
 of Software Science and Computation Structures (FOSSACS 2005
, 2005
"... Abstract. The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of course, should be taken in conjunction with the wellestablished views and methods stemming from algebra, category ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Abstract. The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of course, should be taken in conjunction with the wellestablished views and methods stemming from algebra, category theory, domain theory, logic, type theory, etc. In support of this proposal I will show how such an approach leads to interesting connections between various areas of computer science and mathematics; concentrating on one such example in some detail. Specifically, I will consider the line of my research involving denotational models of the pi calculus and algebraic theories with variablebinding operators, indicating how the abstract mathematical structure underlying these models fits with that of Joyal’s combinatorial species of structures. This analysis suggests both the unification and generalisation of models, and in the latter vein I will introduce generalised species of structures and their calculus. These generalised species encompass and generalise various of the notions of species used in combinatorics. Furthermore, they have a rich mathematical structure (akin to models of Girard’s linear logic) that can be described purely within Lawvere’s generalised logic. Indeed, I will present and treat the cartesian closed structure, the linear structure, the differential structure, etc. of generalised species axiomatically in this mathematical framework. As an upshot, I will observe that the setting allows for interpretations of computational calculi (like the lambda calculus, both typed and untyped; the recently introduced differential lambda calculus of Ehrhard and Regnier; etc.) that can be directly seen as translations into a more basic elementary calculus of interacting agents that compute by communicating and operating upon structured data.
∂ for Data: Differentiating Data Structures
"... This paper and our conference paper (Abbott, Altenkirch, Ghani, and McBride, 2003b) explain and analyse the notion of the derivative of a data structure as the type of its onehole contexts based on the central observation made by McBride (2001). To make the idea precise we need a generic notion of ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
This paper and our conference paper (Abbott, Altenkirch, Ghani, and McBride, 2003b) explain and analyse the notion of the derivative of a data structure as the type of its onehole contexts based on the central observation made by McBride (2001). To make the idea precise we need a generic notion of a data type, which leads to the notion of a container, introduced in (Abbott, Altenkirch, and Ghani, 2003a) and investigated extensively in (Abbott, 2003). Using containers we can provide a notion of linear map which is the concept missing from McBride’s first analysis. We verify the usual laws of differential calculus including the chain rule and establish laws for initial algebras and terminal coalgebras.
Categorical models for simply typed resource calculi
 ENTCS
"... We introduce the notion of differential λcategory as an extension of BluteCockettSeely’s differential Cartesian categories. We prove that differential λcategories can be used to model the simply typed versions of: (i) the differential λcalculus, a λcalculus extended with a syntactic derivative ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We introduce the notion of differential λcategory as an extension of BluteCockettSeely’s differential Cartesian categories. We prove that differential λcategories can be used to model the simply typed versions of: (i) the differential λcalculus, a λcalculus extended with a syntactic derivative operator; (ii) the resource calculus, a nonlazy axiomatisation of Boudol’s λcalculus with multiplicities. Finally, we provide two
Category theory for linear logicians
 Linear Logic in Computer Science
, 2004
"... This paper presents an introduction to category theory with an emphasis on those aspects relevant to the analysis of the model theory of linear logic. With this in mind, we focus on the basic definitions of category theory and categorical logic. An analysis of cartesian and cartesian closed categori ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
This paper presents an introduction to category theory with an emphasis on those aspects relevant to the analysis of the model theory of linear logic. With this in mind, we focus on the basic definitions of category theory and categorical logic. An analysis of cartesian and cartesian closed categories and their relation to intuitionistic logic is followed by a consideration of symmetric monoidal closed, linearly distributive and ∗autonomous categories and their relation to multiplicative linear logic. We examine nonsymmetric monoidal categories, and consider them as models of noncommutative linear logic. We introduce traced monoidal categories, and discuss their relation to the geometry of interaction. The necessary aspects of the theory of monads is introduced in order to describe the categorical modelling of the exponentials. We conclude by briefly describing the notion of full completeness, a strong form of categorical completeness, which originated in the categorical model theory of linear logic. No knowledge of category theory is assumed, but we do assume knowledge of linear logic sequent calculus and the standard models of linear logic, and modest familiarity with typed lambda calculus. 0
Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic (Extended Abstract)
"... Abstract. In the first part of the paper I investigate categorical models of multiplicative biadditive intuitionistic linear logic, and note that in them some surprising coherence laws arise. The thesis for the second part of the paper is that these models provide the right framework for investigati ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. In the first part of the paper I investigate categorical models of multiplicative biadditive intuitionistic linear logic, and note that in them some surprising coherence laws arise. The thesis for the second part of the paper is that these models provide the right framework for investigating differential structure in the context of linear logic. Consequently, within this setting, I introduce a notion of creation operator (as considered by physicists for bosonic Fock space in the context of quantum field theory), provide an equivalent description of creation operators in terms of creation maps, and show that they induce a differential operator satisfying all the basic laws of differentiation (the product and chain rules, the commutation relations, etc.). 1
The differential λµcalculus
 Theor. Comput. Sci
, 2007
"... We define a differential λµcalculus which is an extension of both Parigot’s λµcalculus and EhrhardRégnier’s differential λcalculus. We prove some basic properties of the system: reduction enjoys ChurchRosser and simply typed terms are strongly normalizing. Contents 1 ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We define a differential λµcalculus which is an extension of both Parigot’s λµcalculus and EhrhardRégnier’s differential λcalculus. We prove some basic properties of the system: reduction enjoys ChurchRosser and simply typed terms are strongly normalizing. Contents 1