Limits of real numbers in the binary signed digit representation

DOI10.46298/LMCS-18(3:24)2022MaRDI QIDQ5043582zbMATH OpenOpenAlexFDO

Authors Franziskus Wiesnet, Niels Köpp

Publication date 6 October 2022

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2103.15702

zbMATH Keywords

coinductioncorecursionexact real number computationHaskellMinlogprogram extractionrealizabilitysigned digit code

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• Logic for Exact Real Arithmetic: Multiplication
• Logic for exact real arithmetic
• Logical Approaches to Computational Barriers
• A coinductive approach to computing with compact sets
• From coinductive proofs to exact real arithmetic: theory and applications

Cites work

• A certified, corecursive implementation of exact real numbers
• Coinduction for exact real number computation
• Computing with infinite objects
• Constructive analysis with witnesses
• From coinductive proofs to exact real arithmetic: theory and applications
• Logic for exact real arithmetic
• Program extraction in exact real arithmetic
• Proofs and computations
• Proofs, programs, processes

Cited in

(2)

• Logic for Exact Real Arithmetic: Multiplication
• Verified program extraction in number theory: the fundamental theorem of arithmetic and relatives

Describes a project that uses

Uses Software

• Haskell
• Minlog

This page was built for publication: Limits of real numbers in the binary signed digit representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043582)