论文信息 - The Rational Tree Machine

The Rational Tree Machine

The Rational Tree Machine (RTM) is a type of graph reduction architecture, for the processing of logic programs, currently under development at Boeing's High Technology Center. The architecture is composed of three types of functional modules: tree memory, automata constructor, and automata simulation modules. A previous paper described the overall architecture and its functionality. This paper will concentrate on a detailed description of the automata constructor.

Wolf Kohn | Jean Debrohun Butler | Robert V. Graham

[1] Alain Colmerauer,et al. Equations and Inequations on Finite and Infinite Trees , 1984, FGCS.

[2] Alain Colmerauer,et al. Opening the Prolog III universe , 1987 .

[3] Leon Sterling,et al. The Art of Prolog - Advanced Programming Techniques , 1986 .

[4] Stuart M. Shieber,et al. An Introduction to Unification-Based Approaches to Grammar , 1986, CSLI Lecture Notes.

[5] Stanley Burris,et al. A course in universal algebra , 1981, Graduate texts in mathematics.

[6] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[7] Keith L. Clark,et al. Notes on System Programming in Parlog , 1984, FGCS.

[8] Ehud Shapiro,et al. Concurrent Prolog: A Progress Report , 1985, Computer.

[9] George Gratzer,et al. Universal Algebra , 1979 .