A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

• Compiling with Continuations (addall). ISBN 0521416957. Andrew W. Appel. Cambridge University Press, 1992.

• Shrinking Lambda Expressions in Linear Time. Andrew Appel and Trevor Jim. JFP, 7(5):515-540, 1997.

• Modern Compiler Implementation in ML (addall). ISBN 0521582741 Andrew W. Appel. Cambridge University Press, 1998.

• Tree Pattern Matching for ML. Marianne Baudinet, David MacQueen. 1985.

Describes the match compiler used in an early version of SML/NJ.

• Compiling Standard ML to Java Bytecodes. Nick Benton, Andrew Kennedy, and George Russell. ICFP 1998.

• Interlanguage Working Without Tears: Blending SML with Java. Nick Benton and Andrew Kennedy. ICFP 1999.

• Exceptional Syntax. Nick Benton and Andrew Kennedy. JFP, 11(4):395-410, 2001.

• Embedded Interpreters. Nick Benton. JFP, 2005.

• Adventures in Interoperability: The SML.NET Experience. Nick Benton, Andrew Kennedy, and Claudio Russo. PPDP 2004.

• OO Programming styles in ML. Bernard Berthomieu. LAAS Report #2000111, 2000.

• No-Longer-Foreign: Teaching an ML compiler to speak C "natively". Matthias Blume. BABEL 2001.

• Destructors, Finalizers, and Synchronization. Hans Boehm. POPL 2003.

Discusses a number of issues in the design of finalizers. Many of the design choices are consistent with MLtonFinalizable.

• Flow-directed Closure Conversion for Typed Languages. Henry Cejtin, Suresh Jagannathan, and Stephen Weeks. ESOP 2000.

Describes MLton's closure-conversion algorithm, which translates from its simply-typed higher-order intermediate language to its simply-typed first-order intermediate language.

• Functional Unparsing. Olivier Danvy. BRICS Technical Report RS 98-12, 1998.

• Extensional Polymorphism. Catherin Dubois, Francois Rouaix, and Pierre Weis. POPL 1995.

An extension of ML that allows the definition of ad-hoc polymorphic functions by inspecting the type of their argument.

• Garbage Collection Safety for Region-based Memory Management. Martin Elsman. TLDI 2003.

• Type-Specialized Serialization with Sharing Martin Elsman. University of Copenhagen. IT University Technical Report TR-2004-43, 2004.

• The Little MLer (addall). ISBN 026256114X. Matthias Felleisen and Dan Freidman. The MIT Press, 1998.

• Kill-Safe Synchronization Abstractions. Matthew Flatt and Robert Bruce Findler. PLDI 2004.

• Contification Using Dominators. Matthew Fluet and Stephen Weeks. ICFP 2001.

Describes contification, a generalization of tail-recursion elimination that is an optimization operating on MLton's static single assignment (SSA) intermediate language.

• Phantom Types and Subtyping. Matthew Fluet and Riccardo Pucella. TCS 2002.

• Generic Polymorphism in ML. J. Furuse. JFLA 2001.

The formalism behind G'CAML, which has an approach to ad-hoc polymorphism based on Dubois94, the differences being in how type checking works an an improved compilation approach for typecase that does the matching at compile time, not run time.

• The Standard ML Basis Library. (addall) ISBN 0521794781. Emden R. Gansner and John H. Reppy. Cambridge University Press, 2004.

An introduction and overview of the Basis Library, followed by a detailed description of each module. The module descriptions are also available online.

• Region-based Memory Management in Cyclone. Dan Grossman, Greg Morrisett, Trevor Jim, Michael Hicks, Yanling Wang, and James Cheney. PLDI 2002.

• Combining Region Inference and Garbage Collection. Niels Hallenberg, Martin Elsman, and Mads Tofte. PLDI 2002.

• Introduction to Programming using SML (addall). ISBN 0201398206. Michael R. Hansen, Hans Rischel. Addison-Wesley, 1999.

• Safe and Flexible Memory Management in Cyclone. Mike Hicks, Greg Morrisett, Dan Grossman, and Trevor Jim. University of Maryland Technical Report CS-TR-4514, 2003.

• Garbage Collection: Algorithms for Automatic Memory Management (addall). ISBN 0471941484. Richard Jones. John Wiley & Sons, 1999.

• Mistakes and ambiguities in the definition of Standard ML. Stefan Kahrs. University of Edinburgh LFCS Report ECS-LFCS-93-257, 1993.

  There are also the addenda published in 1996.

Describes a number of problems with the 1990 Definition, many of which were fixed in the 1997 Definition.

• Pickler Combinators. Andrew Kennedy. JFP, 14(6): 727-739, 2004.

• Faster Algorithms for Finding Minimal Consistent DFAs. Kevin Lang. 1999.

• mGTK: An SML binding of Gtk+. Ken Larsen and Henning Niss. USENIX Annual Technical Conference, 2004.

• The ZINC experiment: an economical implementation of the ML language. Xavier Leroy. Technical report 117, INRIA, 1990.

A detailed explanation of the design and implementation of a bytecode compiler and interpreter for ML with a machine model aimed at efficient implementation.

• Polymorphism by name for references and continuations. Xavier Leroy. POPL 1993.

• MLRISC Annotations. Allen Leung and Lal George. 1998.

• Asynchronous exceptions in Haskell. Simon Marlow, Simon Peyton Jones, Andy Moran and John Reppy. PLDI 2001.

An asynchronous exception is a signal that one thread can send to another, and is useful for the receiving thread to treat as an exception so that it can clean up locks or other state relevant to its current context.
There are a couple of earlier versions of this paper floating around, from August and November 2000. Make sure and get the official version from May 2001 (linked above).

• A Just-In-Time backend for Moscow ML 2.00 in SML. Bjarke Meier, Kristian Nørgaard. Masters Thesis, 2003.

A just-in-time compiler using GNU Lightning, showing a speedup of up to four times over Moscow ML's usual bytecode interpreter.
The full report is only available in Danish.

• How ML Evolved. Robin Milner. Polymorphism--The ML/LCF/Hope Newsletter, 1983.

• Commentary on Standard ML (online pdf). (addall) ISBN 0262631327. Robin Milner and Mads Tofte. The MIT Press, 1990.

Introduces and explains the notation and approach used in The Definition of Standard ML.

• The Definition of Standard ML. (addall) ISBN 0262631326. Robin Milner, Mads Tofte, and Robert Harper. The MIT Press, 1990.

Superseded by The Definition of Standard ML (Revised). Accompanied by the Commentary on Standard ML.

• The Definition of Standard ML (Revised). (addall) ISBN 0262631814. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The MIT Press, 1997.

A terse and formal specification of Standard ML's syntax and semantics. Supersedes an older version.

• Automatic Code Generation from Coloured Petri Nets for an Access Control System. Kjeld H. Mortensen. Workshop on Practical Use of Coloured Petri Nets and Design/CPN, 1999.

• fxp - Processing Structured Documents in SML. Andreas Neumann. Scottish Functional Programming Workshop, 1999.

Describes fxp, an XML parser implemented in Standard ML.

• Parsing and Querying XML Documents in SML. Andreas Neumann. Doctoral Thesis, 1999.

• Purely Functional Data Structures. ISBN 0521663504. Chris Okasaki. Cambridge University Press, 1999.

• ML For the Working Programmer (addall) ISBN 052156543X. Larry C. Paulson. Cambridge University Press, 1996.

• The HiPE/x86 Erlang Compiler: System Description and Performance Evaluation. Mikael Pettersson, Konstantinos Sagonas, and Erik Johansson. FLOPS 2002.

Describes a native x86 Erlang compiler and a comparison of many different native x86 compilers (including MLton) and their register usage and call stack implementations.

• Embedding an Interpreted Language Using Higher-Order Functions and Types. Norman Ramsey. IVME 2003.

• Widening Integer Arithmetic. Kevin Redwine and Norman Ramsey. CC 2004.

Describes a method to implement numeric types and operations (like Int31 or Word17) for sizes smaller than that provided by the processor.

• Concurrent Programming in ML (addall). ISBN 0521480892. John Reppy. Cambridge University Press, 1999.

Covers ConcurrentML.

• Defects in the Revised Definition of Standard ML. Andreas Rossberg. 2001.

• Dual-Mode Garbage Collection. Patrick M. Sansom. Workshop on the Parallel Implementation of Functional Languages, 1991.

• When Do Match-Compilation Heuristics Matter. Kevin Scott and Norman Ramsey. University of Virginia Technical Report CS-2000-13.

Modified SML/NJ to experimentally compare a number of match-compilation heuristics and showed that choice of heuristic usually does not significantly affect code size or run time.

• ML pattern match compilation and partial evaluation. Peter Sestoft. Partial Evaluation, 1996.

Describes the derivation of the match compiler used in Moscow ML.

• Anthony L. Shipman. Unix System Programming with Standard ML, 2002.

• Calcul statique des applications de modules parametres. Julien Signoles. JFLA 2003.

Describes a defunctorizer for OCaml, and compares it to existing defunctorizers, including MLton.

• Object-oriented programming and Standard ML. Lars Thorup and Mads Tofte. Workshop on ML and its applications, 1994.

• Type Inference for Polymorphic References. Mads Tofte. Information and Computation, 89(1_References), 1990.

• Elements of ML Programming (addall). ISBN 0137903871. Jeffrey D. Ullman. Prentice-Hall, 1998.

• Managing Memory with Types. Daniel C. Wang. PhD Thesis.

Chapter 6 describes an implementation of a type-preserving garbage collector for MLton.

• Type-Preserving Garbage Collectors. Daniel C. Wang and Andrew W. Appel. POPL 2001.

Shows how to modify MLton to generate a strongly typed garbage collector as part of a program.

• Programming With Recursion Schemes. Daniel C. Wang and Tom Murphy VII.

Describes a programming technique for data abstraction, along with benchmarks of MLton and other SML compilers.

• Recursion Schemes as Abstract Interfaces. Daniel C. Wang and Tom Murphy. JFP.

• Simple Imperative Polymorphism. Andrew Wright. LASC, 8(4):343-355, 1995.

The origin of the ValueRestriction.

Abbreviations

• BABEL = Workshop on multi-language infrastructure and interoperability.

• CC = International Conference on Compiler Construction

• ESOP = European Symposium on Programming

• FLOPS = Symposium on Functional and Logic Programming

• ICFP = International Conference on Functional Programming

• IVME = Workshop on Interpreters, Virtual Machines and Emulators.

• JFLA = Journees Francophones des Langages Applicatifs

• JFP = Journal of Functional Programming

• LASC = Lisp and Symbolic Computation

• PLDI = Conference on Programming Language Design and Implementation

• POPL = Symposium on Principles of Programming Languages

• PPDP = International Conference on Principles and Practice of Declarative Programming

• TCS = IFIP International Conference on Theoretical Computer Science

• TLDI = Workshop on Types in Language Design and Implementation