An Operational Foundation for Delimited Continuations in the CPS Hierarchy
We present an abstract machine and a reduction semantics for the lambda-calculus extended with control operators that give access to delimited continuations in the CPS hierarchy. The abstract machine is derived from an evaluator in continuation-passing style (CPS); the reduction semantics (i.e., a s...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2005-11-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/2269/pdf |
| _version_ | 1797268813089079296 |
|---|---|
| author | Malgorzata Biernacka Dariusz Biernacki Olivier Danvy |
| author_facet | Malgorzata Biernacka Dariusz Biernacki Olivier Danvy |
| author_sort | Malgorzata Biernacka |
| collection | DOAJ |
| description | We present an abstract machine and a reduction semantics for the
lambda-calculus extended with control operators that give access to delimited
continuations in the CPS hierarchy. The abstract machine is derived from an
evaluator in continuation-passing style (CPS); the reduction semantics (i.e., a
small-step operational semantics with an explicit representation of evaluation
contexts) is constructed from the abstract machine; and the control operators
are the shift and reset family. We also present new applications of delimited
continuations in the CPS hierarchy: finding list prefixes and normalization by
evaluation for a hierarchical language of units and products. |
| first_indexed | 2024-04-25T01:38:26Z |
| format | Article |
| id | doaj.art-6b6afdbdcae5419c8fef0c6d6517bf46 |
| institution | Directory Open Access Journal |
| issn | 1860-5974 |
| language | English |
| last_indexed | 2024-04-25T01:38:26Z |
| publishDate | 2005-11-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| series | Logical Methods in Computer Science |
| spelling | doaj.art-6b6afdbdcae5419c8fef0c6d6517bf462024-03-08T08:32:15ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742005-11-01Volume 1, Issue 210.2168/LMCS-1(2:5)20052269An Operational Foundation for Delimited Continuations in the CPS HierarchyMalgorzata Biernackahttps://orcid.org/0000-0001-8094-0980Dariusz Biernackihttps://orcid.org/0000-0002-1477-4635Olivier DanvyWe present an abstract machine and a reduction semantics for the lambda-calculus extended with control operators that give access to delimited continuations in the CPS hierarchy. The abstract machine is derived from an evaluator in continuation-passing style (CPS); the reduction semantics (i.e., a small-step operational semantics with an explicit representation of evaluation contexts) is constructed from the abstract machine; and the control operators are the shift and reset family. We also present new applications of delimited continuations in the CPS hierarchy: finding list prefixes and normalization by evaluation for a hierarchical language of units and products.https://lmcs.episciences.org/2269/pdfcomputer science - logic in computer sciencecomputer science - programming languagesd.1.1f.3.2 |
| spellingShingle | Malgorzata Biernacka Dariusz Biernacki Olivier Danvy An Operational Foundation for Delimited Continuations in the CPS Hierarchy Logical Methods in Computer Science computer science - logic in computer science computer science - programming languages d.1.1 f.3.2 |
| title | An Operational Foundation for Delimited Continuations in the CPS Hierarchy |
| title_full | An Operational Foundation for Delimited Continuations in the CPS Hierarchy |
| title_fullStr | An Operational Foundation for Delimited Continuations in the CPS Hierarchy |
| title_full_unstemmed | An Operational Foundation for Delimited Continuations in the CPS Hierarchy |
| title_short | An Operational Foundation for Delimited Continuations in the CPS Hierarchy |
| title_sort | operational foundation for delimited continuations in the cps hierarchy |
| topic | computer science - logic in computer science computer science - programming languages d.1.1 f.3.2 |
| url | https://lmcs.episciences.org/2269/pdf |
| work_keys_str_mv | AT malgorzatabiernacka anoperationalfoundationfordelimitedcontinuationsinthecpshierarchy AT dariuszbiernacki anoperationalfoundationfordelimitedcontinuationsinthecpshierarchy AT olivierdanvy anoperationalfoundationfordelimitedcontinuationsinthecpshierarchy AT malgorzatabiernacka operationalfoundationfordelimitedcontinuationsinthecpshierarchy AT dariuszbiernacki operationalfoundationfordelimitedcontinuationsinthecpshierarchy AT olivierdanvy operationalfoundationfordelimitedcontinuationsinthecpshierarchy |