PLDI 2026 (series) / EGRAPHS 2026 (series) / EGRAPHS /
Lifting E-Graphs: A Function Isn’t a Constant
Mon 15 Jun 2026 09:23 - 09:46 at Meadows CD - Session 1
Variables are quite subtle and easy to get wrong. This talk presents an approach to dealing with the α equivalence problem in e-graphs using a baked in notion of functional lifting combinators inspired by slotted e- graphs and Co-de Bruijn syntax. Work is ongoing implementing and understanding the semantic issues in the approach.
| slides (thin_talk.pdf) | 914KiB |
Tinkerer. Lover of solvers. Blogger. Cool dude.
Mon 15 JunDisplayed time zone: Mountain Time (US & Canada) change
Mon 15 Jun
Displayed time zone: Mountain Time (US & Canada) change
09:00 - 10:10 | |||
09:00 23mTalk | From Rewriting to Fixpoints: Solving Recursive Equations with E-Graphs EGRAPHS Samuel Coward University College London (UCL), Cheng Zhang Worcester Polytechnic Institute, Philip Zucker Draper, Alexandra Silva Cornell University | ||
09:23 23mTalk | Lifting E-Graphs: A Function Isn’t a Constant EGRAPHS Philip Zucker Draper Pre-print File Attached | ||
09:46 23mTalk | Predicate E-Graphs with Symbolic Conditional RewritingRemote EGRAPHS Anders Ågren Thuné Uppsala University, Johannes Borgström Uppsala University, Sweden, Lars-Henrik Eriksson Uppsala University, John Högberg Ericsson, Tjark Weber Uppsala University, Tobias Wrigstad Uppsala University File Attached | ||
