Kevin Millikin

According to our database1, Kevin Millikin authored at least 11 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Faster sorting algorithms discovered using deep reinforcement learning.
Nat., 2023

2015
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations.
ACM Trans. Program. Lang. Syst., 2015

Spicing Up Dart with Side Effects.
ACM Queue, 2015

2012
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation.
Theor. Comput. Sci., 2012

2010
Defunctionalized Interpreters for Call-by-Need Evaluation.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
Refunctionalization at work.
Sci. Comput. Program., 2009

2008
A Rational Deconstruction of Landin's SECD Machine with the J Operator.
Log. Methods Comput. Sci., 2008

On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion.
Inf. Process. Lett., 2008

2007
On one-pass CPS transformations.
J. Funct. Program., 2007

2005
A new approach to one-pass transformations.
Proceedings of the Revised Selected Papers from the Sixth Symposium on Trends in Functional Programming, 2005

A Rational Deconstruction of Landin's J Operator.
Proceedings of the Implementation and Application of Functional Languages, 2005


  Loading...