ACM SIGAPL APL Quote Quad

Brown, Robert G.

doi: 10.1145/140660.140662pmid: N/A

Shpigel, Boris Ya.

doi: 10.1145/140660.140665pmid: N/A

Peelle, Howard A.; Brown, Robert G.

doi: 10.1145/140660.140666pmid: N/A

Moore, Larry B.

doi: 10.1145/140660.140669pmid: N/A

Bowman, Dick; Weigang, Jim

doi: 10.1145/140660.140671pmid: N/A

Fordyce, Kenneth; Alfonseca, Manuel; Brown, James; Sullivan, Gerald

doi: 10.1145/140660.140673pmid: N/A

Many great advances in science and mathematics were preceded by notational improvements. While a given algorithm can be implemented in any general purpose programming language, discovery of algorithms is heavily influenced by the notation used to investigate them. It is often conjectured that APL notation leads to unique solutions. In logic problems the values for variables are often limited to two states or options: yes/no, true/false, on/off, guilt/innocence, etc. This paper provides one example of how APL provides a unique solution to such problems.

Holt, Dick

doi: 10.1145/140660.140677pmid: N/A

Bowman, Dick

doi: 10.1145/140660.140679pmid: N/A

Dickey, Lee J.

doi: 10.1145/140660.571032pmid: N/A

Bowman, Dick

doi: 10.1145/140660.571031pmid: N/A