Kevin Millikin

Google Publications

On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation

Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny

Theoretical Computer Science, vol. 435 (2012), pp. 21-42
A rational deconstruction of Landin's SECD machine with the J operator

Olivier Danvy, Kevin Millikin

Logical Methods in Computer Science, vol. 4 (2008), pp. 1-67

Refunctionalization at work

Olivier Danvy, Kevin Millikin

Science of Computer Programming, vol. 74 (2009), pp. 534-549
On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion

Olivier Danvy, Kevin Millikin

Information Processing Letters, vol. 106 (2008), pp. 100-109
A structured approach to the transformation, normalization and execution of computer programs

Kevin Millikin

Ph.D. Thesis, BRICS, Department of Computer Science, University of Aarhus (2007)
On one-pass CPS transformations

Olivier Danvy, Kevin Millikin, Lasse R. Nielsen

Journal of Functional Programming, vol. 17 (2007), pp. 793-812
A dynamic continuation-passing style for dynamic delimited continuations

Dariusz Biernacki, Olivier Danvy, Kevin Millikin

BRICS, Department of Computer Science, University of Aarhus (2005), pp. 1-60