Entry Bertot:2004:ITP from compj2000.bib
Last update: Sun Mar 31 02:13:37 MDT 2019
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Book{Bertot:2004:ITP,
author = "Yves Bertot and P. (Pierre) Cast{\'e}ran",
title = "Interactive theorem proving and program development:
{Coq'Art}: the calculus of inductive constructions",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxv + 469",
year = "2004",
ISBN = "3-540-20854-2 (hardcover)",
ISBN-13 = "978-3-540-20854-9 (hardcover)",
LCCN = "QA76.9.A96 B47 2004",
bibdate = "Wed Dec 21 17:46:09 MST 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/compj2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Texts in theoretical computer science",
acknowledgement = ack-nhfb,
subject = "Automatic theorem proving; Computer programming",
}
Related entries
- 3-540-20854-2,
49(1)130
- Automatic,
7(0)x--153,
43(6)482,
49(1)129,
51(6)688,
52(5)545
- calculus,
0(0)xi--420,
0(0)xii--580,
47(1)10,
49(1)130
- computer,
0(0)viii--378,
0(0)xi--170,
0(0)xi--420,
0(0)xii--574,
0(0)xiii--483,
0(0)xiii--574,
0(0)xv--387,
0(0)xvi--848,
0(0)xvii--325,
0(0)xviii--240,
0(0)xxi--418,
0(0)xxiii--703,
0(0)xxv--672,
0(0)xxvi--590,
0(0)xxx--593,
0(0)xxxii--648,
0(0)xxxvi--412,
0(0)0,
0(0)x--295,
0(0)x--438,
7(0)x--153,
35(0)335,
41(7)445,
43(4)274,
44(4)321,
44(4)324,
44(4)326,
46(1)3,
46(5)487,
47(4)399,
47(6)627,
48(6)650,
48(6)662,
49(1)129,
49(1)130,
49(2)136,
49(2)249,
49(3)376,
49(3)378,
49(4)390,
49(4)501,
49(6)762,
50(1)4,
50(2)151,
50(3)254,
50(4)375,
51(1)1,
51(6)688,
51(6)731,
51(6)735,
51(6)741,
51(6)743,
58(0)xvi--358,
z(0)xiv--320,
z(0)xxvi--442
- constructions,
49(1)130
- Coq'Art,
49(1)130
- development,
0(0)viii--378,
0(0)xxi--418,
0(0)xxix--561,
0(0)xxx--593,
0(0)xxxii--648,
0(0)xxxvi--412,
0(0)0,
0(0)x--438,
35(0)335,
44(1)1,
45(1)2,
45(1)37,
46(6)602,
48(2)253,
49(1)130,
49(6)685,
51(2)144
- hardcover,
0(0)ix--292,
0(0)xi--170,
0(0)xii--274,
0(0)xxi--418,
0(0)xxiii--499,
49(1)128,
49(1)130,
49(6)764,
52(4)510,
52(4)510
- inductive,
49(1)130,
50(3)369
- Interactive,
46(4)340,
47(2)140,
49(1)130,
50(3)371
- program,
0(0)viii--378,
0(0)xv--387,
0(0)xxv--672,
0(0)xxx--593,
48(4)421,
48(5)588,
48(6)737,
49(1)42,
49(1)130,
49(6)744,
50(3)254,
50(3)261,
50(3)269,
51(5)571,
52(5)530,
52(5)545
- programming,
0(0)xi--420,
0(0)xiii--483,
0(0)xiii--574,
0(0)xv--368,
0(0)xv--387,
0(0)xvii--325,
0(0)xxiii--499,
0(0)xxxii--648,
7(0)x--153,
35(0)335,
43(4)252,
43(6)491,
43(6)512,
46(5)527,
46(5)529,
47(1)134,
48(2)130,
48(5)602,
49(1)127,
49(1)129,
49(1)130,
49(6)665,
50(2)134,
52(6)724,
z(0)xiv--320,
z(0)xxvi--442
- proving,
49(1)130
- theorem,
49(1)130,
51(5)566