<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-04838255</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-22T23:11:08+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Intrinsically Correct Sorting in Cubical Agda</title>
            <author role="aut">
              <persName>
                <forename type="first">Cass</forename>
                <surname>Alexandru</surname>
              </persName>
              <idno type="halauthorid">3340797-0</idno>
              <affiliation ref="#struct-358321"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Vikraman</forename>
                <surname>Choudhury</surname>
              </persName>
              <idno type="halauthorid">3337141-0</idno>
              <affiliation ref="#struct-1178797"/>
              <affiliation ref="#struct-50194"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jurriaan</forename>
                <surname>Rot</surname>
              </persName>
              <idno type="halauthorid">798026-0</idno>
              <affiliation ref="#struct-300856"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Niels</forename>
                <surname>van der Weide</surname>
              </persName>
              <idno type="halauthorid">3004627-0</idno>
              <affiliation ref="#struct-300856"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Vikraman</forename>
                <surname>Choudhury</surname>
              </persName>
              <email type="md5">ef2753904b7048acd0491038a0e8befe</email>
              <email type="domain">gmail.com</email>
            </editor>
            <funder ref="#projeurop-737206"/>
            <funder ref="#projeurop-745771"/>
            <funder ref="#projeurop-745772"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2025-07-02 12:01:03</date>
              <date type="whenModified">2026-05-05 15:53:23</date>
              <date type="whenReleased">2025-07-02 13:11:08</date>
              <date type="whenProduced">2025-01-20</date>
              <date type="whenEndEmbargoed">2025-07-02</date>
              <ref type="file" target="https://hal.science/hal-04838255v1/document">
                <date notBefore="2025-07-02"/>
              </ref>
              <ref type="file" subtype="greenPublisher" n="1" target="https://hal.science/hal-04838255v1/file/2412.08362v1.pdf" id="file-5139934-4440162">
                <date notBefore="2025-07-02"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/2412.08362"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1364072">
                <persName>
                  <forename>Vikraman</forename>
                  <surname>Choudhury</surname>
                </persName>
                <email type="md5">ef2753904b7048acd0491038a0e8befe</email>
                <email type="domain">gmail.com</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04838255</idno>
            <idno type="halUri">https://hal.science/hal-04838255</idno>
            <idno type="halBibtex">alexandru:hal-04838255</idno>
            <idno type="halRefHtml">&lt;i&gt;CPP 2025 - Certified Programs and Proofs&lt;/i&gt;, Jan 2025, Denver (Colorado), United States. &lt;a target="_blank" href="https://dx.doi.org/10.1145/3703595.3705873"&gt;&amp;#x27E8;10.1145/3703595.3705873&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">CPP 2025 - Certified Programs and Proofs, Jan 2025, Denver (Colorado), United States. &amp;#x27E8;10.1145/3703595.3705873&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-5139934-4440162"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
            <idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
            <idno type="stamp" n="OPENAIRE">OpenAIRE</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="INRIA-ALLEMAGNE">INRIA-ALLEMAGNE</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Intrinsically Correct Sorting in Cubical Agda</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Cass</forename>
                    <surname>Alexandru</surname>
                  </persName>
                  <idno type="halauthorid">3340797-0</idno>
                  <affiliation ref="#struct-358321"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Vikraman</forename>
                    <surname>Choudhury</surname>
                  </persName>
                  <idno type="halauthorid">3337141-0</idno>
                  <affiliation ref="#struct-1178797"/>
                  <affiliation ref="#struct-50194"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jurriaan</forename>
                    <surname>Rot</surname>
                  </persName>
                  <idno type="halauthorid">798026-0</idno>
                  <affiliation ref="#struct-300856"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Niels</forename>
                    <surname>van der Weide</surname>
                  </persName>
                  <idno type="halauthorid">3004627-0</idno>
                  <affiliation ref="#struct-300856"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>CPP 2025 - Certified Programs and Proofs</title>
                  <date type="start">2025-01-20</date>
                  <date type="end">2025-01-21</date>
                  <settlement>Denver (Colorado)</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <date type="datePub">2024-12-11</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2412.08362</idno>
              <idno type="doi">10.1145/3703595.3705873</idno>
              <relatedItem target="https://archive.softwareheritage.org/swh:1:dir:a749ceb20254d0ff2de4fa6d04398efb5baab831" type="Cites" subtype="http://purl.org/coar/resource_type/c_5ce6"/>
              <relatedItem target="https://archive.softwareheritage.org/swh:1:snp:a96c4f3e083e1e3434685ff5add2f17a2d6b65c2" type="Cites" subtype="http://purl.org/coar/resource_type/c_5ce6"/>
              <relatedItem target="https://archive.softwareheritage.org/swh:1:rel:d9b3e4b639f81ffcc5d051edb4455af8d54d8431" type="Cites" subtype="http://purl.org/coar/resource_type/c_5ce6"/>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
              <classCode scheme="halDomain" n="math.math-ct">Mathematics [math]/Category Theory [math.CT]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The paper "Sorting with Bialgebras and Distributive Laws" by Hinze et al. uses the framework of bialgebraic semantics to define sorting algorithms. From distributive laws between functors they construct pairs of sorting algorithms using both folds and unfolds. Pairs of sorting algorithms arising this way include insertion/selection sort and quick/tree sort. We extend this work to define intrinsically correct variants in cubical Agda. Our key idea is to index our data types by multisets, which concisely captures that a sorting algorithm terminates with an ordered permutation of its input list. By lifting bialgebraic semantics to the indexed setting, we obtain the correctness of sorting algorithms purely from the distributive law.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-358321" status="VALID">
          <idno type="ROR">https://ror.org/04zrf7b53</idno>
          <orgName>Technische Universität Kaiserslautern</orgName>
          <orgName type="acronym">TU Kaiserslautern</orgName>
          <date type="start">1970-01-01</date>
          <desc>
            <address>
              <addrLine>Erwin-Schrödinger-Straße 52, 67663 Kaiserslautern</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">https://www.uni-kl.de/en/home/</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-1178797" status="VALID">
          <idno type="RNSR">202324453J</idno>
          <idno type="ROR">https://ror.org/02fw3g688</idno>
          <orgName>Fondements opérationnels, logiques et algébriques des systèmes logiciels</orgName>
          <orgName type="acronym">OLAS</orgName>
          <date type="start">2023-10-01</date>
          <date type="end">2027-09-30</date>
          <desc>
            <address>
              <addrLine>Dipartimento di Informatica - Scienza e Ingegneria (DISI) Universita' di Bologna Mura Anteo Zamboni, 7 40126 Bologna ITALY</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">https://www.inria.fr/en/olas</ref>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-419351" type="direct"/>
            <relation active="#struct-30978" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-50194" status="VALID">
          <orgName>Department of Computer Science and Engineering [Bologna]</orgName>
          <orgName type="acronym">DISI</orgName>
          <desc>
            <address>
              <addrLine>Università di Bologna Dipartimento di Informatica - Scienza e Ingegneria Mura Anteo Zamboni, 7 40126 Bologna Italiy</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">http://www.cs.unibo.it/en/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-30978" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300856" status="VALID">
          <idno type="IdRef">112681611</idno>
          <idno type="ROR">https://ror.org/016xsfp80</idno>
          <orgName>Radboud University [Nijmegen]</orgName>
          <desc>
            <address>
              <addrLine>Houtlaan 4, 6525 XZ Nijmegen</addrLine>
              <country key="NL"/>
            </address>
            <ref type="url">https://www.ru.nl/en</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-34586" status="VALID">
          <idno type="RNSR">198318250R</idno>
          <idno type="ROR">https://ror.org/01nzkaw91</idno>
          <orgName>Centre Inria d'Université Côte d'Azur</orgName>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 06902 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/sophia/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-419351" status="VALID">
          <orgName>Dipartimento di Informatica - Scienza e Ingegneria [Bologna]</orgName>
          <orgName type="acronym">DISI</orgName>
          <desc>
            <address>
              <addrLine>http://www.informatica.unibo.it/it</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">http://www.informatica.unibo.it/it</ref>
          </desc>
          <listRelation>
            <relation active="#struct-30978" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-30978" status="VALID">
          <idno type="ROR">https://ror.org/01111rn36</idno>
          <orgName>Alma Mater Studiorum Università di Bologna = University of Bologna [Bologne]</orgName>
          <orgName type="acronym">UNIBO</orgName>
          <desc>
            <address>
              <addrLine>Via Zamboni, 33 - 40126 Bologna</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">http://www.eng.unibo.it/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="europeanProject" xml:id="projeurop-737206" status="VALID">
          <idno type="number">101106046</idno>
          <idno type="program">HORIZON-MSCA-2022-PF-01</idno>
          <idno type="call">HORIZON-MSCA-2022-PF-01</idno>
          <orgName>ReGraDe-CS</orgName>
          <desc>Reversible Gray Debugging of Concurrent Systems</desc>
          <date type="start">2023-12-01</date>
          <date type="end">2025-11-30</date>
        </org>
        <org type="europeanProject" xml:id="projeurop-745771" status="INCOMING">
          <idno type="number">OCENW.M20.380</idno>
          <desc>The Power of Equality</desc>
        </org>
        <org type="europeanProject" xml:id="projeurop-745772" status="INCOMING">
          <idno type="number">OCENW.M20.053</idno>
          <desc>Modular Construction and Analysis of Distributive Laws for Programming Language Semantics</desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>