RICHARD, M. Axel (2025) Library for term-graphs rewrites and equality saturation PRE - Projet de recherche, ENSTA.

Fichier(s) associé(s) à ce document :

[img]
Prévisualisation
PDF
311Kb

Résumé

When dealing with automatically generated formulas, the need for simplification arises quickly. Because this problem is not specific to the program generating these formulas, a more general tool is needed. Furthermore, having a tool that automatically generates the code that applies simplification makes adding simplification rules a lot easier, and allows for easier experimentation on the technique used to apply these simplifications. Here we focus on rewriting terms by following a bottom-up strategy, using a simplified version of e-graphs ([Nel80], [Wil+21]). This allows us to represent a term and its rewrite at the same time, to enable the use of equality saturation ([Tat+09]).

Type de document:Rapport ou mémoire (PRE - Projet de recherche)
Mots-clés libres:Term rewriting, Equality saturation, E-graph (equivalence graph), Bottom-up strategy, Hash consing
Sujets:Sciences et technologies de l'information et de la communication
Code ID :10547
Déposé par :Axel RICHARD
Déposé le :20 août 2025 11:52
Dernière modification:20 août 2025 11:52

Modifier les métadonnées de ce document.