Principled scavenging

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2001, Pages 81-91

  Monnier, S ^a   Saha, B ^a   Shao, Z ^a  

^a Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; PROGRAM COMPILERS; SEMANTICS;

PRINCIPLED SCAVENGING;

CODES (SYMBOLS);

EID: 0034837174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. On bounding time and space for multiprocessor garbage collection
2. A non-recursive list compacting algorithm
3. Typed assembly language: Type theory for machine code
4. Typed memory management in a calculus of capabilities
5. Flexible type analysis
6. Intensional polymorphism in type-erasure semantics
7. Representing control, a study of the cps transformation
8. Compiling polymorphism using intensional type analysis
9. Typed closure conversion for recursively-defined functions
10. Typed closure conversion
11. Open problems for certifying compilers
12. From system F to typed assembly language
13. Proof-carrying code
14. The design and implementation of a certifying compiler
15. Real-time replication garbage collection
16. Implementing typed intermediate languages
17. Implementation of the typed call-by-value λ-calculus using a stack of regions
18. From ML to Ada: Strongly-typed language interoperability via source translation
19. Fully reflexive intensional type analsysis
20. Alias types for recursive data structures
21. Type-preserving garbage collectors
22. Uniprocessor garbage collection techniques