O(1) Reversible Tree Navigation Without Cycles

Details O(1) Reversible Tree Navigation Without Cycles O(1) Reversible Tree Navigation Without Cycles

2004-06-07

arxiv.org/abs/cs/0406014v1

Theory and Practice of Logic Programming, vol. 1, no. 5, 2001

Computer Science

Programming Languages

Appeared in Theory and Practice of Logic Programming, vol. 1, no. 5, 2001

Scientific paper

Imperative 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.

Affiliated with

Also associated with

No associations

Rating

O(1) Reversible Tree Navigation Without Cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with O(1) Reversible Tree Navigation Without Cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and O(1) Reversible Tree Navigation Without Cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-594576