Iverson notation: Difference between revisions
Miraheze>Adám Brudzewsky No edit summary |
m (Iverson notation category) |
||
| (6 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
[[File:A Formal Description of System-360 page 258b.png|thumb|right|A fragment of the description of System/360]] | |||
<blockquote>Applied mathematics is largely concerned with the design and analysis of explicit procedures for calculating the exact or approximate values of various functions. Such explicit procedures are called algorithms or programs. Because an effective notation for the description of programs exhibits considerable syntactic structure, it is called a programming language. | A mathematical notation for manipulating arrays was developed by [[Ken Iverson|Kenneth E. Iverson]], starting in 1957 at Harvard University. In 1960, he began work for [[IBM]] where he developed this notation with [[Adin Falkoff]] and published it in his book ''[[A Programming Language]]'' in 1962. The preface states its premise: | ||
<blockquote>"Applied mathematics is largely concerned with the design and analysis of explicit procedures for calculating the exact or approximate values of various functions. Such explicit procedures are called algorithms or programs. Because an effective notation for the description of programs exhibits considerable syntactic structure, it is called a programming language." | |||
</blockquote> | </blockquote> | ||
This notation was used inside IBM for short research reports on computer systems, such as the Burroughs B5000 and its stack mechanism when stack machines versus register machines were being evaluated by IBM for upcoming computers. | This notation was used inside IBM for short research reports on computer systems, such as the Burroughs B5000 and its stack mechanism when stack machines versus register machines were being evaluated by IBM for upcoming computers. It was also used to design and describe the new IBM/360. | ||
Iverson also used his notation in a draft of the chapter ''A Programming Language'', written for a book he was writing with Fred Brooks, Automatic Data Processing, which would be published in 1963. Based on this, [[Larry Breed]] and [[Phil Abrams]] implemented the first interpreter, and it eventually was named ''A.P.L.'', acronymising the title from the book. | |||
In 1979, Iverson received the Turing Award for his work on APL. | |||
== External links == | |||
* A. D. Falkoff, K. E. Iverson, and E. H. Sussenguth, [https://web.archive.org/web/20070710100707/http://www.research.ibm.com/journal/sj/032/falkoff.pdf A Formal Description of System\360]. IBM Systems Journal, Vol. 3, No. 3, 1964. | |||
{{APL | {{APL dialects}}[[Category:Iverson notation| ]] | ||
Latest revision as of 15:45, 30 April 2020
A mathematical notation for manipulating arrays was developed by Kenneth E. Iverson, starting in 1957 at Harvard University. In 1960, he began work for IBM where he developed this notation with Adin Falkoff and published it in his book A Programming Language in 1962. The preface states its premise:
"Applied mathematics is largely concerned with the design and analysis of explicit procedures for calculating the exact or approximate values of various functions. Such explicit procedures are called algorithms or programs. Because an effective notation for the description of programs exhibits considerable syntactic structure, it is called a programming language."
This notation was used inside IBM for short research reports on computer systems, such as the Burroughs B5000 and its stack mechanism when stack machines versus register machines were being evaluated by IBM for upcoming computers. It was also used to design and describe the new IBM/360. Iverson also used his notation in a draft of the chapter A Programming Language, written for a book he was writing with Fred Brooks, Automatic Data Processing, which would be published in 1963. Based on this, Larry Breed and Phil Abrams implemented the first interpreter, and it eventually was named A.P.L., acronymising the title from the book.
In 1979, Iverson received the Turing Award for his work on APL.
External links
- A. D. Falkoff, K. E. Iverson, and E. H. Sussenguth, A Formal Description of System\360. IBM Systems Journal, Vol. 3, No. 3, 1964.
| APL dialects [edit] | |
|---|---|
| Maintained | APL+Win ∙ APL2 ∙ APL64 ∙ APL\iv ∙ Aplette ∙ April ∙ Co-dfns ∙ Dyalog APL ∙ Dyalog APL Vision ∙ dzaima/APL ∙ GNU APL ∙ Kap ∙ NARS2000 ∙ Pometo ∙ TinyAPL |
| Historical | A Programming Language ∙ A+ (A) ∙ APL# ∙ APL2C ∙ APL\360 ∙ APL/700 ∙ APL\1130 ∙ APL\3000 ∙ APL.68000 ∙ APL*PLUS ∙ APL.jl ∙ APL.SV ∙ APLX ∙ Extended Dyalog APL ∙ Iverson notation ∙ IVSYS/7090 ∙ NARS ∙ ngn/apl ∙ openAPL ∙ Operators and Functions ∙ PAT ∙ Rowan ∙ SAX ∙ SHARP APL ∙ Rationalized APL ∙ VisualAPL (APLNext) ∙ VS APL ∙ York APL |
| Derivatives | AHPL ∙ BQN ∙ CoSy ∙ ELI ∙ Glee ∙ I ∙ Ivy ∙ J ∙ Jelly ∙ K (Goal, Klong, Q) ∙ KamilaLisp ∙ Lang5 ∙ Lil ∙ Nial ∙ RAD ∙ Uiua |
| Overviews | Comparison of APL dialects ∙ Timeline of array languages ∙ Timeline of influential array languages ∙ Family tree of array languages |