Theory of Computing Systems

, Volume 41, Issue 1, pp 49–105 | Cite as

Shrad: A Language for Sequential Real Number Computation

Article

Abstract

Since Di Gianantonio [1993] introduced his semantics for exact real number computation, there has always been a struggle to maintain data abstraction and efficiency as much as possible. The interval domain model-or its variations-can be regarded as the standard setting to obtain maximum data abstraction. As for efficiency there has been much focus on sequentiality to the extent that these two terms have become almost synonymous. Escardo et al. [1998, 2004] demonstrated that there is not much one can get by sequential computation in the interval domain model. In Farjudian [2004a, 2003] we reinforced this result by exposing the limited power of (some extensions of) the sequential fragment of Real-PCF. The previous argument suggests some sort of compromise in the beauty of the model in order to keep efficiency. One way forward is to try to sacrifice single-valuedness over partial real numbers. This is exactly what we will see in designing Shrad (which originally comes from Farjudian [2004b]) where we succeed in presenting a framework for exact real number computation which satisfies the following all at the same time: 1) It is sequential. 2) Multi-valuedness over total real numbers is carefully avoided. 3) All the computable first-order functions are defined in the language (expressivity).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2007

Authors and Affiliations

  1. 1.Department of Mathematical Sciences, Sharif University of Technology, Azadi St.TehranIran

Personalised recommendations