<?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-20T10:52:13Z</responseDate>
  <request identifier="3675" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:3675</identifier>
        <datestamp>2024-03-06T10:34:21Z</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>Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication</dc:title>
          <dc:creator>DeYoung, Henry</dc:creator>
          <dc:creator>Caires, Luís</dc:creator>
          <dc:creator>Pfenning, Frank</dc:creator>
          <dc:creator>Toninho, Bernardo</dc:creator>
          <dc:subject>linear logic</dc:subject>
          <dc:subject>cut reduction</dc:subject>
          <dc:subject>asynchronous pi-calculus</dc:subject>
          <dc:subject>session types</dc:subject>
          <dc:description>Prior work has shown that intuitionistic linear logic can be seen as a&#13;
session-type discipline for the pi-calculus, where cut reduction in&#13;
the sequent calculus corresponds to synchronous process reduction.  In&#13;
this paper, we exhibit a new process assignment from the asynchronous,&#13;
polyadic pi-calculus to exactly the same proof rules. Proof-theoretically, the difference between these interpretations can&#13;
be understood through permutations of inference rules that preserve&#13;
observational equivalence of closed processes in the synchronous case.&#13;
We also show that, under this new asynchronous interpretation, cut&#13;
reductions correspond to a natural asynchronous buffered session&#13;
semantics, where each session is allocated a separate communication&#13;
buffer.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Henry DeYoung and Luís Caires and Frank Pfenning and Bernardo Toninho</dc:contributor>
          <dc:date>2012</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 16, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (2012)</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.2012.228</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-36753</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.228</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
