[EGRAPHS24] Automated Proof Generation for Associative and Distributive Rewriting with E-Graphs
Автор: ACM SIGPLAN
Загружено: 2024-07-23
Просмотров: 102
Описание:
Automated Proof Generation for Associative and Distributive Rewriting with E-Graphs (Video, EGRAPHS 2024)
Adrian Lehmann, Ben Caldwell, John Reppy, and Robert Rand
(University of Chicago; University of Chicago; University of Chicago, USA; University of Chicago)
Abstract: We present a strategy for encoding a dependently-typed inductive language originally designed for a proof assistant within e-graphs. This language necessitates automated reasoning about distributivity and associativity. We encode our domain-specific language into egglog. Since egglog currently lacks proof extraction, we discuss strategies for building proof trees within egglog and approaches to implementing proof extraction in Metatheory.jl. Once extraction exists, we plan on interfacing with Coq to automate proof generation and checking. Having such a tool would drastically reduce the overhead in using our Coq library and enable reasoning about distributive and associative structures more broadly.
Presentation at the EGRAPHS 2024 workshop, June 24, 2024, https://pldi24.sigplan.org/home/EGRAP...
Sponsored by ACM SIGPLAN,
Повторяем попытку...
![[EGRAPHS24] Automated Proof Generation for Associative and Distributive Rewriting with E-Graphs](https://imager.clipsaver.ru/9-clwZD2SWY/max.jpg)
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
![[EGRAPHS24] SpEQ: Translation of Sparse Codes using Equivalences](https://image.4k-video.ru/id-video/a9BNIBTIgC8)
![[EGRAPHS24] Disequalities in E-Graphs: An Experiment](https://image.4k-video.ru/id-video/JDD7ol7rUBQ)
![[EGRAPHS24] E-graphs and Automated Reasoning: Looking back to look forward](https://image.4k-video.ru/id-video/XW8yl7OGNwk)
![[EGRAPHS24] SpEQ: Translation of Sparse Codes using Equivalences](https://image.4k-video.ru/id-video/9R7wloIKO_8)