O(1) Reversible Tree Navigation Without Cycles

Simple item page
dc.creatorO'Keefe, Richard A.
dc.date2004-06-07
dc.date.accessioned2026-07-07T03:21:25Z
dc.date.available2026-07-07T03:21:25Z
dc.descriptionImperative programmers often use cyclically linked trees in order to achieve O(1) navigation time to neighbours. Some logic programmers believe that cyclic terms are necessary to achieve the same in logic-based languages. An old but little-known technique provides O(1) time and space navigation without cyclic links, in the form of reversible predicates. A small modification provides O(1) amortised time and space editing.
dc.descriptionAppeared in Theory and Practice of Logic Programming, vol. 1, no. 5, 2001
dc.identifierhttps://arxiv.org/abs/cs/0406014
dc.identifierhttp://arxiv.org/abs/cs/0406014
dc.identifierTheory and Practice of Logic Programming, vol. 1, no. 5, 2001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32189
dc.subjectProgramming Languages
dc.subjectD.1.6; D.3.2
dc.titleO(1) Reversible Tree Navigation Without Cycles
dc.typetext

Files

Collections

arXiv