Entities Mentioned
- Haskell
- Simon Peyton Jones
- Philip Wadler
- Don Stewart
- Simon Marlow
- ACM Press
- Cambridge University Press
- Neil Mitchell
- Duncan Coutts
- MIT Press
- John Launchbury
- Colin Runciman
- Tony Hoare
- University of Glasgow
- Matthew Naylor
- Symbolic Computation
- John Meacham
- Andrew Tolmach
- Will Partain
- Dimitry Golubovsky
- Thomas Johnsson
- Roman Leshchinskiy
Authors
-
Neil Mitchell and Colin Runciman
University of York, UK, http://www.cs.york.ac.uk/~ndm
Abstract. Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges for optimising compilers. We report practical experiments using novel variants of supercompilation, with special attention to let bindings and the generalisation technique. Results include (Read Full Article)
Related Articles
- Haskell Weekly News: October 25, 2007
- also mentions Colin Runciman
- The Other Prelude - HaskellWiki
- also written by vlad_hash
- TyingTheKnot
- also written by vlad_hash
- Defanging the Multi-Core Werewolf
- also mentions Tony Hoare
- Neil Mitchell - Supero
- also published in www-users.cs.york.ac.uk
- Haskell (programming language)
- also mentions Philip Wadler
- The Comonad.Reader " Generalizing (.)
- also written by vlad_hash
- Rubrication " Verifying the Monad Laws with Supercompilation
- also written by vlad_hash
- Algorithms and Data Structures
- also written by vlad_hash
- Neil Mitchell - Tag Soup
- also published in www-users.cs.york.ac.uk





