Difference between revisions of "Template:Functional programming basics"
Jump to navigation
Jump to search
imported>Ancheta Wis (test) |
imported>Ancheta Wis (+1) |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 2: | Line 2: | ||
|name = Functional programming basics | |name = Functional programming basics | ||
|title = [[Functional programming ]] | |title = [[Functional programming ]] | ||
| − | + | ||
| − | |||
*[[Abstract rewriting system]] | *[[Abstract rewriting system]] | ||
*[[Ad hoc polymorphism]] | *[[Ad hoc polymorphism]] | ||
| Line 15: | Line 14: | ||
*[[Canonical form]] | *[[Canonical form]] | ||
*[[Categorical abstract machine]] | *[[Categorical abstract machine]] | ||
| − | *[[Codomain]] | + | *[[Codomain]] |
| − | |||
| − | |||
*[[Constructivism (philosophy of mathematics)]] | *[[Constructivism (philosophy of mathematics)]] | ||
*[[Continuation-passing style]] | *[[Continuation-passing style]] | ||
| Line 26: | Line 23: | ||
*[[Domain-specific language]] | *[[Domain-specific language]] | ||
*[[Effect system]] | *[[Effect system]] | ||
| − | *[[Exponential object]] | + | *[[Exponential object]] |
| − | |||
| − | |||
*[[Expression (computer science)]] | *[[Expression (computer science)]] | ||
*[[Expression (mathematics)]] | *[[Expression (mathematics)]] | ||
| Line 39: | Line 34: | ||
*[[Higher-order function]] | *[[Higher-order function]] | ||
*[[Higher-order logic]] | *[[Higher-order logic]] | ||
| − | + | *[[Intuitionistic type theory]] | |
| − | |||
| − | |||
*[[Intuitionistic logic]] | *[[Intuitionistic logic]] | ||
*[[Kan extension]] | *[[Kan extension]] | ||
| − | *[[Lambda calculus definition]] | + | *[[Lambda calculus definition]] |
| − | *[[ | + | *[[Lambda lifting]] |
| − | |||
| − | |||
| − | |||
| − | |||
*[[Miranda (programming language)]] | *[[Miranda (programming language)]] | ||
*[[Monad (functional programming)]] | *[[Monad (functional programming)]] | ||
*[[Natural_deduction#Judgments_and_propositions]] | *[[Natural_deduction#Judgments_and_propositions]] | ||
| − | |||
*[[Normal form (abstract rewriting)]] | *[[Normal form (abstract rewriting)]] | ||
*[[Partial application]] | *[[Partial application]] | ||
| Line 75: | Line 63: | ||
*[[Tail call]] | *[[Tail call]] | ||
*[[Thunk]] | *[[Thunk]] | ||
| − | *[[Topos]] | + | *[[Topos]] |
| − | |||
| − | |||
*[[Type class]] | *[[Type class]] | ||
*[[Type constructor]] | *[[Type constructor]] | ||
| Line 84: | Line 70: | ||
*[[Type theory]] | *[[Type theory]] | ||
*[[Unified Modeling Language]] | *[[Unified Modeling Language]] | ||
| − | + | ||
}}<noinclude>{{Documentation|content= | }}<noinclude>{{Documentation|content= | ||
| Line 94: | Line 80: | ||
[[Category:Programming language templates|{{PAGENAME}}]] | [[Category:Programming language templates|{{PAGENAME}}]] | ||
}}</noinclude> | }}</noinclude> | ||
| + | <!-- | ||
| + | *[[Complete partial order Cont]] | ||
| + | *[[Hindley–Milner t s]] | ||
| + | *[[Abstract mach Info]] | ||
| + | |||
| + | *[[Expression evaluation]] | ||
| + | |||
| + | |||
| + | *[[Abstract_machine#Information]] | ||
| + | *[[Complete_partial_order#Continuous_functions_and_fixpoints]] | ||
| + | *[[Hindley–Milner type system#Hindley–Milner_type_inference_algorithm]] | ||
| + | *[[Lambda_calculus#The_lambda_calculus]] | ||
| + | *[[Lambda_cube#System_F]] | ||
| + | *[[Lambda_lifting#Let_expressions_and_lambda_calculus]] | ||
| + | *[[Lazy_evaluation#Laziness_and_eagerness] | ||
| + | *[[Linear_logic#Sequent_calculus_presentation]] | ||
| + | *[[Turnstile_(symbol)#Interpretations]]*[[Complete_partial_order#Continuous_functions_and_fixpoints]] | ||
| + | --> | ||
Latest revision as of 12:11, 28 March 2019
| Editors can experiment in this template's sandbox (create | mirror) and testcases (create) pages. Subpages of this template. |