<?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-24T21:22:24Z</responseDate>
  <request identifier="4623" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:4623</identifier>
        <datestamp>2024-03-06T10:35:09Z</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>Update Monads: Cointerpreting Directed Containers</dc:title>
          <dc:creator>Ahman, Danel</dc:creator>
          <dc:creator>Uustalu, Tarmo</dc:creator>
          <dc:subject>monads and distributive laws</dc:subject>
          <dc:subject>reader</dc:subject>
          <dc:subject>writer and state monads</dc:subject>
          <dc:subject>monoids and monoid actions</dc:subject>
          <dc:subject>directed containers</dc:subject>
          <dc:description>We introduce update monads as a generalization of state monads. Update&#13;
monads are the compatible compositions of reader and writer monads&#13;
given by a set and a monoid. Distributive laws between such monads are&#13;
given by actions of the monoid on the set.&#13;
&#13;
We also discuss a dependently typed generalization of update monads. Unlike simple update monads, they cannot be factored into a reader and writer monad, but rather into similarly looking relative monads.&#13;
&#13;
Dependently typed update monads arise from cointerpreting directed&#13;
containers, by which we mean an extension of an interpretation of the&#13;
opposite of the category of containers into the category of set&#13;
functors.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Danel Ahman and Tarmo Uustalu</dc:contributor>
          <dc:date>2014</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 26, 19th International Conference on Types for Proofs and Programs (TYPES 2013)</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.2013.1</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-46235</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2013.1</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>
