摘要: We present a higher-order term indexing strategy based on substitution trees. The is in linear patterns where computationally expensive parts are delayed. Insertion of terms into the index computing most specific generalization two patterns. Retrieving matching This structure implemented as part Twelf system to speed-up execution tabled higher-logic programming interpreter. Experimental results show substantial performance improvements, between 100% and over 800%.