Formal Aspects of Computing

, Volume 6, Issue 6, pp 659–675

Sharing Analysis Based on Type Inference

  • Yasuhiko Minamide
Formal Aspects of Computing
  • 21 Downloads

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.

Keywords

Sharing analysis Type inference Compile-time garbage collection 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bak90]
    Baker, H. G.: Unify and conquer (garbage, updatind, aliasing,…) in functional languages. In Proc. ACM Conf. Lisp and Functional Programming, 1990.Google Scholar
  2. [DaM82]
    Damas, L. and Milner, R.: Principal type-schemes for functional programs. In Proc. ACM Symp. on Principles of Prog. Languages, 1982.Google Scholar
  3. [ISY88]
    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. [Jen91]
    Jensen, T. P.: Strictness analysis in logical form. In Proc. Functional Programming Languages and Computer Architecture, LNCS 523. Springer-Verlag, 1991.Google Scholar
  5. [JoM89]
    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. [KuM89]
    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. [Myc81]
    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. [Tof88]
    Tofte, M.: Operational Semantics and Polymorphic Type Inference. PhD thesis, Department of Computer Science,University of Edinburgh, 1988. CST-52-88.Google Scholar
  9. [Tof90]
    Tofte, M.: Type inference for polymorphic references. Information and Computation, Vol. 89, No. 1, 1990.Google Scholar

Copyright information

© BCS 1994

Authors and Affiliations

  • Yasuhiko Minamide
    • 1
  1. 1.Research Institute for Mathematical SciencesKyoto UniversityKyotoJapan

Personalised recommendations