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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
