Skip to main content
SpringerLink
Log in

TTSLI: An Implementation of Tree-Tuple Synchronized Languages

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

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

Included in the following conference series:

  • 215 Accesses

Abstract

Tree-Tuple Synchronized Languages have first been introduced by means of Tree-Tuple Synchronized Grammars (TTSG) [3], and have been reformulated recently by means of (so-called) Constraint Systems (CS), which allowed to prove more properties [2,1]. A number of applications to rewriting and to concurrency have been presented (see [5] for a survey).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. V. Gouranton, P. Réty, and H. Seidl. Synchronized Tree Languages Revisited and New Applications. Research Report 2000-16, LIFO, 2000. http://www.univ-orleans.fr/SCIENCES/LIFO/Members/rety/publications.html.

  2. V. Gouranton, P. Réty, and H. Seidl. Synchronized Tree Languages Revisited and New Applications. In Proceedings of FoSSaCs, volume 2030 of LNCS. Springer-Verlag, 2001.

    Google Scholar 

  3. S. Limet and P. Réty. E-Unification by Means of Tree Tuple Synchronized Grammars. In Proceedings of 6th Colloquium on Trees in Algebra and Programming, volume 1214 of LNCS, pages 429–440. Springer-Verlag, 1997. Full version in DMTCS (http://dmtcs.loria.fr/), volume 1, pages 69–98, 1997.

    Google Scholar 

  4. S. Limet, P. Réty, and H. Seidl. Weakly Regular Relations and Applications. In Proceedings of 12th Conference on Rewriting Techniques and Applications, Utrecht (The Netherlands), volume 2051 of LNCS. Springer-Verlag, 2001.

    Google Scholar 

  5. P. Réty. Langages synchronisés d’arbres et applications. Habilitation Thesis (in French). LIFO, Université d’Orléans, June 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFO, Université d’Orléans, 6759, 45067, Orléans cedex 2, France

    Benoit Lecland & Pierre Réty

Authors
  1. Benoit Lecland
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Réty
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIFL Bâtiment M3, Université de Lille 1, Cité Scientifique, 59655, Villeneuve d’Ascq cedex, France

    Sophie Tison

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lecland, B., Réty, P. (2002). TTSLI: An Implementation of Tree-Tuple Synchronized Languages. In: Tison, S. (eds) Rewriting Techniques and Applications. RTA 2002. Lecture Notes in Computer Science, vol 2378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45610-4_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-45610-4_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43916-5

  • Online ISBN: 978-3-540-45610-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation