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.

A compiler for nondeterministic term rewriting systems

Identifieur interne : 000D22 ( PascalFrancis/Corpus ); précédent : 000D21; suivant : 000D23

A compiler for nondeterministic term rewriting systems

Auteurs : M. Vittek

Source :

RBID : Pascal:96-0480388

Descripteurs français

English descriptors

Abstract

This work presents the design and the implementation of a compiler for the ELAN specification language. The language is based on rewriting logic and permits, in particular, the combination of computations where deterministic evaluations are mixed with a nondeterministic search for solutions. The implementation combines compilation methods of term rewriting systems, functional and logic programming languages, and some new original techniques producing, in summary, an efficient code in an imperative language. The efficiency of the compiler is demonstrated on experimental results.

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 1103
A08 01  1  ENG  @1 A compiler for nondeterministic term rewriting systems
A09 01  1  ENG  @1 RTA-96 : rewriting techniques and applications : New Brunswick NJ, July 27-30, 1996
A11 01  1    @1 VITTEK (M.)
A12 01  1    @1 GANZINGER (Harald) @9 ed.
A14 01      @1 INRIA-Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101 @2 54602 Villers-lès-Nancy @3 FRA @Z 1 aut.
A14 02      @1 ILOG, 9, rue de Verdun, BP 85 @2 94253 Gentilly @3 FRA @Z 1 aut.
A20       @1 154-168
A21       @1 1996
A23 01      @0 ENG
A43 01      @1 INIST @2 16343 @5 354000060633830120
A44       @0 0000 @1 © 1996 INIST-CNRS. All rights reserved.
A45       @0 1 p.
A47 01  1    @0 96-0480388
A60       @1 P @2 C
A61       @0 A
A64 01  1    @0 Lecture notes in computer science
A66 01      @0 DEU
A66 02      @0 USA
C01 01    ENG  @0 This work presents the design and the implementation of a compiler for the ELAN specification language. The language is based on rewriting logic and permits, in particular, the combination of computations where deterministic evaluations are mixed with a nondeterministic search for solutions. The implementation combines compilation methods of term rewriting systems, functional and logic programming languages, and some new original techniques producing, in summary, an efficient code in an imperative language. The efficiency of the compiler is demonstrated on experimental results.
C02 01  X    @0 001D02B09
C02 02  X    @0 001D02B02
C02 03  X    @0 001D02C02
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 Non déterminisme @5 02
C03 02  X  ENG  @0 Non determinism @5 02
C03 02  X  SPA  @0 No determinismo @5 02
C03 03  X  FRE  @0 Langage spécification @5 03
C03 03  X  ENG  @0 Specification language @5 03
C03 03  X  SPA  @0 Lenguaje especificación @5 03
C03 04  X  FRE  @0 Programmation logique @5 04
C03 04  X  ENG  @0 Logical programming @5 04
C03 04  X  SPA  @0 Programación lógica @5 04
C03 05  X  FRE  @0 Implémentation @5 05
C03 05  X  ENG  @0 Implementation @5 05
C03 05  X  SPA  @0 Ejecución @5 05
C03 06  X  FRE  @0 Compilateur @5 06
C03 06  X  ENG  @0 Compiler @5 06
C03 06  X  SPA  @0 Compilador @5 06
N21       @1 330
pR  
A30 01  1  ENG  @1 Rewriting techniques and applications. International conference @2 7 @3 New Brunswick NJ USA @4 1996-07-27

Format Inist (serveur)

NO : PASCAL 96-0480388 INIST
ET : A compiler for nondeterministic term rewriting systems
AU : VITTEK (M.); GANZINGER (Harald)
AF : INRIA-Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101/54602 Villers-lès-Nancy/France (1 aut.); ILOG, 9, rue de Verdun, BP 85/94253 Gentilly/France (1 aut.)
DT : Publication en série; Congrès; Niveau analytique
SO : Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1103; Pp. 154-168; Bibl. 1 p.
LA : Anglais
EA : This work presents the design and the implementation of a compiler for the ELAN specification language. The language is based on rewriting logic and permits, in particular, the combination of computations where deterministic evaluations are mixed with a nondeterministic search for solutions. The implementation combines compilation methods of term rewriting systems, functional and logic programming languages, and some new original techniques producing, in summary, an efficient code in an imperative language. The efficiency of the compiler is demonstrated on experimental results.
CC : 001D02B09; 001D02B02; 001D02C02
FD : Réécriture; Non déterminisme; Langage spécification; Programmation logique; Implémentation; Compilateur
ED : Rewriting; Non determinism; Specification language; Logical programming; Implementation; Compiler
SD : Reescritura; No determinismo; Lenguaje especificación; Programación lógica; Ejecución; Compilador
LO : INIST-16343.354000060633830120
ID : 96-0480388

Links to Exploration step

Pascal:96-0480388

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">A compiler for nondeterministic term rewriting systems</title>
<author>
<name sortKey="Vittek, M" sort="Vittek, M" uniqKey="Vittek M" first="M." last="Vittek">M. Vittek</name>
<affiliation>
<inist:fA14 i1="01">
<s1>INRIA-Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="02">
<s1>ILOG, 9, rue de Verdun, BP 85</s1>
<s2>94253 Gentilly</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">96-0480388</idno>
<date when="1996">1996</date>
<idno type="stanalyst">PASCAL 96-0480388 INIST</idno>
<idno type="RBID">Pascal:96-0480388</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000D22</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">A compiler for nondeterministic term rewriting systems</title>
<author>
<name sortKey="Vittek, M" sort="Vittek, M" uniqKey="Vittek M" first="M." last="Vittek">M. Vittek</name>
<affiliation>
<inist:fA14 i1="01">
<s1>INRIA-Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
<affiliation>
<inist:fA14 i1="02">
<s1>ILOG, 9, rue de Verdun, BP 85</s1>
<s2>94253 Gentilly</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series>
<title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint>
<date when="1996">1996</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Compiler</term>
<term>Implementation</term>
<term>Logical programming</term>
<term>Non determinism</term>
<term>Rewriting</term>
<term>Specification language</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Réécriture</term>
<term>Non déterminisme</term>
<term>Langage spécification</term>
<term>Programmation logique</term>
<term>Implémentation</term>
<term>Compilateur</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">This work presents the design and the implementation of a compiler for the ELAN specification language. The language is based on rewriting logic and permits, in particular, the combination of computations where deterministic evaluations are mixed with a nondeterministic search for solutions. The implementation combines compilation methods of term rewriting systems, functional and logic programming languages, and some new original techniques producing, in summary, an efficient code in an imperative language. The efficiency of the compiler is demonstrated on experimental results.</div>
</front>
</TEI>
<inist>
<standard h6="B">
<pA>
<fA01 i1="01" i2="1">
<s0>0302-9743</s0>
</fA01>
<fA05>
<s2>1103</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG">
<s1>A compiler for nondeterministic term rewriting systems</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG">
<s1>RTA-96 : rewriting techniques and applications : New Brunswick NJ, July 27-30, 1996</s1>
</fA09>
<fA11 i1="01" i2="1">
<s1>VITTEK (M.)</s1>
</fA11>
<fA12 i1="01" i2="1">
<s1>GANZINGER (Harald)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01">
<s1>INRIA-Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02">
<s1>ILOG, 9, rue de Verdun, BP 85</s1>
<s2>94253 Gentilly</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA20>
<s1>154-168</s1>
</fA20>
<fA21>
<s1>1996</s1>
</fA21>
<fA23 i1="01">
<s0>ENG</s0>
</fA23>
<fA43 i1="01">
<s1>INIST</s1>
<s2>16343</s2>
<s5>354000060633830120</s5>
</fA43>
<fA44>
<s0>0000</s0>
<s1>© 1996 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45>
<s0>1 p.</s0>
</fA45>
<fA47 i1="01" i2="1">
<s0>96-0480388</s0>
</fA47>
<fA60>
<s1>P</s1>
<s2>C</s2>
</fA60>
<fA61>
<s0>A</s0>
</fA61>
<fA64 i1="01" i2="1">
<s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01">
<s0>DEU</s0>
</fA66>
<fA66 i1="02">
<s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG">
<s0>This work presents the design and the implementation of a compiler for the ELAN specification language. The language is based on rewriting logic and permits, in particular, the combination of computations where deterministic evaluations are mixed with a nondeterministic search for solutions. The implementation combines compilation methods of term rewriting systems, functional and logic programming languages, and some new original techniques producing, in summary, an efficient code in an imperative language. The efficiency of the compiler is demonstrated on experimental results.</s0>
</fC01>
<fC02 i1="01" i2="X">
<s0>001D02B09</s0>
</fC02>
<fC02 i1="02" i2="X">
<s0>001D02B02</s0>
</fC02>
<fC02 i1="03" i2="X">
<s0>001D02C02</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>Non déterminisme</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG">
<s0>Non determinism</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA">
<s0>No determinismo</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE">
<s0>Langage spécification</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG">
<s0>Specification language</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA">
<s0>Lenguaje especificación</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE">
<s0>Programmation logique</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG">
<s0>Logical programming</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA">
<s0>Programación lógica</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE">
<s0>Implémentation</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG">
<s0>Implementation</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA">
<s0>Ejecución</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE">
<s0>Compilateur</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG">
<s0>Compiler</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA">
<s0>Compilador</s0>
<s5>06</s5>
</fC03>
<fN21>
<s1>330</s1>
</fN21>
</pA>
<pR>
<fA30 i1="01" i2="1" l="ENG">
<s1>Rewriting techniques and applications. International conference</s1>
<s2>7</s2>
<s3>New Brunswick NJ USA</s3>
<s4>1996-07-27</s4>
</fA30>
</pR>
</standard>
<server>
<NO>PASCAL 96-0480388 INIST</NO>
<ET>A compiler for nondeterministic term rewriting systems</ET>
<AU>VITTEK (M.); GANZINGER (Harald)</AU>
<AF>INRIA-Lorraine & CRIN, 615, rue du Jardin Botanique, BP 101/54602 Villers-lès-Nancy/France (1 aut.); ILOG, 9, rue de Verdun, BP 85/94253 Gentilly/France (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1103; Pp. 154-168; Bibl. 1 p.</SO>
<LA>Anglais</LA>
<EA>This work presents the design and the implementation of a compiler for the ELAN specification language. The language is based on rewriting logic and permits, in particular, the combination of computations where deterministic evaluations are mixed with a nondeterministic search for solutions. The implementation combines compilation methods of term rewriting systems, functional and logic programming languages, and some new original techniques producing, in summary, an efficient code in an imperative language. The efficiency of the compiler is demonstrated on experimental results.</EA>
<CC>001D02B09; 001D02B02; 001D02C02</CC>
<FD>Réécriture; Non déterminisme; Langage spécification; Programmation logique; Implémentation; Compilateur</FD>
<ED>Rewriting; Non determinism; Specification language; Logical programming; Implementation; Compiler</ED>
<SD>Reescritura; No determinismo; Lenguaje especificación; Programación lógica; Ejecución; Compilador</SD>
<LO>INIST-16343.354000060633830120</LO>
<ID>96-0480388</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 000D22 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000D22 | 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:96-0480388
   |texte=   A compiler for nondeterministic term rewriting systems
}}

Wicri

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