Computer Science – Data Structures and Algorithms
Scientific paper
2004-03-16
Computer Science
Data Structures and Algorithms
LaTeX2e, 13 pages, 2 tables, 11 figures (several of them, text). Yet unpublished
Scientific paper
We describe here a simple application of rational trees to the implementation of an interpreter for a procedural language written in a logic programming language. This is possible in languages designed to support rational trees (such as Prolog II and its descendants), but also in traditional Prolog, whose data structures are initially based on Herbrand terms, but in which implementations often omit the occurs check needed to avoid the creation of infinite data structures. We provide code implementing two interpreters, one of which needs non-occurs-check unification, which makes it faster (and more economic). We provide experimental data supporting this, and we argue that rational trees are interesting enough as to receive thorough support inside the language.
No associations
LandOfFree
An Application of Rational Trees in a Logic Programming Interpreter for a Procedural Language 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 An Application of Rational Trees in a Logic Programming Interpreter for a Procedural Language, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Application of Rational Trees in a Logic Programming Interpreter for a Procedural Language will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-574244