RX: an interpreter for Rational Tree Languages

RX exploits functional programming in two ways. First, tree automata and their operations are described in a small functional language. Second, RX is implemented in the higher-order lazy functional language Haskell.

Also see the RX home page

• Developer: Johannes Waldmann
  
• Contact:
  • Dr. Johannes Waldmann
    Institut für Informatik
    Fakultät für Mathematik und Informatik
    Universität Leipzig
    Augustusplatz 10-11
    D-04709 Leipzig
    Germany
    Phone/Fax: +49 341 97 32 204/209
    Email: joe@informatik.uni-leipzig.de
• Number of sites: 1+
• Number of users: about 3+
• In use: since 1997
• Language: Haskell
• Compilers: ghc (Glasgow), hbc (Chalmers), hugs (Nottingham/Yale)
• Line count: about 7K.
• Availability: Sources available under GNU copyleft.
• Related publications:
  • application of RX: J. Waldmann: Normalization of S Terms is Decidable, in: Proceedings 9th RTA, LNCS 1379, pp 138--150