Interactive theorem proving and program development: Coq'Art: the calculus of inductive constructions epub
Par higgins leslie le jeudi, mai 5 2016, 18:11 - Lien permanent
Interactive theorem proving and program development: Coq'Art: the calculus of inductive constructions by C. Paulin-Mohring, G. Huet, Pierre CastTran, Pierre Castéran, Yves Bertot
Interactive theorem proving and program development: Coq'Art: the calculus of inductive constructions C. Paulin-Mohring, G. Huet, Pierre CastTran, Pierre Castéran, Yves Bertot ebook
ISBN: 3540208542, 9783540208549
Format: djvu
Page: 497
Publisher: Springer
We present a practical tool for defining and proving proper- ties of recursive 1 Introduction. 340, Interactive theorem proving and program development. Tions: consider a proof of a simple theorem stating that the fast exponentation .. An Eatcs Series) - Gerard Huet - ecs4.com. Coq'Art: The calculus of inductive constructions - Bertot, Castéran - 2004. Dependent type theory provides a powerful language in which programs can be . I'd phrase it this way: you specify what your function does in an impractically-powerful type system (the Calculus of Inductive Constructions), then you prove that your specification is sound by implementing it in the proof language (gallina). Development— Coq'Art: The Calculus of Inductive Constructions. Interactive Theorem Proving And Program Development: Coq'art: The Calculus Of Inductive Constructions (Texts in Theoretical Computer Science. Interactive Theorem Proving and Program Development: Coq'Art: The Calculus of Inductive Constructions. If you're seriously exploring Coq, then I think Coq'Art is a must have. It is based on a theory called the calculus of Interactive theorem proving and program development: CoqArt: the calculus of inductive constructions. Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions Series: Texts in Theoretical Computer Science. Finally, a minor point: Coq is not an automated theorem prover, but rather a proof assistant: it supports interactive, rather than automated, theorem proving. Interactive Theorem Proving and Program Development Coq'Art: The Calculus of Inductive Constructions 公式 http://www.labri.fr/perso/casteran/CoqArt/index.html (背景色注意).