Content deleted Content added
Add Julia |
Update Scheme box on records Tag: references removed |
||
Line 9:
| [[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|accessdate=26 November 2013}}</ref> || {{Yes}}<ref name=common-lisp>{{cite web|last=Antoniotti|first=Marco|title=CLAZY: Lazy Calling in Common Lisp|url=http://common-lisp.net/project/clazy/|accessdate=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/|accessdate=26 November 2013|doi=10.1016/s0065-2458(09)01205-4}}</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> || {{dunno}} || {{No}}<ref>{{cite web|title=Mutable Data Structures|url=http://caml.inria.fr/pub/docs/fpcl/fpcl-07.pdf|accessdate=28 November 2013}}</ref> || {{No}} || {{Yes}}<ref>{{cite web|title=Closures in Lisp|url=http://psg.com/~dlamkins/sl/chapter15.html|accessdate=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>
|-
| [[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|accessdate=26 November 2013}}</ref> || {{Yes}}<ref>{{cite web|title=(Scheme) 17. Lazy Evaluation|url=http://www.shido.info/lisp/scheme_lazy_e.html|accessdate=30 April 2020}}</ref> || style="background:#FC6; text-align:center"|Dynamic<ref name="caml.inria.fr" /> || {{Yes}}<ref>{{cite web|title=Records
|-
| [[Racket (programming language)|Racket]] || {{No}} || {{Yes2}}Yes, with Lazy Racket<ref name="lazy racket">{{cite web|url=https://docs.racket-lang.org/lazy/index.html|title=Lazy Racket|accessdate=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|accessdate=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|accessdate=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|accessdate=8 February 2020|first=Eric|last=Griffis}}</ref> || {{partial}}<ref name="racket immutability">{{Cite web|url=https://beautifulracket.com/explainer/data-structures.html|title=Beautiful Racket: Data Structures|accessdate=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|accessdate=8 February 2020}}</ref>
| |||