Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers

DOI10.1007/978-3-540-74464-1_14zbMATH Open1178.68530OpenAlexW1483266313MaRDI QIDQ3612445FDOQ3612445

Authors: Milad Niqui 

Publication date: 10 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74464-1_14

Recommendations

• Coinductive Formal Reasoning in Exact Real Arithmetic
• Coinductive field of exact real numbers and general corecursion
• Coinduction for exact real number computation
• From Coinductive Proofs to Exact Real Arithmetic
• A certified, corecursive implementation of exact real numbers

Mathematics Subject Classification ID

Cited In (6)

• New Computational Paradigms
• Coinduction for exact real number computation
• Productivity of Edalat-Potts exact arithmetic in constructive type theory
• Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base
• Formal correctness of a quadratic unification algorithm
• Coinductive Formal Reasoning in Exact Real Arithmetic

Uses Software

• Coq

This page was built for publication: Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers

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