New pages
Jump to navigation
Jump to search
- 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...")
- 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...")
- 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: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: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...")
- 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: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)"
- 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....")
- 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:37, 5 March 2024 Stop (hist | edit) [1,857 bytes] Marshall (talk | contribs) (Created page with "{{Built-in|Stop|⊣}} (in SHARP APL and APLX) or '''Hide''' (in GNU APL and Kap) is a primitive monadic function that ignores its argument and returns a non-printing value. It shares the left tack glyph with Left Identity. The nature of the returned value can vary: for example an empty matrix is used in SAX and APLX, while GNU APL uses the scalar 0 but returns it as a shy result (or "committed"). In SHARP APL's initial implemen...")
- 00:57, 5 March 2024 Determinant (hist | edit) [2,313 bytes] Marshall (talk | contribs) (Created page with "{{Built-in|Determinant|<nowiki>.</nowiki>}} is a primitive dyadic operator that takes two dyadic functions for operands and produces a monadic function. Much like Inner Product for matrix products, it generalizes the matrix wikipedia:determinant, so that <source lang=apl inline>-.×</source> computes the determinant and <source lang=apl inline>+.×</source> the wikipedia:permanent (mathematics). Determinant has been implemented in SHAR...")
- 17:00, 3 March 2024 Direct definition (hist | edit) [816 bytes] Marshall (talk | contribs) (Created page with "'''Direct definition''' may refer to any of several different function styles, which share the feature that arguments are given default names rather than having names defined in a header: * Direct definition (Iverson), a named style defined by Ken Iverson and used to discuss APL in the 1970s and 80s * Direct definition (NARS), an anonymous function produced in NARS by applying <syntaxhighlight lang=apl inline>∇</syntaxhighlight> to strings *...")
- 16:41, 3 March 2024 Direct definition (notation) (hist | edit) [3,803 bytes] Marshall (talk | contribs) (Created page with "Ken Iverson's '''direct definition''' is a function style written with a name followed by <code>:</code> and a result, using <syntaxhighlight lang=apl inline>⍺</syntaxhighlight> and <syntaxhighlight lang=apl inline>⍵</syntaxhighlight> for arguments. The result may be one expression, which is evaluated to apply the function, or three expressions separated by <code>:</code>, in which case the middle expression is evaluated to determine which of the other tw...") originally created as "Direct definition (Iverson)"
- 01:14, 2 March 2024 Prefix and suffix vectors (hist | edit) [3,541 bytes] Marshall (talk | contribs) (Created page with "{| class=vertical-navbox style="float:right; font-size:500%; margin:0 1ex;" |<code>⍺</code> <code>⍵</code> |} In Iverson notation, the '''prefix vector''' <math>\alpha^j(n)</math> and '''suffix vector''' <math>\omega^j(n)</math> of weight <math>j</math> and length <math>n</math> are Boolean vectors that can be used with Replicate to select a prefix or suffix of a vector, a task now performed with Take. Primitives <code>⍺</code> and <code>⍵...") originally created as "Prefix and Suffix vectors"
- 03:39, 28 February 2024 IVSYS/7090 (hist | edit) [7,262 bytes] Marshall (talk | contribs) (Created page with "{{Infobox array language | array model = flat without boxes | index origin = 1 | function styles = defined function | numeric types = integer, float | unicode support = no | released = 1965 | developer = Larry Breed (IBM), Phil Abrams | implementation language = wikipedia:FORTRAN | platforms = wikipedia:IBM 7090 | ope...")
- 21:27, 26 February 2024 Phil Abrams (hist | edit) [3,400 bytes] Marshall (talk | contribs) (Created page with "'''Philip Samuel Abrams''' is an APL implementer who worked on IVSYS/7090, APL30, and APL\3000. He is a co-founder of STSC and was briefly chairman of SIGAPL. Abrams graduated Princeton with an A.B. in mathematics in 1964 and entered Stanford, where he would earn an M.S. degree in computer science in 1966 and Ph.D. in 1970. There he worked with Larry Breed, of IBM's wik...")
- 02:32, 26 February 2024 Dick Lathwell (hist | edit) [3,867 bytes] Marshall (talk | contribs) (Created page with "'''Richard Henry Lathwell''' was one of the implementers of APL0, and a designer and implementer at IBM and I.P. Sharp Associates afterwards. He is credited with the practical realization of shared variables in APL.SV, and also published the modern formula for tolerant comparison,<ref>Dick Lathwell. [https://doi.org/10.1145/800114.803685 APL comparison tolerance] at APL76 (also reproduced in [https://www.jsoftware.com/papers/satn23.htm SATN...")
- 03:34, 25 February 2024 Comparison tolerance (hist | edit) [4,430 bytes] Marshall (talk | contribs) (Created page with "'''Tolerant comparison''' is an inexact form of comparison used to mitigate the impact of floating-point rounding error on programs. It considers two numbers equal when their relative difference is smaller than a parameter called the '''comparison tolerance''', and accessed with the system variable <syntaxhighlight lang=apl inline>⎕CT</syntaxhighlight>. In addition to the comparison functions, tolerance applies to Match and Not Match, Floor, C...") originally created as "Tolerant comparison"
- 02:46, 25 February 2024 Character (hist | edit) [1,764 bytes] Marshall (talk | contribs) (Created page with ":''This page is about the data type. For the symbols used to write APL code, see Glyph.'' A '''character''' is a scalar array representing a unit of text. In current APLs this generally means a Unicode wikipedia:code point, while historically various custom character sets were used. These accomodated typical text as well as APL code, usually with one byte per character. Characters and numbers are the two basic...")
- 22:23, 23 February 2024 Number (hist | edit) [4,921 bytes] Marshall (talk | contribs) (Created page with "In APL, a number is a scalar array representing a mathematical wikipedia:number. Numbers and characters were the only possible element types in APL0 and remain the basic data types in modern APLs. In addition to quantities for computation, they are used to represent Booleans (0 and 1) and indices. Numeric operations may be subject to floating-point rounding and comparison tolerance. Traditionally, APL provides only one user-visib...")
- 16:24, 20 February 2024 EVOLUTION ERROR (hist | edit) [794 bytes] Marshall (talk | contribs) (https://tenebrax.bandcamp.com/track/evolution-error is quite good actually)