MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Under consideration for publication in J. Functional Programming 1 Constructed Product Result Analysis for Haskell

by Clem Baker-Finch The ,  Kevin Glynn ,  Simon Peyton Jones
Add To MetaCart

Abstract:

Compilers for ML and Haskell typically go to a good deal of trouble to arrange that multiple arguments can be passed eciently to a procedure. For some reason, less eort seems to be invested in ensuring that multiple results can also be returned eciently.

Citations

574 Compiling with Continuations – Appel - 1992
167 S.L.: Implementing lazy functional languages on stock hardware: The spineless tagless G-machine – Jones - 1992
161 Unboxed objects and polymorphic typing – Leroy - 1992
157 The revised report on the algorithmic language Scheme – Clinger, Rees - 1991
73 A transformation-based optimiser for Haskell. Science of Computer Programming – Jones, Santos - 1998
57 The nofib benchmark suite of Haskell programs – Partain - 1992
44 A semantics for imprecise exceptions – JONES, REID, et al. - 1999
34 Secrets of the Glasgow Haskell Compiler inliner – Jones, Marlow - 2002
33 An Open-source Memory Debugger for x86-GNU/Linux. available at URL http://developer.kde.org/ sewardj – Valgrind
32 The effectiveness of type-based unboxing – Leroy - 1997
15 Generalized boxings, congruences and partial inlining – Goubault - 1994
8 The system F of variable types, years later – Girard - 1986
6 Higher-order arity raising – Hannan, Hicks - 1998
6 Unboxed values as class citizens – Jones, S, et al. - 1991
4 An ecient implementation of multiple return values in Scheme – Ashley, Dybvig - 1994