InforLorV4, PascalFrancis, Corpus, bibRecord, 000A93

Non-deterministic computations in ELAN

Identifieur interne : 000A93 ( PascalFrancis/Corpus ); précédent : 000A92; suivant : 000A94

Non-deterministic computations in ELAN

Auteurs : H. Kirchner ; P.-E. Moreau

Source :

Lecture notes in computer science [ 0302-9743 ] ; 1999.

RBID : Pascal:99-0492295

Descripteurs français

Pascal (Inist)
- Informatique théorique, Programmation logique avec contrainte, Programmation fonctionnelle, Système réécriture, Spécification programme, Analyse programme.

English descriptors

KwdEn :
- Computer theory, Constraint logic programming, Functional programming, Program analysis, Program specification, Rewriting systems.

Abstract

The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for experimenting their combination. The ELAN language is based on rewriting logic and evaluation of labelled conditional rewrite rules. ELAN has two originalities with respect to several other algebraic languages, namely to handle non-deterministic computations and to provide a user-defined strategy language for controlling rule application. We focus in this paper on these two related aspects and explain how non-determinism is used in ELAN programs and handled in the ELAN compiler.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1589`
A08	`01`	`1`	`ENG`	`@1 Non-deterministic computations in ELAN`
A09	`01`	`1`	`ENG`	`@1 Recent trends in algebraic development techniques : Lisbon, 2-4 April 1998, selected papers`
A11	`01`	`1`		`@1 KIRCHNER (H.)`
A11	`02`	`1`		`@1 MOREAU (P.-E.)`
A12	`01`	`1`		`@1 FIADEIRO (José Luiz) @9 ed.`
A14	`01`			`@1 LORIA-CNRS & INRIA, BP 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut.`
A20				`@1 168-182`
A21				`@1 1999`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-66246-4`
A43	`01`			`@1 INIST @2 16343 @5 354000084571380120`
A44				`@0 0000 @1 © 1999 INIST-CNRS. All rights reserved.`
A45				`@0 1 p.3/4`
A47	`01`	`1`		`@0 99-0492295`
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 The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for experimenting their combination. The ELAN language is based on rewriting logic and evaluation of labelled conditional rewrite rules. ELAN has two originalities with respect to several other algebraic languages, namely to handle non-deterministic computations and to provide a user-defined strategy language for controlling rule application. We focus in this paper on these two related aspects and explain how non-determinism is used in ELAN programs and handled in the ELAN compiler.
C02	`01`	`X`		`@0 001D02A07`
C03	`01`	`X`	`FRE`	`@0 Informatique théorique @5 01`
C03	`01`	`X`	`ENG`	`@0 Computer theory @5 01`
C03	`01`	`X`	`SPA`	`@0 Informática teórica @5 01`
C03	`02`	`X`	`FRE`	`@0 Programmation logique avec contrainte @5 02`
C03	`02`	`X`	`ENG`	`@0 Constraint logic programming @5 02`
C03	`02`	`X`	`SPA`	`@0 Programación lógica con restricción @5 02`
C03	`03`	`X`	`FRE`	`@0 Programmation fonctionnelle @5 03`
C03	`03`	`X`	`ENG`	`@0 Functional programming @5 03`
C03	`03`	`X`	`SPA`	`@0 Programación funcional @5 03`
C03	`04`	`3`	`FRE`	`@0 Système réécriture @5 04`
C03	`04`	`3`	`ENG`	`@0 Rewriting systems @5 04`
C03	`05`	`X`	`FRE`	`@0 Spécification programme @5 05`
C03	`05`	`X`	`ENG`	`@0 Program specification @5 05`
C03	`05`	`X`	`SPA`	`@0 Especificación programa @5 05`
C03	`06`	`X`	`FRE`	`@0 Analyse programme @5 06`
C03	`06`	`X`	`ENG`	`@0 Program analysis @5 06`
C03	`06`	`X`	`SPA`	`@0 Análisis programa @5 06`
N21				`@1 312`

A30	`01`	`1`	`ENG`	`@1 WADT'98 : workshop on algebraic development techniques @2 13 @3 Lisbon PRT @4 1998-04-02`

Format Inist (serveur)

NO :	PASCAL 99-0492295 INIST
ET :	Non-deterministic computations in ELAN
AU :	KIRCHNER (H.); MOREAU (P.-E.); FIADEIRO (José Luiz)
AF :	LORIA-CNRS & INRIA, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1999; Vol. 1589; Pp. 168-182; Bibl. 1 p.3/4
LA :	Anglais
EA :	The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for experimenting their combination. The ELAN language is based on rewriting logic and evaluation of labelled conditional rewrite rules. ELAN has two originalities with respect to several other algebraic languages, namely to handle non-deterministic computations and to provide a user-defined strategy language for controlling rule application. We focus in this paper on these two related aspects and explain how non-determinism is used in ELAN programs and handled in the ELAN compiler.
CC :	001D02A07
FD :	Informatique théorique; Programmation logique avec contrainte; Programmation fonctionnelle; Système réécriture; Spécification programme; Analyse programme
ED :	Computer theory; Constraint logic programming; Functional programming; Rewriting systems; Program specification; Program analysis
SD :	Informática teórica; Programación lógica con restricción; Programación funcional; Especificación programa; Análisis programa
LO :	INIST-16343.354000084571380120
ID :	99-0492295

Links to Exploration step

Pascal:99-0492295

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Non-deterministic computations in ELAN</title>
<author><name sortKey="Kirchner, H" sort="Kirchner, H" uniqKey="Kirchner H" first="H." last="Kirchner">H. Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-CNRS & INRIA, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Moreau, P E" sort="Moreau, P E" uniqKey="Moreau P" first="P.-E." last="Moreau">P.-E. Moreau</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-CNRS & INRIA, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">99-0492295</idno>
<date when="1999">1999</date>
<idno type="stanalyst">PASCAL 99-0492295 INIST</idno>
<idno type="RBID">Pascal:99-0492295</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000A93</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Non-deterministic computations in ELAN</title>
<author><name sortKey="Kirchner, H" sort="Kirchner, H" uniqKey="Kirchner H" first="H." last="Kirchner">H. Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-CNRS & INRIA, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Moreau, P E" sort="Moreau, P E" uniqKey="Moreau P" first="P.-E." last="Moreau">P.-E. Moreau</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-CNRS & INRIA, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 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="1999">1999</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>Computer theory</term>
<term>Constraint logic programming</term>
<term>Functional programming</term>
<term>Program analysis</term>
<term>Program specification</term>
<term>Rewriting systems</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Programmation logique avec contrainte</term>
<term>Programmation fonctionnelle</term>
<term>Système réécriture</term>
<term>Spécification programme</term>
<term>Analyse programme</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for experimenting their combination. The ELAN language is based on rewriting logic and evaluation of labelled conditional rewrite rules. ELAN has two originalities with respect to several other algebraic languages, namely to handle non-deterministic computations and to provide a user-defined strategy language for controlling rule application. We focus in this paper on these two related aspects and explain how non-determinism is used in ELAN programs and handled in the ELAN compiler.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1589</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Non-deterministic computations in ELAN</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Recent trends in algebraic development techniques : Lisbon, 2-4 April 1998, selected papers</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>KIRCHNER (H.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>MOREAU (P.-E.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>FIADEIRO (José Luiz)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA-CNRS & INRIA, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>168-182</s1>
</fA20>
<fA21><s1>1999</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-66246-4</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000084571380120</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1999 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>1 p.3/4</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>99-0492295</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>The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for experimenting their combination. The ELAN language is based on rewriting logic and evaluation of labelled conditional rewrite rules. ELAN has two originalities with respect to several other algebraic languages, namely to handle non-deterministic computations and to provide a user-defined strategy language for controlling rule application. We focus in this paper on these two related aspects and explain how non-determinism is used in ELAN programs and handled in the ELAN compiler.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A07</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Programmation logique avec contrainte</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Constraint logic programming</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Programación lógica con restricción</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Programmation fonctionnelle</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Functional programming</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Programación funcional</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="3" l="FRE"><s0>Système réécriture</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Spécification programme</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Program specification</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Especificación programa</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Analyse programme</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Program analysis</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Análisis programa</s0>
<s5>06</s5>
</fC03>
<fN21><s1>312</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>WADT'98 : workshop on algebraic development techniques</s1>
<s2>13</s2>
<s3>Lisbon PRT</s3>
<s4>1998-04-02</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 99-0492295 INIST</NO>
<ET>Non-deterministic computations in ELAN</ET>
<AU>KIRCHNER (H.); MOREAU (P.-E.); FIADEIRO (José Luiz)</AU>
<AF>LORIA-CNRS & INRIA, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1999; Vol. 1589; Pp. 168-182; Bibl. 1 p.3/4</SO>
<LA>Anglais</LA>
<EA>The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for experimenting their combination. The ELAN language is based on rewriting logic and evaluation of labelled conditional rewrite rules. ELAN has two originalities with respect to several other algebraic languages, namely to handle non-deterministic computations and to provide a user-defined strategy language for controlling rule application. We focus in this paper on these two related aspects and explain how non-determinism is used in ELAN programs and handled in the ELAN compiler.</EA>
<CC>001D02A07</CC>
<FD>Informatique théorique; Programmation logique avec contrainte; Programmation fonctionnelle; Système réécriture; Spécification programme; Analyse programme</FD>
<ED>Computer theory; Constraint logic programming; Functional programming; Rewriting systems; Program specification; Program analysis</ED>
<SD>Informática teórica; Programación lógica con restricción; Programación funcional; Especificación programa; Análisis programa</SD>
<LO>INIST-16343.354000084571380120</LO>
<ID>99-0492295</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 000A93 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000A93 | 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:99-0492295
   |texte=   Non-deterministic computations in ELAN
}}

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

Non-deterministic computations in ELAN

Non-deterministic computations in ELAN

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