Is Ja Dialect of APL? Reported by Jonathan Barman Eugene Mcdonnell - the Question Is Irrelevant
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
An APL Subset Interpreter for a New Chip Set / by James Hoskin
An APL Subset Interpreter for a New Chip Set James Hoskin MSc (Physics), University of Calgary A THESIS SUBMI 1 TED IN L'ARTlAl f Ul FILLMENT OF THE REQUIKEMENTS FOR THE DEGREE OF MASTER OF SCIFNCE In the School of Cornput~ngSc~enre " James Hosk~n1987 SIMON FRASER UNIVERSITY May 1987 All rights reserved This thesis may not be reproduced in whole or in part. by photocopy or other means w~thoutthe permission of the author Approval Title of Thesis: An APL Subset Interpreter for a New Chip Set Name. James D Hoskin Degree: Master of ~iience Examining Committee. Chairperson. Dr. W. S. Luk Dr. R. F. Hobson Senior Supervisor Dr J& Weinkam,"I/, Dr. R. D. Cameron External Examiner Dr. Carl McCrosky External Examiner April 28, 1987 Date Approved: PART IAL COPYR l GHT L ICENSE I hereby grant to Simon Fraser University the right to lend my thesis, project or extended essay (the title of which is shown below) to users of the Simon Fraser University Library, and to make partial or single copies only for such users or in response to a request from the library of any other university, or other educational institution, on its own behalf or for one of its users. I further agree that permission for multiple copying of this work for scholarly purposes may be granted by me or the Dean of Graduate Studies. It is understood that copying or publication of this work for financial gain shall not be allowed without my written permission. Title of Thesis/Project/Extended Essay -- - Author: (signature) (date) Abstract The APL language provides a powerful set of functions and operators to handle dynamic array data. -
KDB Kernel Debugger and Kdb Command
AIX Version 7.2 KDB kernel debugger and kdb command IBM Note Before using this information and the product it supports, read the information in “Notices” on page 323. This edition applies to AIX Version 7.2 and to all subsequent releases and modifications until otherwise indicated in new editions. © Copyright International Business Machines Corporation 2015. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents About this document.............................................................................................ix Highlighting..................................................................................................................................................ix Case-sensitivity in AIX................................................................................................................................ ix ISO 9000......................................................................................................................................................ix KDB kernel debugger and kdb command................................................................ 1 KDB kernel debugger................................................................................................................................... 1 Invoking the KDB kernel debugger........................................................................................................ 2 The kdb command..................................................................................................................................3 -
Compendium of Technical White Papers
COMPENDIUM OF TECHNICAL WHITE PAPERS Compendium of Technical White Papers from Kx Technical Whitepaper Contents Machine Learning 1. Machine Learning in kdb+: kNN classification and pattern recognition with q ................................ 2 2. An Introduction to Neural Networks with kdb+ .......................................................................... 16 Development Insight 3. Compression in kdb+ ................................................................................................................. 36 4. Kdb+ and Websockets ............................................................................................................... 52 5. C API for kdb+ ............................................................................................................................ 76 6. Efficient Use of Adverbs ........................................................................................................... 112 Optimization Techniques 7. Multi-threading in kdb+: Performance Optimizations and Use Cases ......................................... 134 8. Kdb+ tick Profiling for Throughput Optimization ....................................................................... 152 9. Columnar Database and Query Optimization ............................................................................ 166 Solutions 10. Multi-Partitioned kdb+ Databases: An Equity Options Case Study ............................................. 192 11. Surveillance Technologies to Effectively Monitor Algo and High Frequency Trading .................. -
A Lambda Calculus for Transfinite Arrays
1 A Lambda Calculus for Transfinite Arrays Unifying Arrays and Streams ARTJOMS ŠINKAROVS, Heriot-Watt University SVEN-BODO SCHOLZ, Heriot-Watt University Array programming languages allow for concise and generic formulations of numerical algorithms, thereby providing a huge potential for program optimisation such as fusion, parallelisation, etc. One of the restric- tions that these languages typically have is that the number of elements in every array has to be finite. This means that implementing streaming algorithms in such languages requires new types of data structures, with operations that are not immediately compatible with existing array operations or compiler optimisations. In this paper, we propose a design for a functional language that natively supports infinite arrays. We use ordinal numbers to introduce the notion of infinity in shapes and indices. By doing so, we obtain a calculus that naturally extends existing array calculi and, at the same time, allows for recursive specifications as they are found in stream- and list-based settings. Furthermore, the main language construct that can be thought of as an n-fold cons operator gives rise to expressing transfinite recursion in data, something that lists or streams usually do not support. This makes it possible to treat the proposed calculus as a unifying theory of arrays, lists and streams. We give an operational semantics of the proposed language, discuss design choices that we have made, and demonstrate its expressibility with several examples. We also demonstrate that the proposed formalism preserves a number of well-known universal equalities from array/list/stream theories, and discuss implementation-related challenges. -
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. -
How We Got to APL\1130
How We Got To APL\1130 by Larry Breed APLBUG at CHM, 10 May 2004 APL\1130 was implemented overnight in the autumn of 1967, but it took years of effort to make that possible. In 1965, Ken Iverson’s group in Yorktown was wrestling with the transition from Iverson Notation, a notation suited for blackboards and printed pages, to a machine-executable programming environment. Iverson had already developed a Selectric typeball and was writing a high-school math textbook. By autumn 1965, Larry Breed and Stanford grad student Philip Abrams had written the first implementation in 7090 Fortran (with batch execution). Eugene McDonnell was looking for applications to run on TSM, his project’s experimental time-sharing system on a virtual-memory 7090. With his help, Breed ported the Fortran code, added I/O routines for the 1050 terminals, called the result IVSYS; and Iverson Notation went interactive. Iverson, Breed and other associates now faced issues of input and output, function definition, error handling, suspended execution, and workspaces. They also struggled with both extending the notation to multidimensional arrays and new primitives, and limiting it to what could reasonably be implemented. Whatever it was, it wasn’t “APL”; that name came later. Iverson was also collaborating with John Lawrence of Science Research Associates (SRA), an IBM subsidiary in Chicago aimed at educational markets. Lawrence had been editor of the IBM Systems Journal when it published the Iversonian tour de force “A Formal Description of System/360.” At SRA he was leading a project to make Iverson’s notation the heart of a line of instructional materials, both books and interactive computer applications. -
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. -
KDB+ Quick Guide
KKDDBB++ -- QQUUIICCKK GGUUIIDDEE http://www.tutorialspoint.com/kdbplus/kdbplus_quick_guide.htm Copyright © tutorialspoint.com KKDDBB++ -- OOVVEERRVVIIEEWW This is a complete quide to kdb+ from kx systems, aimed primarily at those learning independently. kdb+, introduced in 2003, is the new generation of the kdb database which is designed to capture, analyze, compare, and store data. A kdb+ system contains the following two components − KDB+ − the database kdatabaseplus Q − the programming language for working with kdb+ Both kdb+ and q are written in k programming language (same as q but less readable). Background Kdb+/q originated as an obscure academic language but over the years, it has gradually improved its user friendliness. APL 1964, AProgrammingLanguage A+ 1988, modifiedAPLbyArthurWhitney K 1993, crispversionofA + , developedbyA. Whitney Kdb 1998, in − memorycolumn − baseddb Kdb+/q 2003, q language – more readable version of k Why and Where to Use KDB+ Why? − If you need a single solution for real-time data with analytics, then you should consider kdb+. Kdb+ stores database as ordinary native files, so it does not have any special needs regarding hardware and storage architecture. It is worth pointing out that the database is just a set of files, so your administrative work won’t be difficult. Where to use KDB+? − It’s easy to count which investment banks are NOT using kdb+ as most of them are using currently or planning to switch from conventional databases to kdb+. As the volume of data is increasing day by day, we need a system that can handle huge volumes of data. KDB+ fulfills this requirement. KDB+ not only stores an enormous amount of data but also analyzes it in real time. -
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. -
Generating an APL Font
TUGboat, Volume 8 (1987), No. 3 275 Generating an APL Font a typewriter-like typeface with fixed spacing; the Aarno Hohti and Okko Kanerva same approach for representing TEX input was University of Helsinki adopted by Knuth in the wbook. The verbatim macros have often been used for importing screen ABSTRACT. The APL language is well known for its or paper outputs into 'I@X documents; some people peculiar symbols which have inhibited the use of this misuse them for an easy construction of tables etc. language in many programming environments. Making In verbatim, the typewriter mode is entered by the APL documents of good quality has been difficult and control sequence \ begint t - that mode is ended by expensive. We describe here a simple way how to use METAFONT to generate an APL font for Tk,X by using \endtt. In the same vein, we could enter the APL existing font definitions as far as possible. mode by the control sequence \beginapl, and to end it by \endapl. However, it is more convenient Introduction to augment verbatim with aplstyle so that it This note describes an interesting exercise in using can be used with several different typewriter-like METAFONT to produce new typefaces by combining fonts. (The verbatim macros can be found in the letters from standard fonts. As we know, the APL Wbook, p. 421.) Since Q (the at sign) is used as language [6] of Kenneth Iverson has never gained the escape character inside verbatim mode, our the popularity it deserves largely because of its code might (and in fact does) look as follows: strange symbol set. -
Glossary of Mathematical Symbols
Glossary of mathematical symbols A mathematical symbol is a figure or a combination of figures that is used to represent a mathematical object, an action on mathematical objects, a relation between mathematical objects, or for structuring the other symbols that occur in a formula. As formulas are entirely constituted with symbols of various types, many symbols are needed for expressing all mathematics. The most basic symbols are the decimal digits (0, 1, 2, 3, 4, 5, 6, 7, 8, 9), and the letters of the Latin alphabet. The decimal digits are used for representing numbers through the Hindu–Arabic numeral system. Historically, upper-case letters were used for representing points in geometry, and lower-case letters were used for variables and constants. Letters are used for representing many other sort of mathematical objects. As the number of these sorts has dramatically increased in modern mathematics, the Greek alphabet and some Hebrew letters are also used. In mathematical formulas, the standard typeface is italic type for Latin letters and lower-case Greek letters, and upright type for upper case Greek letters. For having more symbols, other typefaces are also used, mainly boldface , script typeface (the lower-case script face is rarely used because of the possible confusion with the standard face), German fraktur , and blackboard bold (the other letters are rarely used in this face, or their use is unconventional). The use of Latin and Greek letters as symbols for denoting mathematical objects is not described in this article. For such uses, see Variable (mathematics) and List of mathematical constants. However, some symbols that are described here have the same shape as the letter from which they are derived, such as and .