Ordered types and a generalized for statement

Authors:
Harvey Abramson
Affiliations:
The University of British Columbia, Vancouver, B.C., Canada
Venue:
ACM SIGPLAN Notices
Year:
1977

Citing 4
Cited 0

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
PASCAL user manual and report

PASCAL user manual and report
SIMULA 67 common base language, (Norwegian Computing Center. Publication)

SIMULA 67 common base language, (Norwegian Computing Center. Publication)
Structured programming

Structured programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

An ordered type is a data structure together with predecessor and successor procedures and a relation defined over pairs of elements of the ordered type. A generalized for statement which uses the procedures connected with an ordered type is introduced. This allows ordered types to be used to control statement iteration in programs.