<?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-23T04:52:15Z</responseDate>
  <request identifier="3900" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:3900</identifier>
        <datestamp>2024-03-06T10:34:37Z</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>Verification of redecoration for infinite triangular matrices using coinduction</dc:title>
          <dc:creator>Matthes, Ralph</dc:creator>
          <dc:creator>Picard, Celia</dc:creator>
          <dc:subject>nested datatype</dc:subject>
          <dc:subject>coinduction</dc:subject>
          <dc:subject>theorem proving</dc:subject>
          <dc:subject>Coq</dc:subject>
          <dc:description>Finite triangular matrices with a dedicated type for the diagonal&#13;
elements can be profitably represented by a nested data type, i. e., a&#13;
heterogeneous family of inductive data types, while infinite&#13;
triangular matrices form an example of a nested coinductive type,&#13;
which is a heterogeneous family of coinductive data types. &#13;
&#13;
Redecoration for infinite triangular matrices is taken up from&#13;
previous work involving the first author, and it is shown that&#13;
redecoration forms a comonad with respect to bisimilarity.&#13;
&#13;
The main result, however, is a validation of the original algorithm&#13;
against a model based on infinite streams of infinite streams. The&#13;
two formulations are even provably equivalent, and the second is&#13;
identified as a special instance of the generic cobind operation&#13;
resulting from the well-known comultiplication operation on streams&#13;
that creates the stream of successive tails of a given stream. Thus,&#13;
perhaps surprisingly, the verification of redecoration is easier for&#13;
infinite triangular matrices than for their finite counterpart.&#13;
&#13;
All the results have been obtained and are fully formalized in the&#13;
current version of the Coq theorem proving environment where these&#13;
coinductive datatypes are fully supported since the version 8.1,&#13;
released in 2007.  Nonetheless, instead of displaying the Coq&#13;
development, we have chosen to write the paper in standard&#13;
mathematical and type-theoretic language. Thus, it should be&#13;
accessible without any specific knowledge about Coq.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Ralph Matthes and Celia Picard</dc:contributor>
          <dc:date>2013</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 19, 18th International Workshop on Types for Proofs and Programs (TYPES 2011)</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.TYPES.2011.55</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-39001</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2011.55</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
