Program extraction in exact real arithmetic
From MaRDI portal
Publication:5740678
DOI10.1017/S0960129513000327zbMath1362.03026OpenAlexW2144130305MaRDI QIDQ5740678
Helmut Schwichtenberg, Kenji Miyamoto
Publication date: 27 July 2016
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129513000327
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Limits of real numbers in the binary signed digit representation ⋮ Unnamed Item ⋮ Lookahead analysis in exact real arithmetic with logical methods ⋮ Normal forms, linearity, and prime algebraicity over nonflat domains ⋮ Nonflatness and totality ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
Uses Software
Cites Work
- A certified, corecursive implementation of exact real numbers
- Realizability interpretation of proofs in constructive analysis
- Computing with infinite objects
- Term rewriting for normalization by evaluation.
- Theory of the segment points transformation
- Proofs and Computations
- Proofs, Programs, Processes
- From Coinductive Proofs to Exact Real Arithmetic
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
This page was built for publication: Program extraction in exact real arithmetic
