A New Match Compiler for Standard ML of New Jersey
This abstract describes an implementation of a match compiler (for SML/NJ) that is the latest in an evolution of designs going back to the mid 1980s. It summarizes a more detailed technical report (in preparation) documenting the match compiler and its source code.
Thu 15 SepDisplayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change
11:00 - 12:30
|A New Match Compiler for Standard ML of New Jersey
David MacQueen University of Chicago (Emeritus)File Attached
|Boxroot, fast movable GC roots for a better FFI
|Unboxed types for OCaml
|What About the Integer Numbers?
Daan Leijen Microsoft ResearchLink to publication File Attached
Talk given by John Reppy