First-Order Unification on Compressed Terms

Adrià Gascón, Sebastian Maneth & Lander Ramos
Singleton Tree Grammars (STGs) have recently drawn considerable attention. They generalize the sharing of subtrees known from DAGs to sharing of connected subgraphs. This allows to obtain smaller in-memory representations of trees than with DAGs. In the past years some important tree algorithms were proved to perform efficiently (without decompression) over STGs; e.g., type checking, equivalence checking, and unification. We present a tool that implements an extension of the unification algorithm for STGs. This algorithm...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.