What is a categorical model of the differential and the resource λ-calculi?
نویسنده
چکیده
The differential λ-calculus is a paradigmatic functional programming language endowed with a syntactical differentiation operator that allows to apply a program to an argument in a linear way. One of the main features of this language is that it is resource conscious and gives the programmer suitable primitives to handle explicitly the resources used by a program during its execution. The differential operator also allows to write the full Taylor expansion of a program. Through this expansion every program can be decomposed into an infinite sum (representing non-deterministic choice) of ‘simpler’ programs that are strictly linear. The aim of this paper is to develop an abstract ‘model theory’ for the untyped differential λ-calculus. In particular, we investigate what should be a general categorical definition of denotational model for this calculus. Starting from the work of Blute, Cockett and Seely on differential categories we provide the notion of Cartesian closed differential category and we prove that linear reflexive objects living in such categories constitute sound models of the untyped differential λ-calculus. We also give sufficient conditions for Cartesian closed differential categories to model the Taylor expansion. This entails that every model living in such categories equates all programs having the same full Taylor expansion. We then provide a concrete example of a Cartesian closed differential category modeling the Taylor expansion, namely the category MRel of sets and relations from finite multisets to sets. We prove that the relational model D of λ-calculus we have recently built in MRel is linear, and therefore it is also a model of the untyped differential λ-calculus. Finally, we study the relationship between the differential λ-calculus and the resource calculus, a functional programming language combining the ideas behind the differential λ-calculus with those behind the λ-calculus with multiplicities. We define two translation maps between these two calculi and we study the properties of these translations. In particular, from this analysis it follows that the two calculi share the same notion of model. Therefore the resource calculus can be interpreted by translation into every linear reflexive object living in a Cartesian closed differential category.
منابع مشابه
What is a categorical model of the differential and the resource lambda-calculi?
The differential λ-calculus is a paradigmatic functional programming language endowed with a syntactical differentiation operator that allows to apply a program to an argument in a linear way. One of the main features of this language is that it is resource conscious and gives the programmer suitable primitives to handle explicitly the resources used by a program during its execution. The diffe...
متن کاملCategorical Models for Simply Typed Resource Calculi
We introduce the notion of differential λ-category as an extension of Blute-Cockett-Seely’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 non-lazy axiomatisation of Boudol’s λ-calculus with mult...
متن کاملOn the discriminating power of tests in resource λ-calculus
Since its discovery, differential linear logic (DLL) inspired numerous domains. In denotational semantics, categorical models of DLL are now commune, and the simplest one is Rel, the category of sets and relations. In proof theory this naturally gave birth to differential proof nets that are full and complete for DLL. In turn, these tools can naturally be translated to their intuitionistic coun...
متن کاملOn the discriminating power of tests in resource λ - calculus May 22 , 2012
Since its discovery, differential linear logic (DLL) inspired numerous domains. In denotational semantics, categorical models of DLL are now commune, and the simplest one is Rel, the category of sets and relations. In proof theory this naturally gave birth to differential proof nets that are full and complete for DLL. In turn, these tools can naturally be translated to their intuitionistic coun...
متن کاملλ-Symmetry method and the Prelle-Singer method for third-order differential equations
In this paper, we will obtain first integral, integrating factor and λ-symmetry of third-order ODEs u ⃛=F(x,u,u ̇,u ̈). Also we compare Prelle -Singer (PS) method and λ-symmetry method for third-order differential equations.In this paper, we will obtain first integral, integrating factor and λ-symmetry of third-order ODEs u ⃛=F(x,u,u ̇,u ̈). Also we compare Prelle -Singer (PS) method and λ-symmetry m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 22 شماره
صفحات -
تاریخ انتشار 2012