Binding-Time Analysis for Standard ML

We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard ML except modules and we show the principles of how constraints can be used for binding-time analysis of Standard ML; in particular we show how to binding-time analyse nested pattern matching. To the best of our knowledge no previous binding-time analysis has treated nested pattern matching. This article is partly based on [BW93] in which we document the development of a semantics-based compiler generator, ML-Mix, for Standard ML programs.

• Type: Conference
• Year: 1994
• Where: PEPM
• Authors: Lars Birkedal, Morten Welinder
• Keywords: Binding-time Analysis, Pattern Matching, PEPM 1994, Software Engineering, Standard ML