Sciweavers

201 search results - page 4 / 41
» Typed Dynamic Control Operators for Delimited Continuations
Sort
View
POPL
2009
ACM
14 years 8 months ago
Lazy evaluation and delimited control
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
Ronald Garcia, Andrew Lumsdaine, Amr Sabry
LISP
2002
80views more  LISP 2002»
13 years 7 months ago
Comparing Control Constructs by Double-Barrelled CPS
We investigate call-by-value continuation-passing style transforms that continuations. Altering a single variable in the translation of -abstraction gives rise to different control...
Hayo Thielecke
ICFP
2010
ACM
13 years 7 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
ECOOP
2008
Springer
13 years 9 months ago
An Extensible State Machine Pattern for Interactive Applications
Abstract. The state design pattern is the standard object-oriented programming idiom for implementing the state machine logic of interactive applications. While this pattern provid...
Brian Chin, Todd D. Millstein
LISP
2007
112views more  LISP 2007»
13 years 7 months ago
Axioms for control operators in the CPS hierarchy
A CPS translation is a syntactic translation of programs, which is useful for describing their operational behavior. By iterating the standard callby-value CPS translation, Danvy a...
Yukiyoshi Kameyama