• Publications
  • Influence
Standard ML of New Jersey
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 largeExpand
The Definition of Standard ML (Revised)
Part 1 Syntax of the core: reserved words special constants comments identifiers lexical analysis infixed operators derived forms grammar syntactic restrictions. Part 2 Syntax of modules: reservedExpand
Coroutines and Networks of Parallel Processes
Ce langage de programmation permet aussi de clarifier les relations entre plusieurs concepts : coroutines, appel par necessite, structures de donnees dynamiques et calcul parallele. Expand
HOPE: An experimental applicative language
An applicative language called HOPE is described and discussed, to produce a very simple programming language which encourages the construction of clear and manipulable programs. Expand
Modules for standard ML
The module facility described here has been proposed as part of the revised language, now called Standard ML, to facilitate the structuring of large ML programs and to employ new ideas in the semantics of data types to extend the power of ML's polymorphic type system. Expand
Using dependent types to express modular structure
The goal here is to examine some of the proposed linguistic notions with respect to how they meet the pragmatic requirements of programming in the large. Expand
A Standard ML compiler
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. Expand
An ideal model for recursive polymorphic types
When constants are added to the pure lambda calculus, run-time errors can occur if the constants are used improperly, for example, if an at tempt is made to apply a natural number as if it were aExpand
An Ideal Model for Recursive Polymorphic Types
Typing first-class continuations in ML
First-class continuations are a powerful tool for implementing sophisticated control constructs like co-routines, processes, backtracking, and asynchronous signals, but it is clear that extensive work is required to integrate continuations fully into the definition of Standard ML. Expand