A new DSL for AI graph rewriting is given a formal, Coq-verified core semantics that matches an idealized backtracking interpreter.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Pattern Matching in AI Compilers and its Formalization (Extended Version)
A new DSL for AI graph rewriting is given a formal, Coq-verified core semantics that matches an idealized backtracking interpreter.