Author:
Magaud Nicolas,Bertot Yves
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Penny Anderson. Representing proof transformations for program optimization. In International Conference on Automated Deduction, LNAI 814, Springer-Verlag, 1994.
2. Antonia Balaa and Yves Bertot. Fix-point equations for well-founded recursion in type theory. In Harrison and Aagaard [9], pages 1–16.
3. B. Barras, S. Boutin, C. Cornes, J. Courant, J.C. Filliâtre, E. Giménez, H. Herbelin, G. Huet, C. Muñoz, C. Murthy, C. Parent, C. Paulin, A. Saϊbi, and B. Werner. The Coq Proof Assistant Reference Manual-Version V6.1. Technical Report 0203, INRIA, August 1997. revised version distributed with Coq.
4. Lect Notes Comput Sci;S. Boutin,1997
5. Yann Coscoy. A natural language explanation for formal proofs. In Christian Rétoré, editor, Logical Aspects of Computational Linguistics, LNAI 1328, Springer-Verlag, 1996.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Adapting proof automation to adapt proofs;Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018;2018
2. Inductive Families Need Not Store Their Indices;Lecture Notes in Computer Science;2004
3. Theorem Reuse by Proof Term Transformation;Lecture Notes in Computer Science;2004
4. Changing Data Representation within the Coq System;Lecture Notes in Computer Science;2003