Addressed term rewriting systems: application to a typed object calculus
Identifieur interne : 002694 ( Istex/Curation ); précédent : 002693; suivant : 002695Addressed term rewriting systems: application to a typed object calculus
Auteurs : Daniel J. Dougherty [États-Unis] ; Pierre Lescanne [France] ; Luigi LiquoriSource :
- Mathematical Structures in Computer Science [ 0960-1295 ] ; 2006-08.
Abstract
We present a formalism called addressed term rewriting systems, which can be used to model implementations of theorem proving, symbolic computation and programming languages, especially aspects of sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are therefore well suited to describing object-based languages, and as an example we present a language called $\lambda{\cal O}bj^{a}$, incorporating both functional and object-based features. As a case study in how reasoning about languages is supported in the ATRS formalism, we define a type system for $\lambda{\cal O}bj^{a}$ and prove a type soundness result.
Url:
DOI: 10.1017/S096012950600541X
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002727
Links to Exploration step
ISTEX:A5E8DB455B3FF4F827436C30D78D7BFE3EEF2CBBCuration
No country items
Luigi Liquori<affiliation><mods:affiliation>INRIA Sophia Antipolis FR-06902 France</mods:affiliation>
<wicri:noCountry code="no comma">INRIA Sophia Antipolis FR-06902 France</wicri:noCountry>
</affiliation>
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Addressed term rewriting systems: application to a typed object calculus</title>
<author><name sortKey="Dougherty, Daniel J" sort="Dougherty, Daniel J" uniqKey="Dougherty D" first="Daniel J." last="Dougherty">Daniel J. Dougherty</name>
<affiliation wicri:level="2"><mods:affiliation>Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA 01609 U.S.A.</mods:affiliation>
<country xml:lang="fr">États-Unis</country>
<placeName><region type="state">Massachusetts</region>
</placeName>
<wicri:cityArea>Department of Computer Science, Worcester Polytechnic Institute, Worcester</wicri:cityArea>
</affiliation>
</author>
<author><name sortKey="Lescanne, Pierre" sort="Lescanne, Pierre" uniqKey="Lescanne P" first="Pierre" last="Lescanne">Pierre Lescanne</name>
<affiliation wicri:level="1"><mods:affiliation>Laboratoire de l'Informatique du Parallélisme, École Normale Supérieure de Lyon, 46, Allée d'Italie, 69364 Lyon 07, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>Laboratoire de l'Informatique du Parallélisme, École Normale Supérieure de Lyon, 46, Allée d'Italie, 69364 Lyon 07</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Liquori, Luigi" sort="Liquori, Luigi" uniqKey="Liquori L" first="Luigi" last="Liquori">Luigi Liquori</name>
<affiliation><mods:affiliation>INRIA Sophia Antipolis FR-06902 France</mods:affiliation>
<wicri:noCountry code="no comma">INRIA Sophia Antipolis FR-06902 France</wicri:noCountry>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:A5E8DB455B3FF4F827436C30D78D7BFE3EEF2CBB</idno>
<date when="2006" year="2006">2006</date>
<idno type="doi">10.1017/S096012950600541X</idno>
<idno type="url">https://api.istex.fr/ark:/67375/6GQ-95JKZRX9-6/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002727</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002727</idno>
<idno type="wicri:Area/Istex/Curation">002694</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a">Addressed term rewriting systems: application to a typed object calculus</title>
<author><name sortKey="Dougherty, Daniel J" sort="Dougherty, Daniel J" uniqKey="Dougherty D" first="Daniel J." last="Dougherty">Daniel J. Dougherty</name>
<affiliation wicri:level="2"><mods:affiliation>Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA 01609 U.S.A.</mods:affiliation>
<country xml:lang="fr">États-Unis</country>
<placeName><region type="state">Massachusetts</region>
</placeName>
<wicri:cityArea>Department of Computer Science, Worcester Polytechnic Institute, Worcester</wicri:cityArea>
</affiliation>
</author>
<author><name sortKey="Lescanne, Pierre" sort="Lescanne, Pierre" uniqKey="Lescanne P" first="Pierre" last="Lescanne">Pierre Lescanne</name>
<affiliation wicri:level="1"><mods:affiliation>Laboratoire de l'Informatique du Parallélisme, École Normale Supérieure de Lyon, 46, Allée d'Italie, 69364 Lyon 07, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>Laboratoire de l'Informatique du Parallélisme, École Normale Supérieure de Lyon, 46, Allée d'Italie, 69364 Lyon 07</wicri:regionArea>
</affiliation>
</author>
<author><name sortKey="Liquori, Luigi" sort="Liquori, Luigi" uniqKey="Liquori L" first="Luigi" last="Liquori">Luigi Liquori</name>
<affiliation><mods:affiliation>INRIA Sophia Antipolis FR-06902 France</mods:affiliation>
<wicri:noCountry code="no comma">INRIA Sophia Antipolis FR-06902 France</wicri:noCountry>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Mathematical Structures in Computer Science</title>
<idno type="ISSN">0960-1295</idno>
<idno type="eISSN">1469-8072</idno>
<imprint><publisher>Cambridge University Press</publisher>
<pubPlace>Cambridge, UK</pubPlace>
<date type="published" when="2006-08">2006-08</date>
<biblScope unit="volume">16</biblScope>
<biblScope unit="issue">4</biblScope>
<biblScope unit="page" from="667">667</biblScope>
<biblScope unit="page" to="709">709</biblScope>
</imprint>
<idno type="ISSN">0960-1295</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0960-1295</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract">We present a formalism called addressed term rewriting systems, which can be used to model implementations of theorem proving, symbolic computation and programming languages, especially aspects of sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are therefore well suited to describing object-based languages, and as an example we present a language called $\lambda{\cal O}bj^{a}$, incorporating both functional and object-based features. As a case study in how reasoning about languages is supported in the ATRS formalism, we define a type system for $\lambda{\cal O}bj^{a}$ and prove a type soundness result.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002694 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 002694 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Istex |étape= Curation |type= RBID |clé= ISTEX:A5E8DB455B3FF4F827436C30D78D7BFE3EEF2CBB |texte= Addressed term rewriting systems: application to a typed object calculus }}
This area was generated with Dilib version V0.6.33. |