<?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-08-17T12:00:59Z</responseDate>
  <request identifier="5969" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:5969</identifier>
        <datestamp>2024-03-06T10:37:23Z</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>Coalgebras and Higher-Order Computation: a GoI Approach</dc:title>
          <dc:creator>Hasuo, Ichiro</dc:creator>
          <dc:subject>functional programming</dc:subject>
          <dc:subject>geometry of interaction</dc:subject>
          <dc:subject>categorical semantics</dc:subject>
          <dc:subject>coalgebra</dc:subject>
          <dc:description>Girard's geometry of interaction (GoI) can be seen---in one practical&#13;
aspect of it---as a compositional compilation method from functional&#13;
programs to sequential machines. There tokens move around and express&#13;
interactions between (parts of) programs. Intrigued by the combination&#13;
of abstract structures and concrete dynamics in GoI, our line of work&#13;
has aimed at exploiting, in GoI, results from the theory of&#13;
coalgebra---a categorical abstraction of state-based transition&#13;
systems that has found its use principally in concurrency theory. Such&#13;
reinforced connection between higher-order computation and state-based&#13;
dynamics is made possible thanks to an elegant categorical&#13;
axiomatization of GoI by Abramsky, Haghverdi and Scott, where traced&#13;
monoidal categories are identified to be the essential structure&#13;
behind. In the talk I shall lay out these basic ideas, together with&#13;
some of our results on: GoI semantics for a quantum programming&#13;
language; and our ``memoryful'' extension of GoI with algebraic&#13;
effects.&#13;
The talk is based on my joint work with my colleague Naohiko Hoshino (RIMS, Kyoto Univer- sity) and my (former) students Koko Muroya (University of Birmingham) and Toshiki Kataoka&#13;
(University of Tokyo), to whom I owe special thanks.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Ichiro Hasuo</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.2</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-59698</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.2</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>
