Semantics of exact real arithmetic
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 248-257
- https://doi.org/10.1109/lics.1997.614952
Abstract
In this paper, we incorporate a representation of the non-negative extended real numbers based on the composition of linear fractional transformations with non-negative integer coefficients into the Programming Language for Computable Functions (PCF) with products. We present two models for the extended language and show that they are computationally adequate with respect to the operational semantics.Keywords
This publication has 14 references indexed in Scilit:
- Arbitrary precision real arithmetic: design and algorithmsThe Journal of Logic and Algebraic Programming, 2005
- Exploiting redundancy in bit-pipelined rational arithmeticPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- PCF extended with real numbersTheoretical Computer Science, 1996
- History of Continued Fractions and Padé ApproximantsPublished by Springer Nature ,1991
- An algorithm for redundant binary bit-pipelined rational arithmeticIEEE Transactions on Computers, 1990
- An on-line arithmetic unit for bit-pipelined rational arithmeticJournal of Parallel and Distributed Computing, 1988
- An essay on continued fractionsTheory of Computing Systems, 1985
- Finite precision lexicographic continued fraction number systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Continued FractionsPublished by Cambridge University Press (CUP) ,1984
- Error Analysis of Certain Floating-Point On-Line AlgorithmsIEEE Transactions on Computers, 1983