A Type-Theoretic Approach to Resolution

We propose a new type-theoretic approach to SLD-resolution and Horn-clause logic programming. It views Horn formulas as types, and derivations for a given query as a construction of the inhabitant (a proofterm) for the type given by the query. We propose a method of program transformation that allows to transform logic programs in such a way that proof… CONTINUE READING