Skip to content
#

higher-order-functions

Here are 125 public repositories matching this topic...

In this article I try to explain why Haskell keeps being such an important language by presenting some of its most important and distinguishing features and detailing them with working code examples. The presentation aims to be self-contained and does not require any previous knowledge of the language.

  • Updated Jun 26, 2022
  • Haskell
olwmc
olwmc commented Jun 6, 2022

Since users are able to construct possibly error containing patters, we need to note in the documentation that things like:

structure B with
    data a.
    data b.
end

-- No structure "A" exists
let p = pattern A(x,y).
let *p = B(1,2)

are valid programs up until the pattern match is attempted on the last line. Note we have not defined A to be anything.

good first issue
mtso
mtso commented Oct 22, 2017

In the language of your choice, write an example of:

add(1)(2) // A function that returns a function value.
each([1, 2, 3], print) // A function that takes a function parameter.

Add [language name].[language extension] source file to the root.

For example:

// javascript.js

function add(x) {
  return function(y) { return x + y }
}

function each(list, callback) {

Improve this page

Add a description, image, and links to the higher-order-functions topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the higher-order-functions topic, visit your repo's landing page and select "manage topics."

Learn more