~/talk

Relational Interpreteres, Conversion, and Synthesis

Talkat miniKanren 2022 · on Thursday, 2022-09-15
links:none on file
slides:none on file

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

  1. 0:00Introduction
  2. 3:19Semantic issues in current approaches
  3. 10:00Relational interpreters concept
  4. 15:28Advantages of new approach
  5. 22:10Practical applications and transformations
  6. 32:46Relational systems links and channels
  7. 41:34Conflict resolution and conclusions
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.