<?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-17T14:41:33Z</responseDate>
  <request identifier="3245" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:3245</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>Relating Two Semantics of Locally Scoped Names</dc:title>
          <dc:creator>Lösch, Steffen</dc:creator>
          <dc:creator>Pitts, Andrew M.</dc:creator>
          <dc:subject>local names</dc:subject>
          <dc:subject>continuations</dc:subject>
          <dc:subject>typed lambda-calculus</dc:subject>
          <dc:subject>observational equivalence</dc:subject>
          <dc:description>The operational semantics of programming constructs involving locally&#13;
scoped names typically makes use of stateful "dynamic allocation": a&#13;
set of currently-used names forms part of the state and upon entering&#13;
a scope the set is augmented by a new name bound to the scoped&#13;
identifier. More abstractly, one can see this as a transformation of&#13;
local scopes by expanding them outward to an implicit top-level. By&#13;
contrast, in a neglected paper from 1994, Odersky gave a stateless&#13;
lambda calculus with locally scoped names whose dynamics contracts&#13;
scopes inward. The properties of "Odersky-style" local names are quite&#13;
different from dynamically allocated ones and it has not been clear,&#13;
until now, what is the expressive power of Odersky's notion. We show&#13;
that in fact it provides a direct semantics of locally scoped names&#13;
from which the more familiar dynamic allocation semantics can be&#13;
obtained by continuation-passing style (CPS) translation. More&#13;
precisely, we show that there is a CPS translation of typed lambda&#13;
calculus with dynamically allocated names (the Pitts-Stark&#13;
nu-calculus) into Odersky's lambda-nu-calculus which is&#13;
computationally adequate with respect to observational equivalence in&#13;
the two calculi.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Steffen Lösch and Andrew M. Pitts</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.396</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-32454</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.396</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>
