Skip to content
This repository has been archived by the owner on Jan 19, 2023. It is now read-only.

Latest commit

 

History

History
46 lines (38 loc) · 1.75 KB

haskell.org

File metadata and controls

46 lines (38 loc) · 1.75 KB

Haskell

Notes

Normal form

We say that expressions are in normal form when there are no more evaluation step that can be taken, or, put differently, when they’ve reached an irreducible form.

Syntax

The syntax of a function can be read like this:

   triple x = x * 3
-- o----o o   o---o

Being the triple the name of the function, the first x the parameter, and the body of the function is everything that is in the right of the equal sign.

Books

  • Haskell Programming from First Principles

Links

Quchen’s articles

Haskell implementations of type inference algorithms

References

Related

  • Functional programming
  • Lambda Calculus