The call-by-need lambda calculus
Identifieur interne : 00B233 ( Main/Exploration ); précédent : 00B232; suivant : 00B234The call-by-need lambda calculus
Auteurs : John Maraist [Australie] ; Martin Odersky [Australie] ; Philip Wadler [Australie]Source :
- Journal of Functional Programming [ 0956-7968 ] ; 1998-05.
Abstract
We present a calculus that captures the operational semantics of call-by-need. The call-by-need lambda calculus is confluent, has a notion of standard reduction, and entails the same observational equivalence relation as the call-by-name calculus. The system can be formulated with or without explicit let bindings, admits useful notions of marking and developments, and has a straightforward operational interpretation.
Url:
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003B04
- to stream Istex, to step Curation: 003A60
- to stream Istex, to step Checkpoint: 002464
- to stream Main, to step Merge: 00B954
- to stream Main, to step Curation: 00B233
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>The call-by-need lambda calculus</title><author><name sortKey="Maraist, John" sort="Maraist, John" uniqKey="Maraist J" first="John" last="Maraist">John Maraist</name></author><author><name sortKey="Odersky, Martin" sort="Odersky, Martin" uniqKey="Odersky M" first="Martin" last="Odersky">Martin Odersky</name></author><author><name sortKey="Wadler, Philip" sort="Wadler, Philip" uniqKey="Wadler P" first="Philip" last="Wadler">Philip Wadler</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F659CB3DF6F64F9CB172F6BB46C0DF9AC4FBB62C</idno><date when="1998" year="1998">1998</date><idno type="url">https://api.istex.fr/ark:/67375/6GQ-P1X1ZBKQ-T/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003B04</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003B04</idno><idno type="wicri:Area/Istex/Curation">003A60</idno><idno type="wicri:Area/Istex/Checkpoint">002464</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002464</idno><idno type="wicri:doubleKey">0956-7968:1998:Maraist J:the:call:by</idno><idno type="wicri:Area/Main/Merge">00B954</idno><idno type="wicri:Area/Main/Curation">00B233</idno><idno type="wicri:Area/Main/Exploration">00B233</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">The call-by-need lambda calculus</title><author><name sortKey="Maraist, John" sort="Maraist, John" uniqKey="Maraist J" first="John" last="Maraist">John Maraist</name><affiliation wicri:level="1"><country wicri:rule="url">Australie</country><wicri:regionArea>School of Computer and Information Science, University of South Australia, Warrendi Road, The Levels, Adelaide, SA 5095</wicri:regionArea><wicri:noRegion>SA 5095</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Odersky, Martin" sort="Odersky, Martin" uniqKey="Odersky M" first="Martin" last="Odersky">Martin Odersky</name><affiliation wicri:level="1"><country wicri:rule="url">Australie</country><wicri:regionArea>School of Computer and Information Science, University of South Australia, Warrendi Road, The Levels, Adelaide, SA 5095</wicri:regionArea><wicri:noRegion>SA 5095</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Wadler, Philip" sort="Wadler, Philip" uniqKey="Wadler P" first="Philip" last="Wadler">Philip Wadler</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Australie</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Functional Programming</title><idno type="ISSN">0956-7968</idno><idno type="eISSN">1469-7653</idno><imprint><publisher>Cambridge University Press</publisher><date type="published" when="1998-05">1998-05</date><biblScope unit="volume">8</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="275">275</biblScope><biblScope unit="page" to="317">317</biblScope></imprint><idno type="ISSN">0956-7968</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0956-7968</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract">We present a calculus that captures the operational semantics of call-by-need. The call-by-need lambda calculus is confluent, has a notion of standard reduction, and entails the same observational equivalence relation as the call-by-name calculus. The system can be formulated with or without explicit let bindings, admits useful notions of marking and developments, and has a straightforward operational interpretation.</div></front></TEI><affiliations><list><country><li>Australie</li></country></list><tree><country name="Australie"><noRegion><name sortKey="Maraist, John" sort="Maraist, John" uniqKey="Maraist J" first="John" last="Maraist">John Maraist</name></noRegion><name sortKey="Maraist, John" sort="Maraist, John" uniqKey="Maraist J" first="John" last="Maraist">John Maraist</name><name sortKey="Odersky, Martin" sort="Odersky, Martin" uniqKey="Odersky M" first="Martin" last="Odersky">Martin Odersky</name><name sortKey="Odersky, Martin" sort="Odersky, Martin" uniqKey="Odersky M" first="Martin" last="Odersky">Martin Odersky</name><name sortKey="Wadler, Philip" sort="Wadler, Philip" uniqKey="Wadler P" first="Philip" last="Wadler">Philip Wadler</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B233 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00B233 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F659CB3DF6F64F9CB172F6BB46C0DF9AC4FBB62C
|texte= The call-by-need lambda calculus
}}
| This area was generated with Dilib version V0.6.33. |  |