Category:Functional programming

C

• ► Combinatory logic‎ (1 C, 8 P)

D

• ► Dependently typed programming‎ (2 C, 11 P)

F

• ► Functional data structures‎ (4 P)
• ► Functional languages‎ (8 C, 123 P)

H

• ► Higher-order functions‎ (9 P)

I

• ► Implementation of functional programming languages‎ (2 C, 18 P)

L

• ► Lambda calculus‎ (3 C, 49 P)

R

• ► Recursion schemes‎ (7 P)

• Functional programming

A

• A-normal form
• Actant
• Algebraic data type
• Anonymous function
• Append
• Apply
• Arrow (computer science)

B

• Brouwer–Heyting–Kolmogorov interpretation

C

• Catamorphism
• Coinduction
• Cons
• Constructed product result analysis
• Continuation-passing style
• Corecursion
• Currying

F

• F-algebra
• First-class function
• Frenetic (programming language)
• Functional logic programming
• Functional reactive programming

G

• Generalized algebraic data type
• GNU Guix
• Graph reduction machine

H

• Higher-order function

I

• Immutable object
• Inductive functional programming
• Initial algebra
• International Conference on Functional Programming
• Iteratee

J

• Journal of Functional Programming

L

• List of functional programming topics
• Lout (software)

M

• Erik Meijer (computer scientist)
• Monad (functional programming)
• Monad transformer

N

• Nix package manager

O

• Option type

P

• Parser combinator
• Partial application
• Pattern matching
• Simon Peyton Jones
• Polymorphism (computer science)
• Pure function
• Purely functional

Q

• Quark Framework

R

• Regular number

S

• SequenceL
• Side effect (computer science)
• Skew binary number system
• Supercombinator
• System F-sub

T

• Thunk
• Total functional programming
• Type class
• Type family
• Type variable

W

• Philip Wadler

Z

• Zipper (data structure)