Sciweavers

ML
2008
ACM
13 years 4 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
ML
2008
ACM
104views Machine Learning» more  ML 2008»
13 years 4 months ago
Many holes in hindley-milner
We implement statically-typed multi-holed contexts in OCaml using an underlying algebraic datatype augmented with phantom types. Existing approaches require dynamic checks or more...
Sam Lindley
ML
2008
ACM
135views Machine Learning» more  ML 2008»
13 years 4 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget
ML
2008
ACM
109views Machine Learning» more  ML 2008»
13 years 4 months ago
O'browser: objective caml on browsers
We present a way to run Objective Caml programs on a standard, unmodified web browser, with a compatible data representation and execution model, including concurrency. To achieve...
Benjamin Canou, Vincent Balat, Emmanuel Chailloux