( en | de | ru )

 

Disambiguation of "Bertot, Yves"

Author of the publication

copydeleteadd this publication to your clipboard
Distant Decimals of π : Formal Proofs of Some Algorithms Computing Them and Guarantees of Exact Computation.

, , and . J. Autom. Reason., 61 (1-4): 33-71 (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yves Robert

Yves Steinmetz

Yves Hoffmann

Yves Burkhardt

Yves Gensterblum

 

Other publications of authors with the same name

Vérification formelle d'extractions de racines entières.. Technique et Science Informatiques, 24 (9): 1161-1185 (2005)Reasoning with Executable Specifications., and . TAPSOFT, volume 915 of Lecture Notes in Computer Science, page 531-545. Springer, (1995)Formal Study of Plane Delaunay Triangulation., and . ITP, volume 6172 of Lecture Notes in Computer Science, page 211-226. Springer, (2010)A Short Presentation of Coq.. TPHOLs, volume 5170 of Lecture Notes in Computer Science, page 12-16. Springer, (2008)Type-Theoretic Functional Semantics., , and . TPHOLs, volume 2410 of Lecture Notes in Computer Science, page 83-98. Springer, (2002)Interactive Theorem Proving and Program Development - Coq'Art: The Calculus of Inductive Constructions, and . Texts in Theoretical Computer Science. An EATCS Series Springer, (2004)Interactive Theorem Proving and Program Development : Coq'Art : The Calculus of Inductive Constructions, and . Texts in Theoretical Computer Science Springer, 2004 edition, (May 14, 2004)Le Coq'Art, and . Hardcover, (Jan 31, 2015)Fixed point semantics and partial recursion in Coq., and . PPDP, page 89-96. ACM, (2008)Fix-Point Equations for Well-Founded Recursion in Type Theory., and . TPHOLs, volume 1869 of Lecture Notes in Computer Science, page 1-16. Springer, (2000)