<--- Back to Details
First PageDocument Content
Software engineering / Computer programming / Declarative programming / Higher-order functions / Programming language comparisons / Fold / Recursion / Haskell / Tak / Map / Haskell features
Date: 2016-04-19 09:56:22
Software engineering
Computer programming
Declarative programming
Higher-order functions
Programming language comparisons
Fold
Recursion
Haskell
Tak
Map
Haskell features

Supero: Making Haskell Faster

Add to Reading List

Source URL: ndmitchell.com

Download Document from Source Website

File Size: 80,97 KB

Share Document on Facebook

Similar Documents

Software engineering / Computing / Computer programming / Functional languages / Scala / Programming language comparisons / Map

What Did We Learn In Scala.Meta? Eugene Burmako ´ Ecole Polytechnique F´ ed´

DocID: 1rqNS - View Document

Computing / Software engineering / Computer programming / Higher-order functions / Programming language comparisons / Parallel computing / Apache Software Foundation / Fold / Recursion / Apache Spark / MapReduce / Map

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

Software engineering / Computer programming / Declarative programming / Higher-order functions / Programming language comparisons / Recursion / Fold / FO / Haskell features / Standard ML

Proving Correctness via Free Theorems The Case of the destroy/build-Rule Janis Voigtl¨ander Technische Universit¨ at Dresden

DocID: 1rlNb - View Document

Software engineering / Computer programming / Computing / Higher-order functions / Programming language comparisons / Map / Haskell / Fold / TeX / Comment / Directive / Literate programming

Guide2lhs2TeX (for versionRalf Hinze Computing Laboratory, University of Oxford Wolfson Building, Parks Road, Oxford, OX1 3QD, England

DocID: 1rlg1 - View Document

Software engineering / Computer programming / Declarative programming / Functional programming / Data types / Programming language comparisons / Type theory / Higher-order functions / Fold / Generic programming / Map / Type class

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