Category:Glossary

Categories: Haskell

Definitions of the nomenclature specific to Haskell and functional programming.

Articles in category "Glossary"

There are 79 articles in this category.

A Abbreviations Ad-hoc polymorphism Algebraic data type Alpha conversion Anonymous function Applicative functor B Beta reduction Bottom C Camel case Closure Combinator Comparison of functional programming languages Concrete data type Confluent term rewriting system Constant applicative form Continuation Currying D Deforestation Dynamic E EDSL Eager evaluation Embedded domain specific language Error Eta conversion Exception Existential type

F Fold Free expression Free variable Function Function composition Function inlining Function unfolding Functional dependencies Functional programming/Old version G Garbage collector Generalised algebraic datatype H Heterogenous collections Higher order function I Infix operator Iterate L Lambda abstraction Lambda calculus Lazy evaluation List comprehension Literate programming M Maximal free expression Memory leak Monad (sans metaphors) Monomorphism Monomorphism restriction Multi-parameter type class Mutually recursive modules

N Non-strict semantics P Partial application Pattern guard Peano numbers Phantom type Polymorphism R Recursion in a monad Reducible expression Refactoring Referential transparency Reified type S Section of an infix operator Sharing Short cut fusion Short-circuiting Smart constructors Strict semantics Studly capitals Super combinator T Tail recursion Thunk Type class Type inference Type synonym Typing V Variable

Recent content is available under a simple permissive license.