Civil Rights
Movements, leaders, victories and the continuing fight for equality.
Explore the people, places, events, achievements, struggles and stories that shaped our journey.
Movements, leaders, victories and the continuing fight for equality.
Innovation, patents, science, technology and world-changing contributions.
Pioneers, champions, Negro Leagues, records, activism and excellence.
Meet the people whose lives, choices and achievements shaped the journey.
Black towns, communities, institutions and places where history happened.
Moments that changed communities, movements, institutions and the nation.
Wilmington, North Carolina once had a thriving Black middle class and an elected interracial government. In 1898 white supremacists used violence to overthrow that government, kill Black residents and drive many others from the city.
MORE →Reflects the personal views, recollections, and perspective of the author, Mike Davis.
This is a personal recollection on the Move fire on May 13, 1985
The table shows a comparison of functional programming languages which compares various features and designs of different functional programming languages.
| Name | Pure | Lazy evaluation | Typing | Abstract data types | Algebraic data types | Data is immutable | Type classes | Garbage collection | First appeared |
|---|---|---|---|---|---|---|---|---|---|
| Common Lisp | No[1] | Simulated with thunks[2] | Dynamic[3] | Yes[4] | Extension[5] | No[6] | ? | Yes | 1984 |
| Scheme | No[7] | Yes[8] | Dynamic[7] | Yes[9] | Simulated with thunks[10] | No[11] | No | Yes | 1975 |
| Racket | No | Default in Lazy Racket[12] | Strong, Dynamic, statically typed with gradual typing in Typed Racket[13] | Yes[14] | Yes, with Algebraic Racket[15] | Partial[16] | No | Yes | 1995 |
| Clojure | No[17] | Yes[18] | Dynamic[19] | Yes[20] | Yes[21] | Yes[22] | No | Yes | 2007 |
| Standard ML | No[23] | No[24][25] | Static[26] | Yes | Yes | Yes[27] | No | Yes | 1983 |
| OCaml | No[28] | Yes[28] | Static[29] | Yes[30] | Yes[31] | Yes[32] | Simulated with parametric modules[33] | Yes | 1996 |
| F# | No[34] | Yes[35] | Static[36] | Yes[37] | Yes[38] | Yes[39] | No | Yes | 2005 |
| Haskell | Yes[40] | Default[41] | Static[42] | Yes[40] | Yes[43] | Yes[44] | Yes[45] | Yes | 1990 |
| Scala | No[46] | Yes[47] | Static[46] | Yes[48] | Yes[48] | Yes[49] | Yes[50] | Yes | 2004 |
| JavaScript | No | Extension[51] | Dynamic[52] | Extension[53] | Extension[54] | Partial[55][56] | ? | Yes | 1995 |
| Clean | Yes[57] | Yes, with optional strictness annotations[58] | Static with uniqueness/optionally dynamic[59] | Yes[58] | Yes[58] | Yes, except for unique types[58] | Yes[58] | Yes | 1987 |
| Miranda | Yes[60] | Default[61] | Static[60] | Yes[62] | Yes[60] | Yes | No | Yes | 1986 |
| SASL | Yes[63] | Yes | Dynamic[64] | Yes | Yes | Yes | No | Yes | 1972 |
| Elixir | No | Stream module[65] | Dynamic | Yes | No | Yes | ? | Yes | 2012 |
| Erlang | No | No[66] | Dynamic | Yes[67] | No | Yes[68] | ? | Yes | 1986 |
| Elm | Yes | No | Static[69] | ? | Yes[70] | Yes[69] | No | Yes | 2012 |
| Futhark | Yes | No | Static[71] | Yes | Yes | Yes[69] | No | Yes | 2014 |
| Python | No[72] | Simulated with generators | Dynamic[73] | Yes[74] | No | Partial[75] | ? | Yes | 1991 |
| Idris | Yes[76] | Yes[76] | Static[76] | Yes[76] | Yes[76] | Yes[76] | Yes[76] | Yes | 2007 |
| Nix | Yes[77] | Yes[77] | Dynamic[77] | No | Yes | Yes | No | Yes | 2003 |
| Wolfram Language | No | No | Static | Yes | Yes | Yes | No | Yes | 1988 |
| Kotlin | No | Lazy delegation[78] and Sequence[79] | Static | Yes | No | Yes | No | Yes | 2011 |
| Swift | No | No | Static | Yes | Yes | Yes | No | Swift uses Automatic Reference Counting, which differs from tracing garbage collection but is designed to provide similar benefits with better performance. | 2014 |
| Julia | No | No[80] | Dynamic[81] | Yes[81] | No | Partial[81] | ? | Yes | 2012 |
| PureScript | Yes | No | Static | Yes | Yes | Yes | Yes | Yes | 2013 |
| Rust | No | Lazy iterators[82] and external libraries[83] | Static[84] | Yes[85] | Yes[86] | Yes[87] | Yes, through traits[85] | No | 2010 |
| Bosque | No | No | Static | Yes | Yes | Yes | ? | Yes | 2019 |
| D | Optional[88][89] | Optional[90] | Static[91] | ? | Yes | Yes[92] | No | Yes[93] | 2001 |
| Gleam | No[94] | Experimental external libraries | Static | Yes | Yes | Yes | No | Yes | 2019 |
{{cite web}}: CS1 maint: multiple names: authors list (link)
Source: Wikipedia. Article content is retrieved live through the MediaWiki API.
The table shows a comparison of functional programming languages which compares various features and designs of different functional programming languages.
Programming languages can be grouped by the number and types of paradigms supported.
Programming languages are used for controlling the behavior of a machine (often a computer). Like natural languages, programming languages follow rules for syntax and semantics. There are thousands of programming languages with new ones developed annually. While few languages achieve widespread adoption, professional programmers may use multiple languages throughout their career. Most programming languages are not standardized by an international (or national) standard, even widely used ones, such as Perl or Standard ML (despite the name). Notable standardized programming languages include ALGOL, C, C++, JavaScript (under the name ECMAScript), Smalltalk, Prolog, Common Lisp, Scheme (IEEE standard), ISLISP, Ada, Fortran, COBOL, SQL, and XQuery.
This comparison of programming languages (associative arrays) compares the features of associative array data structures or array-lookup processing for over 40 computer programming languages.
Before the 1921 destruction of Tulsa’s Greenwood District, Black residents had created a remarkable center of business and community life. The district included stores, professional offices, entertainment venues and homes owned by Black citizens. Understanding Greenwood means learning what was built—not only what was burned.
MORE →Brown v. Board of Education in 1954.