Programming Pearl: An Open-Ended Tree for Logic Programming: 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:0315:03, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,056 bytes +2,056‎ Created page with "Title: Programming Pearl: An Open-Ended Tree for Logic Programming Abstract: This programming pearl introduces an open-ended tree, a data structure used in logic programming. It is an alternative to open-ended lists, which have a linear time complexity for updates and accesses. The open-ended tree offers a logarithmic time complexity for both updates and accesses, making it more efficient for applications with many application variables that change over time. Main Rese..."
Retrieved from "https://simplesci.org/wiki/Programming_Pearl:_An_Open-Ended_Tree_for_Logic_Programming"