Rationalized APL

From APL Wiki
Revision as of 22:35, 24 July 2021 by Marshall (talk | contribs) (Created page with "{{Infobox array language | array model = flat with boxes | index origin = 0 or 1 | function styles = definition operat...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


Rationalized APL is the name of a 1983 paper by Ken Iverson describing a backwards compatible extension to APL as developed by Iverson IBM (for example VS APL). Written following Iverson's departure from IBM to IPSA in 1980, it showcases Iverson's stance against the nested array model used by APL2 and in favor of the boxes (here, enclosed arrays) already in use by SHARP APL. It was a precursor to A Dictionary of APL and many of the ideas it introduced were later incorporated into J. It also featured the Rank operator, invented by Arthur Whitney the previous year, just prior to its inclusion in SHARP.


APL dialects [edit]
Maintained APL+WinAPL2APL64APL\ivApletteAprilCo-dfnsDyalog APLdzaima/APLExtended Dyalog APLGNU APLKAPNARS2000Pometo
Historical A Programming LanguageA+ (A) ∙ APL#APL\360APL/700APL\1130APL\3000APL.68000APL*PLUSAPL.jlAPL.SVAPLXIverson notationIVSYS/7090NARSngn/aplopenAPLPATRowanSAXSHARP APLRationalized APLVisualAPL (APLNext) ∙ VS APLYork APL
Derivatives AHPLBQNCoSyELIGleeIIvyJJellyJellyfishK (Q, KDB+) ∙ NialRAD
Overviews Timeline of array languagesTimeline of influential array languagesFamily tree of array languages