A Type-Theoretic Account of Standard ML 1996 (Version 1).

Abstract

A t ype-theoretic denition of a variant of the Standard ML (Revised 1996) programming language is given. The denition consists of a syntax-directed translation of SML96 programs into a typed intermediate language. The intermediate language is an explicitly-typed-calculus with product, sum, recursive, and module types. The translation performs type reconstruction, handles identier scope resolution, enforces static well-formedness conditions, and expands high-level constructs (such as pattern matching and signature matching) into uses of the more rudimentary mechanisms of the intermediate language. This document presents work in progress and is being distributed for the purpose of obtaining feedback. As such, the translation does not completely match the denition of SML96, which is itself still undergoing change.

Type-Safe linking with recursive DLLs and shared libraries

“…This translation semantics follows other approaches to defining semantics for modules Stone and Harper 1996], and also suggests a compilation strategy for our module calculus. Whereas linking in the ML module system is described as function application, linking in our calculus has more of the flavor of a process algebra, "plugging together" modules.…”

Towards a mathematical operational semantics

“…Perhaps there will be a useful theory of the combination of operational semantics of different languages (cf [18]). Again, perhaps one can relate the operational semantics of a language with that of its translation into another target language (cf [26]).…”