A Systematic Study of Functional Language Implementations

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 2, 1998, Pages 344-387

  Douence, Rémi ^a   Fradet, Pascal ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

D.1.1 Programming Techniques : Functional Programming; D.2.4 Software Engineering : Program Verification correctness proofs; D.2.8 Software Engineering : Metrics complexity measures; D.3.4 Programming Languages : Processors code generation

Indexed keywords

ABSTRACTING; GRAPH THEORY; PROGRAM COMPILERS; PROGRAM TRANSLATORS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; DATA STRUCTURES; OPTIMIZATION; PROGRAM DIAGNOSTICS;

ABSTRACT MACHINES; FUNCTIONAL PROGRAMING; PROGRAM TRANSFORMATIONS; FUNCTIONAL LANGUAGES; FUNCTIONAL PROGRAMMING; PROGRAM VERIFICATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0032010344     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/276393.276397     Document Type: Article

References (55)

1. ABADI, M., CARDELLI, L., CURIEN, P. L., AND LEVY, J. J. 1990. Explicit substitutions. In Proceedings of POPL 1990. ACM, New York, 31-46.
2. APPEL, A. W. 1992. Compiling with Continuations. Cambridge University Press, Cambridge, Mass.
3. ARGO, G. 1989. Improving the three instruction machine. In Proceedings of FPCA '89, 100-115.
4. ASPERTI, A. 1992. A categorical understanding of environment machines. J. Funct. Program. 2, 1, 23-59.
5. BARENDREGT, H. P. 1981. The Lambda Calculus. Its Syntax and Semantics. North-Holland, Amsterdam.
6. BARENDREGT, H. P. AND HEMERIK, K. 1990. Types in lambda calculi and programming languages. In Proceedings of the 3rd European Symposium on Programming. Lecture Notes in Computer Science, vol. 432. Springer-Verlag, Berlin, 1-35.
7. BENAISSA, Z., LESCANNE, P., AND ROSE, K. H. 1996. Modeling sharing and recursion for weak reduction strategies using explicit substitution. In Proceedings of PLILP 1996, 393-407.
8. BURN, G. AND LE MÉTAYER, D. 1996. Proving the correctness of compiler optimisations based on a global analysis. J. Funct. Program. 6, 1, 75-110.
9. BURN, G., PEYTON JONES, S. L., AND ROBSON, J. D. 1988. The spineless G-machine. In Proceedings of LFP '88, 244-258.
10. COUSINEAU, G., CURIEN, P.-L., AND MAUNY, M. 1987. The categorical abstract machine. Sci. Comput. Program. 8, 2, 173-202.
11. CRÉGUT, P. 1991. Machines à environnement pour la réduction symbolique et l'évaluation partielle. Ph.D. thesis, Université Paris VII, Paris, France.
12. CURIEN, P. L. 1993. Categorical Combinators, Sequential Algorithms and Functional Programming. Birkhauser.
13. CURRY, H. B. AND FEYS, R. 1958. Combinatory Logic, Vol. 1, North-Holland.
14. DANVY, O. 1992. Back to direct style. In Proceedings of ESOP '92. Lecture Notes in Computer Science, vol. 582. Springer-Verlag, Berlin, 130-150.
15. DE BRUJIN, N. G. 1972. λ-calculus notation with nameless dummies: A tool for automatic formula manipulation, with application to Church-Rosser theorem. Indagationes Math. 34, 381-392.
16. DOUENCE, R. 1996. Décrire et comparer les mises en œuvre de langages fonctionnels. Ph.D. thesis, University of Rennes I, Rennes, France.
17. DOUENCE, R. AND FRADET, P. 1995. Towards a taxonomy of functional language implementations. In Proceedings of PLILP '95. Lecture Notes in Computer Science, vol. 982. Springer-Verlag, Berlin, 27-44.
18. DOUENCE, R. AND FRADET, P. 1996a. A taxonomy of functional language implementations. Part I: Call-by-value. INRIA Res. Rep. 2783, INRIA, Rennes, France.
19. DOUENCE, R. AND FRADET, P. 1996b. A taxonomy of functional language implementations. Part II: Call-by-name, call-by-need, and graph reduction. INRIA Res. Rep. 3050, INRIA, Rennes, France.
20. FAIRBAIRN, J. AND WRAY, S. 1987. Tim: A simple, lazy abstract machine to execute super-combinators. In Proceedings of FPCA '87. Lecture Notes in Computer Science, vol. 274. Springer-Verlag, Berlin, 34-45.
21. FISCHER, M. J. 1972. Lambda-calculus schemata. In Proceedings of the ACM Conference on Proving Properties about Programs. SIGPLAN Not. 7, 1, 104-109.
22. FRADET, P. AND LE MÉTAYER, D. 1991. Compilation of functional languages by program transformation. ACM Trans. Program. Lang. Syst. 13, 1, 21-51.
23. HALL, C. 1994. Using Hindley-Milner type inference to optimise list representation. In Proceedings of LFP '94, 162-172.
24. HANNAN, J. 1992. From operational semantics to abstract machines. Math. Struct. Comput. Sci. 2, 4, 415-459.
25. HARDIN, T., MARANGET, L., AND PAGANO, B. 1996. Functional back-ends within the lambda-sigma calculus. In Proceedings of ICFP 1996, 25-33.
26. HATCLIFF, J. AND DANVY, O. 1994. A generic account of continuation-passing styles. In Proceedings of POPL '94. ACM, New York, 458-471.
27. JOHNSSON, T. 1987. Compiling lazy functional languages. Ph.D. thesis, Chalmers Univ. of Technology, Göteborg, Sweden.
28. JOY, M. S., RAYWARD-SMITH, V. J., AND BURTON, F. W. 1985. Efficient combinator code. Comp. Lang. 10, 3/4, 211-224.
29. KLOP, J. W. 1992. Term rewriting systems. In Handbook of Logic in Computer Science. Vol. 2, Oxford University Press, New York, 2-108.
30. KRANZ, D., KESLEY, R., REES, J., HUDAK, P., PHILBIN, J., AND ADAMS, N. 1986. ORBIT: An optimizing compiler for Scheme. SIGPLAN Not. 21, 7, 219-233.
31. LANDIN, P. J. 1964. The mechanical evaluation of expressions. Comput. J. 6, 4, 308-320.
32. LEROY, X. 1990. The Zinc experiment: An economical implementation of the ML language. INRIA Tech. Rep. 117, INRIA, Rennes, France.
33. LEROY, X. 1992. Unboxed objects and polymorphic typing. In Proceedings of the ACM Symposium on Principles of Programming Languages. ACM, New York, 177-188.
34. LESTER, D. 1989. Combinator graph reduction: A congruence and its application. Ph.D. thesis, Oxford Univ., Oxford, U.K.
35. LIANG, S., HUDAK, P., AND JONES, M. P. 1995. Monad transformers and modular interpreters. In Proceedings of POPL '95. ACM, New York, 333-343.
36. LINS, R. D. 1987. Categorical multi-combinators. In Proceedings of FPCA '87. Lecture Notes in Computer Science, vol. 274. Springer-Verlag, Berlin, 60-79.
37. LINS, R., THOMPSON, S., AND PEYTON-JONES, S. L. 1992. On the equivalence between CMC and TIM. J. Funct. Program. 4, 1, 47-63.
38. MEIJER, E. 1992. Calculating compilers. Ph.D. thesis, Katholieke Universiteit Nijmegen, Netherlands.
39. MEIJER, E. AND PATERSON, R. 1991. Down with lambda lifting. Unpublished paper. Copies available at: {erik@cs.kun.nl}.
40. MOGGI, E. 1991. Notions of computation and monads. Inf. Comput. 93, 55-92.
41. PEYTON JONES, S. L. 1987. The Implementation of Functional Programming Languages. Prentice-Hall, Englewood Cliffs, N.J.
42. PEYTON JONES, S. L. 1992. Implementing lazy functional languages on stock hardware: The spineless tagless G-machine. J. Funct. Program. 2, 2, 127-202.
43. PEYTON JONES, S. L. AND LESTER, D. 1992. Implementing Functional Languages, A Tutorial. Prentice-Hall, Englewood Cliffs, N.J.
44. PEYTON JONES, S. L. AND LAUNCHBURY, J. 1991. Unboxed values as first class citizens in a non-strict functional language. In Proceedings of FPCA '91. Lecture Notes in Computer Science, vol. 523. Springer-Verlag, Berlin, 636-666.
45. PEYTON JONES, S. L., PARTAIN, W., AND SANTOS, A. 1996. Let-floating: Moving bindings to give faster programs. In Proceedings of ICFP '96, 1-12.
46. PLASMEIJER, R. AND VAN EEKELEN, M. 1993. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, Reading, Mass.
47. PLOTKIN, G. D. 1975. Call-by-name, call-by-value and the lambda-calculus. TCS 1, 2, 125-159.
48. SCHMIDT, D. 1986. Denotational Semantics, A Methodology for Language Development. W. C. Brown, Dubuque, Iowa.
49. SESTOFT, P. 1994. Deriving a lazy abstract machine. Tech. Rep. 1994-146, Technical Univ. of Denmark.
50. SHAO, Z. AND APPEL, A. 1994. Space-efficient closure representations. In Proceedings of LFP '94, 150-161.
51. SHAO, Z., REPPY, J., AND APPEL, A. 1994. Unrolling lists. In Proceedings of LFP '94, 185-195.
52. STEELE, G. L. 1978. Rabbit: A compiler for Scheme. Tech. Rep. AI-TR-474, MIT, Cambridge, Mass.
53. TURNER, D. A. 1979a. A new implementation technique for applicative languages. Softw. Pract. Exper. 9, 31-49.
54. TURNER, D. A. 1979b. Another algorithm for bracket abstraction. J. Symbol. Logic 44, 267-270.
55. WADLER, P. 1992. The essence of functional programming. In Proceedings of POPL '92.