<?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-20T12:09:20Z</responseDate>
  <request identifier="3238" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:3238</identifier>
        <datestamp>2024-03-06T10:34:00Z</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>The Lax Braided Structure of Streaming I/O</dc:title>
          <dc:creator>Jeffrey, Alan</dc:creator>
          <dc:creator>Rathke, Julian</dc:creator>
          <dc:subject>semantics</dc:subject>
          <dc:subject>categorical models</dc:subject>
          <dc:subject>streaming I/O</dc:subject>
          <dc:subject>Agda</dc:subject>
          <dc:description>We investigate and implement a model of typed streaming I/O. Each type&#13;
determines a language of traces analogous to regular expressions on&#13;
strings, and programs are modelled by certain monotone functions on&#13;
these traces.  We show that sequential composition forms a lax braided&#13;
monoid in the category of types and programs. This lax braided&#13;
structure allows programs to be represented diagrammatically using&#13;
Joyal and Street's string diagrams in 3D space.&#13;
&#13;
Monotone functions over traces cannot be executed efficiently, so we&#13;
present an equivalent monoidal category of transducers. We demonstrate&#13;
that transducers can be executed efficiently, theoretically by showing&#13;
that programs with diagrams embedded in the plane can be executed in&#13;
O(1) space, and experimentally by an implementation in the Agda&#13;
dependently typed functional language. Agda supports machine-assisted&#13;
proof: we have mechanically verified that the transducer&#13;
implementation and the I/O model form lax braided monoidal categories.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Alan Jeffrey and Julian Rathke</dc:contributor>
          <dc:date>2011</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 12, Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL (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.CSL.2011.292</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-32386</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.292</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>
