{
"id": "https://doi.org/10.48456/tr-213",
"doi": "10.48456/TR-213",
"url": "https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-213.html",
"types": {
"ris": "RRPT",
"bibtex": "TechReport",
"citeproc": "report",
"schemaOrg": "Report",
"resourceType": "technical report",
"resourceTypeGeneral": "Report"
},
"creators": [
{
"name": "Valeria Correa Vaz de Paiva",
"nameType": "Personal",
"givenName": "Valeria Correa Vaz",
"familyName": "de Paiva"
}
],
"titles": [
{
"lang": "en",
"title": "The Dialectica categories"
}
],
"publisher": "Computer Laboratory, University of Cambridge",
"subjects": [],
"publicationYear": 1991,
"identifiers": [],
"sizes": [
"82 pages"
],
"formats": [
"PDF"
],
"descriptions": [
{
"lang": "en",
"description": "This work consists of two main parts. The first one, which gives it its name, presents an internal categorical version of Gödel’s “Dialectica interpretation” of higher-order arithmetic. The idea is to analyse the Dialectica interpretation using a cetegory DC where objects are relations on objects of a basic category C and maps are pairs of maps of C satisfying a pullback condition. If C is finitely complete, DC exists and has a very natural symmetric monoidal structure. If C is locally cartesian closed then DC is symmetric monoidal closed. If we assume C with stable and disjoint coproducts, DC has cartesian products and weak-coproducts and satisfies a weak form of distributivity. Using the structure above, DC is a categorical model for intuitionistic linear logic.\n\nMoreover if C has free monoids then DC has cofree comonoids and the corresponding comonad “!” on DC, which has some special properties, can be used to model the exponential “of course!” in Intuitionistic Linear Logic. The category of “!”-coalgebras is isomorphic to the category of comonoids in DC and, if we assume commutative monoids in C, the “!”-Kleisli category, which is cartesian closed, corresponds to the Diller-Nahm variant of the Dialectica interpretation.\n\nThe second part introduces the categories GC. The objects of GC are the same objects of DC, but morphisms are easier to handle, since they are maps in C in opposite directions. If C is finitely complete, the category GC exists. If C is cartesian closed, we can define a symmetric monoidal structure and if C is locally cartesian closed as well, we can define inernal homs in GC that make it a symmetric monoidal closed category. Supposing C with stable and disjoint coproducts, we can define cartesian products and coproducts in GC and, more interesting, we can define a dual operation to the tensor product bifunctor, called “par”. The operation “par” is a bifunctor and has a unit “⊥”, which is a dualising object. Using the internal hom and ⊥ we define a contravariant functor “(−)⊥” which behaves like negation and thus it is used to model linear negation. We show that the category GC, with all the structure above, is a categorical model for Linear Logic, but not exactly the classical one.\n\nIn the last chapter a comonad and a monad are defined to model the exponentials “!” and “?”. To define these endofunctors, we use Beck’s distributive laws in an interesting way. Finally, we show that the Kleisli category GC! is cartesian closed and that the categories DC and GC are related by a Kleisli construction.\n",
"descriptionType": "Abstract"
}
],
"providerId": "lpsw",
"clientId": "lpsw.zmftcd",
"agency": "datacite",
"state": "findable"
}