New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)
- 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 APL\360, 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)
- 02:55, 18 February 2024 Kx Systems (hist | edit) [1,062 bytes] Marshall (talk | contribs) (Created page with "'''KX''' is the vendor for the wikipedia:kdb+ time-series database and associated programming language Q, and developer of K from K1 to K4 (K4 remains accessible but its use is discouraged). Founded in 1993 by Arthur Whitney and Janet Lustgarten, it is fully owned by finance technology firm FD Technologies (formerly First Derivatives) since 2018. Whitney began work on K after leaving wikipedia:Morgan Stanley where he had developed A+. Having de...")
- 00:21, 18 February 2024 VS APL (hist | edit) [1,446 bytes] Marshall (talk | contribs) (Created page with "{{Infobox array language | array model = flat without boxes | index origin = <syntaxhighlight lang=apl inline>⎕IO</syntaxhighlight>0 or 1 | function styles = defined function | numeric types = floats (64-bit HFP) | unicode support = no | released = 1976 | developer = IBM | implementation language = wik...")
- 09:27, 15 February 2024 Comparison of APL dialects (hist | edit) [21,938 bytes] RubenVerg (talk | contribs) (Create Comparison of APL dialects page)
- 16:39, 14 February 2024 STSC (hist | edit) [2,454 bytes] Marshall (talk | contribs) (Created page with "'''Scientific Time Sharing Corporation''' ('''STSC'''), later '''Manugistics Group''', was the developer of APL*PLUS and NARS. Founded in 1969, the company initially developed APL*PLUS together with I.P. Sharp Associates (IPSA), and offered time sharing service to the United States while IPSA sold to Canada. The products were later split, with IPSA renaming its version to SHARP APL. STSC's APL business was sold to form APL2000 in 1995, and is now...")
- 09:48, 14 February 2024 Comment (hist | edit) [2,353 bytes] Adám Brudzewsky (talk | contribs) (Created page with "{| class=vertical-navbox style="float:right; font-size:500%; margin:0 1ex;" |<code><nowiki>⍝</nowiki></code> |} APL allows a '''comment''' at the end of a line, separating (optional) code on the left from comments on the right using the lamp glyph <syntaxhighlight lang=apl inline>⍝</syntaxhighlight>, thus forming a line comment: <syntaxhighlight lang=apl> 2+3 ⍝ An example of addition 5 </syntaxh...")
- 19:27, 12 February 2024 Timeline of array programming corporations (hist | edit) [5,458 bytes] Marshall (talk | contribs) (Created page with "This page shows the history of businesses strongly tied to APL or other array language implementation. Many other commercial vendors have implemented APL at some point. == By dialect == Here families of dialects are grouped together: IBM APL includes APL0, APL.SV, and others; APL*PLUS includes APL+Win and APL64; and SHARP APL includes SAX. Entries in parentheses indicate a change in ownership of the array language developer. Those ma...")
- 02:58, 7 February 2024 Character arithmetic (hist | edit) [1,312 bytes] Marshall (talk | contribs) (Created page with "'''Affine character arithmetic''' is a system that defines addition and subtraction in certain cases involving character arguments. In this system, a number can be added to or subtracted from a character to give another character, and two characters can be subtracted to give a number. These are the same operations allowed in an wikipedia:affine space, and on types such as wikipedia:pointer (computer science)s. Character arithmetic was developed...")
- 02:01, 6 February 2024 Case (hist | edit) [1,531 bytes] Marshall (talk | contribs) (No idea what to call this page)
- 01:15, 6 February 2024 Promote (hist | edit) [1,791 bytes] Marshall (talk | contribs) (Created page with "'''Promote''' is a monadic function that adds a length-1 axis to its argument before the other axes, resulting in an array with rank one higher. It appears as a primitive in Kap (<syntaxhighlight lang=apl inline><</syntaxhighlight>, "increase rank") and Dyalog APL Vision (<syntaxhighlight lang=apl inline>∧</syntaxhighlight>), as well as J (<syntaxhighlight lang=j inline>,:</syntaxhighlight>, "'''Itemize'''"), BQN (<code>≍</code>, "...")
- 13:50, 5 February 2024 APL Challenge (hist | edit) [787 bytes] Adám Brudzewsky (talk | contribs) (Created page with "|thumb|right|200px|APL Challenge logo The '''APL Challenge''' is a quarterly contest hosted by Dyalog Ltd with rounds beginning in February, May, August, and November. The APL Challenge continues the tradition of the APL Problem Solving Competition, which Dyalog Ltd ran from 2008 until 2023, but is aimed specifically at newcomers to APL, and consists of ten entry-level problems.<ref>Dyalog Ltd. [https://www.dyalog.com/news/160/...")
- 19:34, 31 January 2024 Cut (hist | edit) [1,662 bytes] Marshall (talk | contribs) (Created page with ":''For the K primitive function, see Cut (K).'' {{Built-in|Cut|⍤}}, or <syntaxhighlight lang=j inline>;.</syntaxhighlight> in J, is a primitive dyadic operator first defined in Rationalized APL and implemented in SHARP APL. It provides several functions that slice an argument into subarrays in various ways, selected by an integer operand that ranges from -3 to 3. In APL this operand is the left operand, while in J it's the right ope...")
- 18:51, 31 January 2024 Group (BQN) (hist | edit) [1,347 bytes] Marshall (talk | contribs) (Created page with "{{Built-in|Group|⊔}} is a primitive function in BQN that places values at the specified indices in the result. Because each index can appear multiple times in the array of indices, or not at all, each result element is a list of all the values placed there. Group is ambivalent: in the dyadic case, the left argument is the array of indices and the right argument is the array of values. In the monadic case, the right argument gives the result indices and...")
- 16:15, 31 January 2024 Group (K) (hist | edit) [1,287 bytes] Marshall (talk | contribs) (Created page with ":''This page is about the K primitive that returns a dictionary. For the primitive that returns an array introduced by BQN, see Group (BQN).'' {{Built-in|Group|<nowiki>=</nowiki>}} is a monadic function in K that returns a dictionary whose keys are the unique values in its argument and whose value for a given key is the list of indices where it appears. In versions before K4, which introduced dictionaries, Group returns only an array of the index lis...") originally created as "Group"
- 23:23, 29 January 2024 Inverse (hist | edit) [1,612 bytes] Marshall (talk | contribs) (Created page with "The '''inverse''' of a function is a function that undoes its effect, computing an argument that corresponds to the given result for that function. In APL it's usually written with the Power operator as <syntaxhighlight lang=apl inline>(f⍣¯1) x</syntaxhighlight>. While some functions such as Reverse have an obvious exact inverse, others might have no valid inverse or many possible choices for a given result. Treatment of these cases varies among dialects, but...")
- 21:04, 28 January 2024 A Dictionary of APL (hist | edit) [2,284 bytes] Marshall (talk | contribs) (Created page with "{{Infobox array language | array model = flat with boxes | index origin = 0 primarily; allowing 1 in dialects | function styles = definition operator, direct definition | numeric types = real and complex | released = 1987 | developer = Ken Iverson | influenced by = Rationalized APL, SHARP APL | influenced = J | implementation language= not...")