31 search results - page 3 / 7 » On one-pass CPS transformations |
82
Voted
LISP
2002
14 years 10 months ago
2002
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...
109
click to vote
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
APLAS
2007
ACM
15 years 2 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper studies continuations by means of a polymorphic type system. The traditional call-by-name continuation passing style transform admits a typing in which some an...
100
Voted
FLOPS
2004
Springer
15 years 3 months ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...