A Complete Proof Synthesis Method for the Cube of Type Systems
- 1 June 1993
- journal article
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 3 (3) , 287-315
- https://doi.org/10.1093/logcom/3.3.287
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. Finally we show how to turn this algorithm into a unification algorithm.Keywords
All Related Versions
This publication has 0 references indexed in Scilit: