Editing List of functional programming topics

{{Short description|none}}

This is a '''list of [[functional programming]] topics'''.

==Foundational concepts==

*[[Programming paradigm]]
*[[Declarative programming]]
*[[Mathematical programming|Programs as mathematical objects]]
*[[Function-level programming]]
*[[Purely functional programming]]
*[[Total functional programming]]
*[[Lambda programming]]
*[[scope (programming)|Static scoping]]
*[[Higher-order function]]
*[[Referential transparency]]

==Lambda calculus==
{{Further information|Lambda calculus}}
*[[Currying]]
*[[Lambda abstraction]]
*[[Church–Rosser theorem]]
*[[Extensionality]]
*[[Church numeral]]

==Combinatory logic==
{{Further information|Combinatory logic}}
*[[Fixed point combinator]]
*[[SKI combinator calculus]]
*[[B, C, K, W system]]
*[[SECD machine]]
*[[Graph reduction machine]]

==Intuitionistic logic==
{{Further information|Intuitionistic logic}}
*[[Sequent]], [[sequent calculus]]
*[[Natural deduction]]
*[[Intuitionistic type theory]]
*[[BHK interpretation]]
*[[Curry–Howard correspondence]]
*[[Linear logic]]
*[[Game semantics]]

==Type theory==
{{Further information|Type theory}}
*[[Typed lambda calculus]]
*[[Typed and untyped languages]]
*[[Type signature]]
*[[Type inference]]
*[[Datatype]]
*[[Algebraic data type]] ([[Generalized algebraic data type|generalized]])
*[[Type variable]]
*[[First-class value]]
*[[Polymorphism (computer science)|Polymorphism]]
*[[Calculus of constructions]]

==Denotational semantics==
{{Further information|Denotational semantics}}
*[[Domain theory]]
**Directed [[complete partial order]]
**[[Knaster–Tarski theorem]]

==Category theory==
{{Further information|Category theory}}
*[[Cartesian closed category]]
*[[Yoneda lemma]]

==Operational issues==

*[[Graph reduction]]
**[[Combinator graph reduction]]
*[[Strict programming language]]
*[[Lazy evaluation]], [[eager evaluation]]
*[[Speculative evaluation]]
*[[Side effect (computer science)|Side effect]]
*[[Assignment (computer science)|Assignment]]
**[[Setq]]
*[[Closure (computer programming)|Closure]]
*[[Continuation]]
*[[Continuation passing style]]
*[[Operational semantics]]
*[[State transition system]]
*[[Simulation preorder]]
*[[Bisimulation]]
*[[Monads in functional programming]]
*[[Exception handling]]
*[[Garbage collection (computer science)|Garbage collection]]

==Programming languages==
{{Further information|List of functional programming languages}}
*[[Clean (programming language)|Clean]]
*[[Clojure]]
*[[Elixir (programming language)|Elixir]]
*[[Erlang (programming language)|Erlang]]
*[[FP (programming language)|FP]]
*[[F Sharp programming language|F#]]
*[[Haskell]]
**[[Glasgow Haskell Compiler]]
**[[Gofer (programming language)|Gofer]]
**[[Hugs (interpreter)|Hugs]]
**[[Template Haskell]]
*[[ISWIM]]
*[[JavaScript]]
*[[Kent Recursive Calculator]]
*[[Lisp (programming language)|Lisp]]
**[[AutoLISP]]
**[[Common Lisp]]
**[[Emacs Lisp]]
**[[Scheme (programming language)|Scheme]]
*[[Mercury (programming language)|Mercury]]
*[[Miranda (programming language)|Miranda]]
*[[ML (programming language)|ML]] ([[:Category:ML programming language family]])
**[[OCaml]]
**[[Standard ML]]
*[[Pure (programming language)|Pure, predecessor Q]]
*[[Q (programming language from Kx Systems)]]
*[[Quantum programming]]
*[[Scala (programming language)|Scala]]
*[[SISAL]]
*[[Ωmega]]

[[Category:Functional programming| ]]
[[Category:Computing-related lists|Functional programming]]
[[Category:Outlines of computing and engineering|Functional programming topics]]
[[Category:Outlines|Functional programming topics]]