InforLorV4, PascalFrancis, Corpus, bibRecord, 000951

Matching with free function symbols : A simple extension of matching?

Identifieur interne : 000951 ( PascalFrancis/Corpus ); précédent : 000950; suivant : 000952

Matching with free function symbols : A simple extension of matching?

Auteurs : Christophe Ringeissen

Source :

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

RBID : Pascal:01-0325403

Descripteurs français

Pascal (Inist)
- Système réécriture, Démonstration théorème, Langage programmation, Base connaissance, Théorie équationnelle, Théorème existence, Décidabilité, Concordance forme, Langage déclaratif.

English descriptors

KwdEn :
- Decidability, Declarative language, Equational theory, Existence theorem, Knowledge base, Pattern matching, Programming language, Rewriting systems, Theorem proving.

Abstract

Matching is a solving process which is crucial in declarative (rule-based) programming languages. In order to apply rules, one has to match the left-hand side of a rule with the term to be rewritten. In several declarative programming languages, programs involve operators that may also satisfy some structural axioms. Therefore, their evaluation mechanism must implement powerful matching algorithms working modulo equational theories. In this paper, we show the existence of an equational theory where matching is decidable (resp. finitary) but matching in presence of additional (free) operators is undecidable (resp. infinitary). The interest of this result is to easily prove the existence of a frontier between matching and matching with free operators.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2051`
A08	`01`	`1`	`ENG`	`@1 Matching with free function symbols : A simple extension of matching?`
A09	`01`	`1`	`ENG`	`@1 RTA 2001 : rewriting techniques and applications : Utrecht, 22-24 May 2001`
A11	`01`	`1`		`@1 RINGEISSEN (Christophe)`
A12	`01`	`1`		`@1 MIDDELDORP (Aart) @9 ed.`
A14	`01`			`@1 LORIA - INRIA, 615, rue du Jardin Botanique, BP 101 @2 54602 Villers-lès-Nancy @3 FRA @Z 1 aut.`
A20				`@1 276-290`
A21				`@1 2001`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-42117-3`
A43	`01`			`@1 INIST @2 16343 @5 354000092401600190`
A44				`@0 0000 @1 © 2001 INIST-CNRS. All rights reserved.`
A45				`@0 14 ref.`
A47	`01`	`1`		`@0 01-0325403`
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 Matching is a solving process which is crucial in declarative (rule-based) programming languages. In order to apply rules, one has to match the left-hand side of a rule with the term to be rewritten. In several declarative programming languages, programs involve operators that may also satisfy some structural axioms. Therefore, their evaluation mechanism must implement powerful matching algorithms working modulo equational theories. In this paper, we show the existence of an equational theory where matching is decidable (resp. finitary) but matching in presence of additional (free) operators is undecidable (resp. infinitary). The interest of this result is to easily prove the existence of a frontier between matching and matching with free operators.
C02	`01`	`X`		`@0 001A02A01F`
C02	`02`	`X`		`@0 001D02A02`
C03	`01`	`3`	`FRE`	`@0 Système réécriture @5 03`
C03	`01`	`3`	`ENG`	`@0 Rewriting systems @5 03`
C03	`02`	`X`	`FRE`	`@0 Démonstration théorème @5 04`
C03	`02`	`X`	`ENG`	`@0 Theorem proving @5 04`
C03	`02`	`X`	`SPA`	`@0 Demostración teorema @5 04`
C03	`03`	`X`	`FRE`	`@0 Langage programmation @5 06`
C03	`03`	`X`	`ENG`	`@0 Programming language @5 06`
C03	`03`	`X`	`SPA`	`@0 Lenguaje programación @5 06`
C03	`04`	`X`	`FRE`	`@0 Base connaissance @5 07`
C03	`04`	`X`	`ENG`	`@0 Knowledge base @5 07`
C03	`04`	`X`	`SPA`	`@0 Base conocimiento @5 07`
C03	`05`	`X`	`FRE`	`@0 Théorie équationnelle @5 10`
C03	`05`	`X`	`ENG`	`@0 Equational theory @5 10`
C03	`05`	`X`	`SPA`	`@0 Teoría ecuaciónal @5 10`
C03	`06`	`X`	`FRE`	`@0 Théorème existence @5 11`
C03	`06`	`X`	`ENG`	`@0 Existence theorem @5 11`
C03	`06`	`X`	`SPA`	`@0 Teorema existencia @5 11`
C03	`07`	`X`	`FRE`	`@0 Décidabilité @5 12`
C03	`07`	`X`	`ENG`	`@0 Decidability @5 12`
C03	`07`	`X`	`SPA`	`@0 Decidibilidad @5 12`
C03	`08`	`X`	`FRE`	`@0 Concordance forme @5 14`
C03	`08`	`X`	`ENG`	`@0 Pattern matching @5 14`
C03	`09`	`X`	`FRE`	`@0 Langage déclaratif @4 CD @5 96`
C03	`09`	`X`	`ENG`	`@0 Declarative language @4 CD @5 96`
N21				`@1 225`

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-0325403 INIST
ET :	Matching with free function symbols : A simple extension of matching?
AU :	RINGEISSEN (Christophe); MIDDELDORP (Aart)
AF :	LORIA - INRIA, 615, rue du Jardin Botanique, BP 101/54602 Villers-lès-Nancy/France (1 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. 276-290; Bibl. 14 ref.
LA :	Anglais
EA :	Matching is a solving process which is crucial in declarative (rule-based) programming languages. In order to apply rules, one has to match the left-hand side of a rule with the term to be rewritten. In several declarative programming languages, programs involve operators that may also satisfy some structural axioms. Therefore, their evaluation mechanism must implement powerful matching algorithms working modulo equational theories. In this paper, we show the existence of an equational theory where matching is decidable (resp. finitary) but matching in presence of additional (free) operators is undecidable (resp. infinitary). The interest of this result is to easily prove the existence of a frontier between matching and matching with free operators.
CC :	001A02A01F; 001D02A02
FD :	Système réécriture; Démonstration théorème; Langage programmation; Base connaissance; Théorie équationnelle; Théorème existence; Décidabilité; Concordance forme; Langage déclaratif
ED :	Rewriting systems; Theorem proving; Programming language; Knowledge base; Equational theory; Existence theorem; Decidability; Pattern matching; Declarative language
SD :	Demostración teorema; Lenguaje programación; Base conocimiento; Teoría ecuaciónal; Teorema existencia; Decidibilidad
LO :	INIST-16343.354000092401600190
ID :	01-0325403

Links to Exploration step

Pascal:01-0325403

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Matching with free function symbols : A simple extension of matching?</title>
<author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - INRIA, 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>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0325403</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 01-0325403 INIST</idno>
<idno type="RBID">Pascal:01-0325403</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000951</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Matching with free function symbols : A simple extension of matching?</title>
<author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - INRIA, 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>
</author>
</analytic>
<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>
</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>Decidability</term>
<term>Declarative language</term>
<term>Equational theory</term>
<term>Existence theorem</term>
<term>Knowledge base</term>
<term>Pattern matching</term>
<term>Programming language</term>
<term>Rewriting systems</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>Langage programmation</term>
<term>Base connaissance</term>
<term>Théorie équationnelle</term>
<term>Théorème existence</term>
<term>Décidabilité</term>
<term>Concordance forme</term>
<term>Langage déclaratif</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Matching is a solving process which is crucial in declarative (rule-based) programming languages. In order to apply rules, one has to match the left-hand side of a rule with the term to be rewritten. In several declarative programming languages, programs involve operators that may also satisfy some structural axioms. Therefore, their evaluation mechanism must implement powerful matching algorithms working modulo equational theories. In this paper, we show the existence of an equational theory where matching is decidable (resp. finitary) but matching in presence of additional (free) operators is undecidable (resp. infinitary). The interest of this result is to easily prove the existence of a frontier between matching and matching with free operators.</div>
</front>
</TEI>
<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 with free function symbols : A simple extension of matching?</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>RINGEISSEN (Christophe)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>MIDDELDORP (Aart)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA - INRIA, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA20><s1>276-290</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>354000092401600190</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>14 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>01-0325403</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>
<fC01 i1="01" l="ENG"><s0>Matching is a solving process which is crucial in declarative (rule-based) programming languages. In order to apply rules, one has to match the left-hand side of a rule with the term to be rewritten. In several declarative programming languages, programs involve operators that may also satisfy some structural axioms. Therefore, their evaluation mechanism must implement powerful matching algorithms working modulo equational theories. In this paper, we show the existence of an equational theory where matching is decidable (resp. finitary) but matching in presence of additional (free) operators is undecidable (resp. infinitary). The interest of this result is to easily prove the existence of a frontier between matching and matching with free operators.</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>03</s5>
</fC03>
<fC03 i1="01" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>03</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Démonstration théorème</s0>
<s5>04</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Theorem proving</s0>
<s5>04</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Demostración teorema</s0>
<s5>04</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Langage programmation</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Programming language</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Lenguaje programación</s0>
<s5>06</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Base connaissance</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Knowledge base</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Base conocimiento</s0>
<s5>07</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Théorie équationnelle</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Equational theory</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Teoría ecuaciónal</s0>
<s5>10</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Théorème existence</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Existence theorem</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Teorema existencia</s0>
<s5>11</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Décidabilité</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Decidability</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Decidibilidad</s0>
<s5>12</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Concordance forme</s0>
<s5>14</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Pattern matching</s0>
<s5>14</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Langage déclaratif</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Declarative language</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>225</s1>
</fN21>
</pA>
<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>
</pR>
</standard>
<server><NO>PASCAL 01-0325403 INIST</NO>
<ET>Matching with free function symbols : A simple extension of matching?</ET>
<AU>RINGEISSEN (Christophe); MIDDELDORP (Aart)</AU>
<AF>LORIA - INRIA, 615, rue du Jardin Botanique, BP 101/54602 Villers-lès-Nancy/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. 2001; Vol. 2051; Pp. 276-290; Bibl. 14 ref.</SO>
<LA>Anglais</LA>
<EA>Matching is a solving process which is crucial in declarative (rule-based) programming languages. In order to apply rules, one has to match the left-hand side of a rule with the term to be rewritten. In several declarative programming languages, programs involve operators that may also satisfy some structural axioms. Therefore, their evaluation mechanism must implement powerful matching algorithms working modulo equational theories. In this paper, we show the existence of an equational theory where matching is decidable (resp. finitary) but matching in presence of additional (free) operators is undecidable (resp. infinitary). The interest of this result is to easily prove the existence of a frontier between matching and matching with free operators.</EA>
<CC>001A02A01F; 001D02A02</CC>
<FD>Système réécriture; Démonstration théorème; Langage programmation; Base connaissance; Théorie équationnelle; Théorème existence; Décidabilité; Concordance forme; Langage déclaratif</FD>
<ED>Rewriting systems; Theorem proving; Programming language; Knowledge base; Equational theory; Existence theorem; Decidability; Pattern matching; Declarative language</ED>
<SD>Demostración teorema; Lenguaje programación; Base conocimiento; Teoría ecuaciónal; Teorema existencia; Decidibilidad</SD>
<LO>INIST-16343.354000092401600190</LO>
<ID>01-0325403</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 000951 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000951 | 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-0325403
   |texte=   Matching with free function symbols : A simple extension of matching?
}}

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

Matching with free function symbols : A simple extension of matching?

Matching with free function symbols : A simple extension of matching?

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