Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
List of functional programming topics
open-in-new
<h2 id="foundational-concepts">Foundational concepts</h2> <ul><li><a href="/facts/Programming_paradigm/7LwgRpB3">Programming paradigm</a></li> <li><a href="/facts/Declarative_programming/gogtdzcJ">Declarative programming</a></li> <li><a href="/facts/Mathematical_programming/oRn8Iv5I">Programs as mathematical objects</a></li> <li><a href="/facts/Function-level_programming/0uCybhfG">Function-level programming</a></li> <li><a href="/facts/Purely_functional_programming/am3DcNAd">Purely functional programming</a></li> <li><a href="/facts/Total_functional_programming/Eh2XhpDx">Total functional programming</a></li> <li><a href="/facts/Lambda_programming/DaD3RuQ4">Lambda programming</a></li> <li><a href="/facts/Scope_(programming)/bbj6AFMo">Static scoping</a></li> <li><a href="/facts/Higher-order_function/VjnjGbpt">Higher-order function</a></li> <li><a href="/facts/Referential_transparency/g0zARbAD">Referential transparency</a></li></ul> <h2 id="lambda-calculus">Lambda calculus</h2> <p class="note">Further information: <a href="/facts/Lambda_calculus/DaD3RuQ4">Lambda calculus</a></p> <ul><li><a href="/facts/Currying/AmD3PP5B">Currying</a></li> <li><a href="/facts/Lambda_abstraction/DaD3RuQ4">Lambda abstraction</a></li> <li><a href="/facts/Church%25E2%2580%2593Rosser_theorem/dkfn5o4K">Church–Rosser theorem</a></li> <li><a href="/facts/Extensionality/CwPNkVTW">Extensionality</a></li> <li><a href="/facts/Church_numeral/IlLPzswH">Church numeral</a></li></ul> <h2 id="combinatory-logic">Combinatory logic</h2> <p class="note">Further information: <a href="/facts/Combinatory_logic/D7NNo4xT">Combinatory logic</a></p> <ul><li><a href="/facts/Fixed_point_combinator/mRqKblYz">Fixed point combinator</a></li> <li><a href="/facts/SKI_combinator_calculus/VM0ND2yC">SKI combinator calculus</a></li> <li><a href="/facts/B%2c_C%2c_K%2c_W_system/rT4U0zwj">B, C, K, W system</a></li> <li><a href="/facts/SECD_machine/CaJq4ELV">SECD machine</a></li> <li><a href="/facts/Graph_reduction_machine/7FB2o9ht">Graph reduction machine</a></li></ul> <h2 id="intuitionistic-logic">Intuitionistic logic</h2> <p class="note">Further information: <a href="/facts/Intuitionistic_logic/zI7ulCnM">Intuitionistic logic</a></p> <ul><li><a href="/facts/Sequent/7YoB2hYb">Sequent</a>, <a href="/facts/Sequent_calculus/62NMylhL">sequent calculus</a></li> <li><a href="/facts/Natural_deduction/PPtgwoaJ">Natural deduction</a></li> <li><a href="/facts/Intuitionistic_type_theory/qwkrpKlP">Intuitionistic type theory</a></li> <li><a href="/facts/BHK_interpretation/Tm5t5LaF">BHK interpretation</a></li> <li><a href="/facts/Curry%25E2%2580%2593Howard_correspondence/Q3eVu60u">Curry–Howard correspondence</a></li> <li><a href="/facts/Linear_logic/NmFxFRWh">Linear logic</a></li> <li><a href="/facts/Game_semantics/FJSuV3un">Game semantics</a></li></ul> <h2 id="type-theory">Type theory</h2> <p class="note">Further information: <a href="/facts/Type_theory/xj0xzVqI">Type theory</a></p> <ul><li><a href="/facts/Typed_lambda_calculus/g86GP4uK">Typed lambda calculus</a></li> <li><a href="/facts/Typed_and_untyped_languages/cWTYbgWa">Typed and untyped languages</a></li> <li><a href="/facts/Type_signature/psEPS0UW">Type signature</a></li> <li><a href="/facts/Type_inference/vX9K8Qhf">Type inference</a></li> <li><a href="/facts/Datatype/fcx5hgVL">Datatype</a></li> <li><a href="/facts/Algebraic_data_type/Fn9KhnAb">Algebraic data type</a> (<a href="/facts/Generalized_algebraic_data_type/c2tQGjcq">generalized</a>)</li> <li><a href="/facts/Type_variable/72tpqsqS">Type variable</a></li> <li><a href="/facts/First-class_value/N6tFtEUU">First-class value</a></li> <li><a href="/facts/Polymorphism_(computer_science)/S3cCKsVT">Polymorphism</a></li> <li><a href="/facts/Calculus_of_constructions/whAjbfWY">Calculus of constructions</a></li></ul> <h2 id="denotational-semantics">Denotational semantics</h2> <p class="note">Further information: <a href="/facts/Denotational_semantics/yRs3ygRA">Denotational semantics</a></p> <ul><li><a href="/facts/Domain_theory/G1wRMK2K">Domain theory</a> <ul><li>Directed <a href="/facts/Complete_partial_order/a855Q53A">complete partial order</a></li> <li><a href="/facts/Knaster%25E2%2580%2593Tarski_theorem/QeXjysqQ">Knaster–Tarski theorem</a></li></ul></li></ul> <h2 id="category-theory">Category theory</h2> <p class="note">Further information: <a href="/facts/Category_theory/6zS3DXPa">Category theory</a></p> <ul><li><a href="/facts/Cartesian_closed_category/mPXAQps2">Cartesian closed category</a></li> <li><a href="/facts/Yoneda_lemma/j04vXd6x">Yoneda lemma</a></li></ul> <h2 id="operational-issues">Operational issues</h2> <ul><li><a href="/facts/Graph_reduction/8EsDncj4">Graph reduction</a> <ul><li><a href="/facts/Combinator_graph_reduction/8EsDncj4">Combinator graph reduction</a></li></ul></li> <li><a href="/facts/Strict_programming_language/6zaxXvdQ">Strict programming language</a></li> <li><a href="/facts/Lazy_evaluation/mD3DxDkc">Lazy evaluation</a>, <a href="/facts/Eager_evaluation/vLXH27zR">eager evaluation</a></li> <li><a href="/facts/Speculative_evaluation/AkA84o5n">Speculative evaluation</a></li> <li><a href="/facts/Side_effect_(computer_science)/AU3GlLzG">Side effect</a></li> <li><a href="/facts/Assignment_(computer_science)/kLevAoyJ">Assignment</a> <ul><li>Setq</li></ul></li> <li><a href="/facts/Closure_(computer_programming)/droP22Xn">Closure</a></li> <li><a href="/facts/Continuation/53gyBXrB">Continuation</a></li> <li><a href="/facts/Continuation_passing_style/lW296oxe">Continuation passing style</a></li> <li><a href="/facts/Operational_semantics/G24LXz6e">Operational semantics</a></li> <li><a href="/facts/State_transition_system/AABVmNzn">State transition system</a></li> <li><a href="/facts/Simulation_preorder/LuzmGlH3">Simulation preorder</a></li> <li><a href="/facts/Bisimulation/mqupHSps">Bisimulation</a></li> <li><a href="/facts/Monads_in_functional_programming/kYazRoF1">Monads in functional programming</a></li> <li><a href="/facts/Exception_handling/VrJxgb9r">Exception handling</a></li> <li><a href="/facts/Garbage_collection_(computer_science)/j2vlIu7g">Garbage collection</a></li></ul> <h2 id="programming-languages">Programming languages</h2> <p class="note">Further information: <a href="/facts/List_of_functional_programming_languages/XuWNoawk">List of functional programming languages</a></p> <ul><li><a href="/facts/Clean_(programming_language)/vvxRMVyz">Clean</a></li> <li><a href="/facts/Clojure/3JRNxKXx">Clojure</a></li> <li><a href="/facts/Elixir_(programming_language)/vX1J3cgf">Elixir</a></li> <li><a href="/facts/Erlang_(programming_language)/2PuxmzT3">Erlang</a></li> <li><a href="/facts/FP_(programming_language)/mwLQ3D6t">FP</a></li> <li><a href="/facts/F_Sharp_programming_language/jdXHnYz5">F#</a></li> <li><a href="/facts/Haskell/ydEsHuGy">Haskell</a> <ul><li><a href="/facts/Glasgow_Haskell_Compiler/4msB3KFN">Glasgow Haskell Compiler</a></li> <li><a href="/facts/Gofer_(programming_language)/bXkr6zhK">Gofer</a></li> <li><a href="/facts/Hugs_(interpreter)/yyuFwXVP">Hugs</a></li> <li><a href="/facts/Template_Haskell/bSFvCGdC">Template Haskell</a></li></ul></li> <li><a href="/facts/ISWIM/fSMk6YbA">ISWIM</a></li> <li><a href="/facts/JavaScript/XhhIIEsl">JavaScript</a></li> <li><a href="/facts/Kent_Recursive_Calculator/H7eXCENv">Kent Recursive Calculator</a></li> <li><a href="/facts/Lisp_(programming_language)/xJHA3CrX">Lisp</a> <ul><li><a href="/facts/AutoLISP/VQ7Hhmmk">AutoLISP</a></li> <li><a href="/facts/Common_Lisp/mq1pRbSF">Common Lisp</a></li> <li><a href="/facts/Emacs_Lisp/JHdBcPwM">Emacs Lisp</a></li> <li><a href="/facts/Scheme_(programming_language)/0aGdf3SC">Scheme</a></li></ul></li> <li><a href="/facts/Mercury_(programming_language)/4UDPmoxe">Mercury</a></li> <li><a href="/facts/Miranda_(programming_language)/t9A6GFYv">Miranda</a></li> <li><a href="/facts/ML_(programming_language)/RfwxASRF">ML</a> (Category:ML programming language family) <ul><li><a href="/facts/OCaml/ThBGLND8">OCaml</a></li> <li><a href="/facts/Standard_ML/4LaEq9tA">Standard ML</a></li></ul></li> <li><a href="/facts/Pure_(programming_language)/lbvsYKGz">Pure, predecessor Q</a></li> <li><a href="/facts/Q_(programming_language_from_Kx_Systems)/fz0gssCA">Q (programming language from Kx Systems)</a></li> <li><a href="/facts/Quantum_programming/oDpNfGSA">Quantum programming</a></li> <li><a href="/facts/Scala_(programming_language)/ebL8o6AK">Scala</a></li> <li><a href="/facts/SISAL/n8PmrsML">SISAL</a></li> <li><a href="/facts/%25CE%25A9mega/09IqaAJS">Ωmega</a></li></ul>