Limits of real numbers in the binary signed digit representation

DOI10.46298/LMCS-18(3:24)2022OpenAlexW3140889884MaRDI QIDQ5043582FDOQ5043582

Authors: Franziskus Wiesnet, Niels Köpp 

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

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

zbMATH Keywords

realizabilitycoinductioncorecursionprogram extractionHaskellexact real number computationMinlogsigned digit code

Mathematics Subject Classification ID

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

Cites Work

• Coinduction for exact real number computation
• Proofs and computations
• Computing with infinite objects
• From coinductive proofs to exact real arithmetic: theory and applications
• Proofs, programs, processes
• A certified, corecursive implementation of exact real numbers
• Program extraction in exact real arithmetic
• Constructive analysis with witnesses
• Title not available (Why is that?)

Cited In (1)

• Logic for Exact Real Arithmetic: Multiplication

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)