Category:Glossary

A

• Abbreviations
• Abstract data type
• 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
• DSL
• Dynamic

E

• Eager evaluation
• EDSL
• Embedded domain specific language
• Error
• Eta conversion
• Exception
• Existential type

F

• Fold
• Free expression
• Free monad
• Free structure

F cont.

• 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

• Import
• Impredicative types
• Infix operator
• Iterate

L

• Lambda abstraction
• Lambda calculus
• Lazy evaluation
• Lazy pattern match
• 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

• Parallel/Glossary
• Partial application

P cont.

• Partial functions
• Pattern guard
• Peano numbers
• Phantom type
• Polymorphism
• Pure

R

• Recursion in a monad
• Reducible expression
• Refactoring
• Referential transparency
• Reified type

S

• Scoped type variables
• Section of an infix operator
• Seq
• Sharing
• Short cut fusion
• Short-circuiting
• Smart constructors
• Strict semantics
• Studly capitals
• Super combinator

T

• Tail recursion
• Terms
• Thunk
• Type class
• Type inference
• Type signature
• Type synonym
• Typing

V

• Variable

関

• 関数