InforLorV4, PascalFrancis, Corpus, bibRecord, 000998

Efficient first order functional program interpreter with time bound certifications

Identifieur interne : 000998 ( PascalFrancis/Corpus ); précédent : 000997; suivant : 000999

Efficient first order functional program interpreter with time bound certifications

Auteurs : Jean-Yves Marion ; J.-Y. Moyen

Source :

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

RBID : Pascal:01-0016202

Descripteurs français

Pascal (Inist)
- Interpréteur, Programmation fonctionnelle, Ordre 1, Métalangage, Temps polynomial.

English descriptors

KwdEn :
- First order, Functional programming, Interpreter, Metalanguage, Polynomial time.

Abstract

We demonstrate that the class of functions computed by first order functional programs over lists which terminate by multiset path ordering and admit a polynomial quasi-interpretation, is exactly the class of function computable in polynomial time. The interest of this result lies on (i) the simplicity of the conditions on programs to certify their complexity, (ii) the fact that an important class of natural programs is captured, (iii) potential applications for program optimisation.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1955`
A08	`01`	`1`	`ENG`	`@1 Efficient first order functional program interpreter with time bound certifications`
A09	`01`	`1`	`ENG`	`@1 Logic for programming and automated reasoning : Saint Denis, 6-10 November 2000`
A11	`01`	`1`		`@1 MARION (Jean-Yves)`
A11	`02`	`1`		`@1 MOYEN (J.-Y.)`
A12	`01`	`1`		`@1 PARIGOT (Michel) @9 ed.`
A12	`02`	`1`		`@1 VORONKOV (Andrei) @9 ed.`
A14	`01`			`@1 Loria, Calligramme project, B.P. 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut.`
A20				`@1 25-42`
A21				`@1 2000`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-41285-9`
A43	`01`			`@1 INIST @2 16343 @5 354000090104310030`
A44				`@0 0000 @1 © 2001 INIST-CNRS. All rights reserved.`
A45				`@0 34 ref.`
A47	`01`	`1`		`@0 01-0016202`
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 We demonstrate that the class of functions computed by first order functional programs over lists which terminate by multiset path ordering and admit a polynomial quasi-interpretation, is exactly the class of function computable in polynomial time. The interest of this result lies on (i) the simplicity of the conditions on programs to certify their complexity, (ii) the fact that an important class of natural programs is captured, (iii) potential applications for program optimisation.`
C02	`01`	`X`		`@0 001D02C05`
C03	`01`	`X`	`FRE`	`@0 Interpréteur @5 01`
C03	`01`	`X`	`ENG`	`@0 Interpreter @5 01`
C03	`01`	`X`	`SPA`	`@0 Intérprete @5 01`
C03	`02`	`X`	`FRE`	`@0 Programmation fonctionnelle @5 02`
C03	`02`	`X`	`ENG`	`@0 Functional programming @5 02`
C03	`02`	`X`	`SPA`	`@0 Programación funcional @5 02`
C03	`03`	`X`	`FRE`	`@0 Ordre 1 @5 03`
C03	`03`	`X`	`ENG`	`@0 First order @5 03`
C03	`03`	`X`	`SPA`	`@0 Orden 1 @5 03`
C03	`04`	`X`	`FRE`	`@0 Métalangage @5 04`
C03	`04`	`X`	`ENG`	`@0 Metalanguage @5 04`
C03	`04`	`X`	`SPA`	`@0 Metalenguaje @5 04`
C03	`05`	`X`	`FRE`	`@0 Temps polynomial @5 05`
C03	`05`	`X`	`ENG`	`@0 Polynomial time @5 05`
C03	`05`	`X`	`SPA`	`@0 Tiempo polinomial @5 05`
N21				`@1 008`

A30	`01`	`1`	`ENG`	`@1 LPAR 2000 : logic for programming and automated reasoning. International conference @2 7 @3 Saint Denis FRA @4 2000-11-06`

Format Inist (serveur)

NO :	PASCAL 01-0016202 INIST
ET :	Efficient first order functional program interpreter with time bound certifications
AU :	MARION (Jean-Yves); MOYEN (J.-Y.); PARIGOT (Michel); VORONKOV (Andrei)
AF :	Loria, Calligramme project, B.P. 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. 2000; Vol. 1955; Pp. 25-42; Bibl. 34 ref.
LA :	Anglais
EA :	We demonstrate that the class of functions computed by first order functional programs over lists which terminate by multiset path ordering and admit a polynomial quasi-interpretation, is exactly the class of function computable in polynomial time. The interest of this result lies on (i) the simplicity of the conditions on programs to certify their complexity, (ii) the fact that an important class of natural programs is captured, (iii) potential applications for program optimisation.
CC :	001D02C05
FD :	Interpréteur; Programmation fonctionnelle; Ordre 1; Métalangage; Temps polynomial
ED :	Interpreter; Functional programming; First order; Metalanguage; Polynomial time
SD :	Intérprete; Programación funcional; Orden 1; Metalenguaje; Tiempo polinomial
LO :	INIST-16343.354000090104310030
ID :	01-0016202

Links to Exploration step

Pascal:01-0016202

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Efficient first order functional program interpreter with time bound certifications</title>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<affiliation><inist:fA14 i1="01"><s1>Loria, Calligramme project, B.P. 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="Moyen, J Y" sort="Moyen, J Y" uniqKey="Moyen J" first="J.-Y." last="Moyen">J.-Y. Moyen</name>
<affiliation><inist:fA14 i1="01"><s1>Loria, Calligramme project, B.P. 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">01-0016202</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 01-0016202 INIST</idno>
<idno type="RBID">Pascal:01-0016202</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000998</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Efficient first order functional program interpreter with time bound certifications</title>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<affiliation><inist:fA14 i1="01"><s1>Loria, Calligramme project, B.P. 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="Moyen, J Y" sort="Moyen, J Y" uniqKey="Moyen J" first="J.-Y." last="Moyen">J.-Y. Moyen</name>
<affiliation><inist:fA14 i1="01"><s1>Loria, Calligramme project, B.P. 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="2000">2000</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>First order</term>
<term>Functional programming</term>
<term>Interpreter</term>
<term>Metalanguage</term>
<term>Polynomial time</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Interpréteur</term>
<term>Programmation fonctionnelle</term>
<term>Ordre 1</term>
<term>Métalangage</term>
<term>Temps polynomial</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We demonstrate that the class of functions computed by first order functional programs over lists which terminate by multiset path ordering and admit a polynomial quasi-interpretation, is exactly the class of function computable in polynomial time. The interest of this result lies on (i) the simplicity of the conditions on programs to certify their complexity, (ii) the fact that an important class of natural programs is captured, (iii) potential applications for program optimisation.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1955</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Efficient first order functional program interpreter with time bound certifications</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Logic for programming and automated reasoning : Saint Denis, 6-10 November 2000</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>MARION (Jean-Yves)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>MOYEN (J.-Y.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>PARIGOT (Michel)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>VORONKOV (Andrei)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Loria, Calligramme project, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>25-42</s1>
</fA20>
<fA21><s1>2000</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-41285-9</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000090104310030</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>34 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>01-0016202</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>We demonstrate that the class of functions computed by first order functional programs over lists which terminate by multiset path ordering and admit a polynomial quasi-interpretation, is exactly the class of function computable in polynomial time. The interest of this result lies on (i) the simplicity of the conditions on programs to certify their complexity, (ii) the fact that an important class of natural programs is captured, (iii) potential applications for program optimisation.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Interpréteur</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Interpreter</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Intérprete</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Programmation fonctionnelle</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Functional programming</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Programación funcional</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Ordre 1</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>First order</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Orden 1</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Métalangage</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Metalanguage</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Metalenguaje</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Temps polynomial</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Polynomial time</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Tiempo polinomial</s0>
<s5>05</s5>
</fC03>
<fN21><s1>008</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>LPAR 2000 : logic for programming and automated reasoning. International conference</s1>
<s2>7</s2>
<s3>Saint Denis FRA</s3>
<s4>2000-11-06</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 01-0016202 INIST</NO>
<ET>Efficient first order functional program interpreter with time bound certifications</ET>
<AU>MARION (Jean-Yves); MOYEN (J.-Y.); PARIGOT (Michel); VORONKOV (Andrei)</AU>
<AF>Loria, Calligramme project, B.P. 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. 2000; Vol. 1955; Pp. 25-42; Bibl. 34 ref.</SO>
<LA>Anglais</LA>
<EA>We demonstrate that the class of functions computed by first order functional programs over lists which terminate by multiset path ordering and admit a polynomial quasi-interpretation, is exactly the class of function computable in polynomial time. The interest of this result lies on (i) the simplicity of the conditions on programs to certify their complexity, (ii) the fact that an important class of natural programs is captured, (iii) potential applications for program optimisation.</EA>
<CC>001D02C05</CC>
<FD>Interpréteur; Programmation fonctionnelle; Ordre 1; Métalangage; Temps polynomial</FD>
<ED>Interpreter; Functional programming; First order; Metalanguage; Polynomial time</ED>
<SD>Intérprete; Programación funcional; Orden 1; Metalenguaje; Tiempo polinomial</SD>
<LO>INIST-16343.354000090104310030</LO>
<ID>01-0016202</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 000998 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000998 | 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-0016202
   |texte=   Efficient first order functional program interpreter with time bound certifications
}}

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 first order functional program interpreter with time bound certifications

Efficient first order functional program interpreter with time bound certifications

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