#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1974

2003

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Howard A. Peelle
- APL
- 2000

Fundamentals of graph coloring are introduced, and four basic alternative algorithms for coloring undirected graphs are described in J, along with programs for generating, adjacency matrices and testing them. Results are compared, and suggestions for future development are offered.

- Murray Eisenberg, Howard A. Peelle
- APL '83
- 1983

This paper discusses common mistakes novices make when learning to program in APL. We present several exemplary APL “learning bugs”, describe the context in which they occur, indicate why we believe they are interesting, and speculate about underlying thinking processes. We claim that such learning bugs are worth examining: further study may… (More)

- Howard A. Peelle
- APLQ
- 1974

- Murray Eisenberg, Howard A. Peelle
- APL
- 1987

In an effort to understand “APL thinking”, we examine a few selected examples of using APL to solve specific problems, namely: compute the median of a numerical vector; simulate the Replicate function; string search; carry forward work-to-be-done in excess of capacity; rotate concentric rectangular rings in a matrix; find column indices of… (More)

- Howard A. Peelle
- APLQ
- 1976

This paper uses A Programming Language to provide a perspicuous representation of the recurslve algorithm for generating the reflected binary Gray Code. Further, the APt definition is compared with the definition of a recursive function for generating standard binary numbers; a simple expression is proposed for converting a binary to its binary Gray code… (More)

- Murray Eisenberg, Howard A. Peelle
- APL
- 1993

This paper reports how we, two university teachers of APL, began to learn J. By presenting accounts of a series of small experiments, it reveals our understandings and misunderstandings along the way. It discusses things we especially liked and disliked about J as well as the resources available for learning it, and it indicates some implications of our… (More)

- Howard A. Peelle
- APL '81
- 1981

This paper describes a curriculum unit in which APL is used to introduce models of neural networks. It begins with a simple model for transmitting impulses among a vector of logical neurons; then a more sophisticated model is developed with thresholds, decay, and inhibition in a matrix of neurons; then a general model is offered for higher order arrays of… (More)

- Howard A. Peelle
- APL '84
- 1984

Seven alternative representations of Rubik's Cube are presented and compared: a 3-by-3-by-3 array of 3-digit integers; a 6-by-3-by-3 array of literals; a 5-by-12 literal matrix; an ll-by-ll sparse literal matrix; a 54-element vector; a 4-dimension array; and a 3-by-3-by-3 nested array. APL functions are given for orientation moves and quarter-turns plus… (More)

- Howard A. Peelle
- SIGCSE '76
- 1976

Recursion is a powerful idea*—with correspondingly powerful implications for learning and teaching mathematics. Computer scientists have previously pointed out that the use of recursion often permits more lucid and concise descriptions of algorithms [1]; mathematicians know that recursion is a fundamental concept upon which entire systems of… (More)

- Howard A. Peelle, Murray Eisenberg
- APL '85
- 1985

This paper discusses “APL teaching bugs”, in three senses: (1) issues inherent in the teaching of APL that confront the instructor with difficult choices; (2) potential mistakes sometimes made by instructors teaching APL; and (3) problematic aspects of the design of APL that are especially difficult to explain. These teaching bugs are presented… (More)