English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Automated Proof Construction in Type Theory Using Resolution

MPS-Authors
/persons/resource/persons44298

de Nivelle,  Hans
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

de Nivelle, H., Bezem, M., & Hendriks, D. (2000). Automated Proof Construction in Type Theory Using Resolution. In D. McAllester (Ed.), Proceedings of the 17th International Conference on Automated Deduction (CADE-17) (pp. 148-163). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3414-8
Abstract
We provide techniques to integrate resolution logic with equality into type theory. The results may be rendered as follows: - A clausification procedure in type theory, equipped with a correctness proof, all encoded using higher-order primitive recursion. - A novel representation of clauses in minimal logic such that the lambda-representation of resolution proofs is linear in the size of the premises. - A translation of resolution proofs into lambda terms, yielding a verification procedure for those proofs - The prower of resolution theorem provers becomes available in interactive proof construction systems based on type theory.