Thunks and the lambda-calculus:
Abstract: "In his paper, Call-by-name, call-by-value and the [lambda]-calculus, Plotkin formalized evaluation strategies and simulations using operational semantics and continuations. In particular, he showed how call-by-name evaluation could be simulated under call-by-value evaluation and vice...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
København
1995
|
| Schriftenreihe: | Datalogisk Institut <København>: DIKU-Rapport
1995,3 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In his paper, Call-by-name, call-by-value and the [lambda]-calculus, Plotkin formalized evaluation strategies and simulations using operational semantics and continuations. In particular, he showed how call-by-name evaluation could be simulated under call-by-value evaluation and vice versa. Since Algol 60, however, call-by-name is both implemented and simulated with thunks rather than with continuations. We recast this folk theorem in Plotkin's setting, and show that thunks, even though they are simpler than continuations, are sufficient for establishing all the correctness properties of Plotkin's call-by-name simulation. Furthermore, we establish a new relationship between Plotkin's two continuation-based simulations simulations C[subscript n] and C[subscript v], by deriving C[subcript n] as the composition of our thunk-based simulation T and of C+[subscript v] -- an extension of C[subscript v] handling thunks. Almost all of the correctness properties of C[subscript n] follow from the properties of T and C+[subscript v]. This simplifies reasoning about call-by-name continuation-passing style. We also give several applications involving factoring continuation-based transformations using thunks." |
| Beschreibung: | 44 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010678822 | ||
| 003 | DE-604 | ||
| 005 | 19961024 | ||
| 007 | t | ||
| 008 | 960325s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)38435105 | ||
| 035 | |a (DE-599)BVBBV010678822 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a DAT 544f |2 stub | ||
| 100 | 1 | |a Hatcliff, John |d 1966- |e Verfasser |0 (DE-588)12145083X |4 aut | |
| 245 | 1 | 0 | |a Thunks and the lambda-calculus |c John Hatcliff and Olivier Danvy |
| 264 | 1 | |a København |c 1995 | |
| 300 | |a 44 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,3 | |
| 520 | 3 | |a Abstract: "In his paper, Call-by-name, call-by-value and the [lambda]-calculus, Plotkin formalized evaluation strategies and simulations using operational semantics and continuations. In particular, he showed how call-by-name evaluation could be simulated under call-by-value evaluation and vice versa. Since Algol 60, however, call-by-name is both implemented and simulated with thunks rather than with continuations. We recast this folk theorem in Plotkin's setting, and show that thunks, even though they are simpler than continuations, are sufficient for establishing all the correctness properties of Plotkin's call-by-name simulation. Furthermore, we establish a new relationship between Plotkin's two continuation-based simulations simulations C[subscript n] and C[subscript v], by deriving C[subcript n] as the composition of our thunk-based simulation T and of C+[subscript v] -- an extension of C[subscript v] handling thunks. Almost all of the correctness properties of C[subscript n] follow from the properties of T and C+[subscript v]. This simplifies reasoning about call-by-name continuation-passing style. We also give several applications involving factoring continuation-based transformations using thunks." | |
| 650 | 4 | |a Functional programming languages | |
| 650 | 4 | |a Lambda calculus | |
| 700 | 1 | |a Danvy, Olivier |e Verfasser |4 aut | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,3 |w (DE-604)BV010011493 |9 1995,3 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007127110 | ||
Datensatz im Suchindex
| _version_ | 1804125156356915200 |
|---|---|
| any_adam_object | |
| author | Hatcliff, John 1966- Danvy, Olivier |
| author_GND | (DE-588)12145083X |
| author_facet | Hatcliff, John 1966- Danvy, Olivier |
| author_role | aut aut |
| author_sort | Hatcliff, John 1966- |
| author_variant | j h jh o d od |
| building | Verbundindex |
| bvnumber | BV010678822 |
| classification_tum | DAT 544f |
| ctrlnum | (OCoLC)38435105 (DE-599)BVBBV010678822 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02239nam a2200325 cb4500</leader><controlfield tag="001">BV010678822</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19961024 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960325s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38435105</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010678822</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 544f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hatcliff, John</subfield><subfield code="d">1966-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12145083X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Thunks and the lambda-calculus</subfield><subfield code="c">John Hatcliff and Olivier Danvy</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">44 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,3</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In his paper, Call-by-name, call-by-value and the [lambda]-calculus, Plotkin formalized evaluation strategies and simulations using operational semantics and continuations. In particular, he showed how call-by-name evaluation could be simulated under call-by-value evaluation and vice versa. Since Algol 60, however, call-by-name is both implemented and simulated with thunks rather than with continuations. We recast this folk theorem in Plotkin's setting, and show that thunks, even though they are simpler than continuations, are sufficient for establishing all the correctness properties of Plotkin's call-by-name simulation. Furthermore, we establish a new relationship between Plotkin's two continuation-based simulations simulations C[subscript n] and C[subscript v], by deriving C[subcript n] as the composition of our thunk-based simulation T and of C+[subscript v] -- an extension of C[subscript v] handling thunks. Almost all of the correctness properties of C[subscript n] follow from the properties of T and C+[subscript v]. This simplifies reasoning about call-by-name continuation-passing style. We also give several applications involving factoring continuation-based transformations using thunks."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional programming languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lambda calculus</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Danvy, Olivier</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,3</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1995,3</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007127110</subfield></datafield></record></collection> |
| id | DE-604.BV010678822 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:57:05Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007127110 |
| oclc_num | 38435105 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 44 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | Hatcliff, John 1966- Verfasser (DE-588)12145083X aut Thunks and the lambda-calculus John Hatcliff and Olivier Danvy København 1995 44 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1995,3 Abstract: "In his paper, Call-by-name, call-by-value and the [lambda]-calculus, Plotkin formalized evaluation strategies and simulations using operational semantics and continuations. In particular, he showed how call-by-name evaluation could be simulated under call-by-value evaluation and vice versa. Since Algol 60, however, call-by-name is both implemented and simulated with thunks rather than with continuations. We recast this folk theorem in Plotkin's setting, and show that thunks, even though they are simpler than continuations, are sufficient for establishing all the correctness properties of Plotkin's call-by-name simulation. Furthermore, we establish a new relationship between Plotkin's two continuation-based simulations simulations C[subscript n] and C[subscript v], by deriving C[subcript n] as the composition of our thunk-based simulation T and of C+[subscript v] -- an extension of C[subscript v] handling thunks. Almost all of the correctness properties of C[subscript n] follow from the properties of T and C+[subscript v]. This simplifies reasoning about call-by-name continuation-passing style. We also give several applications involving factoring continuation-based transformations using thunks." Functional programming languages Lambda calculus Danvy, Olivier Verfasser aut Datalogisk Institut <København>: DIKU-Rapport 1995,3 (DE-604)BV010011493 1995,3 |
| spellingShingle | Hatcliff, John 1966- Danvy, Olivier Thunks and the lambda-calculus Datalogisk Institut <København>: DIKU-Rapport Functional programming languages Lambda calculus |
| title | Thunks and the lambda-calculus |
| title_auth | Thunks and the lambda-calculus |
| title_exact_search | Thunks and the lambda-calculus |
| title_full | Thunks and the lambda-calculus John Hatcliff and Olivier Danvy |
| title_fullStr | Thunks and the lambda-calculus John Hatcliff and Olivier Danvy |
| title_full_unstemmed | Thunks and the lambda-calculus John Hatcliff and Olivier Danvy |
| title_short | Thunks and the lambda-calculus |
| title_sort | thunks and the lambda calculus |
| topic | Functional programming languages Lambda calculus |
| topic_facet | Functional programming languages Lambda calculus |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT hatcliffjohn thunksandthelambdacalculus AT danvyolivier thunksandthelambdacalculus |