Compilation by Transformation in Non-Strict Functional Languages (1995)

Cached

Download Links

by André L. de M. Santos
Citations:32 - 1 self

Documents Related by Co-Citation

84 A transformation-based optimiser for Haskell – Simon L. Peyton Jones, André L M Santos - 1998
20 Measuring the Effectiveness of a Simple Strictness Analyser – Simon Peyton Jones, Will Partain - 1993
54 Let-Floating: Moving Bindings to Give Faster Programs – Simon Peyton Jones, Will Partain, et al. - 1997
403 Deforestation: Transforming programs to eliminate trees – Philip Wadler - 1990
107 Unboxed values as first class citizens in a non-strict functional language – Simon L Peyton Jones, John Launchbury - 1991
625 Compiling With Continuations – A W Appel - 1992
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
540 The Implementation of Functional Programming Languages – Peyton Jones, S L - 1987
1312 Monads for functional programming – Philip Wadler - 1995
31 Expressing and reasoning about non-deterministic functional programs – J Hughes, J O'Donnel - 1989
43 Non-Determinism in Functional Languages – H Sondergaard, P Sestoft - 1992
5 Optimizing Eden by Transformation – Cristóbal Pareja, Ricardo Peña, Fernando Rubio, O Rubio, Clara Segura - 2000
81 Once Upon a Type – David Turner, Philip Wadler, Christian Mossin - 1995
72 GUM: a portable parallel implementation of Haskell – P.W. Trinder, K. Hammond, J.S. Mattson Jr., A.S. Partridge, S.L. Peyton Jones - 1996
38 Once Upon a Polymorphic Type – Keith Wansbrough, Simon Peyton Jones - 1998
36 Strictness analysis for higher order functions – G Burn, C Hankin, S Abramsky - 1986
260 Compiling polymorphism using intensional type analysis – Robert Harper, Greg Morrisett - 1995
171 Unboxed Objects and Polymorphic Typing – Xavier Leroy - 1992
64 Cheap Deforestation for Non-strict Functional Languages – Andrew John Gill, Andrew John Gill - 1996