Chain Programs for Writing: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 02:1302:13, 24 December 2023SatoshiNakamoto talk contribs 1,359 bytes +1,359 Created page with "Title: Chain Programs for Writing Research Question: How can deterministic metainterpreters be written more efficiently? Methodology: The authors propose a technique called "chain form" for converting logic programs into a form that is easier to reason about. This form allows the programmer to focus on the unification of clauses, simplifying the design of deterministic metainterpreters. Two transformations are presented for converting logic programs into chain form: on..."