Quasi-interpretations and small space bounds
Identifieur interne :
000562 ( PascalFrancis/Corpus );
précédent :
000561;
suivant :
000563
Quasi-interpretations and small space bounds
Auteurs : Guillaume Bonfante ;
Jean-Yves Marion ;
Jean-Yves MoyenSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2005.
RBID : Pascal:05-0287093
Descripteurs français
English descriptors
Abstract
Quasi-interpretations are an useful tool to control resources usage of term rewriting systems, either time or space. They not only combine well with path orderings and provide characterizations of usual complexity classes but also give hints in order to optimize the program. Moreover, the existence of a quasi-interpretation is decidable. In this paper, we present some more characterizations of complexity classes using quasi-interpretations. We mainly focus on small spacebounded complexity classes. On one hand, by restricting quasi-interpretations to sums (that is allowing only affine quasi-interpretations), we obtain a characterization of LINSPACE. On the other hand, a strong tiering discipline on programs together with quasi-interpretations yield a characterization of LOG SPACE. Lastly, we give two new characterizations of PSPACE: in the first, the quasi-interpretation has to be strictly decreasing on each rule and in the second, some linearity constraints are added to the system but no assumption concerning the termination proof is made.
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 3467 |
|---|
| A08 | 01 | 1 | ENG | @1 Quasi-interpretations and small space bounds |
|---|
| A09 | 01 | 1 | ENG | @1 RTA 2005 : term rewriting and applications : Nara, 19-21 April 2005 |
|---|
| A11 | 01 | 1 | | @1 BONFANTE (Guillaume) |
|---|
| A11 | 02 | 1 | | @1 MARION (Jean-Yves) |
|---|
| A11 | 03 | 1 | | @1 MOYEN (Jean-Yves) |
|---|
| A12 | 01 | 1 | | @1 GIESL (Jürgen) @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. @Z 3 aut. |
|---|
| A14 | 02 | | | @1 École Nationale Supérieure des Mines de Nancy, INPL @3 FRA @Z 1 aut. @Z 2 aut. |
|---|
| A14 | 03 | | | @1 Université Henri Poincaré Nancy I @3 FRA @Z 3 aut. |
|---|
| A20 | | | | @1 150-164 |
|---|
| A21 | | | | @1 2005 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-25596-6 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000124473560110 |
|---|
| A44 | | | | @0 0000 @1 © 2005 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 29 ref. |
|---|
| A47 | 01 | 1 | | @0 05-0287093 |
|---|
| 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 Quasi-interpretations are an useful tool to control resources usage of term rewriting systems, either time or space. They not only combine well with path orderings and provide characterizations of usual complexity classes but also give hints in order to optimize the program. Moreover, the existence of a quasi-interpretation is decidable. In this paper, we present some more characterizations of complexity classes using quasi-interpretations. We mainly focus on small spacebounded complexity classes. On one hand, by restricting quasi-interpretations to sums (that is allowing only affine quasi-interpretations), we obtain a characterization of LINSPACE. On the other hand, a strong tiering discipline on programs together with quasi-interpretations yield a characterization of LOG SPACE. Lastly, we give two new characterizations of PSPACE: in the first, the quasi-interpretation has to be strictly decreasing on each rule and in the second, some linearity constraints are added to the system but no assumption concerning the termination proof is made. |
|---|
| C02 | 01 | X | | @0 001D02A02 |
|---|
| C03 | 01 | X | FRE | @0 Gestion ressources @5 06 |
|---|
| C03 | 01 | X | ENG | @0 Resource management @5 06 |
|---|
| C03 | 01 | X | SPA | @0 Gestión recursos @5 06 |
|---|
| C03 | 02 | 3 | FRE | @0 Système réécriture @5 07 |
|---|
| C03 | 02 | 3 | ENG | @0 Rewriting systems @5 07 |
|---|
| C03 | 03 | X | FRE | @0 Relation ordre @5 08 |
|---|
| C03 | 03 | X | ENG | @0 Ordering @5 08 |
|---|
| C03 | 03 | X | SPA | @0 Relación orden @5 08 |
|---|
| C03 | 04 | X | FRE | @0 Classe complexité @5 09 |
|---|
| C03 | 04 | X | ENG | @0 Complexity class @5 09 |
|---|
| C03 | 04 | X | SPA | @0 Clase complejidad @5 09 |
|---|
| C03 | 05 | X | FRE | @0 Décidabilité @5 10 |
|---|
| C03 | 05 | X | ENG | @0 Decidability @5 10 |
|---|
| C03 | 05 | X | SPA | @0 Decidibilidad @5 10 |
|---|
| C03 | 06 | X | FRE | @0 Linéarité @5 18 |
|---|
| C03 | 06 | X | ENG | @0 Linearity @5 18 |
|---|
| C03 | 06 | X | SPA | @0 Linearidad @5 18 |
|---|
| C03 | 07 | X | FRE | @0 Problème terminaison @5 23 |
|---|
| C03 | 07 | X | ENG | @0 Termination problem @5 23 |
|---|
| C03 | 07 | X | SPA | @0 Problema terminación @5 23 |
|---|
| C03 | 08 | X | FRE | @0 Réécriture @5 41 |
|---|
| C03 | 08 | X | ENG | @0 Rewriting @5 41 |
|---|
| C03 | 08 | X | SPA | @0 Reescritura @5 41 |
|---|
| C03 | 09 | X | FRE | @0 . @4 INC @5 82 |
|---|
| N21 | | | | @1 199 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 International conference on term rewriting and applications @2 16 @3 Nara JPN @4 2005-04-19 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 05-0287093 INIST |
|---|
| ET : | Quasi-interpretations and small space bounds |
|---|
| AU : | BONFANTE (Guillaume); MARION (Jean-Yves); MOYEN (Jean-Yves); GIESL (Jürgen) |
|---|
| AF : | Loria, Calligramme project, B.P. 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.); École Nationale Supérieure des Mines de Nancy, INPL/France (1 aut., 2 aut.); Université Henri Poincaré Nancy I/France (3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3467; Pp. 150-164; Bibl. 29 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | Quasi-interpretations are an useful tool to control resources usage of term rewriting systems, either time or space. They not only combine well with path orderings and provide characterizations of usual complexity classes but also give hints in order to optimize the program. Moreover, the existence of a quasi-interpretation is decidable. In this paper, we present some more characterizations of complexity classes using quasi-interpretations. We mainly focus on small spacebounded complexity classes. On one hand, by restricting quasi-interpretations to sums (that is allowing only affine quasi-interpretations), we obtain a characterization of LINSPACE. On the other hand, a strong tiering discipline on programs together with quasi-interpretations yield a characterization of LOG SPACE. Lastly, we give two new characterizations of PSPACE: in the first, the quasi-interpretation has to be strictly decreasing on each rule and in the second, some linearity constraints are added to the system but no assumption concerning the termination proof is made. |
|---|
| CC : | 001D02A02 |
|---|
| FD : | Gestion ressources; Système réécriture; Relation ordre; Classe complexité; Décidabilité; Linéarité; Problème terminaison; Réécriture; . |
|---|
| ED : | Resource management; Rewriting systems; Ordering; Complexity class; Decidability; Linearity; Termination problem; Rewriting |
|---|
| SD : | Gestión recursos; Relación orden; Clase complejidad; Decidibilidad; Linearidad; Problema terminación; Reescritura |
|---|
| LO : | INIST-16343.354000124473560110 |
|---|
| ID : | 05-0287093 |
|---|
Links to Exploration step
Pascal:05-0287093
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Quasi-interpretations and small space bounds</title>
<author><name sortKey="Bonfante, Guillaume" sort="Bonfante, Guillaume" uniqKey="Bonfante G" first="Guillaume" last="Bonfante">Guillaume Bonfante</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>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>École Nationale Supérieure des Mines de Nancy, INPL</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><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>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>École Nationale Supérieure des Mines de Nancy, INPL</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Moyen, Jean Yves" sort="Moyen, Jean Yves" uniqKey="Moyen J" first="Jean-Yves" last="Moyen">Jean-Yves 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>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="03"><s1>Université Henri Poincaré Nancy I</s1>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0287093</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0287093 INIST</idno>
<idno type="RBID">Pascal:05-0287093</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000562</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Quasi-interpretations and small space bounds</title>
<author><name sortKey="Bonfante, Guillaume" sort="Bonfante, Guillaume" uniqKey="Bonfante G" first="Guillaume" last="Bonfante">Guillaume Bonfante</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>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>École Nationale Supérieure des Mines de Nancy, INPL</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><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>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>École Nationale Supérieure des Mines de Nancy, INPL</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Moyen, Jean Yves" sort="Moyen, Jean Yves" uniqKey="Moyen J" first="Jean-Yves" last="Moyen">Jean-Yves 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>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="03"><s1>Université Henri Poincaré Nancy I</s1>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2005">2005</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Complexity class</term>
<term>Decidability</term>
<term>Linearity</term>
<term>Ordering</term>
<term>Resource management</term>
<term>Rewriting</term>
<term>Rewriting systems</term>
<term>Termination problem</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Gestion ressources</term>
<term>Système réécriture</term>
<term>Relation ordre</term>
<term>Classe complexité</term>
<term>Décidabilité</term>
<term>Linéarité</term>
<term>Problème terminaison</term>
<term>Réécriture</term>
<term>.</term>
</keywords><front><div type="abstract" xml:lang="en">Quasi-interpretations are an useful tool to control resources usage of term rewriting systems, either time or space. They not only combine well with path orderings and provide characterizations of usual complexity classes but also give hints in order to optimize the program. Moreover, the existence of a quasi-interpretation is decidable. In this paper, we present some more characterizations of complexity classes using quasi-interpretations. We mainly focus on small spacebounded complexity classes. On one hand, by restricting quasi-interpretations to sums (that is allowing only affine quasi-interpretations), we obtain a characterization of LINSPACE. On the other hand, a strong tiering discipline on programs together with quasi-interpretations yield a characterization of LOG SPACE. Lastly, we give two new characterizations of PSPACE: in the first, the quasi-interpretation has to be strictly decreasing on each rule and in the second, some linearity constraints are added to the system but no assumption concerning the termination proof is made.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>3467</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Quasi-interpretations and small space bounds</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>RTA 2005 : term rewriting and applications : Nara, 19-21 April 2005</s1>
</fA09><fA11 i1="01" i2="1"><s1>BONFANTE (Guillaume)</s1>
</fA11><fA11 i1="02" i2="1"><s1>MARION (Jean-Yves)</s1>
</fA11><fA11 i1="03" i2="1"><s1>MOYEN (Jean-Yves)</s1>
</fA11><fA12 i1="01" i2="1"><s1>GIESL (Jürgen)</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>
<sZ>3 aut.</sZ>
</fA14><fA14 i1="02"><s1>École Nationale Supérieure des Mines de Nancy, INPL</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14><fA14 i1="03"><s1>Université Henri Poincaré Nancy I</s1>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>150-164</s1>
</fA20><fA21><s1>2005</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-25596-6</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000124473560110</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2005 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>29 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>05-0287093</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><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>Quasi-interpretations are an useful tool to control resources usage of term rewriting systems, either time or space. They not only combine well with path orderings and provide characterizations of usual complexity classes but also give hints in order to optimize the program. Moreover, the existence of a quasi-interpretation is decidable. In this paper, we present some more characterizations of complexity classes using quasi-interpretations. We mainly focus on small spacebounded complexity classes. On one hand, by restricting quasi-interpretations to sums (that is allowing only affine quasi-interpretations), we obtain a characterization of LINSPACE. On the other hand, a strong tiering discipline on programs together with quasi-interpretations yield a characterization of LOG SPACE. Lastly, we give two new characterizations of PSPACE: in the first, the quasi-interpretation has to be strictly decreasing on each rule and in the second, some linearity constraints are added to the system but no assumption concerning the termination proof is made.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A02</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Gestion ressources</s0>
<s5>06</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Resource management</s0>
<s5>06</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Gestión recursos</s0>
<s5>06</s5>
</fC03><fC03 i1="02" i2="3" l="FRE"><s0>Système réécriture</s0>
<s5>07</s5>
</fC03><fC03 i1="02" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>07</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Relation ordre</s0>
<s5>08</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Ordering</s0>
<s5>08</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Relación orden</s0>
<s5>08</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Classe complexité</s0>
<s5>09</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Complexity class</s0>
<s5>09</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Clase complejidad</s0>
<s5>09</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Décidabilité</s0>
<s5>10</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Decidability</s0>
<s5>10</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Decidibilidad</s0>
<s5>10</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Linéarité</s0>
<s5>18</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Linearity</s0>
<s5>18</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Linearidad</s0>
<s5>18</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Problème terminaison</s0>
<s5>23</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Termination problem</s0>
<s5>23</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Problema terminación</s0>
<s5>23</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>41</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>41</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>41</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>.</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03><fN21><s1>199</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on term rewriting and applications</s1>
<s2>16</s2>
<s3>Nara JPN</s3>
<s4>2005-04-19</s4>
</fA30><server><NO>PASCAL 05-0287093 INIST</NO>
<ET>Quasi-interpretations and small space bounds</ET>
<AU>BONFANTE (Guillaume); MARION (Jean-Yves); MOYEN (Jean-Yves); GIESL (Jürgen)</AU>
<AF>Loria, Calligramme project, B.P. 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.); École Nationale Supérieure des Mines de Nancy, INPL/France (1 aut., 2 aut.); Université Henri Poincaré Nancy I/France (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3467; Pp. 150-164; Bibl. 29 ref.</SO>
<LA>Anglais</LA>
<EA>Quasi-interpretations are an useful tool to control resources usage of term rewriting systems, either time or space. They not only combine well with path orderings and provide characterizations of usual complexity classes but also give hints in order to optimize the program. Moreover, the existence of a quasi-interpretation is decidable. In this paper, we present some more characterizations of complexity classes using quasi-interpretations. We mainly focus on small spacebounded complexity classes. On one hand, by restricting quasi-interpretations to sums (that is allowing only affine quasi-interpretations), we obtain a characterization of LINSPACE. On the other hand, a strong tiering discipline on programs together with quasi-interpretations yield a characterization of LOG SPACE. Lastly, we give two new characterizations of PSPACE: in the first, the quasi-interpretation has to be strictly decreasing on each rule and in the second, some linearity constraints are added to the system but no assumption concerning the termination proof is made.</EA>
<CC>001D02A02</CC>
<FD>Gestion ressources; Système réécriture; Relation ordre; Classe complexité; Décidabilité; Linéarité; Problème terminaison; Réécriture; .</FD>
<ED>Resource management; Rewriting systems; Ordering; Complexity class; Decidability; Linearity; Termination problem; Rewriting</ED>
<SD>Gestión recursos; Relación orden; Clase complejidad; Decidibilidad; Linearidad; Problema terminación; Reescritura</SD>
<LO>INIST-16343.354000124473560110</LO>
<ID>05-0287093</ID>
</server>
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 000562 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000562 | 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:05-0287093
|texte= Quasi-interpretations and small space bounds
}}
| 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 |  |
