Modeling sharing and recursion for weak reduction strategies using explicit substitution
Identifieur interne : 002A41 ( Istex/Curation ); précédent : 002A40; suivant : 002A42Modeling sharing and recursion for weak reduction strategies using explicit substitution
Auteurs : Zine-El-Abidine Benaissa [France] ; Pierre Lescanne [France] ; Kristoffer H. Rose [Danemark]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We present the λσ w a -calculus, a formal synthesis of the concepts of sharing and explicit substitution for weak reduction. We show how λσ w a , can be used as a foundation of implementations of functional programming languages by modeling the essential ingredients of such implementations, namely weak reduction strategies, recursion, space leaks, recursive data structures, and parallel evaluation. We use λσ w a , to give a unified model of several computational aspects. First, we give a precise account of the major reduction strategies used in functional programming and the consequences of choosing λ-graph-reduction vs. environment-based evaluation. Second, we show how to add constructors and explicit recursion to give a precise account of recursive functions and data structures even with respect to space complexity. Third, we formalize the notion of space leaks in λσ w a and use this to define a space leak free calculus; this suggests optimisations for call-by-need reduction that prevent space leaking and enables us to prove that the “trimming” performed by the STG machine does not leak space. In summary we give a formal account of several implementation techniques used by state of the art implementations of functional programming languages.
Url:
DOI: 10.1007/3-540-61756-6_99
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002A78
Links to Exploration step
ISTEX:B4CA52C0FB46513B3B83B18F1F8CACF39E736720Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Modeling sharing and recursion for weak reduction strategies using explicit substitution</title><author><name sortKey="Benaissa, Zine El Abidine" sort="Benaissa, Zine El Abidine" uniqKey="Benaissa Z" first="Zine-El-Abidine" last="Benaissa">Zine-El-Abidine Benaissa</name><affiliation wicri:level="1"><mods:affiliation>INRIA-Lorraine & CRIN, Bâtiment LORIA, 615, rue du Jardin Botanique, BP 101, F-54602, Villers les Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>INRIA-Lorraine & CRIN, Bâtiment LORIA, 615, rue du Jardin Botanique, BP 101, F-54602, Villers les Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: benaissa@loria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Lescanne, Pierre" sort="Lescanne, Pierre" uniqKey="Lescanne P" first="Pierre" last="Lescanne">Pierre Lescanne</name><affiliation wicri:level="1"><mods:affiliation>INRIA-Lorraine & CRIN, Bâtiment LORIA, 615, rue du Jardin Botanique, BP 101, F-54602, Villers les Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>INRIA-Lorraine & CRIN, Bâtiment LORIA, 615, rue du Jardin Botanique, BP 101, F-54602, Villers les Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: lescanne@loria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Rose, Kristoffer H" sort="Rose, Kristoffer H" uniqKey="Rose K" first="Kristoffer H." last="Rose">Kristoffer H. Rose</name><affiliation wicri:level="1"><mods:affiliation>Basic Research in Computer Science (Centre of the Danish National Research Foundation), Dept. of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, Aarhus C, Denmark</mods:affiliation><country xml:lang="fr">Danemark</country><wicri:regionArea>Basic Research in Computer Science (Centre of the Danish National Research Foundation), Dept. of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, Aarhus C</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: krisrose@brics.dk</mods:affiliation><country wicri:rule="url">Danemark</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B4CA52C0FB46513B3B83B18F1F8CACF39E736720</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/3-540-61756-6_99</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-LKMHM4M3-6/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002A78</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002A78</idno><idno type="wicri:Area/Istex/Curation">002A41</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Modeling sharing and recursion for weak reduction strategies using explicit substitution</title><author><name sortKey="Benaissa, Zine El Abidine" sort="Benaissa, Zine El Abidine" uniqKey="Benaissa Z" first="Zine-El-Abidine" last="Benaissa">Zine-El-Abidine Benaissa</name><affiliation wicri:level="1"><mods:affiliation>INRIA-Lorraine & CRIN, Bâtiment LORIA, 615, rue du Jardin Botanique, BP 101, F-54602, Villers les Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>INRIA-Lorraine & CRIN, Bâtiment LORIA, 615, rue du Jardin Botanique, BP 101, F-54602, Villers les Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: benaissa@loria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Lescanne, Pierre" sort="Lescanne, Pierre" uniqKey="Lescanne P" first="Pierre" last="Lescanne">Pierre Lescanne</name><affiliation wicri:level="1"><mods:affiliation>INRIA-Lorraine & CRIN, Bâtiment LORIA, 615, rue du Jardin Botanique, BP 101, F-54602, Villers les Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>INRIA-Lorraine & CRIN, Bâtiment LORIA, 615, rue du Jardin Botanique, BP 101, F-54602, Villers les Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: lescanne@loria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Rose, Kristoffer H" sort="Rose, Kristoffer H" uniqKey="Rose K" first="Kristoffer H." last="Rose">Kristoffer H. Rose</name><affiliation wicri:level="1"><mods:affiliation>Basic Research in Computer Science (Centre of the Danish National Research Foundation), Dept. of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, Aarhus C, Denmark</mods:affiliation><country xml:lang="fr">Danemark</country><wicri:regionArea>Basic Research in Computer Science (Centre of the Danish National Research Foundation), Dept. of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, Aarhus C</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: krisrose@brics.dk</mods:affiliation><country wicri:rule="url">Danemark</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present the λσ w a -calculus, a formal synthesis of the concepts of sharing and explicit substitution for weak reduction. We show how λσ w a , can be used as a foundation of implementations of functional programming languages by modeling the essential ingredients of such implementations, namely weak reduction strategies, recursion, space leaks, recursive data structures, and parallel evaluation. We use λσ w a , to give a unified model of several computational aspects. First, we give a precise account of the major reduction strategies used in functional programming and the consequences of choosing λ-graph-reduction vs. environment-based evaluation. Second, we show how to add constructors and explicit recursion to give a precise account of recursive functions and data structures even with respect to space complexity. Third, we formalize the notion of space leaks in λσ w a and use this to define a space leak free calculus; this suggests optimisations for call-by-need reduction that prevent space leaking and enables us to prove that the “trimming” performed by the STG machine does not leak space. In summary we give a formal account of several implementation techniques used by state of the art implementations of functional programming languages.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002A41 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 002A41 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:B4CA52C0FB46513B3B83B18F1F8CACF39E736720
|texte= Modeling sharing and recursion for weak reduction strategies using explicit substitution
}}
| This area was generated with Dilib version V0.6.33. |  |