Thunks and the λ-calculus

Journal of Functional Programming

Volumn 7, Issue 3, 1997, Pages 303-319

  Hatcliff, John ^a   Danvy, Olivier ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043146037     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796897002748     Document Type: Article

References (37)

1. Amtoft, T. (1993) Minimal thunkification. In: Cousot, P., Falaschi, M., Filè, G. and Rauzy, A. (editors), Proceedings of the Third International Workshop on Static Analysis WSA'93: Lecture Notes in Computer Science 724, pp. 218-229. Springer-Verlag.
2. Asperti, A. (1992) A categorical understanding of environment machines. J. Functional Programming 2(1): 23-59.
3. Barendregt, H. (1984) The Lambda Calculus: its syntax and semantics. North-Holland.
4. Bloss, A., Hudak, P. and Young, J. (1988) Code optimization for lazy evaluation. Lisp and Symbolic Computation 1: 147-164.
5. Burn, G. and Le Métayer, D. (1996) Proving the correctness of compiler optimisations based on a global program analysis. J. Functional Programming 6(1).
6. Curien, P.-L. (1986) Categorical combinators, sequential algorithms and functional programming. Research Notes in Theoretical Computer Science, Vol. 1. Pitman.
7. Danvy, O. and Filinski, A. (1992) Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science 2(4): 361-391.
8. Danvy, O. and Hatcliff, J. (1992) Thunks (continued). In: Proceedings of the Second International Workshop on Static Analysis WSA'92, pp. 3-11. Bigre Journal 81-82. Bordeaux, France: IRISA, Rennes, France.
9. Danvy, O. and Hatcliff, J. (1993) CPS transformation after strictness analysis. ACM Letters On Programming Languages And Systems 1(3): 195-212.
10. de Groote, P. (1994) A CPS-translation of the λμ-calculus, In: Sophie Tison (editor), 19th Colloquium on Trees in Algebra and Programming (CAAP'94): Lecture Notes in Computer Science 787, pp. 47-58. Springer-Verlag.
11. Fischer, M. J. (1993) Lambda-calculus schemata. In: C. L. Talcott (editor), Special Issue on Continuations (Part I). Lisp and Symbolic Computation 6(3/4). (An earlier version appeared in an ACM Conference on Proving Assertions about Programs, SIGPLAN Notices 7(1) January 1972.)
12. Fischer, M. J. (1993) Lambda-calculus schemata. In: C. L. Talcott (editor), Special Issue on Continuations (Part I). Lisp and Symbolic Computation 6(3/4). (An earlier version appeared in an ACM Conference on Proving Assertions about Programs, SIGPLAN Notices 7(1) January 1972.)
13. Griffin, T. G. (1990) A formulae-as-types notion of control. In: P. Hudak (editor), Proceedings of the Seventeenth Annual ACM Symposium on Principles Of Programming Languages, pp. 47-58. ACM Press.
14. Harper, B. and Lillibridge, M. (1993) Polymorphic type assignment and CPS conversion. In: C. L. Talcott (editor), Special Issue on Continuations (Part I). Lisp and Symbolic Computation 6(3/4).
15. Hatcliff, J. (1994) The structure of continuation-passing styles. PhD thesis, Department of Computing and Information Sciences, Kansas State University.
16. Hatcliff, J. and Danvy, O. (1995) Thunks and the λ-calculus. Technical Report 95/3. DIKU, Computer Science Department, University of Copenhagen.
17. Ingerman, P. Z. (1961) Thunks, a way of compiling procedure statements with some comments on procedure declarations. Communications of the ACM 4(1): 55-58.
18. Lawall, J. L. and Danvy, O. (1993) Separating stages in the continuation-passing style transformation. In: S. L. Graham (editor), Proceedings of the Twentieth Annual ACM Symposium on Principles Of Programming Languages, pp. 124-136. ACM Press.
19. Meyer, A. R. and Wand, M. (1985) Continuation semantics in typed lambda-calculi (summary). In: R. Parikh (editor), Logics of Programs - proceedings: Lecture Notes in Computer Science 193, pp. 219-224.
20. Moggi, E. (1991) Notions of computation and monads. Information and Computation 93: 55-92.
21. Murthy, C. R. (1990) Extracting constructive content from classical proofs. PhD thesis, Department of Computer Science, Cornell University.
22. Mycroft, A. (1981) Abstract interpretation and optimising transformations for applicative programs. PhD thesis, University of Edinburgh.
23. Nielson, F. and Nielson, H. R. (1992) Two-level functional languages. Cambridge Tracts in Theoretical Computer Science, Vol. 34. Cambridge University Press.
24. Niss, H. and Hatcliff, J. (1995) Encoding operational semantics in logical frameworks: A critical review of LF/Elf. In: B. Nördstrom (editor), Proceedings of the 1995 Nordic Workshop on Programming Language Theory, pp. 57-81.
25. Okasaki, C., Lee, P. and Tarditi, D. (1994) Call-by-need and continuation-passing style. In: C. I. Talcott (editor), Special Issue on Continuations (Part II). LISP and Symbolic Computation 7(1).
26. Parigot, M. (1992) λμ-calculus: an algorithmic interpretation of classical natural deduction. In: A. Voronkov(editor), Proceedings of the International Conference on Logic Programming and Automated Reasoning. Lecture Notes in Artificial Intelligence 624, pp. 190-201.
27. Pfenning, F. (1991) Logic programming in the LF logical framework. In: G. Huet and G. Plotkin (editors), Logical Frameworks, pp. 149-181. Cambridge University Press.
28. Plotkin, G. D. (1975) Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1: 125-159.
29. Plotkin, G. D. (1978) Course notes on operational semantics. Unpublished manuscript.
30. Raymond, E. (editor) (1992) The New Hacker's Dictionary. MIT Press.
31. Reynolds, J. C. (1974) On the relation between direct and continuation semantics. In: J. Loeckx (editor), 2nd Colloquium on Automata, Languages and Programming: Lecture Notes in Computer Science 14, pp. 141-156.
32. Riecke, J. G. (1991) Fully abstract translations between functional languages. In: R. Cartwright (editor), Proceedings of the Eighteenth Annual ACM Symposium on Principles Of Programming Languages, pp. 245-254. ACM Press.
33. Sabry, A. and Felleisen, M. (1993) Reasoning about programs in continuation-passing style. In: C. L. Talcott (editor), Special Issue on Continuations (Part I). Lisp and Symbolic Computation 6(3/4) 289-360.
34. Sabry, A. and Wadler, P. (1996) Compiling with reflections. In: R. K. Dybvig (editor), Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming. ACM Press.
35. Steckler, P. and Wand, M. (1994) Selective thunkification. In: B. Le Charlier (editor), Proceedings of the First International Static Analysis Symposium: Lecture Notes in Computer Science 864, pp. 162-178.
36. Steele Jr., G. L. (1978) Rabbit: A compiler for Scheme. Technical Report AI-TR-474. Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA.
37. Talcott, C. L. (editor) (1993) Special Issue on Continuations (Part I): LISP and Symbolic Computation 6(3/4).