Back to direct style

Science of Computer Programming

Volumn 22, Issue 3, 1994, Pages 183-195

  Danvy, Olivier ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; ENCODING (SYMBOLS); MATHEMATICAL TRANSFORMATIONS; RECURSIVE FUNCTIONS;

CONTINUATION PASSING STYLE; LAMBDA ITEMS; TAIL RECURSION;

PROGRAMMING THEORY;

EID: 0028446199     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6423(94)00003-4     Document Type: Article

References (24)

1. 4 report on the algorithmic language Scheme
2. For a better support of static data flow
3. Three steps for the CPS transformation
4. Back to direct style (revised and extended version)
5. Representing control a study of the CPS transformation
6. Back to direct style II: first-class continuations
7. Representing monads
8. The essence of compiling with continuations
9. A generic account of continuation-passing styles
10. Proofs by structural induction using partial evaluation
11. Separating stages in the continuation-passing style transformation
12. Abstract interpretation of partial-evaluation algorithms
13. Notions of computation and monads
14. Two-level semantics and code generation
15. Logic programming in the LF logical framework
16. Call-by-name, call-by-value and the λ-calculus
17. Definitional interpreters for higher-order programming languages
18. Reasoning about programs in continuation-passing style
19. A. Sabry and M. Felleisen, Is continuation-passing useful for data flow analysis? in: V. Sarkar, ed.,Proceedings of the ACM SIGPLAN'94 Conference on Programming Languages Design and Implementation, Orlando, FL (ACM Press, New York, to appear).
20. Introduction
21. Advanced compiling techniques