Focusing the Inverse Method for LF: A Preliminary Report

Authors:
Brigitte Pientka;Xi Li;Florent Pompigne
Affiliations:
School of Computer Science, McGill University, Montreal, Canada;School of Computer Science, McGill University, Montreal, Canada;ENS Cachan, 94235 Cachan cedex, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 9
Cited 0

Natural deduction as higher-order resolution

Journal of Logic Programming
Magic templates: a spellbinding approach to logic programs

Journal of Logic Programming
A framework for defining logics

Journal of the ACM (JACM)
Types and programming languages

Types and programming languages
A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Tabled higher-order logic programming

Tabled higher-order logic programming
Contextual modal type theory

ACM Transactions on Computational Logic (TOCL)
Mechanized metatheory for the masses: the PoplMark challenge

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Tabling for higher-order logic programming

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe a proof-theoretic foundation for bottom-up logic programming based on uniform proofs in the setting of the logical framework LF. We present a forward uniform proofs calculus which is a suitable foundation for the inverse method for LF and prove its correctness. We also present some preliminary results of an implementation for the Horn Fragment as part of the logical framework Twelf, and compare its performance with the tabled logic programming engine.