Wikipedia

Comparison of functional programming languages: Difference between revisions

Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
Added PureScript; just let me know if references are necessary given its wikipedia page already has them. (Justification: PureScript is very much like Elm which is already on here, but is even more similar to Haskell, having type classes for example)
OAbot (talk | contribs)
Bots
643,717 edits
m Open access bot: url-access updated in citation with #oabot.
 
(62 intermediate revisions by 17 users not shown)
Line 1:
{{Short description|none}}
{{Orphan|date=July 2016}}
 
The table shows a '''comparison of functional programming languages''' which compares various features and designs of different [[functional programming]] languages.
Line 5:
{| class="wikitable sortable"
|-
! Name !! [[PurePurely functional programming|Pure]] !! [[Lazy Evaluationevaluation]] !! [[Type system|Typing]] !! [[Abstract Datadata Typetype]]s !! [[Algebraic Datadata Typetype]]s !! [[ImmutabilityImmutable object|Data is Immutableimmutable]] !! [[Type Classclass]]es !! [[ClosureGarbage (computercollection programming)|Closures]]| First appeared
|-
| [[Common Lisp]] || {{No}}<ref name=math-cs.gordon.edu>{{cite web|title=LISP Introduction|url=http://www.math-cs.gordon.edu/courses/cps323/LISP/lisp.html|access-date=26 November 2013}}</ref> || {{Partial}}, simulated|Simulated with [[thunk]]s<ref name=common-lisp>{{cite web|last=Antoniotti|first=Marco|title=CLAZY: Lazy Calling in Common Lisp|url=http://common-lisp.net/project/clazy/|access-date=26 November 2013}}</ref>}} || style="background:#FC6; text-align:center"|Dynamic<ref>{{cite journal|last=Tratt|first=Laurence|title=Dynamically Typed Languages|journal=Advances in Computers|date=July 2009|volume=77|pages=149–184|url=http://tratt.net/laurie/research/pubs/html/tratt__dynamically_typed_languages/|access-date=26 November 2013|doi=10.1016/s0065-2458(09)01205-4|url-access=subscription}}</ref>|| {{Yes}}<ref name=cs.sfu.ca>{{cite web|title=LISP Tutorial Lecture 3: Data Abstraction|url=http://www.cs.sfu.ca/CourseCentral/310/pwfong/Lisp/3/tutorial3.html}}</ref> || {{Partial|Extension}}, with extension<ref>{{cite web|title=Algebraic data types in Common Lisp|website=[[GitHub]] |url=https://github.com/stylewarning/cl-algebraic-data-type|access-date=11 May 2020}}</ref> || {{No}}<ref>{{cite web|title=Mutable Data Structures|url=http://caml.inria.fr/pub/docs/fpcl/fpcl-07.pdf|access-date=28 November 2013}}</ref> || {{NoDunno}} || {{Yes}}<ref>{{cite web|title=Closures in Lisp|url=http://psg.com/~dlamkins/sl/chapter15.html|access-date=6 December 2013|archive-url=https://web.archive.org/web/20141012051738/http://www.psg.com/~dlamkins/sl/chapter15.html|archive-date=12 October 2014|url-status=dead}}</ref> 1984
|-
| [[Scheme (programming language)|Scheme]] || {{No}}<ref name=caml.inria.fr>{{cite web|title=Similar Functional Languages|url=http://caml.inria.fr/pub/docs/oreilly-book/html/book-ora202.html|access-date=26 November 2013}}</ref> || {{Yes}}<ref>{{cite web|title=(Scheme) 17. Lazy Evaluation|url=http://www.shido.info/lisp/scheme_lazy_e.html|access-date=30 April 2020}}</ref> || style="background:#FC6; text-align:center"|Dynamic<ref name="caml.inria.fr" /> || {{Yes}}<ref>{{cite web|title=Records - Revised<sup>6</sup> Report on the Algorithmic Language Scheme|url=http://www.r6rs.org/final/html/r6rs-lib/r6rs-lib.html|access-date=11 May 2020}}</ref> || {{Partial}}, simulated|Simulated with thunks}}<ref>{{cite web|title=Algebraic Data Types in Scheme|url=https://pavpanchekha.com/blog/adtscm.html|access-date=11 May 2020}}</ref> || {{No}}<ref>{{cite web|title=Programs with State|url=http://www.cs.uni.edu/~wallingf/teaching/cs3540/sessions/session26.html|access-date=29 November 2013}}</ref>|| {{No}} || {{Yes}}<ref>{{cite web|title=Procedures| as Closures in Scheme|url=http://icem-www.folkwang-hochschule.de/~finnendahl/cm_kurse/doc/schintro/schintro_122.html#SEC152}}</ref>1975
|-
| [[Racket (programming language)|Racket]] || {{No}} || {{YesYes2}}, defaultDefault in Lazy Racket<ref name="lazy racket">{{cite web|url=https://docs.racket-lang.org/lazy/index.html|title=Lazy Racket|access-date=8 February 2020|first=Eli|last=Barzilay}}</ref> || style="background:#99F; text-align:center"|Dynamic by default, [[gradual typing|gradual]] with Typed Racket<ref name="typed racket">{{cite web|url=https://docs.racket-lang.org/ts-reference/index.html|title=Typed Racket|access-date=8 February 2020|first1=Sam|last1=Tobin-Hochstadt|first2=Vincent|last2=St-Amour|first3=Eric|last3=Dobson|first4=Asumu|last4=Takikawa}}</ref> || {{Yes}}<ref name="racket struct">{{cite web|url=https://docs.racket-lang.org/guide/define-struct.html|title=The Racket Guide: Programmer-Defined Datatypes|access-date=8 February 2020}}</ref> || {{Yes2}}Yes, with Algebraic Racket<ref name="algebraic racket">{{Cite web|url=https://docs.racket-lang.org/algebraic/index.html|title=Algebraic Racket|access-date=8 February 2020|first=Eric|last=Griffis}}</ref> || {{partialPartial}}<ref name="racket immutability">{{Cite web|url=https://beautifulracket.com/explainer/data-structures.html|title=Beautiful Racket: Data Structures|access-date=8 February 2020|first=Matthew|last=Buttrick}}</ref> || {{No}} || {{Yes}}<ref name="racket closure">{{Cite web|url=https://docs.racket-lang.org/reference/procedures.html|title=The Racket Reference: Procedures|access-date=8 February 2020}}</ref>1995
|-
| [[Clojure]] || {{No}}<ref>{{cite web|title=Clojure Functional Programing|url=http://clojure.org/functional_programming}}</ref> || {{Yes}}<ref>{{cite web|title=Clojure - lazy|url=http://clojure.org/lazy|access-date=27 November 2013}}</ref> || style="background:#FC6; text-align:center"|Dynamic<ref>{{cite web|title=Exploring clojure: dynamic typing|date=7 December 2012 |url=http://tgoossens.wordpress.com/2012/12/07/dynamically-exploring-clojure/|access-date=26 November 2013}}</ref> || {{Yes}}<ref>{{cite web|last=Engelberg|first=Mark|title=Thoughts On Programming|date=21 April 2009 |url=http://programming-puzzler.blogspot.com/2009/04/adts-in-clojure.html|access-date=26 November 2013}}</ref> || {{Yes}}<ref name="clojure-contrib">{{cite web|title=clojure-contrib, typing example|url=https://code.google.com/p/clojure-contrib/source/browse/trunk/src/clojure/contrib/types/examples.clj?spec=svn596&r=596|access-date=26 November 2013}}</ref> || {{Yes}}<ref name=clojure.org>{{cite web|title=clojure: functional programming overview|url=http://clojure.org/functional_programming|access-date=26 November 2013}}</ref> || {{No}} || {{Yes}}<ref>{{cite web | title=Clojure - Higher Order Functions | url=https://clojure.org/guides/higher_order_functions}}</ref>2007
|-
| [[Standard ML]] || {{No}}<ref name=cl.cam.ac.uk>{{cite web|title=Introduction to Functional Programming|url=http://www.cl.cam.ac.uk/~jrh13/slides/funprog-jrh/l8.pdf|access-date=26 November 2013}}</ref> || {{No}}<ref>{{cite web|title=Lazy and Eager Evaluation|url=http://homepages.inf.ed.ac.uk/dts/fps/lecture-notes/lazy.pdf|access-date=26 November 2013}}</ref><ref>{{cite web|last=Harper, MacQueen, Milner|title=Standard ML|url=http://www.lfcs.inf.ed.ac.uk/reports/86/ECS-LFCS-86-2/ECS-LFCS-86-2.pdf|work=Section 3.6}}</ref> || style="background:#8CF; text-align:center"|Static<ref>[[Wikibooks:Standard ML Programming/Types]]</ref> || {{dunnoYes}} || {{dunnoYes}}|| {{Yes}}<ref name="courses">{{cite web|title=Mutable and optional data|url=http://courses.cs.washington.edu/courses/cse341/04wi/lectures/08-ml-refs.html|access-date=28 November 2013}}</ref> || {{dunnoNo}} || {{Yes}} || 1983
|-
| [[Lazy MLOCaml]] || {{YesNo}}<ref name=journals.cambridge.orgocaml-functional>{{cite web|title=TheFunctional InteractiveProgramming Lazy– ML SystemOCaml|url=http://journals.cambridgeocaml.org/actionlearn/displayFulltext?type=1&fid=2585068&jid=JFP&volumeId=3&issueId=01&aid=1322252tutorials/functional_programming.html|access-date=1526 DecemberNovember 2013}}</ref> || {{Yes2Yes}}Default<ref name="journals.cambridge.org"ocaml-functional /> || style="background:#8CF; text-align:center"|Static<ref>{{cite web|last=Hickey|first=Jason|title=A CompilerIntroduction forto LazyObjective MLCaml|url=http://dlfiles.acmmetaprl.org/citationdoc/ocaml-book.cfm?idpdf|work=800055Section 2.8020384|publisher=Cambridge University Press|access-date=1526 DecemberNovember 2013|url-status=dead|archive-url=https://web.archive.org/web/20131002091023/http://files.metaprl.org/doc/ocaml-book.pdf|archive-date=2 October 2013}}</ref> || {{dunnoYes}}<ref>{{cite web|title=Type and exception definitions|url=http://caml.inria.fr/pub/docs/manual-ocaml-4.00/manual016.html}}</ref> || {{dunnoYes}}<ref>{{cite web|url=http://ocaml.org/learn/description.html#DataTypes| title=Learn OCaml - Data Types}}</ref> || {{Yes}}<ref>{{cite nameweb|url="courses"http://ocaml.org/learn/description.html#Imperativefeatures | title=Learn OCaml - Imperative Features}}</ref> || {{dunnoPartial|Simulated with parametric modules}}<ref>{{cite web|title=Implementing Type-Classes as OCaml Modules|url=https://accu.org/index.php/journals/2445|access-date=11 May 2020}}</ref> || {{Yes}} || 1996
|-
| [[OCamlF Sharp (programming language)|F#]] || {{No}}<ref name=ocaml-functional>{{cite web |title=Functional Programming – OCaml|url=http://ocamlfsharpforfunandprofit.orgcom/learnlearning-fsharp/tutorials/functional_programming.html| access-date=266 NovemberDecember 2013 | title=Learning F#}}</ref> || {{Yes}}<ref name=ocaml-functional /> || style="background:#8CF; text-align:centermsdn"|Static<ref>{{cite web|last=Hickey|first=Jason|title=IntroductionLazy toComputations Objective Caml(F#)|url=http://filesmsdn.metaprlmicrosoft.orgcom/docen-us/ocaml-booklibrary/vstudio/dd233247.pdf|work=Section 2.4aspx|publisher=CambridgeMicrosoft UniversityDeveloper PressNetwork|access-date=26 November 2013}}</ref> |url| style="background:#8CF; text-statusalign:center"|Static<ref>{{cite web|title=deadAbout F#|archive-url=https://web.archive.org/web/20131002091023/http://files.metaprlfsharp.org/docabout/ocaml-bookindex.pdfhtml|archiveaccess-date=226 OctoberNovember 2013}}</ref> || {{Yes}}<ref>{{cite web|title=TypeStructures and- exception definitionsF#|url=httphttps://camldocs.inriamicrosoft.frcom/puben-us/docsdotnet/manualfsharp/language-ocaml-4.00reference/manual016.htmlstructures|access-date=11 May 2020}}</ref> || {{Yes}}<ref>{{cite web|urltitle=http://ocaml.org/learn/description.html#DataTypesDiscriminated Unions| titledate=Learn15 OCamlSeptember -2021 Data Types}}</ref> || {{Yes}}<ref>{{cite web|url=httphttps://ocamlmsdn.orgmicrosoft.com/learnen-us/descriptionlibrary/dd233226.html#Imperativefeatures | title=Learn OCaml - Imperative Featuresaspx}}</ref> || {{PartialYes}}, simulated with parametric modules<ref name=f-sharp-lang-spec>{{cite web|title=ImplementingThe Type-ClassesF# as3.0 OCamlLanguage ModulesSpecification: 1.1.2 Making Data Simple|url=httpshttp://accufsharp.org/index.phpabout/journalsfiles/2445spec.pdf|access-date=1126 MayNovember 20202013}}</ref> || {{YesNo}}<ref name=ocaml-functional|| />{{Yes}} || 2005
|-
| [[F Sharp (programming language)|F#Haskell]] || {{NoYes}}<ref name=haskell.org>{{cite web |title=Haskell Wiki|url=http://fsharpforfunandprofitwww.com/learning-fsharp/haskell.org| access-date=626 DecemberNovember 2013 | title=Learning F#}}</ref> || {{YesYes2}}Default<ref name="msdn"haskell.org.wiki.lazyEval>{{cite web|title=LazyHaskell ComputationsWiki (F#)Lazy Evaluation|url=http://msdnwww.microsofthaskell.comorg/en-ushaskellwiki/library/vstudio/dd233247.aspx|publisher=Microsoft Developer NetworkLazy_evaluation|access-date=26 November 2013}}</ref> || style="background:#8CF; text-align:center"|Static<ref name="haskell.org.wiki.typing">{{cite web|title=AboutHaskell F#Typing|url=http://fsharpwww.haskell.org/abouthaskellwiki/index.htmlTyping|publisher=HaskellWiki|access-date=26 November 2013}}</ref> || {{Yes}}<ref>{{cite web|titlename=Structures - F#|url=https://docs"haskell.microsoft.com/en-us/dotnet/fsharp/language-reference/structures|access-date=11org" May 2020}}</ref> || {{Yes}}<ref name=haskell.org.wiki.abstractDataType>{{cite web|title=DiscriminatedHaskell UnionsWiki Abstract Data Type|url=httpshttp://msdnwww.microsofthaskell.comorg/en-ushaskellwiki/library/dd233226.aspxAbstract_data_type|access-date=26 November 2013}}</ref> || {{Yes}}<ref name=f-sharp-lang-spec>{{cite web|title=The F# 3.0 Language Specification: 1.1.2 Making Data Simple|url=http://fsharpwww.haskell.org/abouthaskellwiki/files/spec.pdfFunctional_programming#Immutable_data|title=Haskell Wiki|access-date=2627 November 2013}}</ref> || {{No}} || {{Yes}}<ref>{{cite web|title=F# Closure reference|url=http://msdnwww.microsofthaskell.comorg/en-ustutorial/library/vstudio/dd233186classes.aspxhtml|title=Type Classes and Overloading}}</ref> || {{Yes}} || 1990
|-
| [[HaskellScala (programming language)|HaskellScala]] || {{YesNo}}<ref name=haskellscala-lang.org.archives.files.ScalaOverview>{{cite web|title=HaskellScala WikiOverview|url=http://www.haskellscala-lang.org/old/sites/default/files/linuxsoft_archives/docu/files/ScalaOverview.pdf|access-date=26 November 2013}}</ref> || {{Yes2Yes}}Default<ref name=haskellscala-lang.org.wikifiles.lazyEvalScalaExample>{{cite web|title=Haskell WikiScala Lazyby EvaluationExample|url=http://www.haskellscala-lang.org/haskellwikidocu/Lazy_evaluationfiles/ScalaByExample.pdf|access-date=26 November 2013}}</ref> || style="background:#8CF; text-align:center"|Static<ref name="haskellscala-lang.org.wikiarchives.typingfiles.ScalaOverview" /> || {{Yes}}<ref name="scala-lang.org/files/archive">{{cite web|title=HaskellScala TypingReference|url=http://www.haskellscala-lang.org/haskellwikifiles/Typing|publisher=HaskellWikiarchive/nightly/pdfs/ScalaReference.pdf|access-date=26 November 2013}}</ref> || {{Yes}}<ref name="haskellscala-lang.org/files/archive" /> || {{Yes}}<ref name=haskellscala-lang.org.wikicollections.abstractDataTypeoverview>{{cite web|title=HaskellMutable Wikiand AbstractImmutable Data TypeCollections|url=http://wwwdocs.haskellscala-lang.org/haskellwikioverviews/Abstract_data_typecollections/overview.html|access-date=26 November 2013}}</ref> || {{Yes}}<ref>{{cite web|url=http://www.haskell.org/haskellwiki/Functional_programming#Immutable_data|title=HaskellThe Wiki|access-date=27Neophyte's NovemberGuide 2013}}</ref>to ||Scala {{Yes}}<ref>{{citePart web12: Type Classes|url=http://wwwdanielwestheide.haskell.orgcom/blog/2013/tutorial02/06/the-neophytes-guide-to-scala-part-12-type-classes.html|titleaccess-date=Type29 ClassesNovember and Overloading2013}}</ref> || {{Yes}}<ref name=haskell.org.wiki.closure>{{cite web|title=Haskell Wiki Closure|url=http://www.haskell.org/haskellwiki/Closures|access-date=26 November 2013}}</ref> 2004
|-
| [[JavaScript]] || {{No}}<ref>[[List of multi-paradigm programming languages#Language overview]]</ref>{{unreliable source?|date=March 2015}} || {{Partial|Extension}}, with extension<ref>{{cite web|last=Tao|first=Dan|title=Lazy.js|url=http://danieltao.com/lazy.js/|work=Dan Tao|access-date=26 November 2013}}</ref> || style="background:#FC6; text-align:center"|Dynamic<ref>{{cite web|title=JavaScript Overview|url=https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/JavaScript_Overview|work=Mozilla Developer Network|publisher=Mozilla Developer Network|access-date=26 November 2013}}</ref> || {{Partial|Extension}}, with extension<ref>{{cite web|last=Frank|first=Thomas|title=Add some klass to JavaScript|url=http://www.thomasfrank.se/klass.html|work=thomasfrank.com|access-date=26 November 2013|archive-url=https://web.archive.org/web/20131208100043/http://thomasfrank.se/klass.html|archive-date=8 December 2013|url-status=dead}}</ref> || {{Partial|Extension}}, with extension<ref>{{cite web|last=Faubion|first=Nathan|title=ADT|url=https://npmjs.org/package/adt|work=NPM|publisher=Joyent, nodejitsu|access-date=26 November 2013}}</ref> || {{partialPartial}}<ref>[[Immutable object#JavaScript]]</ref><ref>{{cite web|title=Javascript Data structures|url=https://developer.mozilla.org/en-US/docs/Web/JavaScript/Data_structures|work=Mozilla Developer Network|publisher=Mozilla Developer Network|access-date=26 November 2013}}</ref> || {{NoDunno}} || {{Yes}}<ref name=developer.mozilla.org>{{cite web|title=Javascript Closures|url=https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Closures|access-date=26 November 2013}}</ref> 1995▼
| [[Frege (programming language)|Frege]] || {{Yes}}<ref name=github.com.Frege.frege.lang>{{cite web|url=https://github.com/Frege/frege.github.com/blob/master/doc/Language.pdf?raw=true|title=Frege Language Reference|access-date=26 February 2014}}</ref> || {{Yes2}}Default<ref name="github.com.Frege.frege.lang" /> || style="background:#8CF; text-align:center"|Static<ref name="github.com.Frege.frege.lang" /> ||{{Yes}}<ref name="github.com.Frege.frege.lang" /> || {{Yes}}<ref name="github.com.Frege.frege.lang" /> || {{Yes}}<ref name="github.com.Frege.frege.lang" /> ||{{Yes}}<ref name="github.com.Frege.frege.lang" />|| {{Yes}}<ref name="github.com.Frege.frege.lang" />
|-
| [[ScalaClean (programming language)|ScalaClean]] || {{NoYes}}<ref name=scala"clean-lang.org.archives.files.ScalaOverviewfaq">{{cite web |title=Scala Overview|url=http://wwwclean.scala-langcs.orgru.nl/old/sites/default/files/linuxsoft_archives/docu/files/ScalaOverview.pdfFAQ |access-date title=26FAQ November- 2013Clean}}</ref> || {{Yes}}, with optional strictness annotations<ref name=scala"clean-lang.org.files.ScalaExamplereport">{{cite webbook|last1=Plasmeijer|first1=Rinus|last2=Van Eekelen|first2=Marko|last3=Van Groningen|first3=John|title=ScalaClean Version 2.2 Language Report|date=December 2011|publisher=Department of Software Technology, University byof ExampleNijmegen|url=http://wwwclean.scala-langcs.orgru.nl/docudownload/filesdoc/ScalaByExampleCleanLangRep.2.2.pdf|access-date=2623 NovemberMay 20132018}}</ref> || style="background:#8CF99F; text-align:center"|Static<ref name="scala-lang.org.archives.files.ScalaOverview"with />[[Uniqueness type||uniqueness]]/optionally {{Yes}}dynamic<ref name="scalaclean-lang.org/files/archivewiki">{{cite web |title=Scala Reference|url=http://wwwclean.scala-langcs.orgru.nl/files/archive/nightly/pdfs/ScalaReference.pdfClean |access-date title=26 November 2013Clean}}</ref> || {{Yes}}<ref name="scalaclean-lang.org/files/archivereport" /> || {{Yes}}<ref name=scala"clean-lang.org.collections.overview>{{cite web|title=Mutable and Immutable Collections|url=http:report"//docs.scala-lang.org/overviews/collections/overview.html|access-date=26 November 2013}}</ref> || {{Yes}}<ref>{{cite, web|title=Theexcept Neophyte'sfor Guideunique totypes<ref Scala Part 12: Type Classes|urlname=http://danielwestheide.com/blog/2013/02/06/the"clean-neophytes-guide-to-scala-part-12-type-classes.html|access-date=29 November 2013}}<report"/ref> || {{Yes}}<ref name="scalaclean-lang.org/files/archivereport" /> || {{Yes}} || 1987
|-
| [[Miranda (programming language)|Miranda]] || {{Yes}}<ref name=miranda.org.uk>{{cite web | url=http://miranda.org.uk/ | title=Miranda Official Website}}</ref> || {{Yes2}}Default<ref name="http://www.cs.kent.ac.uk/people/staff/dat/miranda/Overview.html#Lazy">{{cite web | url=http://www.cs.kent.ac.uk/people/staff/dat/miranda/Overview.html#Lazy | title=An Overview of Miranda}}</ref> || style="background:#8CF; text-align:center"|Static<ref name=miranda.org.uk/> || {{Yes}}<ref name="http://www.cs.kent.ac.uk/people/staff/dat/miranda/Overview.html#Abstract">{{cite web | url=http://www.cs.kent.ac.uk/people/staff/dat/miranda/Overview.html#Abstract | title=An Overview of Miranda}}</ref> || {{Yes}}<ref name="miranda.org.uk" /> || {{Yes}} || {{No}} || {{Yes}} || 1986
▲| [[JavaScript]] || {{No}}<ref>[[List of multi-paradigm programming languages#Language overview]]</ref>{{unreliable source?|date=March 2015}} || {{Partial}}, with extension<ref>{{cite web|last=Tao|first=Dan|title=Lazy.js|url=http://danieltao.com/lazy.js/|work=Dan Tao|access-date=26 November 2013}}</ref> || style="background:#FC6; text-align:center"|Dynamic<ref>{{cite web|title=JavaScript Overview|url=https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/JavaScript_Overview|work=Mozilla Developer Network|publisher=Mozilla Developer Network|access-date=26 November 2013}}</ref> || {{Partial}}, with extension<ref>{{cite web|last=Frank|first=Thomas|title=Add some klass to JavaScript|url=http://www.thomasfrank.se/klass.html|work=thomasfrank.com|access-date=26 November 2013|archive-url=https://web.archive.org/web/20131208100043/http://thomasfrank.se/klass.html|archive-date=8 December 2013|url-status=dead}}</ref> || {{Partial}}, with extension<ref>{{cite web|last=Faubion|first=Nathan|title=ADT|url=https://npmjs.org/package/adt|work=NPM|publisher=Joyent, nodejitsu|access-date=26 November 2013}}</ref> || {{partial}}<ref>[[Immutable object#JavaScript]]</ref><ref>{{cite web|title=Javascript Data structures|url=https://developer.mozilla.org/en-US/docs/Web/JavaScript/Data_structures|work=Mozilla Developer Network|publisher=Mozilla Developer Network|access-date=26 November 2013}}</ref> || {{No}} || {{Yes}}<ref name=developer.mozilla.org>{{cite web|title=Javascript Closures|url=https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Closures|access-date=26 November 2013}}</ref>
|-
| [[SASL (programming language)|SASL]] || {{Yes}}<ref>Turner, D.A. "An Implementation of SASL". University of St. Andrews, Department of Computer Science Technical Report. TR/75/4.</ref> || {{dunnoYes}} || style="background:#FC6; text-align:center"|Dynamic<ref name="From Semantics to Computer Science">{{cite book | url=https://books.google.com/books?id=W2baKp7710sC&pg=PA128&lpg=PA128&dqq=sasl+dynamic+typing#v=onepage&qpg=sasl%20dynamic%20typing&f=falsePA128 | title=Kahn networks at the dawn of functional programming| isbn=9780521518253| last1=Kahn| first1=Gilles| last2=Bertot| first2=Yves| last3=Huet| first3=Gérard| last4=Lévy| first4=Jean-Jacques| last5=Plotkin| first5=Gordon| date=2009-09-24| publisher=Cambridge University Press}}</ref> || {{dunnoYes}} || {{dunnoYes}} || {{dunnoYes}} || {{dunnoNo}} || {{dunnoYes}} || 1972▼
| [[Clean (programming language)|Clean]] || {{Yes}}<ref name="clean-faq">{{cite web | url=http://clean.cs.ru.nl/FAQ | title=FAQ - Clean}}</ref> || {{Yes}}, with optional strictness annotations<ref name="clean-report">{{cite book|last1=Plasmeijer|first1=Rinus|last2=Van Eekelen|first2=Marko|last3=Van Groningen|first3=John|title=Clean Version 2.2 Language Report|date=December 2011|publisher=Department of Software Technology, University of Nijmegen|url=http://clean.cs.ru.nl/download/doc/CleanLangRep.2.2.pdf|access-date=23 May 2018}}</ref> || style="background:#99F; text-align:center"|Static with [[Uniqueness type|uniqueness]]/optionally dynamic<ref name="clean-wiki">{{cite web | url=http://clean.cs.ru.nl/Clean | title=Clean}}</ref> || {{Yes}}<ref name="clean-report"/> || {{Yes}}<ref name="clean-report"/> || {{Yes}}, except for unique types<ref name="clean-report"/> || {{Yes}}<ref name="clean-report"/> || {{Yes}}<ref name="clean-report"/>
|-
| [[MirandaElixir (programming language)|MirandaElixir]] || {{YesNo}}<ref name=miranda.org.uk>{{cite web | url=http://miranda.org.uk/ | title=Miranda Official Website}}</ref> |{{Partial|Stream {{Yes2}}Defaultmodule<ref name="httphttps://wwwhexdocs.cs.kent.ac.ukpm/peopleelixir/staff/dat/miranda/OverviewStream.html#Lazy">{{cite web | url=httphttps://wwwhexdocs.cs.kent.ac.ukpm/peopleelixir/staff/dat/miranda/OverviewStream.html#Lazy | title=AnStream Overview— ofElixir Mirandav1.17.2}} </ref>}} || style="background:#8CFFC6; text-align:center"|Static<ref name=miranda.org.uk/>Dynamic || {{Yes}}<ref name="http://www.cs.kent.ac.uk/people/staff/dat/miranda/Overview.html#Abstract">{{cite web | url=http://www.cs.kent.ac.uk/people/staff/dat/miranda/Overview.html#Abstract | title=An Overview of Miranda{{No}}</ref> || {{Yes}}<ref name="miranda.org.uk" /> || {{dunnoDunno}} || {{dunnoYes}} || {{dunno}} 2012
|-
| [[Erlang (programming language)|Erlang]] || {{No}} || {{No}}<ref name=erlang.org>{{cite web | url=http://www.erlang.org/doc/reference_manual/expressions.html#id76539| access-date=27 November 2013 | title=Erlang Reference Manual}}</ref> || style="background:#FC6; text-align:center"|Dynamic || {{Yes}}<ref>{{cite web | url=http://www.erlang.org/eeps/eep-0029.html | title=Erlang Programming Language - Abstract Patterns}}</ref> || {{No}} || {{Yes}}<ref name=stackoverflow.com>{{cite web | url=https://stackoverflow.com/questions/2715517/how-do-i-modify-a-record-in-erlang | access-date=15 December 2013 | title=Stack Overflow - How do I modify a record in erlang?}}</ref> || {{Dunno}} || {{Yes}} || 1986
▲| [[SASL (programming language)|SASL]] || {{Yes}}<ref>Turner, D.A. "An Implementation of SASL". University of St. Andrews, Department of Computer Science Technical Report. TR/75/4.</ref> || {{dunno}} || style="background:#FC6; text-align:center"|Dynamic<ref name="From Semantics to Computer Science">{{cite book | url=https://books.google.com/?id=W2baKp7710sC&pg=PA128&lpg=PA128&dq=sasl+dynamic+typing#v=onepage&q=sasl%20dynamic%20typing&f=false | title=Kahn networks at the dawn of functional programming| isbn=9780521518253| last1=Kahn| first1=Gilles| last2=Bertot| first2=Yves| last3=Huet| first3=Gérard| last4=Lévy| first4=Jean-Jacques| last5=Plotkin| first5=Gordon| date=2009-09-24}}</ref> || {{dunno}} || {{dunno}} || {{dunno}} || {{dunno}} || {{dunno}}
|-
| [[Elm (programming language)|Elm]] || {{Yes}} || {{No}} || style="background:#8CF; text-align:center"|Static<ref name=elm-lang.org.blog.interactiveProgramming>{{cite web | url=http://elm-lang.org/blog/Interactive-Programming.elm | access-date=29 November 2013 | title=Elm Blog - Interactive Programming | archive-url=https://web.archive.org/web/20131006235603/http://elm-lang.org/blog/Interactive-Programming.elm | archive-date=6 October 2013 | url-status=dead }}</ref> || {{dunno}} || {{Yes}}<ref name=elm-lang.org.learn.syntax>{{cite web | url=http://elm-lang.org/learn/Syntax.elm#algebraic-data-types | access-date=29 November 2013 | title=Elm Syntax - Algebraic Data Types | archive-url=https://web.archive.org/web/20160313052210/http://elm-lang.org/learn/syntax.elm#algebraic-data-types | archive-date=13 March 2016 | url-status=dead }}</ref> || {{Yes}}<ref name=elm-lang.org.blog.interactiveProgramming /> || {{No}} || {{Yes}}<ref>{{cite web | url=https://csmith111.gitbooks.io/functional-reactive-programming-with-elm/content/section2/ClosuresAndCurrying.html | title=Closures and Currying - Programming with Elm}}</ref>2012▼
| [[Elixir (programming language)|Elixir]] || {{No}} || {{Partial}}, with the Stream module<ref name="https://hexdocs.pm/elixir/Stream.html">{{cite web | url=https://hexdocs.pm/elixir/Stream.html | title=Stream - Elixir v.1.6.0}}</ref> || style="background:#FC6; text-align:center"|Dynamic || {{Yes}} || {{No}} || {{Yes}} || {{No}} || {{Yes}}▼
|-
| [[ErlangFuthark (programming language)|ErlangFuthark]] || {{NoYes}} || {{No}} || style="background:#8CF; text-align:center"|Static<ref name=erlangfuthark-lang.org.docs.inference>{{cite web | url=httphttps://wwwfuthark.erlangreadthedocs.orgio/docen/reference_manuallatest/expressionslanguage-reference.html#id76539type-inference | access-date=2724 NovemberJuly 20132023 | title=ErlangType Reference ManualInference}}</ref> || style="background:#FC6; text-align:center"|Dynamic || {{Yes}}<ref>{{cite web | url=http://www.erlang.org/eeps/eep-0029.html | title=Erlang Programming Language - Abstract Patterns}}</ref> || {{NoYes}} || {{Yes}}<ref name=stackoverflowelm-lang.com>{{cite web | url=https://stackoverfloworg.com/questions/2715517/how-do-i-modify-a-record-in-erlangblog.interactiveProgramming | access-date=15 December 2013 | title=Stack Overflow - How do I modify a record in erlang?}}</ref> || {{No}} || {{Yes}} || 2014
|-
| [[Python (programming language)|Python]] || {{No}}<ref>{{cite web | url=https://docs.python.org/3/howto/functional.html | title=Functional Programming in Python}}</ref> || {{Partial|Simulated with generators}} || style="background:#FC6; text-align:center"|Dynamic<ref>{{cite web | url=https://docs.python.org/3/faq/general.html#what-is-python | title=What is Python?}}</ref> || {{Yes}}<ref>{{cite web | url=http://www.cs.utexas.edu/~byoung/cs313e/slides5-adt.pdf | title=Abstract Data Types and Stacks}}</ref> || {{No}} || {{Partial}}<ref>[[Immutable object#Python]]</ref> || {{Dunno}} || {{Yes}} || 1991
▲| [[Elm (programming language)|Elm]] || {{Yes}} || {{No}} || style="background:#8CF; text-align:center"|Static<ref name=elm-lang.org.blog.interactiveProgramming>{{cite web | url=http://elm-lang.org/blog/Interactive-Programming.elm | access-date=29 November 2013 | title=Elm Blog - Interactive Programming | archive-url=https://web.archive.org/web/20131006235603/http://elm-lang.org/blog/Interactive-Programming.elm | archive-date=6 October 2013 | url-status=dead }}</ref> || {{dunno}} || {{Yes}}<ref name=elm-lang.org.learn.syntax>{{cite web | url=http://elm-lang.org/learn/Syntax.elm#algebraic-data-types | access-date=29 November 2013 | title=Elm Syntax - Algebraic Data Types | archive-url=https://web.archive.org/web/20160313052210/http://elm-lang.org/learn/syntax.elm#algebraic-data-types | archive-date=13 March 2016 | url-status=dead }}</ref> || {{Yes}}<ref name=elm-lang.org.blog.interactiveProgramming /> || {{No}} || {{Yes}}<ref>{{cite web | url=https://csmith111.gitbooks.io/functional-reactive-programming-with-elm/content/section2/ClosuresAndCurrying.html | title=Closures and Currying - Programming with Elm}}</ref>
|-
| [[PythonIdris (programming language)|PythonIdris]] || {{NoYes}}<ref name=idris-lang.org>{{cite web |title=Idris Overview|url=httpshttp://docswww.pythonidris-lang.org/3/howto/functional.html | titleaccess-date=Functional Programming6 inDecember Python2013}}</ref> || {{PartialYes}},<ref simulatedname="idris-lang.org" with generators/> || style="background:#FC68CF; text-align:center"|DynamicStatic<ref>{{cite web | urlname=https://docs.python"idris-lang.org/3/faq/general.html#what-is-python" | title=What is Python?}}</ref> || {{Yes}}<ref>{{cite web | urlname=http://www.cs.utexas.edu/~byoung/cs313e/slides5"idris-adtlang.pdforg" | title=Abstract Data Types and Stacks}}</ref> || {{NoYes}}<ref name="idris-lang.org" /> || {{partialYes}}<ref>[[Immutable object#Python]]<name="idris-lang.org" /ref> || {{NoYes}}<ref name="idris-lang.org" /> || {{Yes}}<ref>{{cite web | url=https://www.python.org/dev/peps/pep-3104/ | title=PEP 3104 -- Access to Names in Outer Spaces}}</ref>2007
|-
| [[Nix (package manager)|Nix]] || {{Yes}} || {{No}} || style="background:#8CF; text-align:center"|Static{{Citation needed|date=January 2025}} || {{No}} || {{Yes}} || {{Yes}} || {{No}} || {{Yes}} || 2003
| [[Candle (programming language)|Candle]] || {{Yes}}<ref>{{cite web | url=http://www.candlescript.org/doc/candle-overview.htm | access-date=30 November 2013 | title=Candle Overview}}</ref> || {{dunno}} || style="background:#FC6; text-align:center"|Dynamic<ref name=candlescript.org>{{cite web | url=http://candlescript.org/doc/candle-overview.htm | title=Candle Overview}}</ref> || {{Partial}}, only Sequence and Map<ref>{{cite web | url=http://www.candlescript.org/doc/candle-data-model-reference.htm | access-date=30 November 2013 | title=Candle Date Model Reference}}</ref> || {{dunno}} || {{partial}}<ref>{{cite web | url=http://candleapp.blogspot.com/2011/12/candles-procedural-design.html | access-date=30 November 2013 | title=Candle's Procedural Design}}</ref>|| {{dunno}} || {{dunno}}
|-
|[[Wolfram Language]]
| [[Idris (programming language)|Idris]] || {{Yes}}<ref name=idris-lang.org>{{cite web|title=Idris Overview|url=http://www.idris-lang.org/|access-date=6 December 2013}}</ref> || {{Yes}}<ref name="idris-lang.org" /> || style="background:#8CF; text-align:center"|Static<ref name="idris-lang.org" /> || {{Yes}}<ref name="idris-lang.org" /> || {{Yes}}<ref name="idris-lang.org" /> || {{Yes}}<ref name="idris-lang.org" /> || {{Yes}}<ref name="idris-lang.org" /> || {{Yes}}<ref name="idris-lang.org" />
|{{No}}
|{{No}}
|style="background:#8CF; text-align:center"|Static
|{{Yes}}
|{{Yes}}
|{{Yes}}
|{{No}}
|{{Yes}}
| 1988
|-
|[[Kotlin (programming language)|Kotlin]]
|{{No}}
|{{Partial}}, lazy|Lazy delegation<ref>{{cite web | url=https://kotlinlang.org/docs/reference/delegated-properties.html | title=Kotlin - Delegated Properties}}</ref> and Sequence<ref>{{cite web | url=https://kotlinlang.org/api/latest/jvm/stdlib/kotlin.sequences/ | title=kotlin-stdlib - kotlin.sequences}}</ref>}}
|style="background:#8CF; text-align:center"|Static
|{{Yes}}
Line 58 ⟶ 67:
|{{No}}
|{{Yes}}
| 2011
|-
|[[Swift (programming language)|Swift]]
|{{No}}
|{{No}}
|style="background:#8CF; text-align:center"|Static
|{{Yes}}
|{{Yes}}
|{{Yes}}
|{{No}}
|{{Partial|Swift uses [[Automatic Reference Counting]], which differs from [[tracing garbage collection]] but is designed to provide similar benefits with better performance.}}
| 2014
|-
|[[Julia (programming language)|Julia]]
Line 66 ⟶ 87:
|{{No}}
|{{Partial}}<ref name=julia-typing/>
|{{NoDunno}}
|{{Yes}}
| 2012
|-
|[[PureScript]]
Line 78 ⟶ 100:
|{{Yes}}
|{{Yes}}
| 2013
|-
|[[Rust (programming language)|Rust]]
|{{No}}
|{{Partial|Lazy iterators}}<ref>{{cite web | url=https://doc.rust-lang.org/book/ch13-02-iterators.html | title=The Rust Programming Language, Processing a Series of Items with Iterators }}</ref> and external libraries<ref>{{cite web | url=https://crates.io/crates/lazy | title=Rust crate 'lazy'}}</ref>
|style="background:#8CF; text-align:center"|Static<ref>{{cite web |url=https://doc.rust-lang.org/book/ch03-02-data-types.html | title=The Rust Programming Language, Data Types}}</ref>
|{{Yes}}<ref name="rust-traits">{{cite web | url=https://doc.rust-lang.org/book/ch10-02-traits.html | title=The Rust Programming Language, Traits}}</ref>
|{{Yes}}<ref>{{cite web | url=https://doc.rust-lang.org/book/ch06-00-enums.html | title=The Rust Programming Language, Enums}}</ref>
|{{Yes}}<ref>{{cite web | url=https://doc.rust-lang.org/book/ch03-01-variables-and-mutability.html | title=The Rust Programming Language, Variables and Mutability}}</ref>
|{{Yes}}, through traits<ref name="rust-traits"/>
|{{No}}
| 2010
|-
|[[Bosque (programming language)|Bosque]]
|{{No}}
|{{No}}
|style="background:#8CF; text-align:center"|Static
|{{Yes}}
|{{Yes}}
|{{Yes}}
|{{Dunno}}
|{{Yes}}
|2019
|-
| [[D (programming language)|D]]
| {{Partial|Optional}}<ref>{{cite web|title=D pure functions|url=https://dlang.org/spec/function.html#pure-functions|access-date=3 February 2024}}</ref><ref>{{cite web|title=D safe functions|url=https://dlang.org/spec/function.html#safe-functions|access-date=3 February 2024}}</ref>
| {{Partial|Optional}}<ref>{{cite web|title=Laziness - Dlang Tour|url=https://tour.dlang.org/tour/en/basics/laziness|access-date=7 April 2020}}</ref>
| style="background:#8CF; text-align:center"|Static<ref>{{cite web|title=Type System|url=https://dlang.org/spec/type.html|access-date=7 April 2020}}</ref>
| {{dunno}}
| {{Yes}}
| {{Yes}}<ref>{{cite web|title=Immutable - Dlang Tour|url=https://tour.dlang.org/tour/en/basics/immutability|access-date=7 April 2020}}</ref>
| {{No}}
| {{Yes}}<ref>{{cite web|title=Garbage Collection|url=https://dlang.org/spec/garbage.html|access-date=7 April 2020}}</ref>
| 2001
|-
▲| [[ElixirGleam (programming language)|ElixirGleam]] || {{No}} || {{Partial}}, with the Stream module<ref name ="https://hexdocs.pm/elixir/Stream.html" Gleam>{{cite web | url=https://hexdocsgleam.pmrun/elixirfrequently-asked-questions/Stream.html#will-gleam-have-type-classes | title=StreamFrequently -asked Elixirquestions – Gleam v.1.6.0}}</ref> || {{Partial|Experimental external libraries}} || style="background:#FC68CF; text-align:center"|DynamicStatic || {{Yes}} || {{NoYes}} || {{Yes}} || {{No}} || {{Yes}} || 2019
|}
 
Retrieved from "https://en.wikipedia.org/wiki/Comparison_of_functional_programming_languages"