Garbage collection via dynamic type inference – A Formal Treatment –

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1473, Issue , 1998, Pages 215-239

  Hosoya, Haruo ^a   Yonezawa, Akinori ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

REFUSE COLLECTION; SPECIFICATIONS;

CALL TYPES; DYNAMIC TYPE; FORMAL CORRECTNESS; GARBAGE COLLECTION; POLYMORPHIC TYPES; SIGNIFICANT POINTS; TYPE INFERENCES; UNDERLYING LANGUAGE;

INFERENCE ENGINES;

EID: 42149182266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055520     Document Type: Conference Paper

References (17)

1. S. Aditya, C. Flood, and J. Hicks. Garbage collection for strongly-typed languages using run-time type reconstruction. In Proceedings of Conference on LISP and Functional Programming, pages 12-23, 1994.
2. H. G. Baker. Unify and conquer (garbage, updating, aliasing,) in functional languages. In Proceedings of Conference on LISP and Functional Programming, pages 218-226, 1990.
3. L. Birkedal, M. Tofte, and M. Vejlstrup. From Region Inferrence to von Neumann Machines via Region Representation. In Conference record of Symposium on Principles of Programming Languages, pages 171-183, 1996.
4. P. Fradet. Collecting more garbage. In Proceedings of Conference on LISP and Functional Programming, pages 24-33, 1994.
5. B. Goldberg and M. Glogar. Polymorphic type reconstruction for garbage collection without tags. In Proceedings of Conference on LISP and Functional Programming, pages 53-65, 1992.
6. K. Inoue, H. Seki, and H. Yagi. Analysis of functional programs to detect runtime garbage cells. ACM Transactions on Programming, Languages and Systems, 10(4): 555-579, 1988.
7. R. Jones. Tail recursion without space leaks. Journal of Functional Programming, 2(1): 73-79, 1992.
8. S. B. Jones and D. L. Metayer. Compile-time garbage collection by sharing analysis. In Conference Proceedings of Functional Programming Languages and Computer Architecture, pages 54-74, Imperial College, London, September 1989.
9. S. L. P. Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987.
10. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17: 348-185, 1978.
11. G. Morrisett. Compiling with Types. PhD thesis, School of Computer Science Carnegie Mellon University, 1995.
12. G. Morrisett, M. Felleisen, and R. Harper. Abstract models of memory management. In Proceedings of Functional Programming Languages and Computer Architecture, pages 66-76, 1995.
13. J. Reynolds. Types, abstraction, and parametric polymorphism. In Information Processing, volume 83, pages 513-523, 1983.
14. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of ACM, 12, 1965.
15. M. Tofte and J.-P. Talpin. Implementation of the Typed Call-by-Value λ-calculus using a Stack of Regions. In Conference record of Symposium on Principles of Programming Languages, pages 188-201, 1994.
16. A. Tolmach. Tag-free garbage collection using explicit type parameters. In Proceedings of Conference on LISP and Functional Programming, pages 1-11, 1994.
17. P. Wadler. Fixing some space leaks with a garbage collector. Software Practice and Experience, 17(9): 595-608, September 1987.