Implementation of interval arithmetic using APL

Authors:
Herbert Fischer;Alvin J. Surkan
Affiliations:
University of Nebraska, Lincoln, Nebraska;University of Nebraska, Lincoln, Nebraska
Venue:
ACM SIGAPL APL Quote Quad
Year:
1975

Citing 2
Cited 0

Automatic Controlled Precision Calculations

Journal of the ACM (JACM)
Computer Interval Arithmetic: Definition and Proof of Correct Implementation

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The central problem of interval arithmetic is first described in a general set theory framework. This description is specialized to intervals and interval operations which are defined over a set of machine numbers and implemented in computer programs. APL has been used for the logical formulation of algorithms for these operations of interval arithmetic. The Iverson notation of APL removes the arbitrariness of conventional descriptions of algorithms and program solutions. The results are obtained by direct execution of the completely explicit APL function type routines which both constitute a program and unambiguously describe algorithms for implementing the operations of interval arithmetic.