Skip to main content
SpringerLink
Log in

Binding-time analysis for Standard ML

  • Published:
LISP and Symbolic Computation

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Lars Ole Andersen. C program specialization. Technical Report 92/14, DIKU, Department of Computer Science, University of Copenhagen, May 1992.

  2. Lars Ole Andersen. Binding time analysis and the taming of C pointers. InProceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 47–58. ACM Press, June 1993.

  3. Lars Birkedal and Morten Welinder. Partial evaluation of Standard ML. Technical Report 93/22, DIKU, October 1993.

  4. Anders Bondorf and Jesper Jørgensen. Efficient analyses for realistic off-line partial evaluation.Journal of Functional Programming, 3(3):315–346, 1993.

    Google Scholar 

  5. Kei Davis. Pers from projections for binding-time analysis.Lisp and Symbolic Computation, (this volume), 1995. Special issue on Partial Evaluation and Semantics-Based Program Manipulation.

  6. Anne de Niel.Self-Applicable Partial Evaluation of Polymorphically Typed Functional Languages. PhD thesis, Katholieke Universiteit Leuven, January 1993.

  7. Fritz Henglein. Efficient type inference for higher-order binding-time analysis. In J. Hughes, editor,Functional Programming Languages and Computer Architecture, LNCS 523, pages 448–472. Springer-Verlag, 1991.

  8. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft.Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.

  9. John Launchbury.Projection Factorisations in Partial Evaluation. Cambridge University Press, 1991.

  10. Robin Milner, Mads Tofte, and Robert Harper.The Definition of Standard ML. MIT Press, 1990.

  11. Jens Palsberg and Michael I. Schwartzbach. Binding-time analysis: Abstract interpretation versus type inference. InProc. ICCL'94, Fifth IEEE International Conference on Computer Languages, Toulouse, France, May 1994.

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, 15213, Pittsburgh, PA, USA

    Lars Birkedal

  2. DIKU, Department of Computer Science, University of Copenhagen, DK-2100, Copenhagen Ø, Denmark

    Morten Welinder

Authors
  1. Lars Birkedal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Morten Welinder
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The present work was conducted while the author was at DIKU.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Birkedal, L., Welinder, M. Binding-time analysis for Standard ML. Lisp and Symbolic Computation 8, 191–208 (1995). https://doi.org/10.1007/BF01019003

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01019003

Keywords

Search

Navigation