Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Comparison of multi-paradigm programming languages
open-in-new
<h2 id="paradigm-summaries">Paradigm summaries</h2> <p>A concise reference for the programming paradigms listed in this article. </p> <ul><li><a href="/facts/Concurrent_programming_language/yVzQBPr9">Concurrent programming</a> – have language constructs for concurrency, these may involve multi-threading, support for distributed computing, message passing, shared resources (including shared memory), or <a href="/facts/Futures_and_promises/5Mpgxv4m">futures</a> <ul><li><a href="/facts/Actor_model/MJ49opnU">Actor programming</a> – concurrent computation with <i>actors</i> that make local decisions in response to the environment (capable of selfish or competitive behaviour)</li></ul></li> <li><a href="/facts/Constraint_programming/rgkCK5bD">Constraint programming</a> – relations between variables are expressed as constraints (or constraint networks), directing allowable solutions (uses constraint satisfaction or <a href="/facts/Simplex_algorithm/9fndF6cq">simplex algorithm</a>)</li> <li><a href="/facts/Dataflow/jea04eH2">Dataflow programming</a> – forced recalculation of formulas when data values change (e.g. <a href="/facts/Spreadsheet/0cvc1GeB">spreadsheets</a>)</li> <li><a href="/facts/Declarative_programming/gogtdzcJ">Declarative programming</a> – describes what computation should perform, without specifying detailed state changes c.f. imperative programming (functional and logic programming are major subgroups of declarative programming)</li> <li><a href="/facts/Distributed_computing/o5nyhqTF">Distributed programming</a> – have support for multiple autonomous computers that communicate via computer networks</li> <li><a href="/facts/Functional_programming/cdxqPEIM">Functional programming</a> – uses evaluation of mathematical functions and avoids state and mutable data</li> <li><a href="/facts/Generic_programming/kqtqJk7p">Generic programming</a> – uses algorithms written in terms of to-be-specified-later types that are then instantiated as needed for specific types provided as parameters</li> <li><a href="/facts/Imperative_programming/6b5dUnE1">Imperative programming</a> – explicit statements that change a program state</li> <li><a href="/facts/Logic_programming/Xgh8lj3F">Logic programming</a> – uses explicit mathematical logic for programming</li> <li><a href="/facts/Metaprogramming/ujbjjJTY">Metaprogramming</a> – writing programs that write or manipulate other programs (or themselves) as their data, or that do part of the work at compile time that would otherwise be done at runtime <ul><li><a href="/facts/Template_metaprogramming/yybwJ7AN">Template metaprogramming</a> – metaprogramming methods in which a compiler uses templates to generate temporary source code, which is merged by the compiler with the rest of the source code and then compiled</li> <li><a href="/facts/Reflective_programming/Nj8stFfp">Reflective programming</a> – metaprogramming methods in which a program modifies or extends itself</li></ul></li> <li><a href="/facts/Object-oriented_programming/TxNMEcao">Object-oriented programming</a> – uses data structures consisting of data fields and methods together with their interactions (objects) to design programs <ul><li><a href="/facts/Class_(computer_programming)/zvzkSAtE">Class-based</a> – object-oriented programming in which inheritance is achieved by defining classes of objects, versus the objects themselves</li> <li><a href="/facts/Prototype-based_programming/x9oNIYPG">Prototype-based</a> – object-oriented programming that avoids classes and implements inheritance via cloning of instances</li></ul></li> <li><a href="/facts/Pipeline_programming/vNahQdsH">Pipeline programming</a> – a simple syntax change to add syntax to nest function calls to language originally designed with none</li> <li><a href="/facts/Rule-based_programming/Xgh8lj3F">Rule-based programming</a> – a network of rules of thumb that comprise a knowledge base and can be used for expert systems and problem deduction & resolution</li> <li><a href="/facts/Visual_programming_language/j0eyIPzU">Visual programming</a> – manipulating program elements graphically rather than by specifying them textually (e.g. <a href="/facts/Simulink/H12XCsw9">Simulink</a>); also termed <i>diagrammatic programming</i><a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a></li></ul> <h2 id="language-overview">Language overview</h2> List of multi-paradigm programming languages<table><tbody><tr><th>Language</th><th>Paradigm count</th><th>Concurrent</th><th>Constraints</th><th>Dataflow</th><th>Declarative</th><th>Distributed</th><th>Functional</th><th>Metaprogramming</th><th>Generic</th><th>Imperative</th><th>Logic</th><th>Reflection</th><th>Object-oriented</th><th>Pipelines</th><th>Visual</th><th>Rule-based</th><th>Other</th></tr><tr><td><a href="/facts/Ada_(programming_language)/Y2yHel4l">Ada</a><a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a><a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a><a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a><a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a><a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a></td><td>5</td><td>Yes<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a></td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Algebraic_Logic_Functional_programming_language/P3oQtsBo">ALF</a></td><td>2</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/AmigaE/XP963Fan">AmigaE</a></td><td>2</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/APL_(programming_language)/E2sb98gC">APL</a></td><td>3</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Array (multi-dimensional)</td></tr><tr><td><a href="/facts/BETA_(programming_language)/zw6sMHL2">BETA</a></td><td>3</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/C%2B%2B/Et0F2qn9">C++</a></td><td>7 (15)</td><td>Yes<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a><a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a><a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a></td><td>Library<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a></td><td>Library<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a><a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a></td><td>Library<a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a><a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a></td><td>Library<a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a><a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a></td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a></td><td>Yes</td><td>Library<a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a><a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a></td><td>Library<a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:26" href="#fn:26"><sup>26</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:27" href="#fn:27"><sup>27</sup></a></td><td>—</td><td>Library<a class="footnote-ref" id="fnref:28" href="#fn:28"><sup>28</sup></a></td><td>Array (multi-dimensional; using <a href="/facts/Standard_Template_Library/IxqpRzWU">STL</a>)</td></tr><tr><td><a href="/facts/C_Sharp_(programming_language)/UC2gxeyb">C#</a></td><td>6 (7)</td><td>Yes</td><td>—</td><td>Library<a class="footnote-ref" id="fnref:29" href="#fn:29"><sup>29</sup></a></td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:30" href="#fn:30"><sup>30</sup></a></td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:31" href="#fn:31"><sup>31</sup></a></td><td>—</td><td>—</td><td>—</td><td>Reactive<a class="footnote-ref" id="fnref:32" href="#fn:32"><sup>32</sup></a></td></tr><tr><td><a href="/facts/ChucK/CuSNkLhf">ChucK</a></td><td>3</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:33" href="#fn:33"><sup>33</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Claire_(programming_language)/PaY5n88T">Claire</a></td><td>2</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:34" href="#fn:34"><sup>34</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Clojure/3JRNxKXx">Clojure</a></td><td>5</td><td>Yes<a class="footnote-ref" id="fnref:35" href="#fn:35"><sup>35</sup></a><a class="footnote-ref" id="fnref:36" href="#fn:36"><sup>36</sup></a></td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:37" href="#fn:37"><sup>37</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:38" href="#fn:38"><sup>38</sup></a></td><td>—</td><td>—</td><td>Library<a class="footnote-ref" id="fnref:39" href="#fn:39"><sup>39</sup></a></td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:40" href="#fn:40"><sup>40</sup></a></td><td>Editor<a class="footnote-ref" id="fnref:41" href="#fn:41"><sup>41</sup></a></td><td>—</td><td><a href="/facts/Multiple_dispatch/eCYSSjGE">Multiple dispatch</a>,<a class="footnote-ref" id="fnref:42" href="#fn:42"><sup>42</sup></a> Agents<a class="footnote-ref" id="fnref:43" href="#fn:43"><sup>43</sup></a></td></tr><tr><td><a href="/facts/Common_Lisp/mq1pRbSF">Common Lisp</a></td><td>7 (14)</td><td>Library<a class="footnote-ref" id="fnref:44" href="#fn:44"><sup>44</sup></a></td><td>Library<a class="footnote-ref" id="fnref:45" href="#fn:45"><sup>45</sup></a></td><td>Library<a class="footnote-ref" id="fnref:46" href="#fn:46"><sup>46</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:47" href="#fn:47"><sup>47</sup></a></td><td>Library<a class="footnote-ref" id="fnref:48" href="#fn:48"><sup>48</sup></a></td><td>Yes</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:49" href="#fn:49"><sup>49</sup></a></td><td>Yes</td><td>Library<a class="footnote-ref" id="fnref:50" href="#fn:50"><sup>50</sup></a></td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:51" href="#fn:51"><sup>51</sup></a><a class="footnote-ref" id="fnref:52" href="#fn:52"><sup>52</sup></a><a class="footnote-ref" id="fnref:53" href="#fn:53"><sup>53</sup></a></td><td>Library<a class="footnote-ref" id="fnref:54" href="#fn:54"><sup>54</sup></a></td><td>Library<a class="footnote-ref" id="fnref:55" href="#fn:55"><sup>55</sup></a></td><td>Library<a class="footnote-ref" id="fnref:56" href="#fn:56"><sup>56</sup></a></td><td>Multiple dispatch, meta-OOP system,<a class="footnote-ref" id="fnref:57" href="#fn:57"><sup>57</sup></a> Language is extensible via metaprogramming.</td></tr><tr><td><a href="/facts/Curl_(programming_language)/dASja3Rv">Curl</a></td><td>5</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:58" href="#fn:58"><sup>58</sup></a></td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:59" href="#fn:59"><sup>59</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Curry_(programming_language)/hDqY8NIf">Curry</a></td><td>4</td><td>Yes</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/D_(programming_language)/4qIzRjkF">D</a> (version 2.0)<a class="footnote-ref" id="fnref:60" href="#fn:60"><sup>60</sup></a><a class="footnote-ref" id="fnref:61" href="#fn:61"><sup>61</sup></a></td><td>7</td><td>Yes<a class="footnote-ref" id="fnref:62" href="#fn:62"><sup>62</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:63" href="#fn:63"><sup>63</sup></a><a class="footnote-ref" id="fnref:64" href="#fn:64"><sup>64</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:65" href="#fn:65"><sup>65</sup></a></td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:66" href="#fn:66"><sup>66</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Delphi_(software)/sUFUXQ8r">Delphi</a></td><td>3</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:67" href="#fn:67"><sup>67</sup></a></td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:68" href="#fn:68"><sup>68</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Dylan_(programming_language)/VVQGkShF">Dylan</a></td><td>3</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:69" href="#fn:69"><sup>69</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/E_(programming_language)/XCLbIxm0">E</a></td><td>3</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:70" href="#fn:70"><sup>70</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/ECMAScript/M7nDHsB5">ECMAScript</a><a class="footnote-ref" id="fnref:71" href="#fn:71"><sup>71</sup></a><a class="footnote-ref" id="fnref:72" href="#fn:72"><sup>72</sup></a> (<a href="/facts/ActionScript/xtDQb0wR">ActionScript</a>, <a href="/facts/ECMAScript_for_XML/351rfHeK">E4X</a>, <a href="/facts/JavaScript/XhhIIEsl">JavaScript</a>, <a href="/facts/JScript/HyuCUU2D">JScript</a>)</td><td>4 (5)</td><td>Partial<a class="footnote-ref" id="fnref:73" href="#fn:73"><sup>73</sup></a><a class="footnote-ref" id="fnref:74" href="#fn:74"><sup>74</sup></a></td><td>—</td><td>—</td><td>Library<a class="footnote-ref" id="fnref:75" href="#fn:75"><sup>75</sup></a><a class="footnote-ref" id="fnref:76" href="#fn:76"><sup>76</sup></a></td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:77" href="#fn:77"><sup>77</sup></a></td><td>Library<a class="footnote-ref" id="fnref:78" href="#fn:78"><sup>78</sup></a><a class="footnote-ref" id="fnref:79" href="#fn:79"><sup>79</sup></a></td><td>Editor<a class="footnote-ref" id="fnref:80" href="#fn:80"><sup>80</sup></a></td><td>—</td><td>Reactive,<a class="footnote-ref" id="fnref:81" href="#fn:81"><sup>81</sup></a><a class="footnote-ref" id="fnref:82" href="#fn:82"><sup>82</sup></a> event driven<a class="footnote-ref" id="fnref:83" href="#fn:83"><sup>83</sup></a><a class="footnote-ref" id="fnref:84" href="#fn:84"><sup>84</sup></a></td></tr><tr><td><a href="/facts/Erlang_(programming_language)/2PuxmzT3">Erlang</a></td><td>3</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Elixir_(programming_language)/vX1J3cgf">Elixir</a></td><td>4</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Elm_(programming_language)/TnQVYGn6">Elm</a></td><td>6</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes (<a href="/facts/Purely_functional_programming/am3DcNAd">pure</a>)<a class="footnote-ref" id="fnref:85" href="#fn:85"><sup>85</sup></a></td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Reactive</td></tr><tr><td><a href="/facts/F_Sharp_(programming_language)/jdXHnYz5">F#</a></td><td>7 (8)</td><td>Yes<a class="footnote-ref" id="fnref:86" href="#fn:86"><sup>86</sup></a></td><td>—</td><td>Library<a class="footnote-ref" id="fnref:87" href="#fn:87"><sup>87</sup></a></td><td>Yes</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:88" href="#fn:88"><sup>88</sup></a></td><td>—</td><td>—</td><td>—</td><td>Reactive<a class="footnote-ref" id="fnref:89" href="#fn:89"><sup>89</sup></a></td></tr><tr><td><a href="/facts/Fortran/m1KqjcMU">Fortran</a></td><td>4 (5)</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:90" href="#fn:90"><sup>90</sup></a></td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:91" href="#fn:91"><sup>91</sup></a></td><td>—</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:92" href="#fn:92"><sup>92</sup></a></td><td>—</td><td>—</td><td>—</td><td>Array (multi-dimensional)</td></tr><tr><td><a href="/facts/Go_(programming_language)/oWlsmAFJ">Go</a></td><td>4</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Haskell/ydEsHuGy">Haskell</a></td><td>8 (15)</td><td>Yes</td><td>Library<a class="footnote-ref" id="fnref:93" href="#fn:93"><sup>93</sup></a></td><td>Library<a class="footnote-ref" id="fnref:94" href="#fn:94"><sup>94</sup></a></td><td>Yes</td><td>Library<a class="footnote-ref" id="fnref:95" href="#fn:95"><sup>95</sup></a></td><td>Yes (<a href="/facts/Lazy_evaluation/mD3DxDkc">lazy</a>) (<a href="/facts/Purely_functional_programming/am3DcNAd">pure</a>)<a class="footnote-ref" id="fnref:96" href="#fn:96"><sup>96</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:97" href="#fn:97"><sup>97</sup></a></td><td>Yes</td><td>Yes</td><td>Library<a class="footnote-ref" id="fnref:98" href="#fn:98"><sup>98</sup></a></td><td>—</td><td>Partial<a class="footnote-ref" id="fnref:99" href="#fn:99"><sup>99</sup></a></td><td>Yes</td><td>Yes</td><td>Library<a class="footnote-ref" id="fnref:100" href="#fn:100"><sup>100</sup></a></td><td>Literate, reactive, dependent types (partial)</td></tr><tr><td><a href="/facts/Io_(programming_language)/06xtsq15">Io</a></td><td>4</td><td>Yes<a class="footnote-ref" id="fnref:101" href="#fn:101"><sup>101</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:102" href="#fn:102"><sup>102</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/J_(programming_language)/EdIVMBj7">J</a></td><td>3</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:103" href="#fn:103"><sup>103</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Java_(programming_language)/9ScgFyAL">Java</a></td><td>6</td><td>Yes</td><td>Library<a class="footnote-ref" id="fnref:104" href="#fn:104"><sup>104</sup></a></td><td>Library<a class="footnote-ref" id="fnref:105" href="#fn:105"><sup>105</sup></a></td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:106" href="#fn:106"><sup>106</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Julia_(programming_language)/AoB0PJ9C">Julia</a></td><td>9 (17)</td><td>Yes</td><td>Library<a class="footnote-ref" id="fnref:107" href="#fn:107"><sup>107</sup></a></td><td>Library<a class="footnote-ref" id="fnref:108" href="#fn:108"><sup>108</sup></a><a class="footnote-ref" id="fnref:109" href="#fn:109"><sup>109</sup></a></td><td>Library<a class="footnote-ref" id="fnref:110" href="#fn:110"><sup>110</sup></a></td><td>Yes</td><td>Yes (<a href="/facts/Eager_evaluation/vLXH27zR">eager</a>)</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Library<a class="footnote-ref" id="fnref:111" href="#fn:111"><sup>111</sup></a></td><td>Yes</td><td>Partial<a class="footnote-ref" id="fnref:112" href="#fn:112"><sup>112</sup></a></td><td>Yes</td><td>—</td><td>Library<a class="footnote-ref" id="fnref:113" href="#fn:113"><sup>113</sup></a><a class="footnote-ref" id="fnref:114" href="#fn:114"><sup>114</sup></a></td><td><a href="/facts/Multiple_dispatch/eCYSSjGE">Multiple dispatch</a>,Array (multi-dimensional); optionally <a href="/facts/Lazy_evaluation/mD3DxDkc">lazy</a><a class="footnote-ref" id="fnref:115" href="#fn:115"><sup>115</sup></a> and reactive (with libraries)</td></tr><tr><td><a href="/facts/Kotlin_(programming_language)/CrAqIFLn">Kotlin</a></td><td>8</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes</td><td>Yes</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/LabVIEW/ue0vyha4">LabVIEW</a></td><td>4</td><td>Yes</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>—</td><td>—</td></tr><tr><td>Lava</td><td>2</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:116" href="#fn:116"><sup>116</sup></a></td><td>—</td><td>Yes</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/LispWorks/Eu7Rg6Xn">LispWorks</a> (version 6.0 with support for symmetric multi-processing, rules, logic (<a href="/facts/Prolog/r5h66Qh1">Prolog</a>), <a href="/facts/Common_Object_Request_Broker_Architecture/VUDlTHs5">CORBA</a>)</td><td>9</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:117" href="#fn:117"><sup>117</sup></a></td><td>—</td><td>—</td><td>Yes</td><td>—</td></tr><tr><td><a href="/facts/Lua_(programming_language)/xkBCgta0">Lua</a></td><td>3</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:118" href="#fn:118"><sup>118</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/MATLAB/qPjLISCk">MATLAB</a></td><td>6 (10)</td><td>Toolbox<a class="footnote-ref" id="fnref:119" href="#fn:119"><sup>119</sup></a></td><td>Toolbox<a class="footnote-ref" id="fnref:120" href="#fn:120"><sup>120</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:121" href="#fn:121"><sup>121</sup></a></td><td>—</td><td>Toolbox<a class="footnote-ref" id="fnref:122" href="#fn:122"><sup>122</sup></a></td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:123" href="#fn:123"><sup>123</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:124" href="#fn:124"><sup>124</sup></a></td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:125" href="#fn:125"><sup>125</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:126" href="#fn:126"><sup>126</sup></a></td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:127" href="#fn:127"><sup>127</sup></a></td><td>—</td><td>Array (multi-dimensional)</td></tr><tr><td><a href="/facts/Nemerle/6E2y4sHK">Nemerle</a></td><td>7</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:128" href="#fn:128"><sup>128</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Object_Pascal/cuGkuISv">Object Pascal</a></td><td>4</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:129" href="#fn:129"><sup>129</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/OCaml/ThBGLND8">OCaml</a></td><td>4</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:130" href="#fn:130"><sup>130</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Oz_(programming_language)/Fsb7wHsv">Oz</a></td><td>11</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:131" href="#fn:131"><sup>131</sup></a></td><td>Yes</td><td>—</td><td>Yes</td><td>—</td></tr><tr><td><a href="/facts/Perl/fx31kjlT">Perl</a></td><td>8 (9)</td><td>Yes<a class="footnote-ref" id="fnref:132" href="#fn:132"><sup>132</sup></a></td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:133" href="#fn:133"><sup>133</sup></a></td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:134" href="#fn:134"><sup>134</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:135" href="#fn:135"><sup>135</sup></a></td><td>Yes</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/PHP/vU6YRJX0">PHP</a><a class="footnote-ref" id="fnref:136" href="#fn:136"><sup>136</sup></a><a class="footnote-ref" id="fnref:137" href="#fn:137"><sup>137</sup></a><a class="footnote-ref" id="fnref:138" href="#fn:138"><sup>138</sup></a></td><td>4</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:139" href="#fn:139"><sup>139</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Poplog/I5wlXhch">Poplog</a></td><td>3</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Prograph/GvVEazjX">Prograph</a></td><td>3</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:140" href="#fn:140"><sup>140</sup></a></td><td>—</td><td>Yes</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Python_(programming_language)/YbuGqofa">Python</a></td><td>5 (10)</td><td>Library<a class="footnote-ref" id="fnref:141" href="#fn:141"><sup>141</sup></a><a class="footnote-ref" id="fnref:142" href="#fn:142"><sup>142</sup></a></td><td>Library<a class="footnote-ref" id="fnref:143" href="#fn:143"><sup>143</sup></a></td><td>—</td><td>—</td><td>Library<a class="footnote-ref" id="fnref:144" href="#fn:144"><sup>144</sup></a></td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:145" href="#fn:145"><sup>145</sup></a><a class="footnote-ref" id="fnref:146" href="#fn:146"><sup>146</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:147" href="#fn:147"><sup>147</sup></a><a class="footnote-ref" id="fnref:148" href="#fn:148"><sup>148</sup></a></td><td>Yes</td><td>Library<a class="footnote-ref" id="fnref:149" href="#fn:149"><sup>149</sup></a></td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:150" href="#fn:150"><sup>150</sup></a></td><td>—</td><td>Editor<a class="footnote-ref" id="fnref:151" href="#fn:151"><sup>151</sup></a></td><td>—</td><td><a href="/facts/Structured_programming/zA8b8dP1">Structured</a></td></tr><tr><td><a href="/facts/R_(programming_language)/LSrkr8K8">R</a></td><td>4 (6)</td><td>Library<a class="footnote-ref" id="fnref:152" href="#fn:152"><sup>152</sup></a></td><td>—</td><td>—</td><td>—</td><td>Library<a class="footnote-ref" id="fnref:153" href="#fn:153"><sup>153</sup></a></td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:154" href="#fn:154"><sup>154</sup></a></td><td>—</td><td>—</td><td>Array (multi-dimensional)</td></tr><tr><td><a href="/facts/Racket_(programming_language)/5n7LW08b">Racket</a></td><td>10</td><td>Yes<a class="footnote-ref" id="fnref:155" href="#fn:155"><sup>155</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:156" href="#fn:156"><sup>156</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:157" href="#fn:157"><sup>157</sup></a></td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:158" href="#fn:158"><sup>158</sup></a></td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>Lazy<a class="footnote-ref" id="fnref:159" href="#fn:159"><sup>159</sup></a></td></tr><tr><td><a href="/facts/Raku_(programming_language)/9eYW7vRJ">Raku</a></td><td>10</td><td>Yes<a class="footnote-ref" id="fnref:160" href="#fn:160"><sup>160</sup></a></td><td>Library<a class="footnote-ref" id="fnref:161" href="#fn:161"><sup>161</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:162" href="#fn:162"><sup>162</sup></a></td><td>—</td><td>Library<a class="footnote-ref" id="fnref:163" href="#fn:163"><sup>163</sup></a></td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:164" href="#fn:164"><sup>164</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:165" href="#fn:165"><sup>165</sup></a></td><td>Yes</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:166" href="#fn:166"><sup>166</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:167" href="#fn:167"><sup>167</sup></a></td><td>Yes</td><td>—</td><td>—</td><td>Multiple dispatch, lazy lists, reactive.</td></tr><tr><td><a href="/facts/ROOP_(programming_language)/JoDcK3dY">ROOP</a></td><td>3</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td></tr><tr><td><a href="/facts/Ruby_(programming_language)/BeYSaPSR">Ruby</a></td><td>5</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:168" href="#fn:168"><sup>168</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Rust_(programming_language)/8JNMV19F">Rust</a> (version 1.0.0-alpha)</td><td>6</td><td>Yes<a class="footnote-ref" id="fnref:169" href="#fn:169"><sup>169</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:170" href="#fn:170"><sup>170</sup></a><a class="footnote-ref" id="fnref:171" href="#fn:171"><sup>171</sup></a></td><td>Yes<a class="footnote-ref" id="fnref:172" href="#fn:172"><sup>172</sup></a></td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>Linear, affline, and ownership types</td></tr><tr><td><a href="/facts/Sather/tEPlet9u">Sather</a></td><td>2</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:173" href="#fn:173"><sup>173</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Scala_(programming_language)/ebL8o6AK">Scala</a><a class="footnote-ref" id="fnref:174" href="#fn:174"><sup>174</sup></a><a class="footnote-ref" id="fnref:175" href="#fn:175"><sup>175</sup></a></td><td>9</td><td>Yes<a class="footnote-ref" id="fnref:176" href="#fn:176"><sup>176</sup></a></td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:177" href="#fn:177"><sup>177</sup></a></td><td>Yes</td><td>—</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:178" href="#fn:178"><sup>178</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Simula/gaEVG7SL">Simula</a></td><td>2</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:179" href="#fn:179"><sup>179</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/SISAL/n8PmrsML">SISAL</a></td><td>3</td><td>Yes</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Spreadsheet/0cvc1GeB">Spreadsheets</a></td><td>2</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Swift_(programming_language)/A7qHQC32">Swift</a></td><td>7</td><td>Yes</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:180" href="#fn:180"><sup>180</sup></a></td><td>—</td><td>—</td><td>—</td><td>Block-structured</td></tr><tr><td><a href="/facts/Tcl/s7fbKYtR">Tcl</a> with Snit extension</td><td>3</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:181" href="#fn:181"><sup>181</sup></a></td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>—</td><td>Yes<a class="footnote-ref" id="fnref:182" href="#fn:182"><sup>182</sup></a><a class="footnote-ref" id="fnref:183" href="#fn:183"><sup>183</sup></a></td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Visual_Basic_.NET/09mPEo4q">Visual Basic .NET</a></td><td>6 (7)</td><td>Yes</td><td>—</td><td>Library<a class="footnote-ref" id="fnref:184" href="#fn:184"><sup>184</sup></a></td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:185" href="#fn:185"><sup>185</sup></a></td><td>—</td><td>—</td><td>—</td><td>Reactive<a class="footnote-ref" id="fnref:186" href="#fn:186"><sup>186</sup></a></td></tr><tr><td><a href="/facts/Windows_PowerShell/G1d10lwn">Windows PowerShell</a></td><td>6</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes</td><td>—</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:187" href="#fn:187"><sup>187</sup></a></td><td>Yes</td><td>—</td><td>—</td><td>—</td></tr><tr><td><a href="/facts/Wolfram_Language/MDxl50Yq">Wolfram Language</a> & <a href="/facts/Mathematica/dRwoGFG2">Mathematica</a></td><td>13<a class="footnote-ref" id="fnref:188" href="#fn:188"><sup>188</sup></a> (14)</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes</td><td>Yes<a class="footnote-ref" id="fnref:189" href="#fn:189"><sup>189</sup></a></td><td>—</td><td>Yes</td><td>Knowledge Based</td></tr></tbody></table> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Programming_paradigm/7LwgRpB3">Programming paradigm</a></li> <li><a href="/facts/List_of_programming_languages_by_type/XuWNoawk">List of programming languages by type</a></li> <li><a href="/facts/Domain-specific_language/n18H1foD">Domain-specific language</a></li> <li><a href="/facts/Domain-specific_multimodeling/6HRLg9Lx">Domain-specific multimodeling</a></li></ul> <h2 id="notes">Notes</h2> <h2 id="citations">Citations</h2> <ul><li>Jim Coplien, <i>Multiparadigm Design for C++</i>, Addison-Wesley Professional, 1998.</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Bragg, S.D.; Driskill, C.G. (20–22 September 1994). "Diagrammatic-graphical programming languages and DoD-STD-2167A". Proceedings of AUTOTESTCON '94 (IEEEXplore). Institute of Electrical and Electronics Engineers (IEEE). pp. 211–220. doi:10.1109/AUTEST.1994.381508. ISBN 978-0-7803-1910-3. S2CID 62509261. <a href="978-0-7803-1910-3" target="_blank">978-0-7803-1910-3</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Ada Reference Manual, ISO/IEC 8652:2005(E) Ed. 3, Section 9: Tasks and Synchronization <a href="http://www.adaic.org/standards/05rm/html/RM-TTL.html" target="_blank">http://www.adaic.org/standards/05rm/html/RM-TTL.html</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Ada Reference Manual, ISO/IEC 8652:2005(E) Ed. 3 Annex E: Distributed Systems <a href="http://www.adaic.org/standards/05rm/html/RM-TTL.html" target="_blank">http://www.adaic.org/standards/05rm/html/RM-TTL.html</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Ada Reference Manual, ISO/IEC 8652:2005(E) Ed. 3, Section 12: Generic Units <a href="http://www.adaic.org/standards/05rm/html/RM-TTL.html" target="_blank">http://www.adaic.org/standards/05rm/html/RM-TTL.html</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Ada Reference Manual, ISO/IEC 8652:2005(E) Ed. 3, Section 6: Subprograms <a href="http://www.adaic.org/standards/05rm/html/RM-TTL.html" target="_blank">http://www.adaic.org/standards/05rm/html/RM-TTL.html</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Ada Reference Manual, ISO/IEC 8652:2005(E) Ed. 3, 3.9 Tagged Types and Type Extensions <a href="http://www.adaic.org/standards/05rm/html/RM-TTL.html" target="_blank">http://www.adaic.org/standards/05rm/html/RM-TTL.html</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>rendezvous and monitor-like based <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>class-based <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>class-based <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>class-based <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>Thread support <a href="http://en.cppreference.com/w/cpp/thread" target="_blank">http://en.cppreference.com/w/cpp/thread</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Atomics support <a href="http://en.cppreference.com/w/cpp/atomic" target="_blank">http://en.cppreference.com/w/cpp/atomic</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>Memory model <a href="https://cppandbeyond.wordpress.com/2011/04/11/session-announcement-the-c0x-memory-model-and-why-you-care" target="_blank">https://cppandbeyond.wordpress.com/2011/04/11/session-announcement-the-c0x-memory-model-and-why-you-care</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>Gecode <a href="http://www.gecode.org/" target="_blank">http://www.gecode.org/</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>SystemC <a href="http://www.accellera.org/downloads/standards/systemc/about_systemc/" target="_blank">http://www.accellera.org/downloads/standards/systemc/about_systemc/</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>Boost.Iostreams <a href="http://www.boost.org/libs/iostreams/" target="_blank">http://www.boost.org/libs/iostreams/</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>Boolinq <a href="https://code.google.com/p/boolinq/" target="_blank">https://code.google.com/p/boolinq/</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>"AraRat" (PDF). Archived from the original (PDF) on 2019-08-19. Retrieved 2019-09-15. <a href="https://web.archive.org/web/20190819105358/http://www.cs.technion.ac.il/~lkeren/scp.pdf" target="_blank">https://web.archive.org/web/20190819105358/http://www.cs.technion.ac.il/~lkeren/scp.pdf</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>OpenMPI <a href="http://www.open-mpi.org/" target="_blank">http://www.open-mpi.org/</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>Boost.MPI <a href="http://www.boost.org/libs/mpi/" target="_blank">http://www.boost.org/libs/mpi/</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>Boost.MPL <a href="http://www.boost.org/libs/mpl/" target="_blank">http://www.boost.org/libs/mpl/</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>template metaprogramming <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>LC++ <a href="http://cgi.di.uoa.gr/~smaragd/lc++/" target="_blank">http://cgi.di.uoa.gr/~smaragd/lc++/</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>Castor Archived 2013-01-25 at the Wayback Machine <a href="http://www.mpprogramming.com/Cpp/Default.aspx" target="_blank">http://www.mpprogramming.com/Cpp/Default.aspx</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>Reflect Library <a href="https://bytemaster.github.com/boost_reflect/" target="_blank">https://bytemaster.github.com/boost_reflect/</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> <li id="fn:26"><p>class-based <a href="#fnref:26" class="footnote-back-ref">↩</a></p></li> <li id="fn:27"><p>N3534 <a href="http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2013/n3534.html" target="_blank">http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2013/n3534.html</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></p></li> <li id="fn:28"><p>Boost.Spirit <a href="http://www.boost.org/libs/spirit/" target="_blank">http://www.boost.org/libs/spirit/</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></p></li> <li id="fn:29"><p>using TPL Dataflow <a href="http://msdn.microsoft.com/en-us/devlabs/gg585582.aspx" target="_blank">http://msdn.microsoft.com/en-us/devlabs/gg585582.aspx</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></p></li> <li id="fn:30"><p>only lambda support (lazy functional programming) <a href="/wiki/Lambda_calculus" target="_blank">/wiki/Lambda_calculus</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></p></li> <li id="fn:31"><p>class-based <a href="#fnref:31" class="footnote-back-ref">↩</a></p></li> <li id="fn:32"><p>using Reactive Extensions (Rx) <a href="http://msdn.microsoft.com/en-us/data/gg577609.aspx" target="_blank">http://msdn.microsoft.com/en-us/data/gg577609.aspx</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></p></li> <li id="fn:33"><p>class-based <a href="#fnref:33" class="footnote-back-ref">↩</a></p></li> <li id="fn:34"><p>class-based <a href="#fnref:34" class="footnote-back-ref">↩</a></p></li> <li id="fn:35"><p>Clojure - Concurrent Programming <a href="https://clojure.org/about/concurrent_programming" target="_blank">https://clojure.org/about/concurrent_programming</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></p></li> <li id="fn:36"><p>Clojure - core.async <a href="https://github.com/clojure/core.async" target="_blank">https://github.com/clojure/core.async</a> <a href="#fnref:36" class="footnote-back-ref">↩</a></p></li> <li id="fn:37"><p>Clojure - Functional Programming <a href="https://clojure.org/about/functional_programming" target="_blank">https://clojure.org/about/functional_programming</a> <a href="#fnref:37" class="footnote-back-ref">↩</a></p></li> <li id="fn:38"><p>Clojure - Macros <a href="https://clojure.org/reference/macros" target="_blank">https://clojure.org/reference/macros</a> <a href="#fnref:38" class="footnote-back-ref">↩</a></p></li> <li id="fn:39"><p>Clojure - core.logic <a href="https://github.com/clojure/core.logic/" target="_blank">https://github.com/clojure/core.logic/</a> <a href="#fnref:39" class="footnote-back-ref">↩</a></p></li> <li id="fn:40"><p>Clojure - Threading Macros Guide <a href="https://clojure.org/guides/threading_macros" target="_blank">https://clojure.org/guides/threading_macros</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></p></li> <li id="fn:41"><p>"Light Table". 2019-04-08. <a href="http://lighttable.com/" target="_blank">http://lighttable.com/</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></p></li> <li id="fn:42"><p>Multimethods and Hierarchies <a href="https://clojure.org/reference/multimethods" target="_blank">https://clojure.org/reference/multimethods</a> <a href="#fnref:42" class="footnote-back-ref">↩</a></p></li> <li id="fn:43"><p>Agents and Asynchronous Actions <a href="https://clojure.org/reference/agents" target="_blank">https://clojure.org/reference/agents</a> <a href="#fnref:43" class="footnote-back-ref">↩</a></p></li> <li id="fn:44"><p>"concurrency". CLiki. <a href="https://www.cliki.net/Concurrency" target="_blank">https://www.cliki.net/Concurrency</a> <a href="#fnref:44" class="footnote-back-ref">↩</a></p></li> <li id="fn:45"><p>[1] constraint programming inside CL through extensions <a href="https://www.cliki.net/screamer" target="_blank">https://www.cliki.net/screamer</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></p></li> <li id="fn:46"><p>[2] dataflow extension <a href="https://www.cliki.net/Cells" target="_blank">https://www.cliki.net/Cells</a> <a href="#fnref:46" class="footnote-back-ref">↩</a></p></li> <li id="fn:47"><p>[3] by creating DSLs using the built-in metaprogramming; also see note on functional, constraint and logic paradigms, which are part of declarative <a href="http://www.gigamonkeys.com/book/practical-an-html-generation-library-the-interpreter.html" target="_blank">http://www.gigamonkeys.com/book/practical-an-html-generation-library-the-interpreter.html</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></p></li> <li id="fn:48"><p>[4] MPI, etc via language extensions <a href="https://www.cliki.net/Distributed" target="_blank">https://www.cliki.net/Distributed</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></p></li> <li id="fn:49"><p>template metaprogramming using macros (see C++) <a href="#fnref:49" class="footnote-back-ref">↩</a></p></li> <li id="fn:50"><p>[5] [6] [7] Prolog implemented as a language extension <a href="https://www.cliki.net/Prolog" target="_blank">https://www.cliki.net/Prolog</a> <a href="#fnref:50" class="footnote-back-ref">↩</a></p></li> <li id="fn:51"><p>multiple dispatch, method combinations <a href="#fnref:51" class="footnote-back-ref">↩</a></p></li> <li id="fn:52"><p>class-based <a href="#fnref:52" class="footnote-back-ref">↩</a></p></li> <li id="fn:53"><p>Common Lisp Object System see Wikipedia article on CLOS, the Common Lisp Object System. <a href="/wiki/Common_Lisp_Object_System" target="_blank">/wiki/Common_Lisp_Object_System</a> <a href="#fnref:53" class="footnote-back-ref">↩</a></p></li> <li id="fn:54"><p>implemented by the user via a short macro, example of implementation <a href="http://blog.vjeux.com/2011/lisp/lisp-chaining-operator.html" target="_blank">http://blog.vjeux.com/2011/lisp/lisp-chaining-operator.html</a> <a href="#fnref:54" class="footnote-back-ref">↩</a></p></li> <li id="fn:55"><p>- Visual programming tool based on Common Lisp <a href="https://github.com/honix/Lire" target="_blank">https://github.com/honix/Lire</a> <a href="#fnref:55" class="footnote-back-ref">↩</a></p></li> <li id="fn:56"><p>[8] rule-based programming extension <a href="http://lisa.sourceforge.net/" target="_blank">http://lisa.sourceforge.net/</a> <a href="#fnref:56" class="footnote-back-ref">↩</a></p></li> <li id="fn:57"><p>[9] Archived 2018-04-26 at the Wayback Machine through the Meta Object Protocol <a href="https://common-lisp.net/project/ecl/static/manual/ch31.html" target="_blank">https://common-lisp.net/project/ecl/static/manual/ch31.html</a> <a href="#fnref:57" class="footnote-back-ref">↩</a></p></li> <li id="fn:58"><p>template metaprogramming <a href="#fnref:58" class="footnote-back-ref">↩</a></p></li> <li id="fn:59"><p>class-based <a href="#fnref:59" class="footnote-back-ref">↩</a></p></li> <li id="fn:60"><p>D Language Feature Table <a href="http://www.digitalmars.com/d/2.0/comparison.html" target="_blank">http://www.digitalmars.com/d/2.0/comparison.html</a> <a href="#fnref:60" class="footnote-back-ref">↩</a></p></li> <li id="fn:61"><p>Phobos std.algorithm <a href="http://www.digitalmars.com/d/2.0/phobos/std_algorithm.html" target="_blank">http://www.digitalmars.com/d/2.0/phobos/std_algorithm.html</a> <a href="#fnref:61" class="footnote-back-ref">↩</a></p></li> <li id="fn:62"><p>actor programming <a href="#fnref:62" class="footnote-back-ref">↩</a></p></li> <li id="fn:63"><p>D language String Mixins <a href="http://dlang.org/mixin.html" target="_blank">http://dlang.org/mixin.html</a> <a href="#fnref:63" class="footnote-back-ref">↩</a></p></li> <li id="fn:64"><p>template metaprogramming <a href="#fnref:64" class="footnote-back-ref">↩</a></p></li> <li id="fn:65"><p>template metaprogramming <a href="#fnref:65" class="footnote-back-ref">↩</a></p></li> <li id="fn:66"><p>class-based <a href="#fnref:66" class="footnote-back-ref">↩</a></p></li> <li id="fn:67"><p>template metaprogramming <a href="#fnref:67" class="footnote-back-ref">↩</a></p></li> <li id="fn:68"><p>class-based <a href="#fnref:68" class="footnote-back-ref">↩</a></p></li> <li id="fn:69"><p>class-based <a href="#fnref:69" class="footnote-back-ref">↩</a></p></li> <li id="fn:70"><p>class-based <a href="#fnref:70" class="footnote-back-ref">↩</a></p></li> <li id="fn:71"><p>The Little JavaScripter demonstrates fundamental commonality with Scheme, a functional language. <a href="http://www.crockford.com/javascript/little.html" target="_blank">http://www.crockford.com/javascript/little.html</a> <a href="#fnref:71" class="footnote-back-ref">↩</a></p></li> <li id="fn:72"><p>Object-Oriented Programming in JavaScript Archived 2019-02-10 at the Wayback Machine gives an overview of object-oriented programming techniques in JavaScript. <a href="http://mckoss.com/jscript/object.htm" target="_blank">http://mckoss.com/jscript/object.htm</a> <a href="#fnref:72" class="footnote-back-ref">↩</a></p></li> <li id="fn:73"><p>promises, native extensions <a href="#fnref:73" class="footnote-back-ref">↩</a></p></li> <li id="fn:74"><p>using Node.js' cluster module or child_process.fork method, web workers in the browser, etc. <a href="/wiki/Node.js" target="_blank">/wiki/Node.js</a> <a href="#fnref:74" class="footnote-back-ref">↩</a></p></li> <li id="fn:75"><p>"React – A JavaScript library for building user interfaces". 2019-04-08. <a href="https://reactjs.org/" target="_blank">https://reactjs.org/</a> <a href="#fnref:75" class="footnote-back-ref">↩</a></p></li> <li id="fn:76"><p>"TNG-Hooks". GitHub. 2019-04-08. <a href="https://github.com/getify/tng-hooks" target="_blank">https://github.com/getify/tng-hooks</a> <a href="#fnref:76" class="footnote-back-ref">↩</a></p></li> <li id="fn:77"><p>Prototype-based <a href="#fnref:77" class="footnote-back-ref">↩</a></p></li> <li id="fn:78"><p>"Lodash documentation". 2019-04-08. <a href="https://lodash.com/docs/4.17.11#flow" target="_blank">https://lodash.com/docs/4.17.11#flow</a> <a href="#fnref:78" class="footnote-back-ref">↩</a></p></li> <li id="fn:79"><p>"mori". 2019-04-08. <a href="https://swannodette.github.io/mori/#pipeline" target="_blank">https://swannodette.github.io/mori/#pipeline</a> <a href="#fnref:79" class="footnote-back-ref">↩</a></p></li> <li id="fn:80"><p>"Light Table". 2019-04-08. <a href="http://lighttable.com/" target="_blank">http://lighttable.com/</a> <a href="#fnref:80" class="footnote-back-ref">↩</a></p></li> <li id="fn:81"><p>using Reactive Extensions (RxJS) <a href="http://reactivex.io/rxjs/" target="_blank">http://reactivex.io/rxjs/</a> <a href="#fnref:81" class="footnote-back-ref">↩</a></p></li> <li id="fn:82"><p>"TNG-Hooks". GitHub. 2019-04-08. <a href="https://github.com/getify/tng-hooks" target="_blank">https://github.com/getify/tng-hooks</a> <a href="#fnref:82" class="footnote-back-ref">↩</a></p></li> <li id="fn:83"><p>in Node.js via their events module <a href="https://nodejs.org/api/events.html" target="_blank">https://nodejs.org/api/events.html</a> <a href="#fnref:83" class="footnote-back-ref">↩</a></p></li> <li id="fn:84"><p>in browsers via their native EventTarget API <a href="https://developer.mozilla.org/en-US/docs/Web/API/EventTarget" target="_blank">https://developer.mozilla.org/en-US/docs/Web/API/EventTarget</a> <a href="#fnref:84" class="footnote-back-ref">↩</a></p></li> <li id="fn:85"><p>purely functional <a href="#fnref:85" class="footnote-back-ref">↩</a></p></li> <li id="fn:86"><p>actor programming <a href="#fnref:86" class="footnote-back-ref">↩</a></p></li> <li id="fn:87"><p>using TPL Dataflow <a href="http://msdn.microsoft.com/en-us/devlabs/gg585582.aspx" target="_blank">http://msdn.microsoft.com/en-us/devlabs/gg585582.aspx</a> <a href="#fnref:87" class="footnote-back-ref">↩</a></p></li> <li id="fn:88"><p>class-based <a href="#fnref:88" class="footnote-back-ref">↩</a></p></li> <li id="fn:89"><p>using Reactive Extensions (Rx) <a href="http://msdn.microsoft.com/en-us/data/gg577609.aspx" target="_blank">http://msdn.microsoft.com/en-us/data/gg577609.aspx</a> <a href="#fnref:89" class="footnote-back-ref">↩</a></p></li> <li id="fn:90"><p>purely functional <a href="#fnref:90" class="footnote-back-ref">↩</a></p></li> <li id="fn:91"><p>parameterized classes <a href="#fnref:91" class="footnote-back-ref">↩</a></p></li> <li id="fn:92"><p>class-based <a href="#fnref:92" class="footnote-back-ref">↩</a></p></li> <li id="fn:93"><p>"Prolog embedding". Haskell.org. <a href="https://hackage.haskell.org/package/hswip" target="_blank">https://hackage.haskell.org/package/hswip</a> <a href="#fnref:93" class="footnote-back-ref">↩</a></p></li> <li id="fn:94"><p>"Functional Reactive Programming". HaskellWiki. <a href="https://wiki.haskell.org/Functional_Reactive_Programming" target="_blank">https://wiki.haskell.org/Functional_Reactive_Programming</a> <a href="#fnref:94" class="footnote-back-ref">↩</a></p></li> <li id="fn:95"><p>Cloud Haskell <a href="https://haskell-distributed.github.io/" target="_blank">https://haskell-distributed.github.io/</a> <a href="#fnref:95" class="footnote-back-ref">↩</a></p></li> <li id="fn:96"><p>purely functional <a href="#fnref:96" class="footnote-back-ref">↩</a></p></li> <li id="fn:97"><p>"Template Haskell". HaskellWiki. <a href="https://wiki.haskell.org/Template_Haskell" target="_blank">https://wiki.haskell.org/Template_Haskell</a> <a href="#fnref:97" class="footnote-back-ref">↩</a></p></li> <li id="fn:98"><p>"Logict: A backtracking logic-programming monad". Haskell.org. <a href="https://hackage.haskell.org/package/logict" target="_blank">https://hackage.haskell.org/package/logict</a> <a href="#fnref:98" class="footnote-back-ref">↩</a></p></li> <li id="fn:99"><p>immutable <a href="#fnref:99" class="footnote-back-ref">↩</a></p></li> <li id="fn:100"><p>Kollmansberger, Steve; Erwig, Martin (30 May 2006). "Haskell Rules: Embedding Rule Systems in Haskell" (PDF). Oregon State University. <a href="https://web.engr.oregonstate.edu/~erwig/HaskellRules/HaskellRules_June06.pdf" target="_blank">https://web.engr.oregonstate.edu/~erwig/HaskellRules/HaskellRules_June06.pdf</a> <a href="#fnref:100" class="footnote-back-ref">↩</a></p></li> <li id="fn:101"><p>actor programming <a href="#fnref:101" class="footnote-back-ref">↩</a></p></li> <li id="fn:102"><p>Prototype-based <a href="#fnref:102" class="footnote-back-ref">↩</a></p></li> <li id="fn:103"><p>class-based <a href="#fnref:103" class="footnote-back-ref">↩</a></p></li> <li id="fn:104"><p>https://jcp.org/en/jsr/detail?id=331 JSR 331: Constraint Programming API <a href="https://jcp.org/en/jsr/detail?id=331" target="_blank">https://jcp.org/en/jsr/detail?id=331</a> <a href="#fnref:104" class="footnote-back-ref">↩</a></p></li> <li id="fn:105"><p>https://github.com/GoogleCloudPlatform/DataflowJavaSDK Google Cloud Platform Dataflow SDK <a href="https://github.com/GoogleCloudPlatform/DataflowJavaSDK" target="_blank">https://github.com/GoogleCloudPlatform/DataflowJavaSDK</a> <a href="#fnref:105" class="footnote-back-ref">↩</a></p></li> <li id="fn:106"><p>class-based <a href="#fnref:106" class="footnote-back-ref">↩</a></p></li> <li id="fn:107"><p>"JuliaOpt/JuMP.jl". GitHub. JuliaOpt. 11 February 2020. Retrieved 12 February 2020. <a href="https://github.com/JuliaOpt/JuMP.jl" target="_blank">https://github.com/JuliaOpt/JuMP.jl</a> <a href="#fnref:107" class="footnote-back-ref">↩</a></p></li> <li id="fn:108"><p>"GitHub - MikeInnes/DataFlow.jl". GitHub. 2019-01-15. <a href="https://github.com/MikeInnes/DataFlow.jl" target="_blank">https://github.com/MikeInnes/DataFlow.jl</a> <a href="#fnref:108" class="footnote-back-ref">↩</a></p></li> <li id="fn:109"><p>"GitHub - JuliaGizmos/Reactive.jl: Reactive programming primitives for Julia". GitHub. 2018-12-28. <a href="https://github.com/JuliaGizmos/Reactive.jl" target="_blank">https://github.com/JuliaGizmos/Reactive.jl</a> <a href="#fnref:109" class="footnote-back-ref">↩</a></p></li> <li id="fn:110"><p>https://github.com/davidanthoff/Query.jl Query almost anything in julia <a href="https://github.com/davidanthoff/Query.jl" target="_blank">https://github.com/davidanthoff/Query.jl</a> <a href="#fnref:110" class="footnote-back-ref">↩</a></p></li> <li id="fn:111"><p>https://github.com/lilinjn/LilKanren.jl A collection of Kanren implementations in Julia <a href="https://github.com/lilinjn/LilKanren.jl" target="_blank">https://github.com/lilinjn/LilKanren.jl</a> <a href="#fnref:111" class="footnote-back-ref">↩</a></p></li> <li id="fn:112"><p>Uses structs with function polymorphism and multiple dispatch <a href="#fnref:112" class="footnote-back-ref">↩</a></p></li> <li id="fn:113"><p>"GitHub - abeschneider/PEGParser.jl: PEG Parser for Julia". GitHub. 2018-12-03. <a href="https://github.com/abeschneider/PEGParser.jl" target="_blank">https://github.com/abeschneider/PEGParser.jl</a> <a href="#fnref:113" class="footnote-back-ref">↩</a></p></li> <li id="fn:114"><p>"GitHub - gitfoxi/Parsimonious.jl: A PEG parser generator for Julia". GitHub. 2017-08-03. <a href="https://github.com/gitfoxi/Parsimonious.jl" target="_blank">https://github.com/gitfoxi/Parsimonious.jl</a> <a href="#fnref:114" class="footnote-back-ref">↩</a></p></li> <li id="fn:115"><p>Lazy https://github.com/MikeInnes/Lazy.jl <a href="https://github.com/MikeInnes/Lazy.jl" target="_blank">https://github.com/MikeInnes/Lazy.jl</a> <a href="#fnref:115" class="footnote-back-ref">↩</a></p></li> <li id="fn:116"><p>class-based <a href="#fnref:116" class="footnote-back-ref">↩</a></p></li> <li id="fn:117"><p>class-based <a href="#fnref:117" class="footnote-back-ref">↩</a></p></li> <li id="fn:118"><p>Prototype-based <a href="#fnref:118" class="footnote-back-ref">↩</a></p></li> <li id="fn:119"><p>"Execute loop iterations in parallel". mathworks.com. Retrieved 21 October 2016. <a href="http://mathworks.com/help/distcomp/parfor.html" target="_blank">http://mathworks.com/help/distcomp/parfor.html</a> <a href="#fnref:119" class="footnote-back-ref">↩</a></p></li> <li id="fn:120"><p>"Write Constraints". mathworks.com. Retrieved 21 October 2016. <a href="https://mathworks.com/help/optim/write-constraints.html" target="_blank">https://mathworks.com/help/optim/write-constraints.html</a> <a href="#fnref:120" class="footnote-back-ref">↩</a></p></li> <li id="fn:121"><p>"Getting Started with SimEvents". mathworks.com. Retrieved 21 October 2016. <a href="https://mathworks.com/help/simevents/getting-started-with-simevents.html" target="_blank">https://mathworks.com/help/simevents/getting-started-with-simevents.html</a> <a href="#fnref:121" class="footnote-back-ref">↩</a></p></li> <li id="fn:122"><p>"Execute loop iterations in parallel". mathworks.com. Retrieved 21 October 2016. <a href="http://mathworks.com/help/distcomp/parfor.html" target="_blank">http://mathworks.com/help/distcomp/parfor.html</a> <a href="#fnref:122" class="footnote-back-ref">↩</a></p></li> <li id="fn:123"><p>"Execute MATLAB expression in text - MATLAB eval". mathworks.com. Retrieved 21 October 2016. <a href="https://mathworks.com/help/matlab/ref/eval.html" target="_blank">https://mathworks.com/help/matlab/ref/eval.html</a> <a href="#fnref:123" class="footnote-back-ref">↩</a></p></li> <li id="fn:124"><p>"Determine class of object". mathworks.com. Retrieved 21 October 2016. <a href="https://mathworks.com/help/matlab/ref/class.html" target="_blank">https://mathworks.com/help/matlab/ref/class.html</a> <a href="#fnref:124" class="footnote-back-ref">↩</a></p></li> <li id="fn:125"><p>"Class Metadata". mathworks.com. Retrieved 21 October 2016. <a href="https://mathworks.com/help/matlab/get-information-about-classes-and-objects.html" target="_blank">https://mathworks.com/help/matlab/get-information-about-classes-and-objects.html</a> <a href="#fnref:125" class="footnote-back-ref">↩</a></p></li> <li id="fn:126"><p>"Object-Oriented Programming". mathworks.com. Retrieved 21 October 2016. <a href="https://mathworks.com/help/matlab/object-oriented-programming.html" target="_blank">https://mathworks.com/help/matlab/object-oriented-programming.html</a> <a href="#fnref:126" class="footnote-back-ref">↩</a></p></li> <li id="fn:127"><p>"Simulink". mathworks.com. Retrieved 21 October 2016. <a href="https://mathworks.com/help/simulink/" target="_blank">https://mathworks.com/help/simulink/</a> <a href="#fnref:127" class="footnote-back-ref">↩</a></p></li> <li id="fn:128"><p>class-based <a href="#fnref:128" class="footnote-back-ref">↩</a></p></li> <li id="fn:129"><p>class-based <a href="#fnref:129" class="footnote-back-ref">↩</a></p></li> <li id="fn:130"><p>class-based <a href="#fnref:130" class="footnote-back-ref">↩</a></p></li> <li id="fn:131"><p>class-based <a href="#fnref:131" class="footnote-back-ref">↩</a></p></li> <li id="fn:132"><p>interpreter based threads <a href="http://perldoc.perl.org/threads.html" target="_blank">http://perldoc.perl.org/threads.html</a> <a href="#fnref:132" class="footnote-back-ref">↩</a></p></li> <li id="fn:133"><p>Higher Order Perl <a href="http://hop.perl.plover.com/book/" target="_blank">http://hop.perl.plover.com/book/</a> <a href="#fnref:133" class="footnote-back-ref">↩</a></p></li> <li id="fn:134"><p>class-based <a href="#fnref:134" class="footnote-back-ref">↩</a></p></li> <li id="fn:135"><p>class-based <a href="#fnref:135" class="footnote-back-ref">↩</a></p></li> <li id="fn:136"><p>PHP Manual, Chapter 17. Functions <a href="http://php.net/manual/en/index.php" target="_blank">http://php.net/manual/en/index.php</a> <a href="#fnref:136" class="footnote-back-ref">↩</a></p></li> <li id="fn:137"><p>PHP Manual, Chapter 19. Classes and Objects (PHP 5) <a href="http://php.net/manual/en/index.php" target="_blank">http://php.net/manual/en/index.php</a> <a href="#fnref:137" class="footnote-back-ref">↩</a></p></li> <li id="fn:138"><p>PHP Manual, Anonymous functions <a href="http://php.net/manual/en/index.php" target="_blank">http://php.net/manual/en/index.php</a> <a href="#fnref:138" class="footnote-back-ref">↩</a></p></li> <li id="fn:139"><p>class-based <a href="#fnref:139" class="footnote-back-ref">↩</a></p></li> <li id="fn:140"><p>class-based <a href="#fnref:140" class="footnote-back-ref">↩</a></p></li> <li id="fn:141"><p>"Parallel Processing and Multiprocessing in Python". Python Wiki. Retrieved 21 October 2016. <a href="https://wiki.python.org/moin/ParallelProcessing" target="_blank">https://wiki.python.org/moin/ParallelProcessing</a> <a href="#fnref:141" class="footnote-back-ref">↩</a></p></li> <li id="fn:142"><p>"threading — Higher-level threading interface". docs.python.org. Retrieved 21 October 2016. <a href="https://docs.python.org/2/library/threading.html" target="_blank">https://docs.python.org/2/library/threading.html</a> <a href="#fnref:142" class="footnote-back-ref">↩</a></p></li> <li id="fn:143"><p>"python-constraint". pypi.python.org. Retrieved 21 October 2016. <a href="https://pypi.python.org/pypi/python-constraint" target="_blank">https://pypi.python.org/pypi/python-constraint</a> <a href="#fnref:143" class="footnote-back-ref">↩</a></p></li> <li id="fn:144"><p>"DistributedProgramming". Python Wiki. Retrieved 21 October 2016. <a href="https://wiki.python.org/moin/DistributedProgramming" target="_blank">https://wiki.python.org/moin/DistributedProgramming</a> <a href="#fnref:144" class="footnote-back-ref">↩</a></p></li> <li id="fn:145"><p>"Chapter 9. Metaprogramming". chimera.labs.oreilly.com. Archived from the original on 23 October 2016. Retrieved 22 October 2016. <a href="https://web.archive.org/web/20161023050954/http://chimera.labs.oreilly.com/books/1230000000393/ch09.html" target="_blank">https://web.archive.org/web/20161023050954/http://chimera.labs.oreilly.com/books/1230000000393/ch09.html</a> <a href="#fnref:145" class="footnote-back-ref">↩</a></p></li> <li id="fn:146"><p>"Metaprogramming". readthedocs.io. Retrieved 22 October 2016. <a href="https://python-3-patterns-idioms-test.readthedocs.io/en/latest/Metaprogramming.html" target="_blank">https://python-3-patterns-idioms-test.readthedocs.io/en/latest/Metaprogramming.html</a> <a href="#fnref:146" class="footnote-back-ref">↩</a></p></li> <li id="fn:147"><p>"PEP 443 – Single-dispatch generic functions". python.org. Retrieved 22 October 2016. <a href="https://www.python.org/dev/peps/pep-0443/" target="_blank">https://www.python.org/dev/peps/pep-0443/</a> <a href="#fnref:147" class="footnote-back-ref">↩</a></p></li> <li id="fn:148"><p>"PEP 484 – Type Hints". python.org. Retrieved 22 October 2016. <a href="https://www.python.org/dev/peps/pep-0484/#generics" target="_blank">https://www.python.org/dev/peps/pep-0484/#generics</a> <a href="#fnref:148" class="footnote-back-ref">↩</a></p></li> <li id="fn:149"><p>"PyDatalog". Retrieved 22 October 2016. <a href="https://sites.google.com/site/pydatalog/" target="_blank">https://sites.google.com/site/pydatalog/</a> <a href="#fnref:149" class="footnote-back-ref">↩</a></p></li> <li id="fn:150"><p>class-based <a href="#fnref:150" class="footnote-back-ref">↩</a></p></li> <li id="fn:151"><p>"Light Table". 2019-04-08. <a href="http://lighttable.com/" target="_blank">http://lighttable.com/</a> <a href="#fnref:151" class="footnote-back-ref">↩</a></p></li> <li id="fn:152"><p>"Futureverse". <a href="https://www.futureverse.org/" target="_blank">https://www.futureverse.org/</a> <a href="#fnref:152" class="footnote-back-ref">↩</a></p></li> <li id="fn:153"><p>"future batchtools". <a href="https://future.batchtools.futureverse.org/" target="_blank">https://future.batchtools.futureverse.org/</a> <a href="#fnref:153" class="footnote-back-ref">↩</a></p></li> <li id="fn:154"><p>"Magrittr: A Forward Pipe Operator for R". cran.r-project.org\access-date=13 July 2017. 17 November 2020. <a href="https://cran.r-project.org/package=magrittr" target="_blank">https://cran.r-project.org/package=magrittr</a> <a href="#fnref:154" class="footnote-back-ref">↩</a></p></li> <li id="fn:155"><p>Racket Guide: Concurrency and Synchronization <a href="https://docs.racket-lang.org/guide/concurrency.html" target="_blank">https://docs.racket-lang.org/guide/concurrency.html</a> <a href="#fnref:155" class="footnote-back-ref">↩</a></p></li> <li id="fn:156"><p>The Rosette Guide <a href="https://docs.racket-lang.org/rosette-guide/" target="_blank">https://docs.racket-lang.org/rosette-guide/</a> <a href="#fnref:156" class="footnote-back-ref">↩</a></p></li> <li id="fn:157"><p>FrTime: A Language for Reactive Programs <a href="https://docs.racket-lang.org/frtime/" target="_blank">https://docs.racket-lang.org/frtime/</a> <a href="#fnref:157" class="footnote-back-ref">↩</a></p></li> <li id="fn:158"><p>Racket Guide: Distributed Places <a href="https://docs.racket-lang.org/guide/parallelism.html#%28part._distributed-places%29" target="_blank">https://docs.racket-lang.org/guide/parallelism.html#%28part._distributed-places%29</a> <a href="#fnref:158" class="footnote-back-ref">↩</a></p></li> <li id="fn:159"><p>Lazy Racket <a href="https://docs.racket-lang.org/lazy/" target="_blank">https://docs.racket-lang.org/lazy/</a> <a href="#fnref:159" class="footnote-back-ref">↩</a></p></li> <li id="fn:160"><p>Channels and other mechanisms <a href="https://docs.perl6.org/language/concurrency" target="_blank">https://docs.perl6.org/language/concurrency</a> <a href="#fnref:160" class="footnote-back-ref">↩</a></p></li> <li id="fn:161"><p>"Problem Solver module". <a href="https://raku.land/github:FCO/ProblemSolver" target="_blank">https://raku.land/github:FCO/ProblemSolver</a> <a href="#fnref:161" class="footnote-back-ref">↩</a></p></li> <li id="fn:162"><p>Feed operator <a href="https://docs.perl6.org/routine/==%3E" target="_blank">https://docs.perl6.org/routine/==%3E</a> <a href="#fnref:162" class="footnote-back-ref">↩</a></p></li> <li id="fn:163"><p>https://github.com/perl6/doc/issues/1744#issuecomment-360565196 Cro module <a href="https://github.com/perl6/doc/issues/1744#issuecomment-360565196" target="_blank">https://github.com/perl6/doc/issues/1744#issuecomment-360565196</a> <a href="#fnref:163" class="footnote-back-ref">↩</a></p></li> <li id="fn:164"><p>"Meta-programming: What, why and how". 2011-12-14. <a href="https://perl6advent.wordpress.com/2011/12/14/meta-programming-what-why-and-how/" target="_blank">https://perl6advent.wordpress.com/2011/12/14/meta-programming-what-why-and-how/</a> <a href="#fnref:164" class="footnote-back-ref">↩</a></p></li> <li id="fn:165"><p>https://perl6advent.wordpress.com/2009/12/18/day-18-roles/ Parametrized Roles <a href="https://perl6advent.wordpress.com/2009/12/18/day-18-roles/" target="_blank">https://perl6advent.wordpress.com/2009/12/18/day-18-roles/</a> <a href="#fnref:165" class="footnote-back-ref">↩</a></p></li> <li id="fn:166"><p>"Meta-object protocol (MOP)". <a href="https://docs.perl6.org/language/mop" target="_blank">https://docs.perl6.org/language/mop</a> <a href="#fnref:166" class="footnote-back-ref">↩</a></p></li> <li id="fn:167"><p>https://docs.perl6.org/language/classtut Classes and Roles <a href="https://docs.perl6.org/language/classtut" target="_blank">https://docs.perl6.org/language/classtut</a> <a href="#fnref:167" class="footnote-back-ref">↩</a></p></li> <li id="fn:168"><p>class-based <a href="#fnref:168" class="footnote-back-ref">↩</a></p></li> <li id="fn:169"><p>actor programming <a href="#fnref:169" class="footnote-back-ref">↩</a></p></li> <li id="fn:170"><p>"The Rust macros guide". Rust. Retrieved 19 January 2015. <a href="http://doc.rust-lang.org/1.0.0-alpha/book/macros.html" target="_blank">http://doc.rust-lang.org/1.0.0-alpha/book/macros.html</a> <a href="#fnref:170" class="footnote-back-ref">↩</a></p></li> <li id="fn:171"><p>"The Rust compiler plugins guide". Rust. Retrieved 19 January 2015. <a href="http://doc.rust-lang.org/1.0.0-alpha/book/plugins.html" target="_blank">http://doc.rust-lang.org/1.0.0-alpha/book/plugins.html</a> <a href="#fnref:171" class="footnote-back-ref">↩</a></p></li> <li id="fn:172"><p>The Rust Reference §6.1.3.1 <a href="http://doc.rust-lang.org/1.0.0-alpha/reference.html#generic-functions" target="_blank">http://doc.rust-lang.org/1.0.0-alpha/reference.html#generic-functions</a> <a href="#fnref:172" class="footnote-back-ref">↩</a></p></li> <li id="fn:173"><p>class-based <a href="#fnref:173" class="footnote-back-ref">↩</a></p></li> <li id="fn:174"><p>An Overview of the Scala Programming Language <a href="http://www.scala-lang.org/sites/default/files/linuxsoft_archives/docu/files/ScalaOverview.pdf" target="_blank">http://www.scala-lang.org/sites/default/files/linuxsoft_archives/docu/files/ScalaOverview.pdf</a> <a href="#fnref:174" class="footnote-back-ref">↩</a></p></li> <li id="fn:175"><p>Scala Language Specification <a href="https://wayback.archive-it.org/all/20171003043151/http://www.scala-lang.org/sites/default/files/linuxsoft_archives/docu/files/ScalaReference.pdf" target="_blank">https://wayback.archive-it.org/all/20171003043151/http://www.scala-lang.org/sites/default/files/linuxsoft_archives/docu/files/ScalaReference.pdf</a> <a href="#fnref:175" class="footnote-back-ref">↩</a></p></li> <li id="fn:176"><p>actor programming <a href="#fnref:176" class="footnote-back-ref">↩</a></p></li> <li id="fn:177"><p>Akka Archived 2013-01-19 at the Wayback Machine <a href="http://doc.akka.io/docs/akka/snapshot/scala/dataflow.html" target="_blank">http://doc.akka.io/docs/akka/snapshot/scala/dataflow.html</a> <a href="#fnref:177" class="footnote-back-ref">↩</a></p></li> <li id="fn:178"><p>class-based <a href="#fnref:178" class="footnote-back-ref">↩</a></p></li> <li id="fn:179"><p>class-based <a href="#fnref:179" class="footnote-back-ref">↩</a></p></li> <li id="fn:180"><p>class-based <a href="#fnref:180" class="footnote-back-ref">↩</a></p></li> <li id="fn:181"><p>"Tcl Programming/Introduction". en.wikibooks.org. Retrieved 22 October 2016. <a href="https://en.wikibooks.org/wiki/Tcl_Programming/Introduction#One_language.2C_many_styles" target="_blank">https://en.wikibooks.org/wiki/Tcl_Programming/Introduction#One_language.2C_many_styles</a> <a href="#fnref:181" class="footnote-back-ref">↩</a></p></li> <li id="fn:182"><p>Prototype-based <a href="#fnref:182" class="footnote-back-ref">↩</a></p></li> <li id="fn:183"><p>"TCLLIB - Tcl Standard Library: snitfaq". sourceforge.net. Retrieved 22 October 2016. <a href="http://tmml.sourceforge.net/doc/tcllib/snitfaq.html" target="_blank">http://tmml.sourceforge.net/doc/tcllib/snitfaq.html</a> <a href="#fnref:183" class="footnote-back-ref">↩</a></p></li> <li id="fn:184"><p>using TPL Dataflow <a href="http://msdn.microsoft.com/en-us/devlabs/gg585582.aspx" target="_blank">http://msdn.microsoft.com/en-us/devlabs/gg585582.aspx</a> <a href="#fnref:184" class="footnote-back-ref">↩</a></p></li> <li id="fn:185"><p>class-based <a href="#fnref:185" class="footnote-back-ref">↩</a></p></li> <li id="fn:186"><p>using Reactive Extensions (Rx) <a href="http://msdn.microsoft.com/en-us/data/gg577609.aspx" target="_blank">http://msdn.microsoft.com/en-us/data/gg577609.aspx</a> <a href="#fnref:186" class="footnote-back-ref">↩</a></p></li> <li id="fn:187"><p>class-based <a href="#fnref:187" class="footnote-back-ref">↩</a></p></li> <li id="fn:188"><p>Notes for Programming Language Experts, Wolfram Language Documentation. <a href="http://www.wolfram.com/language/for-experts/" target="_blank">http://www.wolfram.com/language/for-experts/</a> <a href="#fnref:188" class="footnote-back-ref">↩</a></p></li> <li id="fn:189"><p>External Programs, Wolfram Language Documentation. <a href="https://reference.wolfram.com/language/tutorial/ExternalPrograms.html" target="_blank">https://reference.wolfram.com/language/tutorial/ExternalPrograms.html</a> <a href="#fnref:189" class="footnote-back-ref">↩</a></p></li> </ol>