Binding-time analysis for Standard ML

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Lars Birkedal
  • Morten Welinder, DIKU, Department of Computer Science, Denmark

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. © 1995 Kluwer Academic Publishers.

Original languageEnglish
Title of host publicationPEPM'94 - ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, Walt Disney World Vilage, Orlando, Florida, USA, 25 June 1994, Proceedings : Technical Report 94/9.
Number of pages11
PublisherUniversity of Melbourne. Department of Computer Science
Publication year1 Sep 1995
Pages61-71
Publication statusPublished - 1 Sep 1995
Externally publishedYes

    Research areas

  • Binding-time analysis, partial evaluation, Standard ML

See relations at Aarhus University Citationformats

ID: 81723354