Standard ML of New Jersey
Lecture notes in computer sciencePublished 1 January 1991
Andrew W. Appel, David MacQueen
Citations245
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The Standard ML of New Jersey compiler has been under development for five years now and has developed a robust and complete environment that supports the implementation of large software systems and generates efficient code.
Abstract
The Standard ML of New Jersey compiler has been under development for five years now. We have developed a robust and complete environment for Standard ML that supports the implementation of large software systems and generates efficient code. The compiler has also served as a laboratory for developing novel implementation techniques for a sophisticated type and module system, continuation based code generation, efficient pattern matching, and concurrent programming features.
Keywords
Computer Science
The MIT Press eBooksThe Definition of Standard ML
2,411 Citations1997Robin Milner, Robert Harper +2 more
This book provides a formal definition of Standard ML for the benefit of all concerned with the language, including users and implementers, and the authors have defined their semantic objects in mathematical notation that is completely independent of StandardML.
Yacc : Yet Another Compiler Compiler
1,239 Citations1978S. C. Johnson, Murray Hill
Yacc provides a general tool for describing the input to a computer program, together with code to be invoked as each such structure is recognized, and turns such a specification into a subroutine that handles the input process.
The Computer JournalThe Mechanical Evaluation of Expressions
932 Citations1964P. J. Landin
It is shown how some forms of expression in current programming languages can be modelled in Church's X-notation, and a way of "interpreting" such expressions is described, which suggests a method of analyzing the things computer users write.
Indagationes Mathematicae (Proceedings)Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
925 Citations1972N.G. de Bruijn
How to make ad-hoc polymorphism less ad hoc
770 Citations1989Philip Wadler, Stephen Blott
Type classes extend the Hindley/Milner polymorphic type system, and provide a new approach to issues that arise in object-oriented programming, bounded type quantification, and abstract data types.
DSpace@MIT (Massachusetts Institute of Technology)Rabbit: A Compiler for Scheme
402 Citations1978Jr. Guy L. Steele
A compiler for the lexically-scoped dialect of LISP known as SCHEME, which handles only a small basis set which reflects the semantics of lambda-calculus, and serves to produce code as good as that produced by more traditional compilers.
Software Practice and ExperienceSimple generational garbage collection and fast allocation
305 Citations1989Andrew W. Appel
A scheme for quick record allocation attacks this bottleneck because many garbage‐collected environments do not know when to ask the operating system for more memory, and a robust heuristic solves this problem.
ACM SIGPLAN NoticesOrbit
259 Citations2004David Kranz, Richard Kelsey +4 more
Orbit was an optimizing compiler for T, a dialect of Scheme, that directly spawned six PhD theses and one Masters thesis, and influenced many other projects as well, including SML of New Jersey.
ORBIT: an optimizing compiler for scheme
209 Citations1986Norman I. Adams, David Kranz +4 more
Information and ComputationType inference for polymorphic references
186 Citations1990Mads Tofte
A modified type inference system is presented and it is proved its soundness using operational semantics that it is decidable whether, given an expression e, any type can be inferred for e.
Continuation-passing, closure-passing style
168 Citations1989Andrew W. Appel, Trevor Jim
This work implemented a continuation-passing style (CPS) code generator for ML that separates the code generation into phases that rewrite this representation of the language into ever-simpler forms.
Continuation-based multiprocessing
139 Citations1980Mitchell Wand
This work considers the implementation of other schedulers, interrupts, and the implications of these ideas for language design, by writing the kernel and some modules for a multiprocessing system.
Internet Archive (Internet Archive)Commentary on Standard ML
130 Citations1990Robin Milner, Mads Tofte
This companion volume explains in depth the meaning, or semantic theory, of ML.
Edinburgh Research Archive (University of Edinburgh)Operational Semantics and Polymorphic Type Inference
117 Citations1988Mads Tofte
Lecture notes in computer scienceA standard ML compiler
100 Citations1987Andrew W. Appel, David MacQueen
This work describes the first compiler written for Standard ML in Standard ML, a major revision of earlier dialects of the functional language ML that incorporates a number of novel features and techniques.
Typing first-class continuations in ML
99 Citations1991Bruce F. Duba, Robert Harper +1 more
The soundness of the Damas–Milner polymorphic type assignment system with respect to this semantics is proved, and the full Damas-Milner type system is shown to be unsound in the presence of first-class continuations.
ACM Letters on Programming Languages and SystemsNo assembly required
93 Citations1992David Tarditi, Peter Lee +1 more
This work shows how to compile Standard ML to C without compromising on portability and proper tail recursion, and analyzes the performance and determines the aspects of the compilation method that lead to the observed slowdown.
LISP and Symbolic ComputationRuntime tags aren't necessary
72 Citations1989Andrew W. Appel
Though a form of tag will still be required for user-defined variant records, all other type information can be encoded once—in the program—rather than replicated many times in the data, leading to savings both in space and time.
Debugging standard ML without reverse engineering
70 Citations1990Andrew Tolmach, Andrew W. Appel
A novel and efficient replay debugger for the Standard ML compiler, featuring full variable display, polymorphic type resolution, stack trace-back, breakpointing, and reverse execution, even though the compiler is very highly optimizing and has no run-time stack.
Polymorphic type inference and assignment
67 Citations1991Xavier Leroy, Pierre Weis
The type system given here leads to a better integration of imperative programming style with the purely applicative kernel of ML, and generic functions that allocate mutable data can safely be given fully polymorphic types.
FigshareAdding threads to Standard ML
53 Citations2018Eric C. Cooper, J. Gregory Morrisett
Standard ML has added multiple threads of control to the Standard ML programming language and it is demonstrated how other concurrency and synchronization operations, such as cobegin/coend, futures, and events, can be implemented in terms of the thread interface.
An implementation of standard ML modules
28 Citations1988David MacQueen
The representations and algorithms of this implementation were inspired by a detailed formal semantics of Standard ML developed by Milner, Tofte, and Harper.
LISP and Symbolic ComputationCallee-save registers in continuation-passing style
25 Citations1992Andrew W. Appel, Zhong Shao
This work examines how CPS expresses the saving and restoring of registers in source-language procedure calls, and explains how to express callee-save registers in Continuation-Passing Style, and gives measurements showing the resulting improvement in execution time.
Lecture notes in computer scienceAn abstract interpretation for ML equality kinds
4 Citations1991Carl A. Gunter, Elsa L. Gunter +1 more
A refinement of the Standard ML system of equality types is introduced and is proven sound and complete with respect to the existence of a computable equality.
Type Abstraction Rules for References: A Comparison of Four which have Achieved Notoriety
3 Citations1991Jr O'Toole, W. James
Four type abstraction rules which have been introduced by various authors to permit polymorphic type safety in the presence of mutable data are presented.