New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 100 | older 100) (20 | 50 | 100 | 250 | 500)
- 15:54, 29 May 2024 Combinators (hist | edit) [34 bytes] Adám Brudzewsky (talk | contribs) (Redirected page to Function composition) Tag: New redirect
- 15:54, 29 May 2024 Combinator (hist | edit) [34 bytes] Adám Brudzewsky (talk | contribs) (Redirected page to Function composition) Tag: New redirect
- 13:35, 1 May 2024 Meetups (hist | edit) [25 bytes] Adám Brudzewsky (talk | contribs) (Redirected page to User groups) Tag: New redirect
- 00:02, 16 April 2024 Joey K. Tuttle (hist | edit) [25 bytes] Marshall (talk | contribs) (Redirected page to Joey Tuttle) Tag: New redirect
- 23:36, 15 April 2024 Philadelphia Scientific Center (hist | edit) [48 bytes] Marshall (talk | contribs) (Redirected page to IBM#Philadelphia Scientific Center) Tag: New redirect
- 23:20, 15 April 2024 Joey Tuttle (hist | edit) [3,131 bytes] Marshall (talk | contribs) (Created page with "'''Joey Keith Tuttle''' (April 29, 1942 – February 26, 2024<ref name=obit>Benito & Azzaro Pacific Gardens Chapel. [https://pacificgardenschapel.com/tribute/details/329905/Joey-Tuttle/obituary.html Obituary of Joey Keith Tuttle]. 2024-03-09.</ref>) was an APL programmer at IBM and I.P. Sharp Associates, and later a J programmer, with an interest in data analysis. Tuttle graduated high school in 1960 and enrolled at wikipedia:Missouri University of Science...")
- 18:59, 9 April 2024 Syracuse (hist | edit) [33 bytes] Marshall (talk | contribs) (Redirected page to Syracuse University) Tag: New redirect
- 08:13, 28 March 2024 Swag (hist | edit) [29 bytes] Adám Brudzewsky (talk | contribs) (Redirected page to APL merchandise) Tag: New redirect
- 20:24, 20 March 2024 Al Rose (hist | edit) [2,664 bytes] Marshall (talk | contribs) (Created page with "'''Allen J. Rose''' was an APL educator at IBM, and later a co-founder and vice president of STSC. He was the 1988 recipient of the Iverson Award. Rose was noted for his ability to demonstrate APL using an wikipedia:IBM 2741 terminal, including in a verse of APL Blossom Time which descibes it as "an old, bent, beat-up 2741". The terminal weighed 120 pounds and had been distributed into two custom suitcases for portability.<ref>Jacob Brickmann. [http...")
- 22:35, 19 March 2024 Trenchard More (hist | edit) [2,774 bytes] Marshall (talk | contribs) (Created page with "{{Also on Wikipedia|More}} '''Trenchard More''' (1930 – 2019) was a mathematician employed by IBM who helped develop nested array model concepts—"Array Theory", in his terminology—such as the "floating" property of simple scalars and the behavior of prototypes. According to Jim Brown, More "had a tremendous influence on the final definition of the APL2 language".<ref name=personal>Jim Brown. [https://old.aplwiki.com/OnAPLsHistory?action=Atta...")
- 17:36, 19 March 2024 Stanford University (hist | edit) [1,512 bytes] Marshall (talk | contribs) (Created page with "{{Also on Wikipedia}} Several students of '''Stanford University''' in California participated in IBM's initial APL implementation: Larry Breed (B.S. 1961, M.S. 1965), Phil Abrams (M.S. 1966, Ph.D. 1970), Roger Moore (B.S. 1963), and Charles Brenner (B.S. 1967) worked in various combinations on IVSYS/7090, APL\1130, and APL\360. Breed and Brenner did their implementation work at IBM's Watson Research Center, and Moore at I.P. Sharp...")
- 00:45, 19 March 2024 Watson Research Center (hist | edit) [40 bytes] Marshall (talk | contribs) (Redirected page to IBM#Watson Research Center) Tag: New redirect
- 20:48, 18 March 2024 Falkoff (hist | edit) [26 bytes] Marshall (talk | contribs) (Redirected page to Adin Falkoff) Tag: New redirect
- 15:33, 17 March 2024 Dyalog APL 12.1 (hist | edit) [38 bytes] Marshall (talk | contribs) (Redirected page to Dyalog APL versions#12.1) Tag: New redirect
- 22:08, 16 March 2024 Timeline of APL primitives (hist | edit) [8,158 bytes] Marshall (talk | contribs) (Created page with "The following table lists APL primitives, primitive extensions, and primitive-like syntax that are implemented across many dialects, or are precursors of such features. Features are ordered by the first APL dialect to implement them, and previous definitions in other array languages or as proposals are indicated in parentheses. Because primitives tend to have multiple names and may even change name within a dialect, common modern names are used rather than the name when...")
- 01:35, 11 March 2024 Direct definition operator (hist | edit) [42 bytes] Marshall (talk | contribs) (Redirected page to Direct definition (operator)) Tag: New redirect
- 01:04, 11 March 2024 Ordering (hist | edit) [28 bytes] Marshall (talk | contribs) (Redirected page to Array ordering) Tag: New redirect
- 01:03, 11 March 2024 Array ordering (hist | edit) [1,932 bytes] Marshall (talk | contribs) (Created page with "'''Array ordering''' is the ordering of arrays exposed by functions such as Grade and Interval Index. It may be more general than comparison, for example by allowing characters to be compared to each other and to numbers. However, not all arrays need to be comparable, meaning that functions that depend on array ordering can throw an error. Traditionally, ordering is defined only for simple arrays of the same shape and type (Grade o...")
- 23:26, 10 March 2024 Major cell search (hist | edit) [2,985 bytes] Marshall (talk | contribs) (Created page with "The dyadic functions Index Of (<syntaxhighlight lang=apl inline>⍳</syntaxhighlight>), Interval Index (<syntaxhighlight lang=apl inline>⍸</syntaxhighlight>), and possibly Member Of (<syntaxhighlight lang=apl inline>∊</syntaxhighlight>) can be extended to search argument cells rather than elements, in accordance with the leading axis model. In this model, the "principal argument" (the one that is searched through) is considered as a list of its ...")
- 03:28, 10 March 2024 APL2C (hist | edit) [4,212 bytes] Marshall (talk | contribs) (Created page with "{{Infobox array language | logo = File:APL2C.gif | array model = nested | index origin = 0 or 1 | function styles = defined | numeric types = floats | unicode support = no | released = 2001 | developer = Tilman Otto | latest release version = 5.0.3 / 2002 | implementation languages = wikipedia:C_(programming_language...")
- 01:31, 10 March 2024 E. W. Dijkstra (hist | edit) [32 bytes] Marshall (talk | contribs) (Redirected page to Edsger W. Dijkstra) Tag: New redirect
- 01:30, 10 March 2024 One-liner (hist | edit) [1,842 bytes] Marshall (talk | contribs) (Created page with ":''This article is about one-liners in APL. For other languages, see Wikipedia.'' A '''one-liner''' is an APL program consisting of a single line of code. Creating such programs to perform various tasks, which might be considered a less precisely-measured form of code golf, was a popular challenge in early APL. The one-line constraint was significantly more limiting in this era, as it prevented creating defined functions or using...")
- 21:42, 9 March 2024 Function assignment (hist | edit) [44 bytes] Marshall (talk | contribs) (Redirected page to Assignment#Function assignment) Tag: New redirect
- 21:39, 9 March 2024 Overstruck (hist | edit) [24 bytes] Marshall (talk | contribs) (Redirected page to Overstrike) Tag: New redirect
- 02:21, 9 March 2024 Mask (hist | edit) [2,890 bytes] Marshall (talk | contribs) (Created page with "{| class=vertical-navbox style="float:right; font-size:500%; margin:0 1ex;" |<math>/a,u,b/</math> |} In Iverson notation, '''Mask''' (<math>/a,u,b/</math>) is a three-argument operation which merges two arguments according to a Boolean array, all with matching shape. The relationship between Mask and Mesh is similar to that between Compress and Expand. The Case function can also be seen as a generalization of Mask. A related function also name...")
- 02:46, 7 March 2024 Anonymous function (hist | edit) [49 bytes] Marshall (talk | contribs) (Redirected page to Function styles#Anonymous functions) Tag: New redirect
- 02:43, 7 March 2024 Direct definition (operator) (hist | edit) [2,424 bytes] Marshall (talk | contribs) (Created page with ":''The Del glyph <code>∇</code> is more commonly used for dfn recursion or to indicate a defined function.'' {{Built-in|Direct definition|∇}}, in NARS, is a primitive dyadic operator that defines an anonymous function based on source strings. Its left operand is the source for the function's dyadic case and the right is the source for the monadic case. One of these operands may be replaced with a Jot (using this operator a...") originally created as "Direct definition (NARS)"
- 16:44, 6 March 2024 Itemize (hist | edit) [21 bytes] Marshall (talk | contribs) (Redirected page to Promote) Tag: New redirect
- 15:11, 6 March 2024 Sort Down (hist | edit) [18 bytes] Marshall (talk | contribs) (Redirected page to Sort) Tag: New redirect
- 15:11, 6 March 2024 Sort Up (hist | edit) [18 bytes] Marshall (talk | contribs) (Redirected page to Sort) Tag: New redirect
- 15:11, 6 March 2024 Sort ascending (hist | edit) [18 bytes] Marshall (talk | contribs) (Redirected page to Sort) Tag: New redirect
- 15:11, 6 March 2024 Sort descending (hist | edit) [18 bytes] Marshall (talk | contribs) (Redirected page to Sort) Tag: New redirect
- 15:10, 6 March 2024 Descending Sort (hist | edit) [18 bytes] Marshall (talk | contribs) (Redirected page to Sort) Tag: New redirect
- 15:10, 6 March 2024 Ascending Sort (hist | edit) [18 bytes] Marshall (talk | contribs) (Redirected page to Sort) Tag: New redirect
- 15:08, 6 March 2024 Sort down (hist | edit) [18 bytes] Marshall (talk | contribs) (Redirected page to Sort) Tag: New redirect
- 15:08, 6 March 2024 Sort up (hist | edit) [18 bytes] Marshall (talk | contribs) (Redirected page to Sort) Tag: New redirect
- 15:06, 6 March 2024 Sort (hist | edit) [3,436 bytes] Marshall (talk | contribs) (Created page with "'''Sort Up''' and '''Sort Down''' are monadic functions that order the major cells of an array in ascending or descending order. Traditionally these functions are performed using Grade in APL: for example the FinnAPL idiom library gives <syntaxhighlight lang=apl inline>X[⍋X]</syntaxhighlight> and <syntaxhighlight lang=apl inline>X[⍒X]</syntaxhighlight> to sort <syntaxhighlight lang=apl inline>X</syntaxhighlight> ascending and descending, respectively....")
- 14:36, 6 March 2024 Idiom recognition (hist | edit) [37 bytes] Marshall (talk | contribs) (Redirected page to Idiom#Optimised phrases) Tag: New redirect
- 02:33, 5 March 2024 Gets (hist | edit) [24 bytes] Marshall (talk | contribs) (Redirected page to Assignment) Tag: New redirect
- 02:21, 5 March 2024 Alternant (hist | edit) [25 bytes] Marshall (talk | contribs) (Redirected page to Determinant) Tag: New redirect
- 02:18, 5 March 2024 Catalogue (hist | edit) [31 bytes] Marshall (talk | contribs) (Redirected page to Cartesian Product) Tag: New redirect
- 02:15, 5 March 2024 Cartesian Product (hist | edit) [1,494 bytes] Marshall (talk | contribs) (Created page with "{| class=vertical-navbox style="float:right; font-size:500%; margin:0 1ex;" |<code>{</code> |} '''Cartesian Product''' (<code>{</code>, or <code>@</code> in SAX), '''All''', or '''Catalogue''' is a primitive monadic function that returns an array of all combinations of choices from its argument, much like Outer Product. It appears in Rationalized APL, A Dictionary of APL, SAX, and J. It shares a glyph with the dyadic function Select (l...")
- 01:38, 5 March 2024 Hide (hist | edit) [18 bytes] Marshall (talk | contribs) (Redirected page to Stop) Tag: New redirect