Type-preserving garbage collectors

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2001, Pages 166-178

  Wang, D C ^a   Appel, A W ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; DATA STORAGE EQUIPMENT; DATA STRUCTURES;

REGION INFERENCE; TYPE-PRESERVING GARBAGE COLLECTORS;

PROGRAM COMPILERS;

EID: 0035042878     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/360204.360218     Document Type: Conference Paper

References (33)

1. Better static memory management: Improving region-based analysis of higher-order languages
2. Empirical and analytic study of stack versus heap cost for languages with closures
3. Efficent and safe-for-space closure conversion
4. Lively linear lisp - 'look ma, no garbage!'
5. The treadmill, real-time garbage collection without motion sickness
6. The boyer benchmark meets linear logic
7. Region analysis and the polymorphic lambda calculus
8. Simple garbage-collector safety
9. Typed memory management in a calculus of capabilities
10. Intensional polymorphism in type-erasure semantics
11. Compiler support for garbage collection in a statically typed language
12. Memory management with explicit regions
13. Java intermediate bytecodes
14. Compiling polymorphism using intensional type analysis
15. Typed closure conversion
16. Principled scavenging
17. Abstract models of memory management
18. From system F to typed assembly language
19. Proof-carrying code
20. An efficient machine independent procedure for garbage collection in various list structures
21. Flow-directed lightweight closure conversion
22. Alias types
23. Recycling continuations
24. Programming with regions in the ML Kit (for version 3)
25. Implementation of the typed call-by-value λ-calculus using a stack of regions
26. From ML to Ada: Strongly-typed language interoperability via source translation
27. Transformations de programmes recursifs
28. How to make ad-hoc polymorphism less ad-hoc
29. Alias types for recursive data structures (extended version)
30. Type-preserving garbage collectors (extend version)
31. The MM garbage collector for C++