Skip to main content
SpringerLink
Log in

Sharing Analysis Based on Type Inference

  • Formal Aspects of Computing
  • Published:
Formal Aspects of Computing

Abstract

This paper presents a framework for sharing analysis based on type inference. The type system used in this paper is a modified version of Milner’s type system. The soundness of the analysis is defined by the semantics of types extended for sharing information and proved with respect to an operational semantics for a strict language. It is also shown that the information obtained by the analysis can be applied to compile-time garbage collection.

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. Baker, H. G.: Unify and conquer (garbage, updatind, aliasing,…) in functional languages. In Proc. ACM Conf. Lisp and Functional Programming, 1990.

    Google Scholar 

  2. Damas, L. and Milner, R.: Principal type-schemes for functional programs. In Proc. ACM Symp. on Principles of Prog. Languages, 1982.

    Google Scholar 

  3. Inoue, K., Seki, H. and Yagi, H.: Analysis of functional programs to detect run-time garbage cells. ACM Transaction on Programming Languages and Systems, Vol. 10, No. 4,, 1988.

    Google Scholar 

  4. Jensen, T. P.: Strictness analysis in logical form. In Proc. Functional Programming Languages and Computer Architecture, LNCS 523. Springer-Verlag, 1991.

    Google Scholar 

  5. Jones, S. B. and Le Métayer, D.: Compile-time garbage collection by sharing analysis. In Functional Programming Languages and Computer Architecture. ACM Press, 1989.

    Google Scholar 

  6. Kuo, T.-M. and Mishra, P.: Strictness analysis: A new perspective based on type inference. In Proc. Functional Programming Languages and Computer Architecture. ACM Press, 1989.

    Google Scholar 

  7. Mycroft, A.: Abstract Interpretation and Optimizing Transformations for Applicative Programs. PhD thesis, Department of Computer Science,University of Edinburgh, 1981. CST-15-81.

    Google Scholar 

  8. Tofte, M.: Operational Semantics and Polymorphic Type Inference. PhD thesis, Department of Computer Science,University of Edinburgh, 1988. CST-52-88.

    Google Scholar 

  9. Tofte, M.: Type inference for polymorphic references. Information and Computation, Vol. 89, No. 1, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Mathematical Sciences, Kyoto University, Kyoto, 606, Japan

    Yasuhiko Minamide

Authors
  1. Yasuhiko Minamide
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Minamide, Y. Sharing Analysis Based on Type Inference. Form Asp Comp 6, 659–675 (1994). https://doi.org/10.1007/BF03259391

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation