c ACM, 2009. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. ° Not for redistribution. The definitive version was published in the Proceedings of the Haskell Sym

First Page		Document Content
Date: 2013-10-12 04:58:09 Lambda calculus Functional programming Subroutines Formal methods Theoretical computer science Combinatory logic Let expression Lambda lifting Anonymous function Monad Closure Partial application		c ACM, 2009. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. ° Not for redistribution. The definitive version was published in the Proceedings of the Haskell Sym Add to Reading List Source URL: community.haskell.org Download Document from Source Website File Size: 224,67 KB Share Document on Facebook

	Uniqueness Typing Redefined Edsko de Vries?1 , Rinus Plasmeijer2 , and David M Abrahamson1 1 2 Trinity College Dublin, Ireland, {devriese,david}@cs.tcd.ie DocID: 1qPrx - View Document
	A Supercompiler for Core Haskell 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 ev DocID: 1quWn - View Document
	Supero: Making Haskell Faster 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 evalu DocID: 1qtvY - View Document
	Tool Supported OCL Refactoring Catalogue Jan Reimann, Claas Wilke, Birgit Demuth, Michael Muck, Uwe Aßmann Technische Universität Dresden Institut für Software- und Multimediatechnik D-01062, Dresden, Germany DocID: 1qh1X - View Document
	Hammell et alFigure 3 DocID: 1q5jN - View Document