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

Authors:
Martín Escardó;Martin Hofmann;Thomas Streicher
Affiliations:
School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK Email: m.escardo@cs.bham.ac.uk;LMU München, Institut für Informatik, Oettingenstraße 67, 80538 München, Germany;Fachbereich Mathematik, Technische Universität Darmstadt, Schloßgartenstraße 7, 64289 Darmstadt, Germany
Venue:
Mathematical Structures in Computer Science
Year:
2004

Citing 7
Cited 9

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Exact real arithmetic formulating real numbers as functions

Research topics in functional programming
Domain theory

Handbook of logic in computer science (vol. 3)
PCF extended with real numbers

Theoretical Computer Science - Special issue on real numbers and computers
Induction and recursion on the partial real line with applications to Real PCF

Theoretical Computer Science - Special issue on real numbers and computers
Domains and lambda-calculi

Domains and lambda-calculi
Sequentiality and Piecewise-affinity in Segments of Real-PCF

Electronic Notes in Theoretical Computer Science (ENTCS)

On the Non-sequential Nature of Domain Models of Real-number Computation

Electronic Notes in Theoretical Computer Science (ENTCS)
Constructive analysis, types and exact real numbers

Mathematical Structures in Computer Science
Semantics of a sequential language for exact real-number computation

Theoretical Computer Science
Sequential Real Number Computation and Recursive Relations

Electronic Notes in Theoretical Computer Science (ENTCS)
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting

Electronic Notes in Theoretical Computer Science (ENTCS)
Synthetic Topology

Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity and intensionality in a type-1 framework for computable analysis

CSL'05 Proceedings of the 19th international conference on Computer Science Logic
SHRAD: a language for sequential real number computation

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
A Stream Calculus of Bottomed Sequences for Real Number Computation

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.