A reference-counting garbage collection algorithm for cyclical functional programming

International Symposium on Memory Management, ISMM

Volumn , Issue , 2008, Pages 71-80

  Widemann, Baltasar Trancón Y ^a  

^a UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

Cycles; Functional programming; Garbage collection; Memory management; Reference counting

Indexed keywords

CYCLES; CYCLIC DATUMS; FUNCTIONAL PROGRAMMING TECHNIQUES; GARBAGE COLLECTION; GARBAGE COLLECTION ALGORITHMS; GARBAGE COLLECTIONS; MARKING INVARIANTS; MEMORY MANAGEMENT; MUTATOR ACTIVITIES; NOVEL ALGORITHMS; REFERENCE COUNTING;

COMPUTER PROGRAMMING; DATA STORAGE EQUIPMENT; REFUSE COLLECTION; REFUSE DISPOSAL; WASTE DISPOSAL;

FUNCTIONAL PROGRAMMING;

EID: 57349090165     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375634.1375645     Document Type: Conference Paper

References (23)

1. D. F. Bacon, P. Cheng, and V. T. Rajan. A unified theory of garbage collection. In OOPSLA '04: Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, pages 50-68. ACM, 2004.
2. D. F. Bacon and V. T. Rajan. Concurrent cycle collection in reference counted systems. In ECOOP '01: Proceedings of 15th European Conference on Object-Oriented Programming, volume 2072 of Lecture Notes in Computer Science, 2001.
3. P. A. Bigot and S. K. Debray. Return value placement and tail call optimization in high level languages. Journal of Logic Programming, 38(1):1-29, 1999.
4. R. S. Bird. Using circular programs to eliminate multiple traversals of data. Acta Informatica, 21:239-250, 1984.
5. S. M. Blackburn and K. S. McKinley. Ulterior reference counting: fast garbage collection without a long wait. In OOPSLA '03: Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications, pages 344-358. ACM, 2003.
6. D. R. Brownbridge. Cyclic reference counting for combinator machines. In Functional Programming Languages and Computer Architecture, volume 201 of Lecture Notes in Computer Science. Springer, 1985.
7. D. P. Friedman and D. S. Wise. Reference counting can manage the circular environments of mutual recursion. Information Processing Letters, 8(0:41-45, 1979.
8. R. E. Jones and R. D. Lins. Cyclic weighted reference counting without delay. In PARLE '93: Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe, pages 712-715. Springer-Verlag, 1993.
9. J. R. Larus. Restructuring Symbolic Programs for Concurrent Execution on Multiprocessors. PhD thesis, University of California, Berkeley, 1989.
10. Y. Levanoni and E. Petrank. An on-the-fly reference counting garbage collector for Java. In OOPSLA '01: Proceedings of the 16th ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications, pages 367-380. ACM, 2001.
11. R. D. Lins. Cyclic reference counting with lazy mark-scan. Information Processing Letters, 44(4):215-220, 1992.
12. R. D. Lins. Generational cyclic reference counting. Inf. Process. Lett., 46(l):19-20, 1993.
13. R. D. Lins. An efficient algorithm for cyclic reference counting. Inf. Process. Lett., 83(3): 145-150, 2002.
14. R. D. Lins, F. Heron de Carvalho Junior, and Z. D. Lins. Cyclic reference counting with permanent objects. Journal of Universal Computer Science, 13(6):830-838, 2007.
15. A. D. Martinez, R. Wachenchauzer, and R. D. Lins. Cycle reference counting with local mark-scan. Information Processing Letters, 34(1):31-35, 1990.
16. E. Pepels, M. van Eekelen, and M. Plasmeijer. A cyclic reference counting algorithm and its proof. Technical Report 88-10, Computing Science Department, University of Nijmegen, 1988.
17. D. Pereira and J. Aycock. Dynamic region inference. Technical Report TR 2002 709 12, Department of Computer Science, University of Calgary, 2002.
18. P. Roy, S. Seshadri, A. Silberschatz, S. Sudarshan, and S. Ashwin. Garbage collection in object-oriented databases using transactional cyclic reference counting. VLDB Journal: Very Large Data Bases, 7(3):179-193, 1998.
19. J. D. Salkild. Implementation and analysis of two reference counting algorithms. Master's thesis, University College, London, 1987.
20. B. Trancón y Widemann. Advanced strict corecursion. In Proceedings of the Symposium on Implementation of Functional Languages. Heriot-Watt University, Edinburgh, 2003.
21. B. Trancón y Widemann. Ein striktes coalgebraisches Berech-nungsmodell. In Programmiersprachen und Rechenkonzepte (22. Workshop der GI-Fachgruppe 2.1.4). Christian-Albrechts-Universität, Kiel, 2005.
22. B. Trancón y Widemann. Strikte Verfahren Zyklischer Berechnung. PhD thesis, Technische Universität Berlin, 2008.
23. D. H. D. Warren. DAI Research Report 141, University of Edinburgh, 1980.