Results 1  10
of
18
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 10 (0 self)
 Add to MetaCart
(Show Context)
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
Complexity of strongly normalising λterms via nonidempotent intersection types
"... We present a typing system for the λcalculus, with nonidempotent intersection types. As it is the case in (some) systems with idempotent intersections, a λterm is typable if and only if it is strongly normalising. Nonidempotency brings some further information into typing trees, such as a bound o ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We present a typing system for the λcalculus, with nonidempotent intersection types. As it is the case in (some) systems with idempotent intersections, a λterm is typable if and only if it is strongly normalising. Nonidempotency brings some further information into typing trees, such as a bound on the longest βreduction sequence reducing a term to its normal form. We actually present these results in Klop’s extension of λcalculus, where the bound that is read in the typing tree of a term is refined into an exact measure of the longest reduction sequence. This complexity result is, for longest reduction sequences, the counterpart of de Carvalho’s result for linear headreduction sequences.
Constructing differential categories and deconstructing categories of games
 In Luca Aceto, Monika Henzinger, and Jiri Sgall, editors, ICALP (2), volume 6756 of Lecture Notes in Computer Science
, 2011
"... Abstract. We present an abstract construction for building differential categories useful to model resource sensitive calculi, and we apply it to categories of games. In one instance, we recover a category previously used to give a fully abstract model of a nondeterministic imperative language. The ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We present an abstract construction for building differential categories useful to model resource sensitive calculi, and we apply it to categories of games. In one instance, we recover a category previously used to give a fully abstract model of a nondeterministic imperative language. The construction exposes the differential structure already present in this model. A second instance corresponds to a new Cartesian differential category of games. We give a model of a Resource PCF in this category and show that it enjoys the finite definability property. Comparison with a relational semantics reveals that the latter also possesses this property and is fully abstract. 1
Differential Linear Logic and Polarization
"... We study an extension of EhrhardRegnier's differential linear logic along the lines of Laurent's polarization. We show that a particular object of the wellknown relational model of linear logic provides a denotational semantics for this new system, which canonically extends the semanti ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
We study an extension of EhrhardRegnier's differential linear logic along the lines of Laurent's polarization. We show that a particular object of the wellknown relational model of linear logic provides a denotational semantics for this new system, which canonically extends the semantics of both differential and polarized linear logics: this justifies our choice of cut elimination rules. Then we show this new system models the recently introduced convolution _*ucalculus, the same as linear logic decomposes calculus.
Proof Nets as Formal Feynman Diagrams
"... Summary. The introduction of linear logic and its associated proof theory has revolutionized many semantical investigations, for example, the search for fullyabstract models of PCF and the analysis of optimal reduction strategies for lambda calculi. In the present paper we show how proof nets, a gra ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Summary. The introduction of linear logic and its associated proof theory has revolutionized many semantical investigations, for example, the search for fullyabstract models of PCF and the analysis of optimal reduction strategies for lambda calculi. In the present paper we show how proof nets, a graphtheoretic syntax for linear logic proofs, can be interpreted as operators in a simple calculus. This calculus was inspired by Feynman diagrams in quantum field theory and is accordingly called the φcalculus. The ingredients are formal integrals, formal power series, a derivativelike construct and analogues of the Dirac delta function. Many of the manipulations of proof nets can be understood as manipulations of formulas reminiscent of a beginning calculus course. In particular, the “box ” construct behaves like an exponential and the nesting of boxes phenomenon is the analogue of an exponentiated derivative formula. We show that the equations for the multiplicativeexponential fragment of linear logic hold. 1
Cartesian differential storage categories
, 2014
"... Cartesian differential categories were introduced to provide an abstract axiomatization of categories of differentiable functions. The fundamental example is the category whose objects are Euclidean spaces and whose arrows are smooth maps. Tensor differential categories provide the framework for cat ..."
Abstract
 Add to MetaCart
(Show Context)
Cartesian differential categories were introduced to provide an abstract axiomatization of categories of differentiable functions. The fundamental example is the category whose objects are Euclidean spaces and whose arrows are smooth maps. Tensor differential categories provide the framework for categorical models of differential
FORMS AND EXTERIOR DIFFERENTIATION IN CARTESIAN DIFFERENTIAL CATEGORIES
"... Abstract. Cartesian differential categories abstractly capture the notion of a differentiation operation. In this paper, we develop some of the theory of such categories by defining differential forms and exterior differentiation in this setting. We show that this exterior derivative, as expected, p ..."
Abstract
 Add to MetaCart
Abstract. Cartesian differential categories abstractly capture the notion of a differentiation operation. In this paper, we develop some of the theory of such categories by defining differential forms and exterior differentiation in this setting. We show that this exterior derivative, as expected, produces a cochain complex. 1.
Tensor products and *autonomous categories
"... The main use of ∗autonomous categories is in the semantic study of Linear ..."
Abstract
 Add to MetaCart
(Show Context)
The main use of ∗autonomous categories is in the semantic study of Linear