InforLorV4, PascalFrancis, Corpus, bibRecord, 000D24

Efficient second-order matching

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

Efficient second-order matching

Auteurs : R. Curien ; Z. Qian ; H. Shi

Source :

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

RBID : Pascal:96-0480340

Descripteurs français

Pascal (Inist)
- Transformation programme, Preuve programme.

English descriptors

KwdEn :
- Program proof, Program transformation.

Abstract

The standard second-order matching algorithm by Huet may be expansive in matching a flexible-rigid pair. On one hand, many fresh free variables may need to be introduced ; on the other hand, attempts are made to match the heading free variable on the flexible side with every "top layer" on the rigid side and every argument of the heading free variable with every subterm covered by the "top layer". We propose a new second-order matching algorithm, which introduces no fresh free variables and just considers some selected "top layers", arguments of the heading free variable and subterms covered by the corresponding "top layers". A first implementation shows that the new algorithm is more efficient both in time and space than the standard one for a great number of matching problems.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1103`
A08	`01`	`1`	`ENG`	`@1 Efficient second-order matching`
A09	`01`	`1`	`ENG`	`@1 RTA-96 : rewriting techniques and applications : New Brunswick NJ, July 27-30, 1996`
A11	`01`	`1`		`@1 CURIEN (R.)`
A11	`02`	`1`		`@1 QIAN (Z.)`
A11	`03`	`1`		`@1 SHI (H.)`
A12	`01`	`1`		`@1 GANZINGER (Harald) @9 ed.`
A14	`01`			`@1 CRIN-CNRS & INRIA-Lorraine, 615, rue du jardin botanique, BP 101 @2 54602 Vandoeuvre-les-Nancy @3 FRA @Z 1 aut.`
A20				`@1 317-331`
A21				`@1 1996`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 16343 @5 354000060633830240`
A44				`@0 0000 @1 © 1996 INIST-CNRS. All rights reserved.`
A45				`@0 19 ref.`
A47	`01`	`1`		`@0 96-0480340`
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 standard second-order matching algorithm by Huet may be expansive in matching a flexible-rigid pair. On one hand, many fresh free variables may need to be introduced ; on the other hand, attempts are made to match the heading free variable on the flexible side with every "top layer" on the rigid side and every argument of the heading free variable with every subterm covered by the "top layer". We propose a new second-order matching algorithm, which introduces no fresh free variables and just considers some selected "top layers", arguments of the heading free variable and subterms covered by the corresponding "top layers". A first implementation shows that the new algorithm is more efficient both in time and space than the standard one for a great number of matching problems.
C02	`01`	`X`		`@0 001D02A05`
C02	`02`	`X`		`@0 001D02B09`
C03	`01`	`X`	`FRE`	`@0 Transformation programme @5 01`
C03	`01`	`X`	`ENG`	`@0 Program transformation @5 01`
C03	`01`	`X`	`SPA`	`@0 Transformación programa @5 01`
C03	`02`	`X`	`FRE`	`@0 Preuve programme @5 02`
C03	`02`	`X`	`ENG`	`@0 Program proof @5 02`
C03	`02`	`X`	`SPA`	`@0 Prueba programa @5 02`
N21				`@1 330`

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-0480340 INIST
ET :	Efficient second-order matching
AU :	CURIEN (R.); QIAN (Z.); SHI (H.); GANZINGER (Harald)
AF :	CRIN-CNRS & INRIA-Lorraine, 615, rue du jardin botanique, BP 101/54602 Vandoeuvre-les-Nancy/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. 317-331; Bibl. 19 ref.
LA :	Anglais
EA :	The standard second-order matching algorithm by Huet may be expansive in matching a flexible-rigid pair. On one hand, many fresh free variables may need to be introduced ; on the other hand, attempts are made to match the heading free variable on the flexible side with every "top layer" on the rigid side and every argument of the heading free variable with every subterm covered by the "top layer". We propose a new second-order matching algorithm, which introduces no fresh free variables and just considers some selected "top layers", arguments of the heading free variable and subterms covered by the corresponding "top layers". A first implementation shows that the new algorithm is more efficient both in time and space than the standard one for a great number of matching problems.
CC :	001D02A05; 001D02B09
FD :	Transformation programme; Preuve programme
ED :	Program transformation; Program proof
SD :	Transformación programa; Prueba programa
LO :	INIST-16343.354000060633830240
ID :	96-0480340

Links to Exploration step

Pascal:96-0480340

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Efficient second-order matching</title>
<author><name sortKey="Curien, R" sort="Curien, R" uniqKey="Curien R" first="R." last="Curien">R. Curien</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN-CNRS & INRIA-Lorraine, 615, rue du jardin botanique, BP 101</s1>
<s2>54602 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Qian, Z" sort="Qian, Z" uniqKey="Qian Z" first="Z." last="Qian">Z. Qian</name>
</author>
<author><name sortKey="Shi, H" sort="Shi, H" uniqKey="Shi H" first="H." last="Shi">H. Shi</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">96-0480340</idno>
<date when="1996">1996</date>
<idno type="stanalyst">PASCAL 96-0480340 INIST</idno>
<idno type="RBID">Pascal:96-0480340</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000D24</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Efficient second-order matching</title>
<author><name sortKey="Curien, R" sort="Curien, R" uniqKey="Curien R" first="R." last="Curien">R. Curien</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN-CNRS & INRIA-Lorraine, 615, rue du jardin botanique, BP 101</s1>
<s2>54602 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Qian, Z" sort="Qian, Z" uniqKey="Qian Z" first="Z." last="Qian">Z. Qian</name>
</author>
<author><name sortKey="Shi, H" sort="Shi, H" uniqKey="Shi H" first="H." last="Shi">H. Shi</name>
</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>Program proof</term>
<term>Program transformation</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Transformation programme</term>
<term>Preuve programme</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The standard second-order matching algorithm by Huet may be expansive in matching a flexible-rigid pair. On one hand, many fresh free variables may need to be introduced ; on the other hand, attempts are made to match the heading free variable on the flexible side with every "top layer" on the rigid side and every argument of the heading free variable with every subterm covered by the "top layer". We propose a new second-order matching algorithm, which introduces no fresh free variables and just considers some selected "top layers", arguments of the heading free variable and subterms covered by the corresponding "top layers". A first implementation shows that the new algorithm is more efficient both in time and space than the standard one for a great number of matching problems.</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>Efficient second-order matching</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>CURIEN (R.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>QIAN (Z.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>SHI (H.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>GANZINGER (Harald)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>CRIN-CNRS & INRIA-Lorraine, 615, rue du jardin botanique, BP 101</s1>
<s2>54602 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA20><s1>317-331</s1>
</fA20>
<fA21><s1>1996</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000060633830240</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1996 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>19 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>96-0480340</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 standard second-order matching algorithm by Huet may be expansive in matching a flexible-rigid pair. On one hand, many fresh free variables may need to be introduced ; on the other hand, attempts are made to match the heading free variable on the flexible side with every "top layer" on the rigid side and every argument of the heading free variable with every subterm covered by the "top layer". We propose a new second-order matching algorithm, which introduces no fresh free variables and just considers some selected "top layers", arguments of the heading free variable and subterms covered by the corresponding "top layers". A first implementation shows that the new algorithm is more efficient both in time and space than the standard one for a great number of matching problems.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02B09</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Transformation programme</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Program transformation</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Transformación programa</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Preuve programme</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Program proof</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Prueba programa</s0>
<s5>02</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-0480340 INIST</NO>
<ET>Efficient second-order matching</ET>
<AU>CURIEN (R.); QIAN (Z.); SHI (H.); GANZINGER (Harald)</AU>
<AF>CRIN-CNRS & INRIA-Lorraine, 615, rue du jardin botanique, BP 101/54602 Vandoeuvre-les-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. 1996; Vol. 1103; Pp. 317-331; Bibl. 19 ref.</SO>
<LA>Anglais</LA>
<EA>The standard second-order matching algorithm by Huet may be expansive in matching a flexible-rigid pair. On one hand, many fresh free variables may need to be introduced ; on the other hand, attempts are made to match the heading free variable on the flexible side with every "top layer" on the rigid side and every argument of the heading free variable with every subterm covered by the "top layer". We propose a new second-order matching algorithm, which introduces no fresh free variables and just considers some selected "top layers", arguments of the heading free variable and subterms covered by the corresponding "top layers". A first implementation shows that the new algorithm is more efficient both in time and space than the standard one for a great number of matching problems.</EA>
<CC>001D02A05; 001D02B09</CC>
<FD>Transformation programme; Preuve programme</FD>
<ED>Program transformation; Program proof</ED>
<SD>Transformación programa; Prueba programa</SD>
<LO>INIST-16343.354000060633830240</LO>
<ID>96-0480340</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 000D24 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000D24 | 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-0480340
   |texte=   Efficient second-order 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

Efficient second-order matching

Efficient second-order 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