The University of York Department of Computer Science Programming Languages and Systems Group Unfailing Haskell Qualifying Dissertation

First Page		Document Content
Date: 2013-10-12 04:58:09 Software engineering Computer programming Declarative programming Functional languages Functional programming Recursion Higher-order functions Programming language comparisons Haskell Lazy evaluation ML Conditional		The University of York Department of Computer Science Programming Languages and Systems Group Unfailing Haskell Qualifying Dissertation Add to Reading List Source URL: community.haskell.org Download Document from Source Website File Size: 416,43 KB Share Document on Facebook

	What Did We Learn In Scala.Meta? Eugene Burmako ´ Ecole Polytechnique F´ ed´ DocID: 1rqNS - View Document
	Prajna: Cloud Service and Interactive Big Data Analytics (Distributed Platform Building Leverage Functional Programming) Jin Li, Sanjeev Mehrotra and Weirong Zhu Microsoft One Microsoft Way, Bld. 99, Redmond, WA, USA {ji DocID: 1rozx - View Document
	Proving Correctness via Free Theorems The Case of the destroy/build-Rule Janis Voigtl¨ander Technische Universit¨ at Dresden DocID: 1rlNb - View Document
	Guide2lhs2TeX (for versionRalf Hinze Computing Laboratory, University of Oxford Wolfson Building, Parks Road, Oxford, OX1 3QD, England DocID: 1rlg1 - View Document
	Deriving Generic Functions by Example Neil Mitchell University of York, UK http://www.cs.york.ac.uk/~ndm/ Abstract. A function is said to be generic if it operates over values of DocID: 1rghj - View Document