Relational Interpreteres, Conversion, and Synthesis
summary
Describes turning verifiers into solvers by program inversion so relational systems can synthesize programs from specifications without bespoke encodings. Shows a pipeline that converts functional verifiers into relational form via relational conversion, removes manual relational encoding, and runs on existing miniKanren-style implementations. Claims this expands the class of synthesizable problems, reduces specification-debug cycles, and demonstrates working examples where inversion finds programs that satisfy given verifiers. turning verifiers into solvers
AI-written summary · about
