Paliath Narendran, Michaël Rusinowitch
Proceedings of the 10th International Conference on Rewriting Techniques and Applications
RTA, 1999.

@proceedings{RTA-1999,
	address       = "Trento, Italy",
	editor        = "Paliath Narendran and Michaël Rusinowitch",
	isbn          = "3-540-66201-4",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 10th International Conference on Rewriting Techniques and Applications}",
	volume        = 1631,
	year          = 1999,
}

Contents (30 items)

4 ×#named
4 ×#normalisation
4 ×#term rewriting
3 ×#on the
2 ×#algebra
2 ×#decidability
2 ×#equation
2 ×#formal method
2 ×#higher-order
2 ×#logic

RTA-1999-NieuwenhuisR #constraints #order

Solved Forms for Path Ordering Constraints (RN, JMR), pp. 1–15.

RTA-1999-DershowitzM

Jeopardy (ND, SM), pp. 16–29.

RTA-1999-Visser #pattern matching

Strategic Pattern Matching (EV), pp. 30–44.

RTA-1999-Groote #deduction #normalisation #on the

On the Strong Normalisation of Natural Deduction with Permutation-Conversions (PdG), pp. 45–59.

RTA-1999-Oostrom #normalisation #orthogonal

Normalisation in Weakly Orthogonal Rewriting (VvO), pp. 60–74.

RTA-1999-CosmoG #normalisation #proving

Strong Normalization of Proof Nets Modulo Structural Congruences (RDC, SG), pp. 75–89.

RTA-1999-Courcelle #graph #logic

Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas (BC), pp. 90–91.

RTA-1999-Marcinkowski #algebra #formal method

Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol (JM), pp. 92–102.

RTA-1999-CaronSTT #quantifier #satisfiability

Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting (ACC, FS, ST, MT), pp. 103–117.

RTA-1999-LimetR #decidability

A New Result about the Decidability of the Existential One-Step Rewriting Theory (SL, PR), pp. 118–132.

RTA-1999-Rubio

A Fully Syntactic AC-RPO (AR), pp. 133–147.

RTA-1999-Stuber #order

Theory Path Orderings (JS), pp. 148–162.

RTA-1999-Touzet #multi #recursion

A Characterisation of Multiply Recursive Functions with Higman’s Lemma (HT), pp. 163–174.

RTA-1999-BaaderT #equation #problem #word

Deciding the Word Problem in the Union of Equational Theories Sharing Constructors (FB, CT), pp. 175–189.

RTA-1999-BachmairRRT #normalisation #term rewriting

Normalization via Rewrite Closures (LB, CRR, IVR, AT), pp. 190–204.

RTA-1999-HofbauerH #testing

Test Sets for the Universal and Existential Closure of Regular Tree Languages (DH, MH), pp. 205–219.

RTA-1999-Raamsdonk #higher-order

Higher-Order Rewriting (FvR), pp. 220–239.

RTA-1999-ClavelDELMMQ #maude

The Maude System (MC, FD, SE, PL, NMO, JM, JFQ), pp. 240–243.

RTA-1999-Lopez-FraguasH #declarative #multi #named #paradigm

TOY: A Multiparadigm Declarative System (FJLF, JSH), pp. 244–247.

RTA-1999-KepserR #algorithm #equation #named #unification

UNIMOK: A System for Combining Equational Unification Algorithm (SK, JR), pp. 248–251.

RTA-1999-VermaS #agile #graph grammar #named

L^arrowR²: A Laboratory fro Rapid Term Graph Rewriting (RMV, SS), pp. 252–255.

RTA-1999-NagayaT #decidability #term rewriting

Decidability for Left-Linaer Growing Term Rewriting Systems (TN, YT), pp. 256–270.

RTA-1999-GieslM #term rewriting

Transforming Context-Sensitive Rewrite Systems (JG, AM), pp. 271–287.

RTA-1999-FerreiraR

Context-Sensitive AC-Rewriting (MCFF, ALR), pp. 286–300.

RTA-1999-BlanquiJO #algebra #calculus

The Calculus of algebraic Constructions (FB, JPJ, MO), pp. 301–316.

RTA-1999-DowekHK #first-order #higher-order #logic #named

HOL-λσ: An Intentional First-Order Expression of Higher-Order Logic (GD, TH, CK), pp. 317–331.

RTA-1999-Otto #formal method #on the

On the Connections between Rewriting and Formal Language Theory (FO), pp. 332–355.

RTA-1999-FrougnyS #polynomial #term rewriting

A Rewrite System Associated with Quadratic Pisot Units (CF, JS), pp. 356–370.

RTA-1999-Gobel #performance #symmetry

Fast Rewriting of Symmetric Polynomials (MG), pp. 371–381.

RTA-1999-SaubionS #implementation #on the

On Implementation of Tree Synchronized Languages (FS, IS), pp. 382–396.