The ML type system was originally introduced as a means of identifying a class of terms in a simple untyped language, often referred to as core-ML, whose evaluation could be guaranteed not to \go wrong". In subsequent work, the terms of core-ML have also been viewed as a `con-venient shorthand' for programs in typed languages. Notable examples include studies of ML polymorphism and investigatio...

We present a typed calculus IL (“intermediate language”) which supports the embedding of ML-like (strict, eager) and Haskell-like (non-strict, lazy) languages, without favoring either. IL’s type system includes negation (continuations), but not implication (function arrow). Within IL we find that lifted sums and products can be represented as the double negation of their unlifted counterparts. ...

This paper presents a compilation scheme from natural semantics speciications to ML. Permutations of premises allow, for a class of speciications, a purely functional execution and can reduce non-determinism. This method uses some speciic features of ML, like exceptions , closures and pattern-matching.

It is well known that the type system of ML is overly re strictive in its handling of recursion certain intuitively sound terms do not pass ML s type check We formalise this intuition and show that the restriction is semantical there are computable semantical functions which cannot be expressed by well typed syntactical terms