Mathematical Structures in Computer Science · 2006 · 93 citations · 10 references
Natural SciencesMathematicsCombinatoricsLogicPhilosophy Of MathematicsCategory TheoryDifferential GeometryDifferential TopologyModel TheoryAxiomsCategory-theoretic FoundationsHigher CategoriesMonoidal CategoriesStable Maps
Following work of Ehrhard and Regnier, we introduce the notion of a differential category: an additive symmetric monoidal category with a comonad (a ‘coalgebra modality’) and a differential combinator satisfying a number of coherence conditions. In such a category one should imagine the morphisms in the base category as being linear maps and the morphisms in the coKleisli category as being smooth (infinitely differentiable). Although such categories do not necessarily arise from models of linear logic, one should think of this as replacing the usual dichotomy of linear vs. stable maps established for coherence spaces.After establishing the basic axioms, we give a number of examples. The most important example arises from a general construction, a comonad -calculus.
10
Jean-Yves Girard · Theoretical Computer Science · 1987 · 4.1K citations
The differential lambda-calculus
Thomas Ehrhard, Laurent Régnier · Theoretical Computer Science · 2003 · 242 citations
Thomas Ehrhard · Mathematical Structures in Computer Science · 2005 · 136 citations