A Complete Proof Synthesis Method for the Cube of Type Systems
Logic in Computer Science
2023-06-12 v1
Abstract
We present a complete proof synthesis method for the eight type systems of Barendregt's cube extended with -conversion. Because these systems verify the proofs-as-objects paradigm, the proof synthesis method is a one level process merging unification and resolution. Then we present a variant of this method, which is incomplete but much more efficient. At last we show how to turn this algorithm into a unification algorithm.
Keywords
Cite
@article{arxiv.2306.05835,
title = {A Complete Proof Synthesis Method for the Cube of Type Systems},
author = {Gilles Dowek},
journal= {arXiv preprint arXiv:2306.05835},
year = {2023}
}