LISP and Symbolic Computation, 8(3)191-208
Binding-Time Analysis for Standard MLLars Birkedal, School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA
Morten Welinder, DIKU, Department of Computer Science, University of Copenhagen, DK-2100 Copenhagen Ø, Denmark
|
Abstract: 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. Keywords: binding-time analysis, partial evaluation, Standard ML |
[local copy]
![[picture of journal cover]](../LISP.JPG)