Parsing and compiling using Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Unification of infinite sets of terms schematized by primal grammars
Theoretical Computer Science
Solving Disequations Modulo Some Class of Rewrite Systems
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
| Hi-index | 0.00 |
Tree languages have been extensively studied and have many applications related to the rewriting framework such as order sorted speci fications, higher order matching or unification. In this paper, we focus on the implementation of such languages and, inspired by the Definite Clause Grammars that allows to write word grammars as Horn clauses in a Prolog environment, we propose to build a similar framework for particular tree languages (TTSG) which introduces a notion of synchronization between production rules. Our main idea is to define a proof theoretical semantics for grammars and thus to change from syntactical tree manipulations to logical deduction. This is achieved by a sequent calculus proof system which can be refined and translated into Prolog Horn clauses. This work provides a scheme to build goal directed procedures for the recognition of tree languages.