Shared Terms and Cached Rewriting

16 pages•Published: April 6, 2025

Abstract

We describe the implementation of first-order terms, the central data structure of most modern automated theorem provers, as perfectly shared immutable term DAGs in E. We demonstrate typical gains possible with this structure (reducing the number of term nodes typically by orders of magnitude) and discuss some of the side benefits of such a representation. One of these benefits is the ability to easily implement cached rewriting, improving the performance of rewriting-based simplification. We discuss lessons learned and some potential future work.

Keyphrases: data structures, first order logic, implementation of logics, terms

In: Konstantin Korovin, Stephan Schulz and Michael Rawson (editors). Proceedings of the 14th and 15th International Workshops on the Implementation of Logics, vol 21, pages 18-33.

Links:	https://easychair.org/publications/paper/PF9F
	https://doi.org/10.29007/4vf1

BibTeX entry

@inproceedings{IWIL-2024:Shared_Terms_Cached_Rewriting,
  author    = {Stephan Schulz},
  title     = {Shared Terms and Cached Rewriting},
  booktitle = {Proceedings of the 14th and 15th International Workshops on the Implementation of Logics},
  editor    = {Konstantin Korovin and Stephan Schulz and Michael Rawson},
  series    = {Kalpa Publications in Computing},
  volume    = {21},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/PF9F},
  doi       = {10.29007/4vf1},
  pages     = {18-33},
  year      = {2025}}

Download PDF Open PDF in browser