Sciweavers

84 search results - page 2 / 17
» Compiling self-adjusting programs with continuations
Sort
View
LFP
1992
153views more  LFP 1992»
13 years 9 months ago
Reasoning About Programs in Continuation-Passing Style
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
Amr Sabry, Matthias Felleisen
FPCA
1991
13 years 11 months ago
Syntactic Detection of Single-Threading Using Continuations
We tackle the problem of detecting global variables in functional programs. We present syntactic criteria for single-threading which improves upon previous solutions (both syntact...
Pascal Fradet
PPDP
2010
Springer
13 years 6 months ago
Functional derivation of a virtual machine for delimited continuations
This paper connects the definitional interpreter for the λ-calculus extended with delimited continuation constructs, shift and reset, with a compiler and a low-level virtual mac...
Kenichi Asai, Arisa Kitani
PADL
2005
Springer
14 years 1 months ago
Towards Provably Correct Code Generation via Horn Logical Continuation Semantics
Abstract. Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we explore approaches to provably correct code genera...
Qian Wang, Gopal Gupta, Michael Leuschel
ICFP
2001
ACM
14 years 7 months ago
Contification Using Dominators
Contification is a compiler optimization that turns a function that always returns to the same place into a continuation. Compilers for functional languages use contification to e...
Matthew Fluet, Stephen Weeks