On the non-sequential nature of the interval-domain model of real-number computation

@article{Escard2004OnTN,
  title={On the non-sequential nature of the interval-domain model of real-number computation},
  author={Mart{\'i}n H{\"o}tzel Escard{\'o} and Martin Hofmann and Thomas Streicher},
  journal={Mathematical Structures in Computer Science},
  year={2004},
  volume={14},
  pages={803 - 814}
}
We show that real-number computations in the interval-domain environment are ‘inherently parallel’ in a precise mathematical sense. We do this by reducing computations of the weak parallel-or operation on the Sierpinski domain to computations of the addition operation on the interval domain. 
Constructive analysis, types and exact real numbers
TLDR
This paper discusses various aspects of computable/constructive analysis, namely semantics, proofs and computations, and indicates that it is often natural to use constructive logic to reason about these computations.
Complexity and Intensionality in a Type-1 Framework for Computable Analysis
TLDR
The introduction of complexity measures for type-1 representations of real functions, and ways to define intensional functions, i.e. functions that may return different real numbers for the same real argument given in different representations are discussed.
Semantics of a sequential language for exact real-number computation
Parallel Functions In Recursive Program Schemes
TLDR
A special class of parallel functions (called invariant functions) are introduced that don’t depend on interpretation of domain on which they are defined and are analyzed in terms of sequential reducibility between the used parallel functions.
Sequential Real Number Computation and Recursive Relations
Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming
We define a notion of stable and measurable map between cones endowed with measurability tests and show that it forms a cpo-enriched cartesian closed category. This category gives a denotational
A Denotational Semantics for Total Correctness of Sequential Exact Real Programs
We provide a domain-based denotational semantics for a sequential language for exact real number computation, equipped with a non-deterministic test operator. The semantics is only an approximate
A Stream Calculus of Bottomed Sequences for Real Number Computation
Foundation of Computer (Algebra) ANALYSIS Systems: Semantics, Logic, Programming, Verification
TLDR
A semantics of operating on real numbers that is sound, Turing-complete, and practical is proposed, and ERC and its Turing-completeness from real functions to functionALs is expanded.
...
...

References

SHOWING 1-10 OF 21 REFERENCES
Topology, domain theory and theoretical computer science
A Fundamental Effect in Computations on Real Numbers
Theory of Recursive Functions and Effective Computability
TLDR
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular and generalizations of recursion theory.
Induction and Recursion on the Partial Real Line with Applications to Real PCF
PCF Extended with Real Numbers
Sequentiality and Piecewise-affinity in Segments of Real-PCF
Domains and lambda-calculi
TLDR
This chapter discusses the development of lambda-calculi in CCC's of algebraic dcpo's, as well as its applications in recursion theory and category theory.
Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
  • A. Edalat
  • Mathematics
    Bulletin of Symbolic Logic
  • 1997
Abstract We present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based
Continuous Lattices and Domains
Preface Acknowledgements Foreword Introduction 1. A primer on ordered sets and lattices 2. Order theory of domains 3. The Scott topology 4. The Lawson Topology 5. Morphisms and functors 6. Spectral
LCF Considered as a Programming Language
...
...