Comparing revisions for page Higher-order functions in Haskell

  == Headline ==

Lecture "Higher-order functions in Haskell" as part of [[Course:Lambdas in Koblenz]]

== Summary ==

[[Higher-order function]]s are functions that take functions as arguments or return functions as results. Much of the expressiveness and convenience of [[functional programming]] is a consequence of the status of functions to be first-class citizens. In this lecture, we focus on higher-order functions for [[list processing]], e.g., the [[map function]]. We also look at important related concepts such as [[partial application]] of functions or [[lambda abstraction]]s for constructing [[anonymous function]]s.

== Concepts ==

* [[Higher-order function]]
* [[Partial application]]
* [[Parametric polymorphism]]
* [[Map function]]
* [[Fold function]]
* [[Filter function]]
* [[Zip function]]
* [[Uncurrying]]
* [[Currying]]
* [[List comprehension]]
* [[Lambda abstraction]]

== Languages ==

* [[Language:Haskell]]

== Contributions ==

* [[Contribution:haskellEngineer|haskellEngineer]]: No higher-order functions
* [[Contribution:haskellList|haskellList]]: Leverage [[map function|map]] and [[sum function|sum]]
* [[Contribution:haskellLambda|haskellLambda]]: Leverage [[anonymous function]]s
* [[Contribution:haskellProfessional|haskellProfessional]]: Richer demonstration

== Metadata ==

* [[memberOf::Course:Lambdas in Koblenz]]
* [[dependsOn::Script:Data modeling in Haskell]]