Rewriting techniques and applications : 6th international conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995 : proceedings
This volume presents the proceedings of the Sixth International Conference on Rewriting Techniques and Applications, RTA-95, held in Kaiserslautern, Germany in April 1995. The 27 full revised papers were selected from a total of 87 submissions. In addition there are 9 system descriptions and two pro...
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
914 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
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, 6th international conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, proceedings, Jieh Hsiang, ed, Berlin, Springer-Verlag, 1995, 1 vol. (XII-471 p.), Lecture notes in computer science, 3-540-59200-8 • Rewriting Techniques and Applications, Texte imprimé, 9783662163887 |
جدول المحتويات:
- On some mathematical logic contributions to rewriting techniques: Lost heritage
- Modularity of completeness revisited
- Automatic termination proofs with transformation orderings
- A termination ordering for higher order rewrite systems
- A complete characterization of termination of 0p 1q?1r 0s
- On narrowing, refutation proofs and constraints
- Completion for multiple reduction orderings
- Towards an efficient construction of test sets for deciding ground reducibility
- Term rewriting in contemporary resolution theorem proving
- ??!?=1 Optimizing optimal ?-calculus implementations
- Substitution tree indexing
- Concurrent garbage collection for concurrent rewriting
- Lazy rewriting and eager machinery
- A rewrite mechanism for logic programs with negation
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- Problems in rewriting applied to categorical concepts by the example of a computational comonad
- Relating two categorical models of term rewriting
- Towards a domain theory for termination proofs
- Higher-order rewrite systems
- Infinitary lambda calculi and böhm models
- Proving the genericity lemma by leftmost reduction is simple
- (Head-)normalization of typeable rewrite systems
- Explicit substitutions with de bruijn's levels
- A restricted form of higher-order rewriting applied to an HDL semantics
- Rewrite systems for integer arithmetic
- General solution of systems of linear diophantine equations and inequations
- Combination of constraint solving techniques: An algebraic point of view
- Some independence results for equational unification
- Regular substitution sets: A means of controlling E-unification
- DISCOUNT: A system fordistributed equational deduction
- ASTRE: Towards a fully automated program transformation system
- Parallel ReDuX ? PaReDuX
- STORM: A many-to-one associative-commutative matcher
- LEMMA: A system for automated synthesis of recursive programs in equational theories
- Generating polynomial orderings for termination proofs
- Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2
- Prototyping completion with constraints using computational systems
- Guiding term reduction through a neural network: Some preliminary results for the group theory
- Studying quasigroup identities by rewriting techniques: Problems and first results
- Problems in rewriting III.