Binding-time analysis for Standard ML

@article{Birkedal1994BindingtimeAF,
  title={Binding-time analysis for Standard ML},
  author={L. Birkedal and Morten Welinder},
  journal={LISP and Symbolic Computation},
  year={1994},
  volume={8},
  pages={191-208}
}
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. 
Fast Binding-Time Analysis for Multi-Level Specialization
Polymorphic specialization for ML
Solving Regular Tree Grammar Based Constraints
A Prototype Dependency Calculus
Tractable Constraints in Finite Semilattices
An Automatic Program Generator for Multi-Level Specialization
Inlining as staged computation
Tractable Constraints in Finite Semilattices
...
1
2
...

References

SHOWING 1-10 OF 19 REFERENCES
Binding-time analysis and the taming of C pointers
Efficient Analysis for Realistic Off-Line Partial Evaluation
Automatic Binding Time Analysis for a Typed lambda-Calculus
Binding-time analysis: abstract interpretation versus type inference
Definition of standard ML
PERs from projections for binding-time analysis
  • K. Davis
  • Computer Science
  • LISP Symb. Comput.
  • 1994
Commentary on standard ML
...
1
2
...