Lookahead analysis in exact real arithmetic with logical methods

DOI10.1016/J.TCS.2022.10.003MaRDI QIDQ2680994zbMATH OpenOpenAlexFDO

Authors Nils Köpp, Helmut Schwichtenberg

Publication date 5 January 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.10.003

zbMATH Keywords

exact real number computationlookaheadminlogprogram extractionrealizabilitysigned digit code

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Logic for exact real arithmetic
• Efficient Exact Arithmetic over Constructive Reals
• Real number computation with committed choice logic programming languages
• Coinductive Formal Reasoning in Exact Real Arithmetic
• Model-theoretic methods of analysis of computer arithmetic
• Program extraction in exact real arithmetic
• Logical approximation for program analysis
• Lazy algorithms for exact real arithmetic
• Logic for Exact Real Arithmetic: Multiplication
• Semantics of a sequential language for exact real-number computation

Cites work

• Constructive analysis with witnesses
• From coinductive proofs to exact real arithmetic: theory and applications
• scientific article; zbMATH DE number 4070894 (Why is no real title available?)
• scientific article; zbMATH DE number 3677794 (Why is no real title available?)
• scientific article; zbMATH DE number 5179800 (Why is no real title available?)
• Logic for exact real arithmetic
• Logic for Gray-code computation
• Program extraction in exact real arithmetic
• Proofs and computations

Cited in

(1)

• Verified program extraction in number theory: the fundamental theorem of arithmetic and relatives

This page was built for publication: Lookahead analysis in exact real arithmetic with logical methods

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