Some Exercises in APL Language Design
Roger K.W. Hui
Introduction
0.
Function Syntax
1.
Elision of Times Sign
2.
Order of Evaluation
3.
Polynomials
4.
Nouns, Verbs, Adverbs
5.
Valence
6.
Order of Arguments
7.
Negate/Minus
8.
Imaginary/Complex
9.
Floor and Ceiling
10.
What is an Array?
11.
Is a Scalar an Array?
12.
Infinite Arrays
13.
Scalar Encoding
14.
Is 1 a Prime?
15.
0÷0
16.
0*0
17.
Scalar and Single Extension
18.
Agreement
19.
Not Found
20.
Major Cell
21.
Dyadic Grade
22.
Sorting Complex Numbers
23.
Total Array Ordering
24.
A Design Mistake?
25.
Squad Indexing
26.
Array Indices
27.
Array Index Bounds
28.
Array Logic
29.
Design Mistake II
30.
Forks
31.
Scalar Operators
32.
Strand Notation
33.
Dfns and Explicit Definition
34.
Sigma, Pi, etc.
35.
Operators in APL in 1978
36.
Operators in J
37.
Operator Encoding Efficiency
38.
Key
39.
Under
40.
Reflexive
41.
Scan
42.
Reduction Style
43.
A Combinatorial Operator
44.
Cut, Tessellate, Tile, Stencil
45.
Small-Range, 1-, and 2-Byte Integers
46.
Tolerant Comparison
47.
assert
48.
Why Functional Programming Matters
49.
Notation as a Tool of Thought
Sample Answer
Further Reading
created:
2016-10-20 18:30
updated:
2018-06-22 20:25