Towards pre-indexed terms
José Francisco Morales Caballero, Manuel V. Hermenegildo · 2012
Indexing of terms and clauses is a well-known technique used in Prolog implementations (as well as automated theorem provers) to speed up search. In this paper we show how the same mechanism can be used to implement ecient reversible mappings between dierent term representations, which we call pre-indexings. Based on user-provided term descriptions, these mappings allow us to use more ecient data encodings internally, such as prex trees. We show that for some classes of programs, we can drastically improve the eciency by applying such mappings at selected program points.