Difference between revisions of "Rationalized APL"
Jump to navigation
Jump to search
(Created page with "{{Infobox array language | array model = flat with boxes | index origin = 0 or 1 | function styles = definition operat...") |
m |
||
Line 13: | Line 13: | ||
'''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, [[enclose]]d 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. | '''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, [[enclose]]d 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}}[[Category:APL | + | {{APL dialects}}[[Category:APL dialects]][[Category:Iverson designs]] |
Revision as of 22:36, 24 July 2021
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+Win ∙ APL2 ∙ APL64 ∙ APL\iv ∙ Aplette ∙ April ∙ Co-dfns ∙ Dyalog APL ∙ dzaima/APL ∙ Extended Dyalog APL ∙ GNU APL ∙ KAP ∙ NARS2000 ∙ Pometo |
Historical | A Programming Language ∙ A+ (A) ∙ APL# ∙ APL\360 ∙ APL/700 ∙ APL\1130 ∙ APL\3000 ∙ APL.68000 ∙ APL*PLUS ∙ APL.jl ∙ APL.SV ∙ APLX ∙ Iverson notation ∙ IVSYS/7090 ∙ NARS ∙ ngn/apl ∙ openAPL ∙ PAT ∙ Rowan ∙ SAX ∙ SHARP APL ∙ Rationalized APL ∙ VisualAPL (APLNext) ∙ VS APL ∙ York APL |
Derivatives | AHPL ∙ BQN ∙ CoSy ∙ ELI ∙ Glee ∙ I ∙ Ivy ∙ J ∙ Jelly ∙ Jellyfish ∙ K (Q, KDB+) ∙ Nial ∙ RAD |
Overviews | Timeline of array languages ∙ Timeline of influential array languages ∙ Family tree of array languages |