Difference between revisions of "Template:Functional programming basics"
Jump to navigation
Jump to search
imported>Ancheta Wis (test) |
imported>Ancheta Wis (restore) |
||
| Line 2: | Line 2: | ||
|name = Functional programming basics | |name = Functional programming basics | ||
|title = [[Functional programming ]] | |title = [[Functional programming ]] | ||
| + | <!-- | ||
*[[Complete partial order Cont]] | *[[Complete partial order Cont]] | ||
*[[Hindley–Milner t s]] | *[[Hindley–Milner t s]] | ||
*[[Abstract mach Info]] | *[[Abstract mach Info]] | ||
| − | + | --> | |
*[[Abstract_machine#Information]] | *[[Abstract_machine#Information]] | ||
*[[Complete_partial_order#Continuous_functions_and_fixpoints]] | *[[Complete_partial_order#Continuous_functions_and_fixpoints]] | ||
| Line 82: | Line 83: | ||
*[[Type theory]] | *[[Type theory]] | ||
*[[Unified Modeling Language]] | *[[Unified Modeling Language]] | ||
| − | + | ||
}}<noinclude>{{Documentation|content= | }}<noinclude>{{Documentation|content= | ||
Revision as of 16:01, 27 March 2019
{{Navbox |name = Functional programming basics |title = Functional programming
- 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
- Abstract rewriting system
- Ad hoc polymorphism
- Algebraic data type
- Anonymous function
- Aspect-oriented programming
- Alpha equivalence
- Beta reduction
- Eta conversion
- Calculus of constructions
- Canonical form
- Categorical abstract machine
- Codomain
- Constructivism (philosophy of mathematics)
- Continuation-passing style
- Curry-Howard isomorphism
- Currying
- Declarative programming
- Denotational semantics
- Domain-specific language
- Effect system
- Exponential object
- Expression evaluation
- Expression (computer science)
- Expression (mathematics)
- First-class citizen
- Function type
- Girard-Reynolds isomorphism
- Graph rewriting
- Hash consing
- Higher-order abstract syntax
- Higher-order function
- Higher-order logic
- Intuitionistic type theory
- Intuitionistic logic
- Kan extension
- Lambda calculus definition
- Miranda (programming language)
- Monad (functional programming)
- Natural_deduction#Judgments_and_propositions
- Normal form (abstract rewriting)
- Partial application
- Partial function
- Partially ordered set
- Pointfree programming
- Polymorphism (computer science)
- Purely functional data structures
- Purely functional programming
- Rewriting
- Scott continuity
- Sequent
- Sequent calculus
- SECD machine
- Side effect (computer science)
- Strictness analysis
- Subobject classifier
- Supercombinator
- Syntactic closure
- System F
- Tail call
- Thunk
- Topos
- Type class
- Type constructor
- Type inference
- Type system
- Type theory
- Unified Modeling Language
}}
| Editors can experiment in this template's sandbox (create | mirror) and testcases (create) pages. Subpages of this template. |