An abstract data type for real numbers
From MaRDI portal
Publication:1960529
DOI10.1016/S0304-3975(99)00036-5zbMath0930.68082MaRDI QIDQ1960529
Publication date: 12 January 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
A stream calculus of bottomed sequences for real number computation ⋮ Semantics of a sequential language for exact real-number computation ⋮ Unnamed Item ⋮ Independent subbases and non-redundant codings of separable metrizable spaces ⋮ Properties of domain representations of spaces through dyadic subbases ⋮ Extracting total Amb programs from proofs ⋮ Intuitionistic fixed point logic ⋮ Hierarchies of total functionals over the reals ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) ⋮ Representations of Complete Uniform Spaces via Uniform Domains ⋮ On the Cantor–Bendixson rank of a set that is searchable in Gödel’s T ⋮ Computing with Functionals—Computability Theory or Computer Science? ⋮ Real number computation through Gray code embedding.
Cites Work
- Constructivism in mathematics. An introduction. Volume I
- LCF considered as a programming language
- PCF extended with real numbers
- Real number computability and domain theory
- On the definitions of computable real continuous functions
- A universality theorem for PCF with recursive types, parallel-or and ∃
- Algorithmic operators in constructive metric spaces
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Recursive Real Numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An abstract data type for real numbers
