InforLorV4, PascalFrancis, Corpus, bibRecord, 000855

ELAN from a rewriting logic point of view

Identifieur interne : 000855 ( PascalFrancis/Corpus ); précédent : 000854; suivant : 000856

ELAN from a rewriting logic point of view

Auteurs : Peter Borovansky ; Claude Kirchner ; Hélène Kirchner ; Pierre-Etienne Moreau

Source :

Theoretical computer science [ 0304-3975 ] ; 2002.

RBID : Pascal:02-0529487

Descripteurs français

Pascal (Inist)
- Réécriture, Logique, Sémantique, Langage programmation, Théorie stratégie, Programmation basée règle, Système calcul, Système ELAN.

English descriptors

KwdEn :
- Logic, Programming language, Rewriting, Semantics.

Abstract

ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule-based processes. With the general goal to make precise a rewriting logic-based semantics of ELAN, this paper has three contributions: a presentation of the concepts of rules and strategies available in ELAN, an expression of rewrite rules with matching conditions in conditional rewriting logic, and finally an enrichment mechanism of a rewrite theory into a strategy theory in conditional rewriting logic.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0304-3975`
A02	`01`			`@0 TCSCDI`
A03		`1`		`@0 Theor. comput. sci.`
A05				`@2 285`
A06				`@2 2`
A08	`01`	`1`	`ENG`	`@1 ELAN from a rewriting logic point of view`
A09	`01`	`1`	`ENG`	`@1 Rewriting logic and its applications`
A11	`01`	`1`		`@1 BOROVANSKY (Peter)`
A11	`02`	`1`		`@1 KIRCHNER (Claude)`
A11	`03`	`1`		`@1 KIRCHNER (Hélène)`
A11	`04`	`1`		`@1 MOREAU (Pierre-Etienne)`
A12	`01`	`1`		`@1 MARTI-OLIET (Narciso) @9 ed.`
A12	`02`	`1`		`@1 MESEGUER (José) @9 ed.`
A14	`01`			`@1 Comenius University, Mlynská dolina @2 842 15 Bratislava @3 SVK @Z 1 aut.`
A14	`02`			`@1 LORIA - CNRS & INRIA, BP 239 @2 54506, Vandœuvre-lès-Nancy @3 FRA @Z 2 aut. @Z 3 aut. @Z 4 aut.`
A15	`01`			`@1 Facultad de Matematicas, Universidad Complutense @2 Madrid @3 ESP @Z 1 aut.`
A15	`02`			`@1 Computer Science Laboratory, SRI International, 333 Ravenswood Ave. @2 Menlo Park, CA 94025 @3 USA @Z 2 aut.`
A20				`@1 155-185`
A21				`@1 2002`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 17243 @5 354000104549090020`
A44				`@0 0000 @1 © 2002 INIST-CNRS. All rights reserved.`
A45				`@0 72 ref.`
A47	`01`	`1`		`@0 02-0529487`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Theoretical computer science`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	@0 ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule-based processes. With the general goal to make precise a rewriting logic-based semantics of ELAN, this paper has three contributions: a presentation of the concepts of rules and strategies available in ELAN, an expression of rewrite rules with matching conditions in conditional rewriting logic, and finally an enrichment mechanism of a rewrite theory into a strategy theory in conditional rewriting logic.
C02	`01`	`X`		`@0 001D02A02`
C03	`01`	`X`	`FRE`	`@0 Réécriture @5 01`
C03	`01`	`X`	`ENG`	`@0 Rewriting @5 01`
C03	`01`	`X`	`SPA`	`@0 Reescritura @5 01`
C03	`02`	`X`	`FRE`	`@0 Logique @5 02`
C03	`02`	`X`	`ENG`	`@0 Logic @5 02`
C03	`02`	`X`	`SPA`	`@0 Lógica @5 02`
C03	`03`	`X`	`FRE`	`@0 Sémantique @5 03`
C03	`03`	`X`	`ENG`	`@0 Semantics @5 03`
C03	`03`	`X`	`SPA`	`@0 Semántica @5 03`
C03	`04`	`X`	`FRE`	`@0 Langage programmation @5 04`
C03	`04`	`X`	`ENG`	`@0 Programming language @5 04`
C03	`04`	`X`	`SPA`	`@0 Lenguaje programación @5 04`
C03	`05`	`X`	`FRE`	`@0 Théorie stratégie @4 INC @5 70`
C03	`06`	`X`	`FRE`	`@0 Programmation basée règle @4 INC @5 71`
C03	`07`	`X`	`FRE`	`@0 Système calcul @4 INC @5 72`
C03	`08`	`X`	`FRE`	`@0 Système ELAN @4 INC @5 73`
N21				`@1 316`

Format Inist (serveur)

NO :	PASCAL 02-0529487 INIST
ET :	ELAN from a rewriting logic point of view
AU :	BOROVANSKY (Peter); KIRCHNER (Claude); KIRCHNER (Hélène); MOREAU (Pierre-Etienne); MARTI-OLIET (Narciso); MESEGUER (José)
AF :	Comenius University, Mlynská dolina/842 15 Bratislava/Slovaquie (1 aut.); LORIA - CNRS & INRIA, BP 239/54506, Vandœuvre-lès-Nancy/France (2 aut., 3 aut., 4 aut.); Facultad de Matematicas, Universidad Complutense/Madrid/Espagne (1 aut.); Computer Science Laboratory, SRI International, 333 Ravenswood Ave./Menlo Park, CA 94025/Etats-Unis (2 aut.)
DT :	Publication en série; Niveau analytique
SO :	Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2002; Vol. 285; No. 2; Pp. 155-185; Bibl. 72 ref.
LA :	Anglais
EA :	ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule-based processes. With the general goal to make precise a rewriting logic-based semantics of ELAN, this paper has three contributions: a presentation of the concepts of rules and strategies available in ELAN, an expression of rewrite rules with matching conditions in conditional rewriting logic, and finally an enrichment mechanism of a rewrite theory into a strategy theory in conditional rewriting logic.
CC :	001D02A02
FD :	Réécriture; Logique; Sémantique; Langage programmation; Théorie stratégie; Programmation basée règle; Système calcul; Système ELAN
ED :	Rewriting; Logic; Semantics; Programming language
SD :	Reescritura; Lógica; Semántica; Lenguaje programación
LO :	INIST-17243.354000104549090020
ID :	02-0529487

Links to Exploration step

Pascal:02-0529487

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">ELAN from a rewriting logic point of view</title>
<author><name sortKey="Borovansky, Peter" sort="Borovansky, Peter" uniqKey="Borovansky P" first="Peter" last="Borovansky">Peter Borovansky</name>
<affiliation><inist:fA14 i1="01"><s1>Comenius University, Mlynská dolina</s1>
<s2>842 15 Bratislava</s2>
<s3>SVK</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA - CNRS & INRIA, BP 239</s1>
<s2>54506, Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA - CNRS & INRIA, BP 239</s1>
<s2>54506, Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Moreau, Pierre Etienne" sort="Moreau, Pierre Etienne" uniqKey="Moreau P" first="Pierre-Etienne" last="Moreau">Pierre-Etienne Moreau</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA - CNRS & INRIA, BP 239</s1>
<s2>54506, Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">02-0529487</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 02-0529487 INIST</idno>
<idno type="RBID">Pascal:02-0529487</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000855</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">ELAN from a rewriting logic point of view</title>
<author><name sortKey="Borovansky, Peter" sort="Borovansky, Peter" uniqKey="Borovansky P" first="Peter" last="Borovansky">Peter Borovansky</name>
<affiliation><inist:fA14 i1="01"><s1>Comenius University, Mlynská dolina</s1>
<s2>842 15 Bratislava</s2>
<s3>SVK</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA - CNRS & INRIA, BP 239</s1>
<s2>54506, Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA - CNRS & INRIA, BP 239</s1>
<s2>54506, Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Moreau, Pierre Etienne" sort="Moreau, Pierre Etienne" uniqKey="Moreau P" first="Pierre-Etienne" last="Moreau">Pierre-Etienne Moreau</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA - CNRS & INRIA, BP 239</s1>
<s2>54506, Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date when="2002">2002</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Logic</term>
<term>Programming language</term>
<term>Rewriting</term>
<term>Semantics</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Réécriture</term>
<term>Logique</term>
<term>Sémantique</term>
<term>Langage programmation</term>
<term>Théorie stratégie</term>
<term>Programmation basée règle</term>
<term>Système calcul</term>
<term>Système ELAN</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule-based processes. With the general goal to make precise a rewriting logic-based semantics of ELAN, this paper has three contributions: a presentation of the concepts of rules and strategies available in ELAN, an expression of rewrite rules with matching conditions in conditional rewriting logic, and finally an enrichment mechanism of a rewrite theory into a strategy theory in conditional rewriting logic.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0304-3975</s0>
</fA01>
<fA02 i1="01"><s0>TCSCDI</s0>
</fA02>
<fA03 i2="1"><s0>Theor. comput. sci.</s0>
</fA03>
<fA05><s2>285</s2>
</fA05>
<fA06><s2>2</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>ELAN from a rewriting logic point of view</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Rewriting logic and its applications</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>BOROVANSKY (Peter)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>KIRCHNER (Claude)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>KIRCHNER (Hélène)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>MOREAU (Pierre-Etienne)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>MARTI-OLIET (Narciso)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>MESEGUER (José)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Comenius University, Mlynská dolina</s1>
<s2>842 15 Bratislava</s2>
<s3>SVK</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA - CNRS & INRIA, BP 239</s1>
<s2>54506, Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>Facultad de Matematicas, Universidad Complutense</s1>
<s2>Madrid</s2>
<s3>ESP</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA15 i1="02"><s1>Computer Science Laboratory, SRI International, 333 Ravenswood Ave.</s1>
<s2>Menlo Park, CA 94025</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA15>
<fA20><s1>155-185</s1>
</fA20>
<fA21><s1>2002</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>17243</s2>
<s5>354000104549090020</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2002 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>72 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>02-0529487</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Theoretical computer science</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule-based processes. With the general goal to make precise a rewriting logic-based semantics of ELAN, this paper has three contributions: a presentation of the concepts of rules and strategies available in ELAN, an expression of rewrite rules with matching conditions in conditional rewriting logic, and finally an enrichment mechanism of a rewrite theory into a strategy theory in conditional rewriting logic.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Logique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Logic</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Lógica</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Sémantique</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Semantics</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Semántica</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Langage programmation</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Programming language</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Lenguaje programación</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Théorie stratégie</s0>
<s4>INC</s4>
<s5>70</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Programmation basée règle</s0>
<s4>INC</s4>
<s5>71</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Système calcul</s0>
<s4>INC</s4>
<s5>72</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Système ELAN</s0>
<s4>INC</s4>
<s5>73</s5>
</fC03>
<fN21><s1>316</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 02-0529487 INIST</NO>
<ET>ELAN from a rewriting logic point of view</ET>
<AU>BOROVANSKY (Peter); KIRCHNER (Claude); KIRCHNER (Hélène); MOREAU (Pierre-Etienne); MARTI-OLIET (Narciso); MESEGUER (José)</AU>
<AF>Comenius University, Mlynská dolina/842 15 Bratislava/Slovaquie (1 aut.); LORIA - CNRS & INRIA, BP 239/54506, Vandœuvre-lès-Nancy/France (2 aut., 3 aut., 4 aut.); Facultad de Matematicas, Universidad Complutense/Madrid/Espagne (1 aut.); Computer Science Laboratory, SRI International, 333 Ravenswood Ave./Menlo Park, CA 94025/Etats-Unis (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2002; Vol. 285; No. 2; Pp. 155-185; Bibl. 72 ref.</SO>
<LA>Anglais</LA>
<EA>ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule-based processes. With the general goal to make precise a rewriting logic-based semantics of ELAN, this paper has three contributions: a presentation of the concepts of rules and strategies available in ELAN, an expression of rewrite rules with matching conditions in conditional rewriting logic, and finally an enrichment mechanism of a rewrite theory into a strategy theory in conditional rewriting logic.</EA>
<CC>001D02A02</CC>
<FD>Réécriture; Logique; Sémantique; Langage programmation; Théorie stratégie; Programmation basée règle; Système calcul; Système ELAN</FD>
<ED>Rewriting; Logic; Semantics; Programming language</ED>
<SD>Reescritura; Lógica; Semántica; Lenguaje programación</SD>
<LO>INIST-17243.354000104549090020</LO>
<ID>02-0529487</ID>
</server>
</inist>
</record>

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 000855 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000855 | 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:02-0529487
   |texte=   ELAN from a rewriting logic point of view
}}

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

ELAN from a rewriting logic point of view

ELAN from a rewriting logic point of view

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

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