Tabling for Higher-Order Logic Programming

We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-computation and re-using its result later. In particular, we focus on the table design and table access in the higher-order setting where many common operations are undecidable in general. To achieve a space and time efficient implementation, we rely on substitution factoring and higher-order substitution tree indexing. Experimental results from a wide range of examples (propositional theorem proving, parsing, refinement type checking, small-step evaluator) demonstrate that higher-order tabled logic programming yields a more robust and more efficient proof procedure.

• Type: Conference
• Year: 2005
• Where: CADE
• Authors: Brigitte Pientka
• Keywords: Automated Reasoning, CADE 2005, Efficient Proof Procedure, Substitution Tree Indexing, Tabled Logic Programming