Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the dynamic extent of delimited continuations

From MaRDI portal
Publication:1044694
Jump to:navigation, search

DOI10.1016/j.ipl.2005.04.003zbMath1191.68157OpenAlexW2089469045MaRDI QIDQ1044694

Olivier Danvy, Chung-Chieh Shan, Dariusz Biernacki

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.8441



Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)


Related Items (3)

Axioms for control operators in the CPS hierarchy ⋮ A static simulation of dynamic delimited control ⋮ On the dynamic extent of delimited continuations



Cites Work

  • On the dynamic extent of delimited continuations
  • Call-by-name, call-by-value and the \(\lambda\)-calculus
  • Definitional interpreters for higher-order programming languages
  • Scheme: A interpreter for extended lambda calculus
  • Continuations: A mathematical semantics for handling full jumps
  • Breadth-first numbering
  • Meta-programming with names and necessity
  • Continuation-Based Program Transformation Strategies
  • An Operational Foundation for Delimited Continuations in the CPS Hierarchy
  • THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control




This page was built for publication: On the dynamic extent of delimited continuations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1044694&oldid=13052277"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 22:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki