QArith: Coq Formalisation of Lazy Rational Arithmetic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

QArith: Coq Formalisation of Lazy Rational Arithmetic

Yves Bertot

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.
Fichier principal
Vignette du fichier
RR-5004.pdf (308.68 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00077041 , version 1 (29-05-2006)

Identifiers

  • HAL Id : inria-00077041 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More