Skip to Main content Skip to Navigation

QArith: Coq Formalisation of Lazy Rational Arithmetic

Milad Niqui 1 yves Bertot 1 
1 LEMME - Software and mathematics
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : In this paper we present the formalisation of the 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 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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Monday, May 29, 2006 - 11:58:04 AM
Last modification on : Friday, February 4, 2022 - 3:19:42 AM
Long-term archiving on: : Monday, April 5, 2010 - 9:33:20 PM


  • HAL Id : inria-00077041, version 1



Milad Niqui, yves Bertot. QArith: Coq Formalisation of Lazy Rational Arithmetic. [Research Report] RR-5004, INRIA. 2003, pp.19. ⟨inria-00077041⟩



Record views


Files downloads