Making a fast curry: Push/enter vs. eval/apply for higher-order languages

Journal of Functional Programming

Volumn 16, Issue 4-5, 2006, Pages 415-449

  Marlow, Simon ^a   Peyton Jones, Simon ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EVALUATION MODELS; HASKELL; HIGHER-ORDER LANGUAGES;

FUNCTIONAL PROGRAMMING;

EID: 33747182546     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796806005995     Document Type: Conference Paper

References (16)

1. Appel, A. W. (1992) Compiling with continuations, Cambridge: Cambridge University Press.
2. Boquist, Urban. (1999) Code optimisation techniques for lazy functional languages. PhD thesis, Chalmers University of Technology, Sweden.
3. Douence, Rémi & Fradet, Pascal (1998) A systematic study of functional language implementations. Acm Transactions on Programming Languages and Systems, 20(2), 344-387.
4. Fairbairn, Jon & Wray, Stuart (1987) TIM - a simple lazy abstract machine to execute supercombinators. Pages 34-45 of: Kahn, G (ed), Proc IFIP Conference on Functional Programming Languages and Computer Architecture, Portland. Springer Verlag LNCS 274.
5. Faxén, Karl-Filip (1997) Analysing, transforming and compiling lazy functional programs. PhD thesis, Department of Teleinformatics, Royal Institute of Technology.
6. Johnsson, Thomas (1984) Efficient compilation of lazy evaluation. Proc. SIGPLAN Symposium on Compiler Construction, Montreal. ACM.
7. Jones, R. (1992) Tail recursion without space leaks. Journal of Functional Programming, 2(1), 73-80.
8. Launchbury, J. (1993) A natural semantics for lazy evaluation. Pages 144-154 of: 20th ACM Symposium on Principles of Programming Languages (POPL'93). ACM.
9. Leroy, X. (1990) The Zinc experiment: an economical implementation of the ML language. Tr 117, inria-rocquencourt. INRIA.
10. Maessen, Jan-Willem (2002) Hybrid eager and lazy evaluation for efficient compilation of haskell. PhD thesis, Massachusetts Institute of Technology.
11. Partain, W. D. (1992) The nofib benchmark suite of Haskell programs. Pages 195-202 of: Launchbury, J. and Sansom, P. M. (eds.), Functional Programming, Glasgow 1992. Workshops in Computing. Springer Verlag.
12. Peyton Jones, Simon, Ramsey, Norman & Reig, Fermin (1999) C - : a portable assembly language that supports garbage collection. Pages 1-28 of: Nadathur, G (ed.), International Conference on Principles and Practice of Declarative Programming. Lecture Notes in Computer Science, no. 1702. Berlin: Springer.
13. Peyton Jones, Simon L. (1992) Implementing lazy functional languages on stock hardware: The spineless tagless G-machine. Journal of Functional Programming, 2(2), 127-202.
14. Peyton Jones, S. L. (1992) Implementing lazy functional languages on stock hardware: The spineless tagless G-machine. Journal of Functional Programming, 2(2), 127-202.
15. Peyton Jones, S. L. & Launchbury, J. (1991) Unboxed values as first class citizens. Pages 636-666 of: Hughes, R. J. M. (ed.), ACM Conference on Functional Programming and Computer Architecture (FPCA'91). Lecture Notes in Computer Science, vol. 523. Boston: Springer Verlag.
16. Seward, Julian, (n.d.) Valgrind. http://valgrind.kde.org.