Verification of the Interface of a Small Proof System in Coq

@inproceedings{Barras1996VerificationOT,
  title={Verification of the Interface of a Small Proof System in Coq},
  author={Bruno Barras},
  booktitle={TYPES},
  year={1996}
}
1 I n t r o d u c t i o n Our ult imate goal is to verify a whole proof system. This would improve the reliability of the tool, but it would also be a good benchmark for the methodology of formally certified software design Coq [4] recommends. Applying this to the proof system itself would eventually lead to a bootstrapped version of Coq. One of the major contributions of the LCF system [12], is that it implements a reliable proof-checker with a very small par t of critical code: the kernel… CONTINUE READING
6 Citations
17 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Th4ry, L.: Extracting text from proofs

  • Y. Coscoy, G. Khan
  • INRIA Research Report
  • 1995
1 Excerpt

A Proof Checker for the Extended Calculus of Constructions

  • R. Pollack
  • 1994
3 Excerpts

Towards Checking Proof-Checkers

  • R. S. Boyer, G. Dowek
  • Informal Proceedings of the Nijmegen Workshop on…
  • 1993
1 Excerpt

Lambda CMcuh with Types

  • H. Barendregt
  • In Handbook of Logic in Computer Science,
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…