Autowrite: A Tool for Term Rewrite Systems and Tree Automata
| hal.structure.identifier | Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | DURAND, Irène | |
| dc.date.accessioned | 2024-04-15T09:53:19Z | |
| dc.date.available | 2024-04-15T09:53:19Z | |
| dc.date.created | 2003 | |
| dc.date.issued | 2004 | |
| dc.date.conference | 2004 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198598 | |
| dc.description.abstractEn | Autowrite is an experimental software tool written in Common Lisp for handling term rewrite systems and bottom-up tree automata. A graphical interface has been written using McCLIM, (the free implementation of the CLIM specification) in order to free the user of any Lisp knowledge. Software and documentation can be found at http://dept-info.labri.u-bordeaux.fr/~idurand/autowrite Autowrite was initially designed to check call-by-need properties of term rewrite systems. For this purpose, it implements the tree automata constructions used in [J96,DM97,DM98,NT02] and many useful operations on terms, term rewrite systems and tree automata. In the first version of Autowrite [D02], only the call-by-need properties and a few other simple properties were available from the graphical interface. This new version of Autowrite includes many new functionalities. There are new functionalities related to TRSs, but the most interesting new feature is the possibility to directly handle (load, save, combine with boolean operations) bottom-up tree automata. In addition, we have added on-line timing information. Since the first version the run-times have been considerably improved due to better choices of data structures. The first version of Autowrite was used to check call-by-need for most of the examples presented in [DM01]. Most of the time no alternative proofs exists. The new features allowed testing many properties of examples presented in DM03 for which no easy proof can be written. | |
| dc.language.iso | en | |
| dc.source.title | Proceedings of the Workshop on Rewriting Strategies | |
| dc.subject.en | term rewriting | |
| dc.subject.en | tree automata | |
| dc.title.en | Autowrite: A Tool for Term Rewrite Systems and Tree Automata | |
| dc.type | Communication dans un congrès | |
| dc.subject.hal | Informatique [cs]/Informatique et langage [cs.CL] | |
| bordeaux.page | 5--14 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | Workshop on Rewriting Strategies | |
| bordeaux.country | DE | |
| bordeaux.title.proceeding | Proceedings of the Workshop on Rewriting Strategies | |
| bordeaux.conference.city | Aachen | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00344274 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00344274v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=Proceedings%20of%20the%20Workshop%20on%20Rewriting%20Strategies&rft.date=2004&rft.spage=5--14&rft.epage=5--14&rft.au=DURAND,%20Ir%C3%A8ne&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||