Skip to main content
Springer Nature Link
Log in

On Implementation of Tree Synchronized Languages

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1631))

Included in the following conference series:

  • 238 Accesses

Abstract

Tree languages have been extensively studied and have many applications related to the rewriting framework such as order sorted specifications, 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. P. Brisset. Compilation de λ Prolog. PhD thesis, Thèse de doctorat de l’université de Rennes, 1992.

    Google Scholar 

  2. J. Cohen and T.J. Hickey. Parsing and compiling using prolog. ACM Transactions on Programming Languages and Systems, 9(2):125–163, 1987.

    Article  Google Scholar 

  3. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. 1997.

    Google Scholar 

  4. J.-Y. Girard. Linear logic, its syntax and semantics. In Regnier Girard, Lafont, editor, Advances in Linear Logic, number 222 in London Mathematical Society Lecture Notes Series, pages 355–419. Cambridge University Press, 1993.

    Google Scholar 

  5. Jean-Yves Girard. Linear Logic. Theoretical Computer Science, (50):1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. De Groote and G. Perrier. A Note on Kobayashi’s and Yonezawa’s “Asynchronous Communication Model Based on Linear Logic”. Formal Aspects of Computing, 10, 1998.

    Google Scholar 

  7. Y. Guan, G. Hotz, and A. Reichert. Tree Grammars with Multilinear Interpretation. Technical Report FB14-S2-01, 1992.

    Google Scholar 

  8. M. Hermann and R. Galbavy. Unification of infinite sets of terms schematized by primal grammars. Theoretical Computer Science, 176, 1997.

    Google Scholar 

  9. J. S. Hodas and D. Miller. Logic Programming in a Fragment of Intuitionistic Linear Logic. In Proceedings of LICS’91, pages 32–42, 1991.

    Google Scholar 

  10. S. Limet and P. Réty. E-Unification by Means of Tree Tuple Synchronized Grammars. Discrete Mathematics and Theoretical Computer Science, 1:69–98, 1997.

    MATH  MathSciNet  Google Scholar 

  11. S. Limet and P. Réty. Solving Disequations modulo some Class of Rewrite System. In T. Nipkow, editor, Proceedings of 9th Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 121–135. Springer Verlag, 1998.

    Chapter  Google Scholar 

  12. S. Limet and F. Saubion. Primal Grammars for R-unification. In PLILP/ALP’98, number 1490 in LNCS. Springer-Verlag, 1998.

    Google Scholar 

  13. J.W. Lloyd. Foundations of Logic Programming. Symbolic Computation series. Springer Verlag, 1987.

    Google Scholar 

  14. Dale Miller. A Multiple-Conclusion Meta-Logic. In LICS 1994, pages 272–281, 1994.

    Google Scholar 

  15. G. Plotkin. Building-in equational theories. Machine Intelligence, 7:73–90, 1972.

    MathSciNet  MATH  Google Scholar 

  16. F. Saubion and I. Stephan. Grammaires TTSG et Système FG. Technical report, 1998. Available at http://www.info.univangers. fr/pub/saubion/Research/Download.html.

  17. I. Stéphan. Nouvelles fondations pour la programmation en logique disjonctive. PhD thesis, Thèse de doctorat de l’université de Rennes, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LERIA, Université d’Angers, 2 Bd Lavoisier, F-49045, Angers Cedex, 01

    Frédéric Saubion & Igor Stéphan

Authors
  1. Frédéric Saubion
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor Stéphan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University at Albany — SUNY, Albany, NY, 12222, USA

    Paliath Narendran

  2. LORIA — INRIA Lorraine 615, rue du Jardin Botanique, F-54602, Villers les Nancy, Cedex, France

    Michael Rusinowitch

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saubion, F., Stéphan, I. (1999). On Implementation of Tree Synchronized Languages. In: Narendran, P., Rusinowitch, M. (eds) Rewriting Techniques and Applications. RTA 1999. Lecture Notes in Computer Science, vol 1631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48685-2_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-48685-2_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66201-3

  • Online ISBN: 978-3-540-48685-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics