On an interpretation of safe recursion in light affine logic
Identifieur interne :
000383 ( PascalFrancis/Curation );
précédent :
000382;
suivant :
000384
On an interpretation of safe recursion in light affine logic
Auteurs : A. S. Murawski [
Royaume-Uni] ;
C.-H. L. Ong [
Royaume-Uni]
Source :
-
Theoretical computer science [ 0304-3975 ] ; 2004.
RBID : Pascal:04-0318834
Descripteurs français
English descriptors
Abstract
We introduce a subalgebra BC- of Bellantoni and Cook's safe-recursion function algebra BC. Functions of the subalgebra have safe arguments that are non-contractible (i.e non-duplicable). We propose a definition of safe and normal variables in light affine logic (LAL), and show that BC- is the largest subalgebra that is interpretable in LAL, relative to that definition. Though BC- itself is not PF complete, there are extensions of it (by additional schemes for defining functions with safe arguments) that are, and are still interpretable in LAL and so preserve PF closure. We focus on one such which is BC- augmented by a definition-by-cases construct and a restricted form of definition-by-recursion scheme over safe arguments. As a corollary we obtain a new proof of the PF completeness of LAL.
| pA |
| A01 | 01 | 1 | | @0 0304-3975 |
|---|
| A02 | 01 | | | @0 TCSCDI |
|---|
| A03 | | 1 | | @0 Theor. comput. sci. |
|---|
| A05 | | | | @2 318 |
|---|
| A06 | | | | @2 1-2 |
|---|
| A08 | 01 | 1 | ENG | @1 On an interpretation of safe recursion in light affine logic |
|---|
| A09 | 01 | 1 | ENG | @1 Implicit computational complexity |
|---|
| A11 | 01 | 1 | | @1 MURAWSKI (A. S.) |
|---|
| A11 | 02 | 1 | | @1 ONG (C.-H. L.) |
|---|
| A12 | 01 | 1 | | @1 MARION (Jean-Yves) @9 ed. |
|---|
| A14 | 01 | | | @1 Oxford University Computing Laboratory (OUCL), Wolfson Building, Parks Road @2 Oxford OX1 3QD @3 GBR @Z 1 aut. @Z 2 aut. |
|---|
| A15 | 01 | | | @1 LORIA-INPL, Ecole Nationale Superieure des Mines de Nancy, BP 239 @2 Vandoeuvre-les-Nancy 54506 @3 FRA @Z 1 aut. |
|---|
| A20 | | | | @1 197-223 |
|---|
| A21 | | | | @1 2004 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A43 | 01 | | | @1 INIST @2 17243 @5 354000110408220100 |
|---|
| A44 | | | | @0 0000 @1 © 2004 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 10 ref. |
|---|
| A47 | 01 | 1 | | @0 04-0318834 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Theoretical computer science |
|---|
| A66 | 01 | | | @0 NLD |
|---|
| C01 | 01 | | ENG | @0 We introduce a subalgebra BC- of Bellantoni and Cook's safe-recursion function algebra BC. Functions of the subalgebra have safe arguments that are non-contractible (i.e non-duplicable). We propose a definition of safe and normal variables in light affine logic (LAL), and show that BC- is the largest subalgebra that is interpretable in LAL, relative to that definition. Though BC- itself is not PF complete, there are extensions of it (by additional schemes for defining functions with safe arguments) that are, and are still interpretable in LAL and so preserve PF closure. We focus on one such which is BC- augmented by a definition-by-cases construct and a restricted form of definition-by-recursion scheme over safe arguments. As a corollary we obtain a new proof of the PF completeness of LAL. |
|---|
| C02 | 01 | X | | @0 001A02A01B |
|---|
| C02 | 02 | X | | @0 001A02A01D |
|---|
| C02 | 03 | X | | @0 001D02A02 |
|---|
| C03 | 01 | X | FRE | @0 Logique @5 17 |
|---|
| C03 | 01 | X | ENG | @0 Logic @5 17 |
|---|
| C03 | 01 | X | SPA | @0 Lógica @5 17 |
|---|
| C03 | 02 | X | FRE | @0 Méthode récursive @5 18 |
|---|
| C03 | 02 | X | ENG | @0 Recursive method @5 18 |
|---|
| C03 | 02 | X | SPA | @0 Método recursivo @5 18 |
|---|
| C03 | 03 | X | FRE | @0 Complétude @5 20 |
|---|
| C03 | 03 | X | ENG | @0 Completeness @5 20 |
|---|
| C03 | 03 | X | SPA | @0 Completitud @5 20 |
|---|
| C03 | 04 | X | FRE | @0 Informatique théorique @5 21 |
|---|
| C03 | 04 | X | ENG | @0 Computer theory @5 21 |
|---|
| C03 | 04 | X | SPA | @0 Informática teórica @5 21 |
|---|
| C03 | 05 | X | FRE | @0 46J10 @4 INC @5 70 |
|---|
| C03 | 06 | X | FRE | @0 Fermeture PF @4 CD @5 96 |
|---|
| C03 | 06 | X | ENG | @0 PF fermeture @4 CD @5 96 |
|---|
| C03 | 07 | X | FRE | @0 LAL @4 CD @5 97 |
|---|
| C03 | 07 | X | ENG | @0 LAL @4 CD @5 97 |
|---|
| N21 | | | | @1 187 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 ICC Workshop @3 Santa Barbara, CA USA @4 2000 |
|---|
|
|---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000658
Links to Exploration step
Pascal:04-0318834
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">On an interpretation of safe recursion in light affine logic</title>
<author><name sortKey="Murawski, A S" sort="Murawski, A S" uniqKey="Murawski A" first="A. S." last="Murawski">A. S. Murawski</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Oxford University Computing Laboratory (OUCL), Wolfson Building, Parks Road</s1>
<s2>Oxford OX1 3QD</s2>
<s3>GBR</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><country>Royaume-Uni</country>
</affiliation><author><name sortKey="Ong, C H L" sort="Ong, C H L" uniqKey="Ong C" first="C.-H. L." last="Ong">C.-H. L. Ong</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Oxford University Computing Laboratory (OUCL), Wolfson Building, Parks Road</s1>
<s2>Oxford OX1 3QD</s2>
<s3>GBR</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><country>Royaume-Uni</country>
</affiliation><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0318834</idno>
<date when="2004">2004</date>
<idno type="stanalyst">PASCAL 04-0318834 INIST</idno>
<idno type="RBID">Pascal:04-0318834</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000658</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000383</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">On an interpretation of safe recursion in light affine logic</title>
<author><name sortKey="Murawski, A S" sort="Murawski, A S" uniqKey="Murawski A" first="A. S." last="Murawski">A. S. Murawski</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Oxford University Computing Laboratory (OUCL), Wolfson Building, Parks Road</s1>
<s2>Oxford OX1 3QD</s2>
<s3>GBR</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><country>Royaume-Uni</country>
</affiliation><author><name sortKey="Ong, C H L" sort="Ong, C H L" uniqKey="Ong C" first="C.-H. L." last="Ong">C.-H. L. Ong</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Oxford University Computing Laboratory (OUCL), Wolfson Building, Parks Road</s1>
<s2>Oxford OX1 3QD</s2>
<s3>GBR</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><country>Royaume-Uni</country>
</affiliation><series><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date when="2004">2004</date>
</imprint><seriesStmt><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Completeness</term>
<term>Computer theory</term>
<term>LAL</term>
<term>Logic</term>
<term>PF fermeture</term>
<term>Recursive method</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Logique</term>
<term>Méthode récursive</term>
<term>Complétude</term>
<term>Informatique théorique</term>
<term>46J10</term>
<term>Fermeture PF</term>
<term>LAL</term>
</keywords><front><div type="abstract" xml:lang="en">We introduce a subalgebra BC- of Bellantoni and Cook's safe-recursion function algebra BC. Functions of the subalgebra have safe arguments that are non-contractible (i.e non-duplicable). We propose a definition of safe and normal variables in light affine logic (LAL), and show that BC- is the largest subalgebra that is interpretable in LAL, relative to that definition. Though BC- itself is not PF complete, there are extensions of it (by additional schemes for defining functions with safe arguments) that are, and are still interpretable in LAL and so preserve PF closure. We focus on one such which is BC- augmented by a definition-by-cases construct and a restricted form of definition-by-recursion scheme over safe arguments. As a corollary we obtain a new proof of the PF completeness of LAL.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0304-3975</s0>
</fA01><fA02 i1="01"><s0>TCSCDI</s0>
</fA02><fA03 i2="1"><s0>Theor. comput. sci.</s0>
</fA03><fA05><s2>318</s2>
</fA05><fA06><s2>1-2</s2>
</fA06><fA08 i1="01" i2="1" l="ENG"><s1>On an interpretation of safe recursion in light affine logic</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Implicit computational complexity</s1>
</fA09><fA11 i1="01" i2="1"><s1>MURAWSKI (A. S.)</s1>
</fA11><fA11 i1="02" i2="1"><s1>ONG (C.-H. L.)</s1>
</fA11><fA12 i1="01" i2="1"><s1>MARION (Jean-Yves)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Oxford University Computing Laboratory (OUCL), Wolfson Building, Parks Road</s1>
<s2>Oxford OX1 3QD</s2>
<s3>GBR</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14><fA15 i1="01"><s1>LORIA-INPL, Ecole Nationale Superieure des Mines de Nancy, BP 239</s1>
<s2>Vandoeuvre-les-Nancy 54506</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA15><fA20><s1>197-223</s1>
</fA20><fA21><s1>2004</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA43 i1="01"><s1>INIST</s1>
<s2>17243</s2>
<s5>354000110408220100</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>10 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>04-0318834</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Theoretical computer science</s0>
</fA64><fA66 i1="01"><s0>NLD</s0>
</fA66><fC01 i1="01" l="ENG"><s0>We introduce a subalgebra BC- of Bellantoni and Cook's safe-recursion function algebra BC. Functions of the subalgebra have safe arguments that are non-contractible (i.e non-duplicable). We propose a definition of safe and normal variables in light affine logic (LAL), and show that BC- is the largest subalgebra that is interpretable in LAL, relative to that definition. Though BC- itself is not PF complete, there are extensions of it (by additional schemes for defining functions with safe arguments) that are, and are still interpretable in LAL and so preserve PF closure. We focus on one such which is BC- augmented by a definition-by-cases construct and a restricted form of definition-by-recursion scheme over safe arguments. As a corollary we obtain a new proof of the PF completeness of LAL.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001A02A01B</s0>
</fC02><fC02 i1="02" i2="X"><s0>001A02A01D</s0>
</fC02><fC02 i1="03" i2="X"><s0>001D02A02</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Logique</s0>
<s5>17</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Logic</s0>
<s5>17</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Lógica</s0>
<s5>17</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Méthode récursive</s0>
<s5>18</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Recursive method</s0>
<s5>18</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Método recursivo</s0>
<s5>18</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Complétude</s0>
<s5>20</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Completeness</s0>
<s5>20</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Completitud</s0>
<s5>20</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>21</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>21</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>21</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>46J10</s0>
<s4>INC</s4>
<s5>70</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Fermeture PF</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>PF fermeture</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>LAL</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>LAL</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03><fN21><s1>187</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>ICC Workshop</s1>
<s3>Santa Barbara, CA USA</s3>
<s4>2000</s4>
</fA30>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000383 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000383 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Curation
|type= RBID
|clé= Pascal:04-0318834
|texte= On an interpretation of safe recursion in light affine logic
}}
| 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 |  |
