InforLorV4, Hal, Corpus, bibRecord, 000F38

Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus

Identifieur interne : 000F38 ( Hal/Corpus ); précédent : 000F37; suivant : 000F39

Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus

Auteurs : Dariusz Biernacki ; Sergueï Lenglet

Source :

Electronic Notes in Theoretical Computer Science [ 1571-0661 ] ; 2014.

RBID : Hal:hal-01080960

English descriptors

mix :
- applicative bisimulation, contextual equivalence, continuation, control operator.

Abstract

We propose the first sound and complete bisimilarities for the call-by-name and call-by-value untyped λµ-calculus, defined in the applicative style. We give equivalence examples to illustrate how our relations can be used; in particular, we prove David and Py's counter-example, which cannot be proved with Lassen's preexisting normal form bisimilarities for the λµ-calculus.

Url:

https://hal.inria.fr/hal-01080960

DOI: 10.1016/j.entcs.2014.10.004

Links to Exploration step

Hal:hal-01080960

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus</title>
<author><name sortKey="Biernacki, Dariusz" sort="Biernacki, Dariusz" uniqKey="Biernacki D" first="Dariusz" last="Biernacki">Dariusz Biernacki</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-231295" status="VALID"><orgName>Faculty of Mathematics and Computer Science [Wroclaw]</orgName>
<desc><address><addrLine>Pl. Uniwersytecki 150-137 Wrocław</addrLine>
<country key="PL"></country>
</address>
<ref type="url">https://international.uni.wroc.pl/en/faculty-mathematics-and-computer-science</ref>
</desc>
<listRelation><relation active="#struct-450377" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-450377" type="direct"><org type="institution" xml:id="struct-450377" status="VALID"><orgName>University of Wrocław [Poland]</orgName>
<desc><address><addrLine>Pl. Uniwersytecki 150-137 Wrocław</addrLine>
<country key="PL"></country>
</address>
<ref type="url">http://uni.wroc.pl/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Lenglet, Serguei" sort="Lenglet, Serguei" uniqKey="Lenglet S" first="Sergueï" last="Lenglet">Sergueï Lenglet</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-205126" status="OLD"><idno type="RNSR">200820941G</idno>
<orgName>Formal islands: foundations and applications</orgName>
<orgName type="acronym">PAREO</orgName>
<date type="end">2014-12-31</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/pareo</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423084" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName>
<orgName type="acronym">LORIA - FM</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01080960</idno>
<idno type="halId">hal-01080960</idno>
<idno type="halUri">https://hal.inria.fr/hal-01080960</idno>
<idno type="url">https://hal.inria.fr/hal-01080960</idno>
<idno type="doi">10.1016/j.entcs.2014.10.004</idno>
<date when="2014-06-12">2014-06-12</date>
<idno type="wicri:Area/Hal/Corpus">000F38</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus</title>
<author><name sortKey="Biernacki, Dariusz" sort="Biernacki, Dariusz" uniqKey="Biernacki D" first="Dariusz" last="Biernacki">Dariusz Biernacki</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-231295" status="VALID"><orgName>Faculty of Mathematics and Computer Science [Wroclaw]</orgName>
<desc><address><addrLine>Pl. Uniwersytecki 150-137 Wrocław</addrLine>
<country key="PL"></country>
</address>
<ref type="url">https://international.uni.wroc.pl/en/faculty-mathematics-and-computer-science</ref>
</desc>
<listRelation><relation active="#struct-450377" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-450377" type="direct"><org type="institution" xml:id="struct-450377" status="VALID"><orgName>University of Wrocław [Poland]</orgName>
<desc><address><addrLine>Pl. Uniwersytecki 150-137 Wrocław</addrLine>
<country key="PL"></country>
</address>
<ref type="url">http://uni.wroc.pl/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Lenglet, Serguei" sort="Lenglet, Serguei" uniqKey="Lenglet S" first="Sergueï" last="Lenglet">Sergueï Lenglet</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-205126" status="OLD"><idno type="RNSR">200820941G</idno>
<orgName>Formal islands: foundations and applications</orgName>
<orgName type="acronym">PAREO</orgName>
<date type="end">2014-12-31</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/pareo</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423084" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName>
<orgName type="acronym">LORIA - FM</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1016/j.entcs.2014.10.004</idno>
<series><title level="j">Electronic Notes in Theoretical Computer Science</title>
<idno type="ISSN">1571-0661</idno>
<imprint><date type="datePub">2014</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>applicative bisimulation</term>
<term>contextual equivalence</term>
<term>continuation</term>
<term>control operator</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We propose the first sound and complete bisimilarities for the call-by-name and call-by-value untyped λµ-calculus, defined in the applicative style. We give equivalence examples to illustrate how our relations can be used; in particular, we prove David and Py's counter-example, which cannot be proved with Lassen's preexisting normal form bisimilarities for the λµ-calculus.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus</title>
<author role="aut"><persName><forename type="first">Dariusz</forename>
<surname>Biernacki</surname>
</persName>
<email></email>
<idno type="halauthor">886667</idno>
<affiliation ref="#struct-231295"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Sergueï</forename>
<surname>Lenglet</surname>
</persName>
<email></email>
<idno type="halauthor">496652</idno>
<affiliation ref="#struct-205126"></affiliation>
</author>
<editor role="depositor"><persName><forename>Sergueï</forename>
<surname>Lenglet</surname>
</persName>
<email>serguei.lenglet@univ-lorraine.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2014-11-06 15:33:17</date>
<date type="whenModified">2015-09-22 01:13:03</date>
<date type="whenReleased">2014-11-06 15:58:42</date>
<date type="whenProduced">2014-06-12</date>
<date type="whenEndEmbargoed">2014-11-06</date>
<ref type="file" target="https://hal.inria.fr/hal-01080960/document"><date notBefore="2014-11-06"></date>
</ref>
<ref type="file" subtype="author" n="1" target="https://hal.inria.fr/hal-01080960/file/lambdamuentcs.pdf"><date notBefore="2014-11-06"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="147267"><persName><forename>Sergueï</forename>
<surname>Lenglet</surname>
</persName>
<email>serguei.lenglet@univ-lorraine.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-01080960</idno>
<idno type="halUri">https://hal.inria.fr/hal-01080960</idno>
<idno type="halBibtex">biernacki:hal-01080960</idno>
<idno type="halRefHtml">Mathematical Foundations of Programming Semantics Thirtieth Conference, Jun 2014, Ithaca, United States. 308, pp.49 - 64, 2014, <10.1016/j.entcs.2014.10.004></idno>
<idno type="halRef">Mathematical Foundations of Programming Semantics Thirtieth Conference, Jun 2014, Ithaca, United States. 308, pp.49 - 64, 2014, <10.1016/j.entcs.2014.10.004></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA-FM" p="LORIA">Méthodes formelles</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus</title>
<author role="aut"><persName><forename type="first">Dariusz</forename>
<surname>Biernacki</surname>
</persName>
<idno type="halAuthorId">886667</idno>
<affiliation ref="#struct-231295"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Sergueï</forename>
<surname>Lenglet</surname>
</persName>
<idno type="halAuthorId">496652</idno>
<affiliation ref="#struct-205126"></affiliation>
</author>
</analytic>
<monogr><idno type="halJournalId" status="VALID">12842</idno>
<idno type="issn">1571-0661</idno>
<title level="j">Electronic Notes in Theoretical Computer Science</title>
<meeting><title>Mathematical Foundations of Programming Semantics Thirtieth Conference</title>
<date type="start">2014-06-12</date>
<date type="end">2014-06-15</date>
<settlement>Ithaca</settlement>
<country key="US">United States</country>
</meeting>
<imprint><publisher>Elsevier</publisher>
<biblScope unit="volume">308</biblScope>
<biblScope unit="pp">49 - 64</biblScope>
<date type="datePub">2014</date>
</imprint>
</monogr>
<idno type="doi">10.1016/j.entcs.2014.10.004</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">control operator</term>
<term xml:lang="en">continuation</term>
<term xml:lang="en">applicative bisimulation</term>
<term xml:lang="en">contextual equivalence</term>
</keywords>
<classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">We propose the first sound and complete bisimilarities for the call-by-name and call-by-value untyped λµ-calculus, defined in the applicative style. We give equivalence examples to illustrate how our relations can be used; in particular, we prove David and Py's counter-example, which cannot be proved with Lassen's preexisting normal form bisimilarities for the λµ-calculus.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000F38 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 000F38 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:hal-01080960
   |texte=   Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus

Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus

Source :

English descriptors

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri