How We Got to APL\1130
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Super Family
Super Family (Chaim Freedman, Petah Tikvah, Israel, September 2008) Yehoash (Heibish/Gevush) Super, born c.1760, died before 1831 in Latvia. He married unknown. I. Shmuel Super, born 1781,1 died by 1855 in Lutzin (now Ludza), Latvia,2 occupation alcohol trader. Appears in a list from 1837 of tax litigants who were alcohol traders in Lutzin. (1) He married Brokha ?, born 1781 in Lutzin (now Ludza), Latvia,3 died before 1831 in Lutzin (now Ludza), Latvia.3 (2) He married Elka ?, born 1794.4 A. Payka Super, (daughter of Shmuel Super and Brokha ?) born 1796/1798 in Lutzin (now Ludza), Latvia,3 died 1859 in Lutzin (now Ludza), Latvia.5 She married Yaakov-Keifman (Kivka) Super, born 1798,6,3 (son of Sholom "Super" ?) died 1874 in Lutzin (now Ludza), Latvia.7 Yaakov-Keifman: Oral tradition related by his descendants claims that Koppel's surname was actually Weinstock and that he married into the Super family. The name change was claimed to have taken place to evade military service. But this story seems to be invalid as all census records for him and his sons use the name Super. 1. Moshe Super, born 1828 in Lutzin (now Ludza), Latvia.8 He married Sara Goda ?, born 1828.8 a. Bentsion Super, born 1851 in Lutzin (now Ludza), Latvia.9 He married Khana ?, born 1851.9 b. Payka Super, born 1854 in Lutzin (now Ludza), Latvia.10 c. Rassa Super, born 1857 in Lutzin (now Ludza), Latvia.11 d. Riva Super, born 1860 in Lutzin (now Ludza), Latvia.12 e. Mushke Super, born 1865 in Lutzin (now Ludza), Latvia.13 f. -
Is Ja Dialect of APL? Reported by Jonathan Barman Eugene Mcdonnell - the Question Is Irrelevant
VICTOR Vol.8 No.2 convert the noun back to verb and as a result various interesting control structures can be created. The verbal nouns thus formed can be put into arrays and some of the benefits that various people have suggested might arise from arrays of functions can be obtained. A design goal is to make compilation possible without limiting the expressive power of J. APL Technology of Computer Simulation, by A Boozin and I Popselov reported by Sylvia Camacho Both authors of this paper are academic mathematicians and their use of APL is just where one might expect it to be: in modelling linear differential equations and stochastic Markovian processes. Questions put showed that they first used APL 15 years ago on terminals to what was described as 'a big old computer'. Currently they use APL*PLUS/PC. They have set up an environment in which they can split the screen and display data graphically with some zoom facilities. This environment can be used in conjunction with raw APL while exploring the results of a model, or can be used in conjunction with data derived from APL or some other source. In fact it is often used by Pascal programmers. Most recently they have been setting up economic models to try to come to terms with the consequences of decentralisation and privatisation. They use both Roman and Cyrillic alphabets. Panel: Is Ja Dialect of APL? reported by Jonathan Barman Eugene McDonnell - The question is irrelevant. Surely proponents of J would not be thrown out of the APL community? Garth Foster - J is quite definitely not APL. -
APL Literature Review
APL Literature Review Roy E. Lowrance February 22, 2009 Contents 1 Falkoff and Iverson-1968: APL1 3 2 IBM-1994: APL2 8 2.1 APL2 Highlights . 8 2.2 APL2 Primitive Functions . 12 2.3 APL2 Operators . 18 2.4 APL2 Concurrency Features . 19 3 Dyalog-2008: Dyalog APL 20 4 Iverson-1987: Iverson's Dictionary for APL 21 5 APL Implementations 21 5.1 Saal and Weiss-1975: Static Analysis of APL1 Programs . 21 5.2 Breed and Lathwell-1968: Implementation of the Original APLn360 25 5.3 Falkoff and Orth-1979: A BNF Grammar for APL1 . 26 5.4 Girardo and Rollin-1987: Parsing APL with Yacc . 27 5.5 Tavera and other-1987, 1998: IL . 27 5.6 Brown-1995: Rationale for APL2 Syntax . 29 5.7 Abrams-1970: An APL Machine . 30 5.8 Guibas and Wyatt-1978: Optimizing Interpretation . 31 5.9 Weiss and Saal-1981: APL Syntax Analysis . 32 5.10 Weigang-1985: STSC's APL Compiler . 33 5.11 Ching-1986: APL/370 Compiler . 33 5.12 Ching and other-1989: APL370 Prototype Compiler . 34 5.13 Driscoll and Orth-1986: Compile APL2 to FORTRAN . 35 5.14 Grelck-1999: Compile APL to Single Assignment C . 36 6 Imbed APL in Other Languages 36 6.1 Burchfield and Lipovaca-2002: APL Arrays in Java . 36 7 Extensions to APL 37 7.1 Brown and Others-2000: Object-Oriented APL . 37 1 8 APL on Parallel Computers 38 8.1 Willhoft-1991: Most APL2 Primitives Can Be Parallelized . 38 8.2 Bernecky-1993: APL Can Be Parallelized . -
K.E.Iverson and APL.J
K.E.Iverson Kenneth Iverson Charismatic mathematician who invented the APL computer programming language A GIFTED mathematician and a charismatic teacher, Ken Iverson made a highly influential contribution to the field of computer science. In the early 1960s a mathematical notation which he had developed as an aide to teaching algebra formed the basis of APL, one of the languages used in programming IBM’s early mainframe computer, the System/360. This concise and powerful language contributed substantially to IBM’s domination of the emerging computer industry during the 1960s and 1970s. Kenneth Eugene Iverson was born in Camrose, Alberta, Canada, in 1920. He demonstrated an early aptitude for mathematics ― he taught himself calculus in his teens. During the Second World War he served in the Royal Canadian Air Force as a flight engineer specialising in reconnaissance. After the war he obtained a degree in mathematics and physics from Queen’s University, Ontario, and went on to postgraduate study at Harvard where, in 1954, he obtained a doctorate in applied mathematics, and from 1955 to 1960 he was assistant professor of applied mathematics. During this period he developed a novel way of teaching algebra to students, the “Iverson notation”. It attracted the interest of IBM, which was already well established in commercial and scientific computing fields and was developing a new mainframe, the System/360. IBM recruited Iverson and three colleagues to turn his teaching notation into a program- ming language which could be used on the System/360. The result, expounded in his book A Programming Language (1962), came to be known as APL. -
The Computational Attitude in Music Theory
The Computational Attitude in Music Theory Eamonn Bell Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Graduate School of Arts and Sciences COLUMBIA UNIVERSITY 2019 © 2019 Eamonn Bell All rights reserved ABSTRACT The Computational Attitude in Music Theory Eamonn Bell Music studies’s turn to computation during the twentieth century has engendered particular habits of thought about music, habits that remain in operation long after the music scholar has stepped away from the computer. The computational attitude is a way of thinking about music that is learned at the computer but can be applied away from it. It may be manifest in actual computer use, or in invocations of computationalism, a theory of mind whose influence on twentieth-century music theory is palpable. It may also be manifest in more informal discussions about music, which make liberal use of computational metaphors. In Chapter 1, I describe this attitude, the stakes for considering the computer as one of its instruments, and the kinds of historical sources and methodologies we might draw on to chart its ascendance. The remainder of this dissertation considers distinct and varied cases from the mid-twentieth century in which computers or computationalist musical ideas were used to pursue new musical objects, to quantify and classify musical scores as data, and to instantiate a generally music-structuralist mode of analysis. I present an account of the decades-long effort to prepare an exhaustive and accurate catalog of the all-interval twelve-tone series (Chapter 2). This problem was first posed in the 1920s but was not solved until 1959, when the composer Hanns Jelinek collaborated with the computer engineer Heinz Zemanek to jointly develop and run a computer program. -
Kenneth E. Iverson
Kenneth E. Iverson Born December 17, 1920, Camrose, Alberta, Canada; with Adin Falkoff, inventor and implementer of the programming language APL. Education: BA, mathematics, Queen's University at Kingston, Ont., 1950; MA, mathematics, Harvard University, 1951; PhD, applied mathematics, Harvard University, 1954. Professional Experience: assistant professor, Harvard University, 1955-1960; research division, IBM Corp., 1960-1980; I.P. Sharp Associates, 1980-1987. Honors and Awards: IBM Fellow, 1970; AFIPS Harry Goode Award, 1975; ACM Turing Award, 1979; IEEE Computer Pioneer Award, 1982; National Medal of Technology, 1991; member, National Academy of Engineering. Iverson has been one of those lucky individuals who has been able to start his career with a success and for over 35 years build on that success by adding to it, enhancing it, and seeing it develop into a successful commercial property. His book A Programming Language set the stage for a concept whose peculiar character set would have appeared to eliminate it from consideration for implementation on any computer. Adin Falkoff is credited by Iverson for picking the name APL for the programming language implementation, and the introduction of the IBM “golf-ball” typewriter, with the replacement typehead, which provided the character set to represent programs. The programming language became the language of enthusiasts (some would say fanatics) and the challenge of minimalists to contain as much processing as possible within one line of code. APL has outlived many other languages and its enthusiasts range from elementary school students to research scientists. BIBLIOGRAPHY Biographical Falkoff, Adin D., and Kenneth E. Iverson, “The Evolution of APL,” in Wexelblat, Richard L., ed., History of Programming Languages, Academic Press, New York, 1981, Chapter 14. -
A Development of APL2 Syntax
A development by James A. Brown of APL2 syntax This paper develops the rules governing the When language extensions are proposed we find that the writing of APL2 expressions and discusses the familiar rules do not cover all cases. For example, A PL 1 principles that motivated design decisions. has the concept of an operator (for example, /) applying to a function (for example, +) and producing a new function (called summation). In APL 2 operators are generalized so 1. introduction that they can apply to all functions—including those IBM has numerous products which follow the IBM internal produced by other operators. Therefore a syntactic decision standard for 4PL {VSAPL, APLSV, PC APL, SlOO has to be made about the meaning of a statement like A PL). In this paper this level of the A PL language is referred to as A PL 1. + .X/ APL2 is based on this writer's Ph.D. thesis [1], the array theory of Trenchard More [2], and most of all on APLl. It (where " . " is the matrix product operator). This could incorporates extensions to data structures, to primitive mean either operations, and to syntax. Those wishing a complete ( + .x)/or + .(x/) description of A PL 2 may refer to the A PL 2 publications library listed in the general references. The only extensions Operators are extended so that they take arrays as covered here are those which have an effect on the syntax of operands. Therefore, if "Z)OP" is a dyadic operator taking the language and those implied by the simplifications of an array right operand, syntax. -
APL-The Language Debugging Capabilities, Entirely in APL Terms (No Core Symbol Denotes an APL Function Named' 'Compress," Dumps Or Other Machine-Related Details)
DANIEL BROCKLEBANK APL - THE LANGUAGE Computer programming languages, once the specialized tools of a few technically trained peo p.le, are now fundamental to the education and activities of millions of people in many profes SIons, trades, and arts. The most widely known programming languages (Basic, Fortran, Pascal, etc.) have a strong commonality of concepts and symbols; as a collection, they determine our soci ety's general understanding of what programming languages are like. There are, however, several ~anguages of g~eat interest and quality that are strikingly different. One such language, which shares ItS acronym WIth the Applied Physics Laboratory, is APL (A Programming Language). A SHORT HISTORY OF APL it struggled through the 1970s. Its international con Over 20 years ago, Kenneth E. Iverson published tingent of enthusiasts was continuously hampered by a text with the rather unprepossessing title, A inefficient machine use, poor availability of suitable terminal hardware, and, as always, strong resistance Programming Language. I Dr. Iverson was of the opinion that neither conventional mathematical nota to a highly unconventional language. tions nor the emerging Fortran-like programming lan At the Applied Physics Laboratory, the APL lan guages were conducive to the fluent expression, guage and its practical use have been ongoing concerns publication, and discussion of algorithms-the many of the F. T. McClure Computing Center, whose staff alternative ideas and techniques for carrying out com has long been convinced of its value. Addressing the putation. His text presented a solution to this nota inefficiency problems, the Computing Center devel tion dilemma: a new formal language for writing clear, oped special APL systems software for the IBM concise computer programs. -
Interview with Jeffrey Shallit
numerative ombinatorics A pplications Enumerative Combinatorics and Applications ECA 2:2 (2022) Interview #S3I5 ecajournal.haifa.ac.il Interview with Jeffrey Shallit Toufik Mansour Jeffrey Shallit earned a bachelor of arts in mathematics from Princeton University in 1979. He received a Ph.D. at the Uni- versity of California, Berkeley in 1983, under the supervision of David Goldschmidt (de jure) and Manuel Blum (de facto). Currently, he is a professor of mathematics in the School of Computer Science at the University of Waterloo. Professor Shallit has given lectures and talks at many conferences and workshops. Here we list some of them: Numeration 2019, Er- win Schr¨odinger Institute, in Austria, 2019; Highlights of Logic, Games, and Automata, in Germany, 2018; LMS Keynote Ad- dress in Discrete Mathematics, in England, 2014; Fields Work- shop on Challenges in Combinatorics on Words, in 2013; High- Photo by Joe Petrik lights of AutomathA, in Austria, 2010; Distinguished Lecture Series, University of Victoria, 2002. Professor Shallit's research interests include combinatorics on words, formal languages and automata theory (especially connections with number theory), algorithmic number theory (primality testing, factoring, etc.), and the ethical use of computers. For his contributions, Professor Shallit, in 2008, was named a Distinguished Scientist by the Association for Computing Machinery. In 2020, Professor Shallit was elected as a Foreign Member of the Finnish Academy of Science and Letters. He has been the editor-in-chief of the Journal of Integer Sequences since 2002. Mansour: Professor Shallit, first of all, we These days, a good combinatorialist often would like to thank you for accepting this in- needs to know complex analysis, number the- terview. -
Synchronizer Synthesizer Sequencer It's So Easy for YOU To
MARCH 1979 Tape Slide Synchronizer Synthesizer Sequencer It's so easy for YOU to I'm going to use the adjacent card to order obtain subscriptions, books, 40 binders and back issues acopy! from ETI! Only $3.00 There's got to be something in this book for all ETI readers. Canadian Projects Book Number One gives you twenty-five projects from issues of ETI sold in Canada.All the projects have been reworked since they were first published to update them with any information we might have received about availability of components, impr- ovements, etc. To order Canadian Projects Book Number One send $3.00 per copy + 4E4 for postage and handling to: Canadian Projects Book, ET! Magazine, Unit Six, 25 Overlea Blvd., Toronto, Ontario, M4H 1B1. Please do not send cash. Send a Cheque, Money Order, Master Charge, Chargex (Visa), please include Card No., Expiry Date, and Signature. Vol. 3. No. 3. MARCH 1979 Editor STEVE BRAIDWOOD BSc Assistant Editor electronics today GRAHAM WIDEMAN BASc international Advertising INCORPORATING ELECTRONIC WORKSHOP Advertising Manager MARK CZERWINSKI BASc Advertising Services SHARON WILSON Advertising Representatives JIM O'BRIEN PROJECTS Eastern Canada JEAN SEGUIN & ASSOCIATES INC.. 601 Cote Vertu. TAPE -SLIDE SYNCHRONISER 31 St. Laurent. Quebec H4L 1 X8. Keep the slides in step with the commentary, on one channel. Telephone (514) 748-6561 DUAL ELECTRONIC DICE 37 Subscriptions Department An LED game to keep you relatively honest. BEBE LALL SYNTHESIZER SEQUENCER 41 Accounts Department Automatic tunes, or control operation. SENGA HARRISON Layout and Assembly GAIL ARMBRUST Contributing Editors FEATURES WALLACE J. PARSONS (Audio) THE SPACE SHUTTLE 14 BILL JOHNSON (Amateur Radio) The story of the spacecraft that truly flies. -
Doc/Articles/Play203 I
Doc/Articles/Play203 i Doc/Articles/Play203 Doc/Articles/Play203 ii COLLABORATORS TITLE : Doc/Articles/Play203 ACTION NAME DATE SIGNATURE WRITTEN BY March 26, 2009 REVISION HISTORY NUMBER DATE DESCRIPTION NAME 10 2009-03-25 07:33:34 follow guidelines, finish code testing. RicSherlock 9 2009-03-25 07:01:33 More work on text. Need to test code from q2 on RicSherlock 8 2009-03-24 20:56:01 RicSherlock 7 2009-03-24 20:52:59 to q2 RicSherlock 6 2009-03-23 08:29:50 update code-block syntax RicSherlock 5 2008-12-08 18:45:51 converted to 1.6 markup localhost 4 2005-12-16 10:10:38 Openning {{{ likes to sit on a line of its own OlegKobchenko 3 2005-12-15 13:08:25 format fixes ChrisBurke 2 2005-12-15 13:03:15 format fixes ChrisBurke Doc/Articles/Play203 iii Contents 1 At Play With J Giddyap 1 1.1 Methods for finding how many different finishes . .1 1.2 Methods for representing all the possible finishes . .2 Doc/Articles/Play203 1 / 5 1 At Play With J Giddyap • Eugene McDonnell The OED doesn’t have a giddyap entry; the Concise Oxford Dictionary has a giddap entry; Webster 3 has an entry for giddap, giddyap, giddyup. I think it must be a children’s word; I don’t think I’ve ever heard it used by an adult. When I was much younger I know that when I pretended I was riding a horse, I swung my imaginary whip on my imaginary horse as I pranced about, shouting giddyap with every stroke of the whip. -
Final List of Participants
Final list of participants 1) States and European Community 2) Entities and intergovernmental organizations having received a Standing invitation from the United Nations General Assembly 3) United Nations Secretariat and Organs 4) United Nations Specialized Agencies 5) Associate Members of Regional Commissions 6) Other invited intergovernmental organizations 7) Non governmental organizations (NGOs) and civil society organizations 8) Business Sector Entities 1) STATES AND EUROPEAN COMMUNITY Afghanistan Representatives: H.E. Mr Mohammad M. STANEKZAI, Ministre des Communications, Afghanistan, [email protected] H.E. Mr Shamsuzzakir KAZEMI, Ambassadeur, Representant permanent, Mission permanente de l'Afghanistan, [email protected] Mr Abdelouaheb LAKHAL, Representative, Delegation of Afghanistan Mr Fawad Ahmad MUSLIM, Directeur de la technologie, Ministère des affaires étrangères, [email protected] Mr Mohammad H. PAYMAN, Président, Département de la planification, Ministère des communications, [email protected] Mr Ghulam Seddiq RASULI, Deuxième secrétaire, Mission permanente de l'Afghanistan, [email protected] Albania Representatives: Mr Vladimir THANATI, Ambassador, Permanent Mission of Albania, [email protected] Ms Pranvera GOXHI, First Secretary, Permanent Mission of Albania, [email protected] Mr Lulzim ISA, Driver, Mission Permanente d'Albanie, [email protected] Algeria Representatives: H.E. Mr Amar TOU, Ministre, Ministère de la poste et des technologies