List of functional programming topics: Difference between revisions

Revision as of 14:21, 11 October 2016

Revision as of 06:45, 23 January 2017

Line 12:

*[[scope (programming)|Static scoping]]

*[[Higher-order function]]

*[[Referential transparency (computer science)|Referential transparency]]

==[[Lambda calculus]]==

==[[Lambda calculus]]==

{{Further information|Lambda calculus}}

*[[Currying]]

*[[Lambda abstraction]]

*[[Church-RosserChurch–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]]

*[[Curry–Howard]]

*[[Linear logic]]

*[[Game semantics]]

==[[Type theory]]==

{{Further information|Type theory}}

*[[Typed lambda calculus]]

*[[Typed and untyped languages]]

Line 53:

*[[Calculus of constructions]]

==[[Denotational semantics]]==

{{Further information|Denotational semantics}}

*[[Domain theory]]

**[[Directed [[complete partial order]]

**[[Knaster–TarskiKnaster–Tarski theorem]]

==[[Category theory]]==

==[[Category theory]]==

*[[Cartesian-closed category]]

{{Further information|Category theory}}

*[[Cartesian- closed category]]

*[[Yoneda lemma]]

Line 68:

*[[Graph reduction]]

**[[Combinator graph reduction]]

*[[Non-strictStrict programming language]]

*[[Lazy evaluation]], [[eager evaluation]]

*[[Speculative evaluation]]

*[[Side- effect (computer science)|Side- effect]]

*[[Assignment (computer science)|Assignment]]

**[[Setq]]

*[[Closure (computer scienceprogramming)|Closure]]

*[[Continuation]]

*[[Continuation passing style]]

Line 83:

*[[Monads in functional programming]]

*[[Exception handling]]

*[[Garbage collection (computer science)|Garbage collection]]

==Programming languages==

==Languages==

*[[Abstract Rewritingrewriting Machinemachine]]

*[[Clean (programming language)|Clean]]

*[[Clojure|Clojure programming language]]

*[[Elixir (programming language)|Elixir]]
*[[Erlang (programming language)|Erlang]]

*[[ErlangFP (programming language)|FP]]

*[[FPF Sharp programming language|F#]]

*[[F SharpHaskell (programming language)|F# programming languageHaskell]]

*[[Haskell (programming language)|Haskell programming language]]

**[[Glasgow Haskell Compiler]]

**[[Gofer (softwareprogramming language)|Gofer]]

**[[Hugs]]

**[[Template Haskell]]

Line 102:

*[[JavaScript]]

*[[Kent Recursive Calculator]]

*[[Kogut]]
*[[Lisp (programming language)|Lisp]]

*[[Lisp programming language|Lisp]]

**[[AutoLISP]]

**[[Common Lisp]]

**[[Emacs Lisp]]

**[[Scheme (programming language)|Scheme]]
**[[Lush (programming language)|Lush]]

**[[LushMercury (programming language)|Lush programming languageMercury]]

*[[MercuryMiranda (programming language)|Miranda]]

*[[MirandaML (programming language)|ML]] ([[:Category:ML programming language family]])

*[[ML programming language]] ([[:Category:ML programming language family]])

**[[Mythryl]]

**[[OCaml]]

**[[Standard ML]]

*[[Pure (programming language)|Pure, predecessor Q]]

*[[Q (equational programming language)]]

*[[Q (programming language from Kx Systems)]]

*[[Quantum programming]]

*[[Scala (programming language)|Scala programming language]]

*[[SISAL]]

*[[Ωmega]]