Work

Assertions and APL programming

Year: 1975

Type: conference-paper

Abstract: Some difficulties in reading and writing APL programs are discussed. Assertions (important relations among and properties of variables) are suggested as a technique for improving reliability and readability of APL programs. It is shown how such assertions may be used for documentation, verification, optimization, and debugging. An implementation of run-time assertions in APLSV is given and illustrated by examples.

Source: International Conference on APL (APL)

DOI: 10.1145/800117.803795

Author: Susan L. Gerhart

Institution: Duke University

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2062945751

FWCI:

Cites: 6

Cited by: 2

Related to: 10