Matching power
Identifieur interne :
000952 ( PascalFrancis/Corpus );
précédent :
000951;
suivant :
000953
Matching power
Auteurs : Horatiu Cirstea ;
Claude Kirchner ;
Luigi LiquoriSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2001.
RBID : Pascal:01-0324885
Descripteurs français
English descriptors
Abstract
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to encode complex structures such as lists, sets, and objects. We provide extensive examples of the calculus, and we focus on its ability to represent some object oriented calculi, namely the Lambda Calculus of Objects of Fisher, Honsell, and Mitchell, and the Object Calculus of Abadi and Cardelli. Furthermore, the calculus allows us to get object oriented constructions unreachable in other calculi. In summa, we intend to show that because of its matching ability, the Rho Calculus represents a lingua franca to naturally encode many paradigms of computations. This enlightens the capabilities of the rewriting calculus based language ELAN to be used as a logical as well as powerful semantical framework.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 2051 |
|---|
| A08 | 01 | 1 | ENG | @1 Matching power |
|---|
| A09 | 01 | 1 | ENG | @1 RTA 2001 : rewriting techniques and applications : Utrecht, 22-24 May 2001 |
|---|
| A11 | 01 | 1 | | @1 CIRSTEA (Horatiu) |
|---|
| A11 | 02 | 1 | | @1 KIRCHNER (Claude) |
|---|
| A11 | 03 | 1 | | @1 LIQUORI (Luigi) |
|---|
| A12 | 01 | 1 | | @1 MIDDELDORP (Aart) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA INRIA INPL ENSMN, BP 239 @2 54506 Vandoeuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. |
|---|
| A20 | | | | @1 77-92 |
|---|
| A21 | | | | @1 2001 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-42117-3 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000092401600060 |
|---|
| A44 | | | | @0 0000 @1 © 2001 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 39 ref. |
|---|
| A47 | 01 | 1 | | @0 01-0324885 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to encode complex structures such as lists, sets, and objects. We provide extensive examples of the calculus, and we focus on its ability to represent some object oriented calculi, namely the Lambda Calculus of Objects of Fisher, Honsell, and Mitchell, and the Object Calculus of Abadi and Cardelli. Furthermore, the calculus allows us to get object oriented constructions unreachable in other calculi. In summa, we intend to show that because of its matching ability, the Rho Calculus represents a lingua franca to naturally encode many paradigms of computations. This enlightens the capabilities of the rewriting calculus based language ELAN to be used as a logical as well as powerful semantical framework. |
|---|
| C02 | 01 | X | | @0 001A02A01F |
|---|
| C02 | 02 | X | | @0 001D02A02 |
|---|
| C03 | 01 | 3 | FRE | @0 Système réécriture @5 04 |
|---|
| C03 | 01 | 3 | ENG | @0 Rewriting systems @5 04 |
|---|
| C03 | 02 | X | FRE | @0 Démonstration théorème @5 05 |
|---|
| C03 | 02 | X | ENG | @0 Theorem proving @5 05 |
|---|
| C03 | 02 | X | SPA | @0 Demostración teorema @5 05 |
|---|
| C03 | 03 | X | FRE | @0 Reconnaissance forme @5 06 |
|---|
| C03 | 03 | X | ENG | @0 Pattern recognition @5 06 |
|---|
| C03 | 03 | X | SPA | @0 Reconocimiento patrón @5 06 |
|---|
| C03 | 04 | X | FRE | @0 Concordance forme @5 07 |
|---|
| C03 | 04 | X | ENG | @0 Pattern matching @5 07 |
|---|
| C03 | 05 | X | FRE | @0 Orienté objet @5 18 |
|---|
| C03 | 05 | X | ENG | @0 Object oriented @5 18 |
|---|
| C03 | 05 | X | SPA | @0 Orientado objeto @5 18 |
|---|
| C03 | 06 | X | FRE | @0 Rho calcul @4 CD @5 96 |
|---|
| C03 | 06 | X | ENG | @0 Rho calculus @4 CD @5 96 |
|---|
| N21 | | | | @1 225 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Rewriting techniques and applications. International conference @2 12 @3 Utrecht NLD @4 2001-05-22 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 01-0324885 INIST |
|---|
| ET : | Matching power |
|---|
| AU : | CIRSTEA (Horatiu); KIRCHNER (Claude); LIQUORI (Luigi); MIDDELDORP (Aart) |
|---|
| AF : | LORIA INRIA INPL ENSMN, BP 239/54506 Vandoeuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2051; Pp. 77-92; Bibl. 39 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to encode complex structures such as lists, sets, and objects. We provide extensive examples of the calculus, and we focus on its ability to represent some object oriented calculi, namely the Lambda Calculus of Objects of Fisher, Honsell, and Mitchell, and the Object Calculus of Abadi and Cardelli. Furthermore, the calculus allows us to get object oriented constructions unreachable in other calculi. In summa, we intend to show that because of its matching ability, the Rho Calculus represents a lingua franca to naturally encode many paradigms of computations. This enlightens the capabilities of the rewriting calculus based language ELAN to be used as a logical as well as powerful semantical framework. |
|---|
| CC : | 001A02A01F; 001D02A02 |
|---|
| FD : | Système réécriture; Démonstration théorème; Reconnaissance forme; Concordance forme; Orienté objet; Rho calcul |
|---|
| ED : | Rewriting systems; Theorem proving; Pattern recognition; Pattern matching; Object oriented; Rho calculus |
|---|
| SD : | Demostración teorema; Reconocimiento patrón; Orientado objeto |
|---|
| LO : | INIST-16343.354000092401600060 |
|---|
| ID : | 01-0324885 |
|---|
Links to Exploration step
Pascal:01-0324885
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Matching power</title>
<author><name sortKey="Cirstea, Horatiu" sort="Cirstea, Horatiu" uniqKey="Cirstea H" first="Horatiu" last="Cirstea">Horatiu Cirstea</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA INRIA INPL ENSMN, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA INRIA INPL ENSMN, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Liquori, Luigi" sort="Liquori, Luigi" uniqKey="Liquori L" first="Luigi" last="Liquori">Luigi Liquori</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA INRIA INPL ENSMN, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0324885</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 01-0324885 INIST</idno>
<idno type="RBID">Pascal:01-0324885</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000952</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Matching power</title>
<author><name sortKey="Cirstea, Horatiu" sort="Cirstea, Horatiu" uniqKey="Cirstea H" first="Horatiu" last="Cirstea">Horatiu Cirstea</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA INRIA INPL ENSMN, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA INRIA INPL ENSMN, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Liquori, Luigi" sort="Liquori, Luigi" uniqKey="Liquori L" first="Luigi" last="Liquori">Luigi Liquori</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA INRIA INPL ENSMN, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2001">2001</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Object oriented</term>
<term>Pattern matching</term>
<term>Pattern recognition</term>
<term>Rewriting systems</term>
<term>Rho calculus</term>
<term>Theorem proving</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Système réécriture</term>
<term>Démonstration théorème</term>
<term>Reconnaissance forme</term>
<term>Concordance forme</term>
<term>Orienté objet</term>
<term>Rho calcul</term>
</keywords><front><div type="abstract" xml:lang="en">In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to encode complex structures such as lists, sets, and objects. We provide extensive examples of the calculus, and we focus on its ability to represent some object oriented calculi, namely the Lambda Calculus of Objects of Fisher, Honsell, and Mitchell, and the Object Calculus of Abadi and Cardelli. Furthermore, the calculus allows us to get object oriented constructions unreachable in other calculi. In summa, we intend to show that because of its matching ability, the Rho Calculus represents a lingua franca to naturally encode many paradigms of computations. This enlightens the capabilities of the rewriting calculus based language ELAN to be used as a logical as well as powerful semantical framework.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>2051</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Matching power</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>RTA 2001 : rewriting techniques and applications : Utrecht, 22-24 May 2001</s1>
</fA09><fA11 i1="01" i2="1"><s1>CIRSTEA (Horatiu)</s1>
</fA11><fA11 i1="02" i2="1"><s1>KIRCHNER (Claude)</s1>
</fA11><fA11 i1="03" i2="1"><s1>LIQUORI (Luigi)</s1>
</fA11><fA12 i1="01" i2="1"><s1>MIDDELDORP (Aart)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA INRIA INPL ENSMN, BP 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>77-92</s1>
</fA20><fA21><s1>2001</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-42117-3</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000092401600060</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>39 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>01-0324885</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to encode complex structures such as lists, sets, and objects. We provide extensive examples of the calculus, and we focus on its ability to represent some object oriented calculi, namely the Lambda Calculus of Objects of Fisher, Honsell, and Mitchell, and the Object Calculus of Abadi and Cardelli. Furthermore, the calculus allows us to get object oriented constructions unreachable in other calculi. In summa, we intend to show that because of its matching ability, the Rho Calculus represents a lingua franca to naturally encode many paradigms of computations. This enlightens the capabilities of the rewriting calculus based language ELAN to be used as a logical as well as powerful semantical framework.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001A02A01F</s0>
</fC02><fC02 i1="02" i2="X"><s0>001D02A02</s0>
</fC02><fC03 i1="01" i2="3" l="FRE"><s0>Système réécriture</s0>
<s5>04</s5>
</fC03><fC03 i1="01" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>04</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Démonstration théorème</s0>
<s5>05</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Theorem proving</s0>
<s5>05</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Demostración teorema</s0>
<s5>05</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Reconnaissance forme</s0>
<s5>06</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Pattern recognition</s0>
<s5>06</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Reconocimiento patrón</s0>
<s5>06</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Concordance forme</s0>
<s5>07</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Pattern matching</s0>
<s5>07</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Orienté objet</s0>
<s5>18</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Object oriented</s0>
<s5>18</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Orientado objeto</s0>
<s5>18</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Rho calcul</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Rho calculus</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fN21><s1>225</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>Rewriting techniques and applications. International conference</s1>
<s2>12</s2>
<s3>Utrecht NLD</s3>
<s4>2001-05-22</s4>
</fA30><server><NO>PASCAL 01-0324885 INIST</NO>
<ET>Matching power</ET>
<AU>CIRSTEA (Horatiu); KIRCHNER (Claude); LIQUORI (Luigi); MIDDELDORP (Aart)</AU>
<AF>LORIA INRIA INPL ENSMN, BP 239/54506 Vandoeuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2051; Pp. 77-92; Bibl. 39 ref.</SO>
<LA>Anglais</LA>
<EA>In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to encode complex structures such as lists, sets, and objects. We provide extensive examples of the calculus, and we focus on its ability to represent some object oriented calculi, namely the Lambda Calculus of Objects of Fisher, Honsell, and Mitchell, and the Object Calculus of Abadi and Cardelli. Furthermore, the calculus allows us to get object oriented constructions unreachable in other calculi. In summa, we intend to show that because of its matching ability, the Rho Calculus represents a lingua franca to naturally encode many paradigms of computations. This enlightens the capabilities of the rewriting calculus based language ELAN to be used as a logical as well as powerful semantical framework.</EA>
<CC>001A02A01F; 001D02A02</CC>
<FD>Système réécriture; Démonstration théorème; Reconnaissance forme; Concordance forme; Orienté objet; Rho calcul</FD>
<ED>Rewriting systems; Theorem proving; Pattern recognition; Pattern matching; Object oriented; Rho calculus</ED>
<SD>Demostración teorema; Reconocimiento patrón; Orientado objeto</SD>
<LO>INIST-16343.354000092401600060</LO>
<ID>01-0324885</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000952 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000952 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:01-0324885
|texte= Matching power
}}
| 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 |  |
