Interpreter for a Procedural Language: 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 15:3515:35, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,301 bytes +2,301‎ Created page with "Title: Interpreter for a Procedural Language Abstract: This research explores the application of rational trees in creating an interpreter for a procedural language. The study investigates the use of rational trees in logic programming languages that naturally support them, as well as in traditional Prolog, which typically does not perform occurs check. The research presents two interpreters, one that requires non-occurs-check unification, and another that is faster and..."
Retrieved from "https://simplesci.org/wiki/Interpreter_for_a_Procedural_Language"