3,038
edits
m (Text replacement - "<source" to "<syntaxhighlight") |
(Partial release table) |
||
Line 20: | Line 20: | ||
[[File:Old SHARP APL.png|thumb|right|SHARP APL running under DOSBox]] | [[File:Old SHARP APL.png|thumb|right|SHARP APL running under DOSBox]] | ||
'''SHARP APL''' was an APL implementation offered by [[I.P. Sharp Associates]] (IPSA), originally as part of its [[time-sharing]] service and later as a stand-alone product. It was split off from [[STSC]]'s [[APL*PLUS]], which until then had been sold jointly by the two companies. SHARP APL was the source of many developments in [[flat array theory]], driven by [[Ken Iverson]] and other APL designers at IPSA. | '''SHARP APL''' was an APL implementation offered by [[I.P. Sharp Associates]] (IPSA), originally as part of its [[time-sharing]] service and later as a stand-alone product. It was split off from [[STSC]]'s [[APL*PLUS]], which until then had been sold jointly by the two companies. SHARP APL was the source of many developments in [[flat array theory]], driven by [[Ken Iverson]] and other APL designers at IPSA. | ||
== Releases == | |||
A partial list of SHARP's major releases is shown. | |||
{|class=wikitable | |||
! Number !! Released !! Features | |||
|- | |||
| || 1981-05 || Enclosed arrays; [[Enclose]] (<syntaxhighlight lang=apl inline><</syntaxhighlight>), [[Disclose]] (<syntaxhighlight lang=apl inline>></syntaxhighlight>), [[Match]] (<syntaxhighlight lang=apl inline>≡</syntaxhighlight>); operators [[Atop|Over]] (<syntaxhighlight lang=apl inline>⍤</syntaxhighlight>), [[Over|On]] (<syntaxhighlight lang=apl inline>⍥</syntaxhighlight>), [[Under|With]] (<syntaxhighlight lang=apl inline>¨</syntaxhighlight>); [[complex number]]s | |||
|- | |||
| || 1982-05 || Generalized [[determinant]] (<syntaxhighlight lang=apl inline>.</syntaxhighlight>); debugging and formatting improvements | |||
|- | |||
| || 1982-11 || [[Complex Floor]], Ceiling, and Residue; reference-counted implementation | |||
|- | |||
| 15 || 1983-05 || [[Rank operator]] and [[Function rank]]; [[Lev]] (<syntaxhighlight lang=apl inline>⊣</syntaxhighlight>), [[Dex]] (<syntaxhighlight lang=apl inline>⊢</syntaxhighlight>), [[Link]] (<syntaxhighlight lang=apl inline>⊃</syntaxhighlight>)<ref>[https://www.jsoftware.com/papers/satn45.htm "Language Extensions of May 1983"]. SATN-45, 1983-05-02.</ref> | |||
|- | |||
| 17 || 1985-01 || | |||
|- | |||
| 19 || 1987-03 || Short left argument for Take/Drop<ref>[[Robert Bernecky]]. [https://dl.acm.org/citation.cfm?id=55632 An Introduction to Function Rank] at [[APL88]]. [[APL Quote Quad]], Volume 18, Issue 2. December 1987.</ref> | |||
|- | |||
| 20 || 1989-09 || [[Find|In]] (<syntaxhighlight lang=apl inline>⍷</syntaxhighlight>), [[Nubsieve]] (<syntaxhighlight lang=apl inline>≠</syntaxhighlight>), [[Raze]] (<syntaxhighlight lang=apl inline>↓</syntaxhighlight>); padding for [[Disclose]] (<syntaxhighlight lang=apl inline>></syntaxhighlight>)<ref>[[IPSA]]. [https://archive.org/details/sharp-apl-release-20.0-guide-for-apl-programmers "SHARP APL Release 20.0: Guide for APL Programmers"].</ref> | |||
|} | |||
== Primitive functions == | == Primitive functions == |