Abstract
We present a PCF-like calculus having real numbers as a basic data type. The calculus is defined by its denotational semantics. We prove the universality of the calculus (i.e. every computable element is definable). We address the general problem of providing an operational semantics to calculi for the real numbers. We present a possible solution based on a new representation for the real numbers.
Author supplied keywords
Cite
CITATION STYLE
Di Gianantonio, P. (1997). An abstract data type for real numbers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 121–131). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_170
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
