<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-21T11:10:39Z</responseDate>
  <request identifier="6000" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:6000</identifier>
        <datestamp>2024-03-06T10:37:27Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Category Theory in Coq 8.5</dc:title>
          <dc:creator>Timany, Amin</dc:creator>
          <dc:creator>Jacobs, Bart</dc:creator>
          <dc:subject>Category Theory</dc:subject>
          <dc:subject>Coq 8.5</dc:subject>
          <dc:subject>Universe Polymorphism</dc:subject>
          <dc:subject>Homotopy Type Theory</dc:subject>
          <dc:description>We report on our experience implementing category theory in Coq 8.5.&#13;
Our work formalizes most of basic category theory, including concepts&#13;
not covered by existing formalizations, in a library that is fit to be&#13;
used as a general-purpose category-theoretical foundation.&#13;
&#13;
Our development particularly takes advantage of two features new to&#13;
Coq 8.5: primitive projections for records and universe polymorphism.&#13;
Primitive projections allow for well-behaved dualities while universe&#13;
polymorphism provides a relative notion of largeness and smallness.&#13;
The latter is one of the main contributions of this paper. It pushes&#13;
the limits of the new universe polymorphism and constraint inference&#13;
algorithm of Coq 8.5.&#13;
&#13;
In this paper we present in detail smallness and largeness in&#13;
categories and the foundation they are built on top of.  We&#13;
furthermore explain how we have used the universe polymorphism of Coq 8.5 &#13;
to represent smallness and largeness arguments by simply ignoring&#13;
them and entrusting them to the universe inference algorithm of Coq 8.5.  &#13;
We also briefly discuss our experience throughout this&#13;
implementation, discuss concepts formalized in this development and&#13;
give a comparison with a few other developments of similar extent.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Amin Timany and Bart Jacobs</dc:contributor>
          <dc:date>2016</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 52, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.FSCD.2016.30</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-60003</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.30</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
