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 proof-term) 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 evidence is computed alongside SLD-derivations. We discuss two applications of this approach: in recently proposed productivity theory of structural resolution, and in type class inference.
CITATION STYLE
Fu, P., & Komendantskaya, E. (2015). A type-theoretic approach to resolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9527, pp. 91–106). Springer Verlag. https://doi.org/10.1007/978-3-319-27436-2_6
Mendeley helps you to discover research relevant for your work.