Contification using dominators

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2001, Pages 2-13

  Fluet, M ^a   Weeks, S ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; RECURSIVE FUNCTIONS; SEMANTICS; THEOREM PROVING; XML;

CONTIFICATION; CONTROL-FLOW INFORMATION; DOMINATOR TREE; FUNCTIONAL LANGUAGES; STANDARD MARKUP LANGUAGES;

PROGRAM COMPILERS;

EID: 0034777503     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/507638.507639     Document Type: Conference Paper

References (25)

1. Loop headers in λ-calculus or CPS
2. SSA is functional programming
3. Shrinking lambda expressions in linear time
4. Flow-directed closure conversion for typed languages
5. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
6. Efficiently computing static single assignment form and the control dependence graph
7. Lambda-dropping: Transforming recursive equations into programs with block structure
8. Static interpretation of modules
9. The essence of compiling with continuations
10. On the type structure of standard ML
11. Flow analysis of lambda expressions
12. A correspondence between continuation passing style and static single assignment form
13. Realistic compilation by program transformation
14. ORBIT: An optimizing compiler for scheme
15. A fast algorithm for finding dominators in a flowgraph
16. MLton, a whole program optimizing compiler for standard ML
17. System for conversion of loop functions in continuation-passing style
18. Local CPS conversion in a direct-style compiler
19. TIL: A type-directed optimizing compiler for ML
20. Programming with regions in the ML kit (for version 3)
21. From ML to Ada: Strongly-typed language interoperability via source translation
22. A cost-effective estimation of uncaught exceptions in standard ML programs