|
595
|
Compiling with Continuations
– Andrew Appel
- 1992
|
|
101
|
Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation
– Olivier
- 1992
|
|
458
|
Perspectives on Program Analysis
– Flemming Nielson
- 1996
|
|
64
|
Continuation Semantics in Typed Lambda-Calculi
– Albert R. Meyer, Mitchell Wand
- 1985
|
|
235
|
The Essence of Compiling with Continuations
– Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen
- 1993
|
|
72
|
Lightweight Closure Conversion
– Paul A. Steckler, Mitchell Wand
- 1996
|
|
13
|
On Static and Dynamic Control-Flow Information in Program Analysis and Transformation
– Daniel Damian, Daniel Damian
- 2001
|
|
12
|
Assessing the Overhead of ML Exceptions by Selective CPS . . .
– Olivier Danvy, Jung-taek Kim, O. Danvy, Jung-taek Kim, Kwangkeun Yi, Kwangkeun Yi
- 1998
|
|
34
|
A Correspondence between Continuation Passing Style and Static Single Assignment Form
– Richard Kelsey
- 1995
|
|
32
|
The effectiveness of type-based unboxing
– Xavier Leroy, Inria Rocquencourt
- 1997
|
|
80
|
The Design of a Class Mechanism for MOBY
– Kathleen Fisher, John Reppy
- 1999
|
|
47
|
Design and Implementation of Code Optimizations for a Type-Directed Compiler for Standard ML
– David Tarditi
- 1996
|
|
13
|
Embedding Type Structure in Semantics
– Mitchell Wand
- 1985
|
|
91
|
RABBIT: a compiler for SCHEME
– STEELE JR, G L
- 1978
|
|
174
|
Call-by-name, call-by-value and the λ-calculus
– G Plotkin
- 1976
|
|
4
|
Rabbit: A compiler for Scheme. Master's dissertation
– Steele Jr, G L
- 1978
|
|
15
|
The Objective Caml System (release 3.00
– X Leroy
- 2000
|
|
59
|
From ML to Ada: Strongly-typed Language Interoperability via Source Translation
– Andrew Tolmach, Dino P. Oliva
- 1993
|
|
24
|
On One-Pass CPS Transformations
– RS-02-3 Olivier Danvy, Lasse R Nielsen
- 2002
|
