Abstract
In this paper we present the Coq formalisation of the QArith library which is an implementation of rational numbers as binary sequences for both lazy and strict computation. We use the representation also known as the Stern-Brocot representation for rational numbers. This formalisation uses advanced machinery of the Coq theorem prover and applies recent developments in formalising general recursive functions. This formalisation highlights the rôle of type theory both as a tool to verify hand-written programs and as a tool to generate verified programs. © Springer-Verlag 2004.
Cite
CITATION STYLE
Niqui, M., & Bertot, Y. (2004). QArith: Coq Formalisation of Lazy Rational Arithmetic. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3085, 309–323. https://doi.org/10.1007/978-3-540-24849-1_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
