Rewriting techniques and applications : ; proceedings 15th international conference, RTA 2004, Aachen, Germany, June 3-5, 2004
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
3091 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Rewriting techniques and applications, 15th international conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Vincent van Oostrom (Ed.), Berlin, Springer, 2004, 1 vol. (X-311 p.), Lecture notes in computer science, 3-540-22153-0 • Rewriting Techniques and Applications, Texte imprimé, 9783662195642 |
Sommario:
- Termination Analysis of the Untyped ?-Calculus
- A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
- Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms
- Monadic Second-Order Unification Is NP-Complete
- A Certified AC Matching Algorithm
- Matchbox: A Tool for Match-Bounded String Rewriting
- TORPA: Termination of Rewriting Proved Automatically
- Querying Unranked Trees with Stepwise Tree Automata
- A Verification Technique Using Term Rewriting Systems and Abstract Interpretation
- Rewriting for Fitch Style Natural Deductions
- Efficient ?-Evaluation with Interaction Nets
- Proving Properties of Term Rewrite Systems via Logic Programs
- On the Modularity of Confluence in Infinitary Term Rewriting
- mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
- Automated Termination Proofs with AProVE
- An Approximation Based Approach to Infinitary Lambda Calculi
- Böhm-Like Trees for Term Rewriting Systems
- Dependency Pairs Revisited
- Inductive Theorems for Higher-Order Rewriting
- The Joinability and Unification Problems for Confluent Semi-constructor TRSs
- A Visual Environment for Developing Context-Sensitive Term Rewriting Systems.