Limits of real numbers in the binary signed digit representation

DOI10.46298/lmcs-18(3:24)2022OpenAlexW3140889884MaRDI QIDQ5043582

Niels Köpp, Franziskus Wiesnet

Publication date: 6 October 2022

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

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

zbMATH Keywords

realizabilityHaskellprogram extractioncoinductioncorecursionexact real number computationMinlogsigned digit code

Mathematics Subject Classification ID

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

Uses Software

• Haskell
• Minlog

Cites Work

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

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