1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870
|
@STRING{toappear="To appear"}
@STRING{lncs="Lecture Notes in Computer Science"}
@TECHREPORT{RefManCoq,
AUTHOR = {Bruno~Barras, Samuel~Boutin,
Cristina~Cornes, Judical~Courant, Yann~Coscoy, David~Delahaye,
Daniel~de~Rauglaudre, Jean-Christophe~Fillitre, Eduardo~Gimnez,
Hugo~Herbelin, Grard~Huet, Henri~Laulhre, Csar~Muoz,
Chetan~Murthy, Catherine~Parent-Vigouroux, Patrick~Loiseleur,
Christine~Paulin-Mohring, Amokrane~Sabi, Benjamin~Werner},
INSTITUTION = {INRIA},
TITLE = {{The Coq Proof Assistant Reference Manual -- Version V6.2}},
YEAR = {1998}
}
@INPROCEEDINGS{Aud91,
AUTHOR = {Ph. Audebaud},
BOOKTITLE = {Proceedings of the sixth Conf. on Logic in Computer Science.},
PUBLISHER = {IEEE},
TITLE = {Partial {Objects} in the {Calculus of Constructions}},
YEAR = {1991}
}
@PHDTHESIS{Aud92,
AUTHOR = {Ph. Audebaud},
SCHOOL = {{Universit\'e} Bordeaux I},
TITLE = {Extension du Calcul des Constructions par Points fixes},
YEAR = {1992}
}
@INPROCEEDINGS{Audebaud92b,
AUTHOR = {Ph. Audebaud},
BOOKTITLE = {{Proceedings of the 1992 Workshop on Types for Proofs and Programs}},
EDITOR = {{B. Nordstr\"om and K. Petersson and G. Plotkin}},
NOTE = {Also Research Report LIP-ENS-Lyon},
PAGES = {pp 21--34},
TITLE = {{CC+ : an extension of the Calculus of Constructions with fixpoints}},
YEAR = {1992}
}
@INPROCEEDINGS{Augustsson85,
AUTHOR = {L. Augustsson},
TITLE = {{Compiling Pattern Matching}},
BOOKTITLE = {Conference Functional Programming and
Computer Architecture},
YEAR = {1985}
}
@INPROCEEDINGS{EG94a,
AUTHOR = {E. Gim\'enez},
EDITORS = {P. Dybjer and B. Nordstr\"om and J. Smith},
BOOKTITLE = {Workshop on Types for Proofs and Programs},
PAGES = {39-59},
SERIES = {LNCS},
NUMBER = {996},
TITLE = {{Codifying guarded definitions with recursive schemes}},
YEAR = {1994},
PUBLISHER = {Springer-Verlag},
}
@INPROCEEDINGS{EG95a,
AUTHOR = {E. Gim\'enez},
BOOKTITLE = {Workshop on Types for Proofs and Programs},
SERIES = {LNCS},
NUMBER = {1158},
PAGES = {135-152},
TITLE = {An application of co-Inductive types in Coq:
verification of the Alternating Bit Protocol},
EDITORS = {S. Berardi and M. Coppo},
PUBLISHER = {Springer-Verlag},
YEAR = {1995}
}
@PhdThesis{EG96,
author = {E. Gim\'enez},
title = {A Calculus of Infinite Constructions and its
application to the verification of communicating systems},
school = {Ecole Normale Sup\'erieure de Lyon},
year = {1996}
}
@ARTICLE{BaCo85,
AUTHOR = {J.L. Bates and R.L. Constable},
JOURNAL = {ACM transactions on Programming Languages and Systems},
TITLE = {Proofs as {Programs}},
VOLUME = {7},
YEAR = {1985}
}
@BOOK{Bar81,
AUTHOR = {H.P. Barendregt},
PUBLISHER = {North-Holland},
TITLE = {The Lambda Calculus its Syntax and Semantics},
YEAR = {1981}
}
@TECHREPORT{Bar91,
AUTHOR = {H. Barendregt},
INSTITUTION = {Catholic University Nijmegen},
NOTE = {In Handbook of Logic in Computer Science, Vol II},
NUMBER = {91-19},
TITLE = {Lambda {Calculi with Types}},
YEAR = {1991}
}
@BOOK{Bastad92,
EDITOR = {B. Nordstr\"om and K. Petersson and G. Plotkin},
PUBLISHER = {Available by ftp at site ftp.inria.fr},
TITLE = {Proceedings of the 1992 Workshop on Types for Proofs and Programs},
YEAR = {1992}
}
@BOOK{Bee85,
AUTHOR = {M.J. Beeson},
PUBLISHER = {Springer-Verlag},
TITLE = {Foundations of Constructive Mathematics, Metamathematical Studies},
YEAR = {1985}
}
@ARTICLE{BeKe92,
AUTHOR = {G. Bellin and J. Ketonen},
JOURNAL = {Theoretical Computer Science},
PAGES = {115--142},
TITLE = {A decision procedure revisited : Notes on direct logic, linear logic and its implementation},
VOLUME = {95},
YEAR = {1992}
}
@BOOK{Bis67,
AUTHOR = {E. Bishop},
PUBLISHER = {McGraw-Hill},
TITLE = {Foundations of Constructive Analysis},
YEAR = {1967}
}
@BOOK{BoMo79,
AUTHOR = {R.S. Boyer and J.S. Moore},
KEY = {BoMo79},
PUBLISHER = {Academic Press},
SERIES = {ACM Monograph},
TITLE = {A computational logic},
YEAR = {1979}
}
@MASTERSTHESIS{Bou92,
AUTHOR = {S. Boutin},
MONTH = sep,
SCHOOL = {{Universit\'e Paris 7}},
TITLE = {Certification d'un compilateur {ML en Coq}},
YEAR = {1992}
}
@ARTICLE{Bru72,
AUTHOR = {N.J. de Bruijn},
JOURNAL = {Indag. Math.},
TITLE = {{Lambda-Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem}},
VOLUME = {34},
YEAR = {1972}
}
@INCOLLECTION{Bru80,
AUTHOR = {N.J. de Bruijn},
BOOKTITLE = {to H.B. Curry : Essays on Combinatory Logic, Lambda Calculus and Formalism.},
EDITOR = {J.P. Seldin and J.R. Hindley},
PUBLISHER = {Academic Press},
TITLE = {A survey of the project {Automath}},
YEAR = {1980}
}
@TECHREPORT{Leroy90,
AUTHOR = {X. Leroy},
TITLE = {The {ZINC} experiment: an economical implementation
of the {ML} language},
INSTITUTION = {INRIA},
NUMBER = {117},
YEAR = {1990}
}
@BOOK{Caml,
AUTHOR = {P. Weis and X. Leroy},
PUBLISHER = {InterEditions},
TITLE = {Le langage Caml},
YEAR = {1993}
}
@TECHREPORT{CoC89,
AUTHOR = {Projet Formel},
INSTITUTION = {INRIA},
NUMBER = {110},
TITLE = {{The Calculus of Constructions. Documentation and user's guide, Version 4.10}},
YEAR = {1989}
}
@INPROCEEDINGS{CoHu85a,
AUTHOR = {Th. Coquand and G. Huet},
ADDRESS = {Linz},
BOOKTITLE = {EUROCAL'85},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS},
TITLE = {{Constructions : A Higher Order Proof System for Mechanizing Mathematics}},
VOLUME = {203},
YEAR = {1985}
}
@Misc{Bar98,
author = {B. Barras},
title = {A formalisation of
\uppercase{B}urali-\uppercase{F}orti's paradox in Coq},
howpublished = {Distributed within the bunch of contribution to the
Coq system},
year = {1998},
month = {March},
note = {\texttt{http://pauillac.inria.fr/coq}}
}
@INPROCEEDINGS{CoHu85b,
AUTHOR = {Th. Coquand and G. Huet},
BOOKTITLE = {Logic Colloquium'85},
EDITOR = {The Paris Logic Group},
PUBLISHER = {North-Holland},
TITLE = {{Concepts Math\'ematiques et Informatiques formalis\'es dans le Calcul des Constructions}},
YEAR = {1987}
}
@ARTICLE{CoHu86,
AUTHOR = {Th. Coquand and G. Huet},
JOURNAL = {Information and Computation},
NUMBER = {2/3},
TITLE = {The {Calculus of Constructions}},
VOLUME = {76},
YEAR = {1988}
}
@BOOK{Con86,
AUTHOR = {R.L. {Constable et al.}},
PUBLISHER = {Prentice-Hall},
TITLE = {{Implementing Mathematics with the Nuprl Proof Development System}},
YEAR = {1986}
}
@INPROCEEDINGS{CoPa89,
AUTHOR = {Th. Coquand and C. Paulin-Mohring},
BOOKTITLE = {Proceedings of Colog'88},
EDITOR = {P. Martin-L{\"o}f and G. Mints},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS},
TITLE = {Inductively defined types},
VOLUME = {417},
YEAR = {1990}
}
@PHDTHESIS{Coq85,
AUTHOR = {Th. Coquand},
MONTH = jan,
SCHOOL = {Universit\'e Paris~7},
TITLE = {Une Th\'eorie des Constructions},
YEAR = {1985}
}
@INPROCEEDINGS{Coq86,
AUTHOR = {Th. Coquand},
ADDRESS = {Cambridge, MA},
BOOKTITLE = {Symposium on Logic in Computer Science},
PUBLISHER = {IEEE Computer Society Press},
TITLE = {{An Analysis of Girard's Paradox}},
YEAR = {1986}
}
@INPROCEEDINGS{Coq90,
AUTHOR = {Th. Coquand},
BOOKTITLE = {Logic and Computer Science},
EDITOR = {P. Oddifredi},
NOTE = {INRIA Research Report 1088, also in~\cite{CoC89}},
PUBLISHER = {Academic Press},
TITLE = {{Metamathematical Investigations of a Calculus of Constructions}},
YEAR = {1990}
}
@INPROCEEDINGS{Coq92,
AUTHOR = {Th. Coquand},
BOOKTITLE = {in \cite{Bastad92}},
TITLE = {{Pattern Matching with Dependent Types}},
YEAR = {1992},
crossref = {Bastad92}
}
@TECHREPORT{COQ93,
AUTHOR = {G. Dowek and A. Felty and H. Herbelin and G. Huet and C. Murthy and C. Parent and C. Paulin-Mohring and B. Werner},
INSTITUTION = {INRIA},
MONTH = may,
NUMBER = {154},
TITLE = {{The Coq Proof Assistant User's Guide Version 5.8}},
YEAR = {1993}
}
@INPROCEEDINGS{Coquand93,
AUTHOR = {Th. Coquand},
BOOKTITLE = {in \cite{Nijmegen93}},
TITLE = {{Infinite Objects in Type Theory}},
YEAR = {1993},
crossref = {Nijmegen93}
}
@MASTERSTHESIS{Cou94a,
AUTHOR = {J. Courant},
MONTH = sep,
SCHOOL = {DEA d'Informatique, ENS Lyon},
TITLE = {Explicitation de preuves par r\'ecurrence implicite},
YEAR = {1994}
}
@TECHREPORT{CPar93,
AUTHOR = {C. Parent},
INSTITUTION = {Ecole {Normale} {Sup\'erieure} de {Lyon}},
MONTH = oct,
NOTE = {Also in~\cite{Nijmegen93}},
NUMBER = {93-29},
TITLE = {Developing certified programs in the system {Coq}- {The} {Program} tactic},
YEAR = {1993}
}
@PHDTHESIS{CPar95,
AUTHOR = {C. Parent},
SCHOOL = {Ecole {Normale} {Sup\'erieure} de {Lyon}},
TITLE = {{Synth\`ese de preuves de programmes dans le Calcul des Constructions Inductives}},
YEAR = {1995}
}
@TECHREPORT{Dow90,
AUTHOR = {G. Dowek},
INSTITUTION = {INRIA},
NUMBER = {1283},
TITLE = {{Naming and Scoping in a Mathematical Vernacular}},
TYPE = {Research Report},
YEAR = {1990}
}
@ARTICLE{Dow91a,
AUTHOR = {G. Dowek},
JOURNAL = {{Compte Rendu de l'Acad\'emie des Sciences}},
NOTE = {(The undecidability of Third Order Pattern Matching in Calculi with Dependent Types or Type Constructors)},
NUMBER = {12},
PAGES = {951--956},
TITLE = {{L'Ind\'ecidabilit\'e du Filtrage du Troisi\`eme Ordre dans les Calculs avec Types D\'ependants ou Constructeurs de Types}},
VOLUME = {I, 312},
YEAR = {1991}
}
@INPROCEEDINGS{Dow91b,
AUTHOR = {G. Dowek},
BOOKTITLE = {Proceedings of Mathematical Foundation of Computer Science},
NOTE = {Also INRIA Research Report},
PAGES = {151--160},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS},
TITLE = {{A Second Order Pattern Matching Algorithm in the Cube of Typed {$\lambda$}-calculi}},
VOLUME = {520},
YEAR = {1991}
}
@PHDTHESIS{Dow91c,
AUTHOR = {G. Dowek},
MONTH = dec,
SCHOOL = {{Universit\'e Paris 7}},
TITLE = {{D\'emonstration automatique dans le Calcul des Constructions}},
YEAR = {1991}
}
@ARTICLE{dowek93,
AUTHOR = {G. Dowek},
TITLE = {{A Complete Proof Synthesis Method for the Cube of Type Systems}},
JOURNAL = {Journal Logic Computation},
VOLUME = {3},
NUMBER = {3},
PAGES = {287--315},
MONTH = {June},
YEAR = {1993}
}
@UNPUBLISHED{Dow92a,
AUTHOR = {G. Dowek},
NOTE = {To appear in Theoretical Computer Science},
TITLE = {{The Undecidability of Pattern Matching in Calculi where Primitive Recursive Functions are Representable}},
YEAR = {1992}
}
@ARTICLE{Dow94a,
AUTHOR = {G. Dowek},
JOURNAL = {Annals of Pure and Applied Logic},
VOLUME = {69},
PAGES = {135--155},
TITLE = {Third order matching is decidable},
YEAR = {1994}
}
@INPROCEEDINGS{Dow94b,
AUTHOR = {G. Dowek},
BOOKTITLE = {Proceedings of the second international conference on typed lambda calculus and applications},
TITLE = {{Lambda-calculus, Combinators and the Comprehension Schema}},
YEAR = {1995}
}
@INPROCEEDINGS{Dyb91,
AUTHOR = {P. Dybjer},
BOOKTITLE = {Logical Frameworks},
EDITOR = {G. Huet and G. Plotkin},
PAGES = {59--79},
PUBLISHER = {Cambridge University Press},
TITLE = {{Inductive sets and families in {Martin-L{\"o}f's Type Theory} and their set-theoretic semantics : An inversion principle for {Martin-L\"of's} type theory}},
VOLUME = {14},
YEAR = {1991}
}
@ARTICLE{Dyc92,
AUTHOR = {Roy Dyckhoff},
JOURNAL = {The Journal of Symbolic Logic},
MONTH = sep,
NUMBER = {3},
TITLE = {Contraction-free sequent calculi for intuitionistic logic},
VOLUME = {57},
YEAR = {1992}
}
@MASTERSTHESIS{Fil94,
AUTHOR = {J.-C. Filli\^atre},
MONTH = sep,
SCHOOL = {DEA d'Informatique, ENS Lyon},
TITLE = {Une proc\'edure de d\'ecision pour le {C}alcul des {P}r\'edicats {D}irect. {E}tude et impl\'ementation dans le syst\`eme {C}oq},
YEAR = {1994}
}
@TECHREPORT{Filliatre95,
AUTHOR = {J.-C. Filli\^atre},
INSTITUTION = {LIP-ENS-Lyon},
TITLE = {{A decision procedure for Direct Predicate Calculus}},
TYPE = {Research report},
NUMBER = {96--25},
YEAR = {1995}
}
@UNPUBLISHED{Fle90,
AUTHOR = {E. Fleury},
MONTH = jul,
NOTE = {Rapport de Stage},
TITLE = {Implantation des algorithmes de {Floyd et de Dijkstra} dans le {Calcul des Constructions}},
YEAR = {1990}
}
@TechReport{Gim98,
author = {E. Gim\'nez},
title = {A Tutorial on Recursive Types in Coq},
institution = {INRIA},
year = {1998}
}
@TECHREPORT{HKP97,
author = {G. Huet and G. Kahn and Ch. Paulin-Mohring},
title = {The {Coq} Proof Assistant - A tutorial, Version 6.1},
institution = {INRIA},
type = {rapport technique},
month = {Aot},
year = {1997},
note = {Version rvise distribue avec {Coq}},
number = {204},
}
@INPROCEEDINGS{Gir70,
AUTHOR = {J.-Y. Girard},
BOOKTITLE = {Proceedings of the 2nd Scandinavian Logic Symposium},
PUBLISHER = {North-Holland},
TITLE = {Une extension de l'interpr\'etation de {G\"odel} \`a l'analyse, et son application \`a l'\'elimination des coupures dans l'analyse et la th\'eorie des types},
YEAR = {1970}
}
@PHDTHESIS{Gir72,
AUTHOR = {J.-Y. Girard},
SCHOOL = {Universit\'e Paris~7},
TITLE = {Interpr\'etation fonctionnelle et \'elimination des coupures de l'arithm\'etique d'ordre sup\'erieur},
YEAR = {1972}
}
@BOOK{Gir89,
AUTHOR = {J.-Y. Girard and Y. Lafont and P. Taylor},
PUBLISHER = {Cambridge University Press},
SERIES = {Cambridge Tracts in Theoretical Computer Science 7},
TITLE = {Proofs and Types},
YEAR = {1989}
}
@MASTERSTHESIS{Hir94,
AUTHOR = {D. Hirschkoff},
MONTH = sep,
SCHOOL = {DEA IARFA, Ecole des Ponts et Chauss\'ees, Paris},
TITLE = {{Ecriture d'une tactique arithm\'etique pour le syst\`eme Coq}},
YEAR = {1994}
}
@INCOLLECTION{How80,
AUTHOR = {W.A. Howard},
BOOKTITLE = {to H.B. Curry : Essays on Combinatory Logic, Lambda Calculus and Formalism.},
EDITOR = {J.P. Seldin and J.R. Hindley},
NOTE = {Unpublished 1969 Manuscript},
PUBLISHER = {Academic Press},
TITLE = {The Formulae-as-Types Notion of Constructions},
YEAR = {1980}
}
@INCOLLECTION{HuetLevy79,
AUTHOR = {G. Huet and J.-J. L\'{e}vy},
TITLE = {Call by Need Computations in Non-Ambigous
Linear Term Rewriting Systems},
NOTE = {Also research report 359, INRIA, 1979},
BOOKTITLE = {Computational Logic, Essays in Honor of
Alan Robinson},
EDITOR = {J.-L. Lassez and G. Plotkin},
PUBLISHER = {The MIT press},
YEAR = {1991}
}
@INPROCEEDINGS{Hue87,
AUTHOR = {G. Huet},
BOOKTITLE = {Programming of Future Generation Computers},
EDITOR = {K. Fuchi and M. Nivat},
NOTE = {Also in Proceedings of TAPSOFT87, LNCS 249, Springer-Verlag, 1987, pp 276--286},
PUBLISHER = {Elsevier Science},
TITLE = {Induction Principles Formalized in the {Calculus of Constructions}},
YEAR = {1988}
}
@INPROCEEDINGS{Hue88,
AUTHOR = {G. Huet},
BOOKTITLE = {A perspective in Theoretical Computer Science. Commemorative Volume for Gift Siromoney},
EDITOR = {R. Narasimhan},
NOTE = {Also in~\cite{CoC89}},
PUBLISHER = {World Scientific Publishing},
TITLE = {{The Constructive Engine}},
YEAR = {1989}
}
@BOOK{Hue89,
EDITOR = {G. Huet},
PUBLISHER = {Addison-Wesley},
SERIES = {The UT Year of Programming Series},
TITLE = {Logical Foundations of Functional Programming},
YEAR = {1989}
}
@INPROCEEDINGS{Hue92,
AUTHOR = {G. Huet},
BOOKTITLE = {Proceedings of 12th FST/TCS Conference, New Delhi},
PAGES = {229--240},
PUBLISHER = {Springer Verlag},
SERIES = {LNCS},
TITLE = {{The Gallina Specification Language : A case study}},
VOLUME = {652},
YEAR = {1992}
}
@ARTICLE{Hue94,
AUTHOR = {G. Huet},
JOURNAL = {J. Functional Programming},
PAGES = {371--394},
PUBLISHER = {Cambridge University Press},
TITLE = {Residual theory in $\lambda$-calculus: a formal development},
VOLUME = {4,3},
YEAR = {1994}
}
@ARTICLE{KeWe84,
AUTHOR = {J. Ketonen and R. Weyhrauch},
JOURNAL = {Theoretical Computer Science},
PAGES = {297--307},
TITLE = {A decidable fragment of {P}redicate {C}alculus},
VOLUME = {32},
YEAR = {1984}
}
@BOOK{Kle52,
AUTHOR = {S.C. Kleene},
PUBLISHER = {North-Holland},
SERIES = {Bibliotheca Mathematica},
TITLE = {Introduction to Metamathematics},
YEAR = {1952}
}
@BOOK{Kri90,
AUTHOR = {J.-L. Krivine},
PUBLISHER = {Masson},
SERIES = {Etudes et recherche en informatique},
TITLE = {Lambda-calcul {types et mod\`eles}},
YEAR = {1990}
}
@ARTICLE{Laville91,
AUTHOR = {A. Laville},
TITLE = {Comparison of Priority Rules in Pattern
Matching and Term Rewriting},
JOURNAL = {Journal of Symbolic Computation},
VOLUME = {11},
PAGES = {321--347},
YEAR = {1991}
}
@BOOK{LE92,
EDITOR = {G. Huet and G. Plotkin},
PUBLISHER = {Cambridge University Press},
TITLE = {Logical Environments},
YEAR = {1992}
}
@INPROCEEDINGS{LePa94,
AUTHOR = {F. Leclerc and C. Paulin-Mohring},
BOOKTITLE = {{Types for Proofs and Programs, Types' 93}},
EDITOR = {H. Barendregt and T. Nipkow},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS},
TITLE = {{Programming with Streams in Coq. A case study : The Sieve of Eratosthenes}},
VOLUME = {806},
YEAR = {1994}
}
@BOOK{LF91,
EDITOR = {G. Huet and G. Plotkin},
PUBLISHER = {Cambridge University Press},
TITLE = {Logical Frameworks},
YEAR = {1991}
}
@BOOK{MaL84,
AUTHOR = {{P. Martin-L\"of}},
PUBLISHER = {Bibliopolis},
SERIES = {Studies in Proof Theory},
TITLE = {Intuitionistic Type Theory},
YEAR = {1984}
}
@INPROCEEDINGS{manoury94,
AUTHOR = {P. Manoury},
TITLE = {{A User's Friendly Syntax to Define
Recursive Functions as Typed $\lambda-$Terms}},
BOOKTITLE = {{Types for Proofs and Programs, TYPES'94}},
SERIES = {LNCS},
VOLUME = {996},
MONTH = jun,
YEAR = {1994}
}
@ARTICLE{MaSi94,
AUTHOR = {P. Manoury and M. Simonot},
JOURNAL = {TCS},
TITLE = {Automatizing termination proof of recursively defined function},
YEAR = {To appear}
}
@TECHREPORT{maranget94,
AUTHOR = {L. Maranget},
INSTITUTION = {INRIA},
NUMBER = {2385},
TITLE = {{Two Techniques for Compiling Lazy Pattern Matching}},
YEAR = {1994}
}
@INPROCEEDINGS{Moh89a,
AUTHOR = {C. Paulin-Mohring},
ADDRESS = {Austin},
BOOKTITLE = {Sixteenth Annual ACM Symposium on Principles of Programming Languages},
MONTH = jan,
PUBLISHER = {ACM},
TITLE = {Extracting ${F}_{\omega}$'s programs from proofs in the {Calculus of Constructions}},
YEAR = {1989}
}
@PHDTHESIS{Moh89b,
AUTHOR = {C. Paulin-Mohring},
MONTH = jan,
SCHOOL = {{Universit\'e Paris 7}},
TITLE = {Extraction de programmes dans le {Calcul des Constructions}},
YEAR = {1989}
}
@INPROCEEDINGS{Moh93,
AUTHOR = {C. Paulin-Mohring},
BOOKTITLE = {Proceedings of the conference Typed Lambda Calculi and Applications},
EDITOR = {M. Bezem and J.-F. Groote},
NOTE = {Also LIP research report 92-49, ENS Lyon},
NUMBER = {664},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS},
TITLE = {{Inductive Definitions in the System Coq - Rules and Properties}},
YEAR = {1993}
}
@MASTERSTHESIS{Mun94,
AUTHOR = {C. Mu\~noz},
MONTH = sep,
SCHOOL = {DEA d'Informatique Fondamentale, Universit\'e Paris 7},
TITLE = {D\'emonstration automatique dans la logique propositionnelle intuitionniste},
YEAR = {1994}
}
@BOOK{Nijmegen93,
EDITOR = {H. Barendregt and T. Nipkow},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS},
TITLE = {Types for Proofs and Programs},
VOLUME = {806},
YEAR = {1994}
}
@BOOK{NoPS90,
AUTHOR = {B. {Nordstr\"om} and K. Peterson and J. Smith},
BOOKTITLE = {Information Processing 83},
PUBLISHER = {Oxford Science Publications},
SERIES = {International Series of Monographs on Computer Science},
TITLE = {Programming in {Martin-L\"of's} Type Theory},
YEAR = {1990}
}
@ARTICLE{Nor88,
AUTHOR = {B. {Nordstr\"om}},
JOURNAL = {BIT},
TITLE = {Terminating General Recursion},
VOLUME = {28},
YEAR = {1988}
}
@BOOK{Odi90,
EDITOR = {P. Odifreddi},
PUBLISHER = {Academic Press},
TITLE = {Logic and Computer Science},
YEAR = {1990}
}
@INPROCEEDINGS{PaMS92,
AUTHOR = {M. Parigot and P. Manoury and M. Simonot},
ADDRESS = {St. Petersburg, Russia},
BOOKTITLE = {Logic Programming and automated reasoning},
EDITOR = {A. Voronkov},
MONTH = jul,
NUMBER = {624},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS},
TITLE = {{ProPre : A Programming language with proofs}},
YEAR = {1992}
}
@ARTICLE{Par92,
AUTHOR = {M. Parigot},
JOURNAL = {Theoretical Computer Science},
NUMBER = {2},
PAGES = {335--356},
TITLE = {{Recursive Programming with Proofs}},
VOLUME = {94},
YEAR = {1992}
}
@INPROCEEDINGS{Parent95b,
AUTHOR = {C. Parent},
BOOKTITLE = {{Mathematics of Program Construction'95}},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS},
TITLE = {{Synthesizing proofs from programs in
the Calculus of Inductive Constructions}},
VOLUME = {947},
YEAR = {1995}
}
@ARTICLE{PaWe92,
AUTHOR = {C. Paulin-Mohring and B. Werner},
JOURNAL = {Journal of Symbolic Computation},
PAGES = {607--640},
TITLE = {{Synthesis of ML programs in the system Coq}},
VOLUME = {15},
YEAR = {1993}
}
@INPROCEEDINGS{Prasad93,
AUTHOR = {K.V. Prasad},
BOOKTITLE = {{Proceedings of CONCUR'93}},
PUBLISHER = {Springer-Verlag},
SERIES = {LNCS},
TITLE = {{Programming with broadcasts}},
VOLUME = {715},
YEAR = {1993}
}
@INPROCEEDINGS{puel-suarez90,
AUTHOR = {L.Puel and A. Su\'arez},
BOOKTITLE = {{Conference Lisp and Functional Programming}},
SERIES = {ACM},
PUBLISHER = {Springer-Verlag},
TITLE = {{Compiling Pattern Matching by Term
Decomposition}},
YEAR = {1990}
}
@UNPUBLISHED{Rou92,
AUTHOR = {J. Rouyer},
MONTH = aug,
NOTE = {To appear as a technical report},
TITLE = {{D\'eveloppement de l'Algorithme d'Unification dans le Calcul des Constructions}},
YEAR = {1992}
}
@TECHREPORT{Saibi94,
AUTHOR = {A. Sa\"{\i}bi},
INSTITUTION = {INRIA},
MONTH = dec,
NUMBER = {2345},
TITLE = {{Axiomatization of a lambda-calculus with explicit-substitutions in the Coq System}},
YEAR = {1994}
}
@MASTERSTHESIS{saidi94,
AUTHOR = {H. Saidi},
MONTH = sep,
SCHOOL = {DEA d'Informatique Fondamentale, Universit\'e Paris 7},
TITLE = {R\'esolution d'\'equations dans le syst\`eme T
de G\"odel},
YEAR = {1994}
}
@MASTERSTHESIS{Ter92,
AUTHOR = {D. Terrasse},
MONTH = sep,
SCHOOL = {IARFA},
TITLE = {{Traduction de TYPOL en COQ. Application \`a Mini ML}},
YEAR = {1992}
}
@TECHREPORT{ThBeKa92,
AUTHOR = {L. Th\'ery and Y. Bertot and G. Kahn},
INSTITUTION = {INRIA Sophia},
MONTH = may,
NUMBER = {1684},
TITLE = {Real theorem provers deserve real user-interfaces},
TYPE = {Research Report},
YEAR = {1992}
}
@BOOK{TrDa89,
AUTHOR = {A.S. Troelstra and D. van Dalen},
PUBLISHER = {North-Holland},
SERIES = {Studies in Logic and the foundations of Mathematics, volumes 121 and 123},
TITLE = {Constructivism in Mathematics, an introduction},
YEAR = {1988}
}
@INCOLLECTION{wadler87,
AUTHOR = {P. Wadler},
TITLE = {Efficient Compilation of Pattern Matching},
BOOKTITLE = {The Implementation of Functional Programming
Languages},
EDITOR = {S.L. Peyton Jones},
PUBLISHER = {Prentice-Hall},
YEAR = {1987}
}
@PHDTHESIS{Wer94,
AUTHOR = {B. Werner},
SCHOOL = {Universit\'e Paris 7},
TITLE = {Une th\'eorie des constructions inductives},
TYPE = {Th\`ese de Doctorat},
YEAR = {1994}
}
|