Onterminationof meta-programs: 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 03:1803:18, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,680 bytes −580‎ No edit summary undo
  • curprev 03:1703:17, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,260 bytes +2,260‎ Created page with "Title: Onterminationof meta-programs Research Question: How can we develop a methodology for performing correct termination analysis for a broad class of practical meta-interpreters? Methodology: The methodology is based on combining the power of general orderings, used in proving termination of term-rewrite systems and programs, and the well-known acceptability condition, used in proving termination of logic programs. This approach allows for the reuse of termination..."
Retrieved from "https://simplesci.org/wiki/Onterminationof_meta-programs"