Coinduction for exact real number computation
From MaRDI portal
Publication:1015372
DOI10.1007/S00224-007-9017-6zbMath1166.68015OpenAlexW2048052240MaRDI QIDQ1015372
Publication date: 8 May 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9017-6
Related Items (6)
A stream calculus of bottomed sequences for real number computation ⋮ Limits of real numbers in the binary signed digit representation ⋮ Typed vs. Untyped Realizability ⋮ Unnamed Item ⋮ Proofs, programs, processes ⋮ From Coinductive Proofs to Exact Real Arithmetic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A certified, corecursive implementation of exact real numbers
- Universal coalgebra: A theory of systems
- A term calculus for (co-)recursive definitions on streamlike data structures
- Affine functions and series with co-inductive real numbers
- Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers
- Implementing constructive real analysis (preliminary report)
- Mathematics of Program Construction
- New Computational Paradigms
- Systems of Logic Based on Ordinals†
- Logical Approaches to Computational Barriers
This page was built for publication: Coinduction for exact real number computation