egg: Fast and extensible equality saturation

An e-graph efficiently represents a congruence relation over many expressions. Although they were originally developed in the late 1970s for use in automated theorem provers, a more recent technique known as equality saturation repurposes e-graphs to implement state-of-the-art, rewrite-driven compil...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of ACM on programming languages Ročník 5; číslo POPL; s. 1 - 29
Hlavní autori:	Willsey, Max, Nandi, Chandrakana, Wang, Yisu Remy, Flatt, Oliver, Tatlock, Zachary, Panchekha, Pavel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	01.01.2021
ISSN:	2475-1421, 2475-1421
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!