Proceedings of the Second International Conference on Rewriting Techniques and Applications
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Pierre Lescanne
Proceedings of the Second International Conference on Rewriting Techniques and Applications
RTA, 1987.

FM
DBLP
Scholar
Full names Links ISxN
@proceedings{RTA-1987,
	address       = "Bordeaux, France",
	editor        = "Pierre Lescanne",
	isbn          = "3-540-17220-3",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Second International Conference on Rewriting Techniques and Applications}",
	volume        = 256,
	year          = 1987,
}

Contents (23 items)

RTA-1987-ODonnell #equation #implementation #logic programming
Term-Rewriting Implementation of Equational Logic Programming (MJO), pp. 1–12.
RTA-1987-Strandh #equation #optimisation #source code
Optimizing Equational Programs (RS), pp. 13–24.
RTA-1987-Kaplan #compilation #term rewriting
A Compiler for Conditional Term Rewriting Systems (SK), pp. 25–41.
RTA-1987-Martin #how
How to Choose Weights in the Knuth Bendix Ordering (UM), pp. 42–53.
RTA-1987-Purdom #detection
Detecting Looping Simplifications (PWPJ), pp. 54–61.
RTA-1987-Sopena #combinator
Combinatorial Hypermap Rewriting (ES), pp. 62–73.
RTA-1987-SquierO #canonical #finite #monad #problem #term rewriting #word
Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems (CCS, FO), pp. 74–82.
RTA-1987-BaetenBK #term rewriting
Term Rewriting Systems with Priorities (JCMB, JAB, JWK), pp. 83–94.
RTA-1987-DauchetC #linear #term rewriting
A Gap Between Linear and Non Linear Term-Rewriting Systems (1) (MD, FDC), pp. 95–104.
RTA-1987-DesplandMR #code generation #generative #term rewriting
Code Generator Generation Based on Template-Driven Target Term Rewriting (AD, MM, RR), pp. 105–120.
RTA-1987-Benois #algorithm #automaton #complexity #regular expression #term rewriting
Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction (MB), pp. 121–132.
RTA-1987-MadlenerO #finite #string #term rewriting
Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems (KM, FO), pp. 133–144.
RTA-1987-Otto #confluence #congruence
Some Results about Confluence on a Given Congruence Class (FO), pp. 145–155.
RTA-1987-Gobel #confluence
Ground Confluence (RG), pp. 156–167.
RTA-1987-Qian
Structured Contextual Rewriting (ZQ), pp. 168–179.
RTA-1987-Kirchner #infinity #process #set
Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes (HK), pp. 180–191.
RTA-1987-BachmairD #congruence
Completion for Rewriting Modulo a Congruence (LB, ND), pp. 192–203.
RTA-1987-BurckertHS #decidability #equation #on the #unification
On Equational Theories, Unification and Decidability (HJB, AH, MSS), pp. 204–215.
RTA-1987-GallierS
A General Complete E-Unification Procedure (JHG, WS), pp. 216–227.
RTA-1987-Rety
Improving Basic Narrowing Techniques (PR), pp. 228–241.
RTA-1987-Padawitz #reduction
Strategy-Controlled Reduction and Narrowing (PP), pp. 242–255.
RTA-1987-ChoppyKS #algorithm #complexity #term rewriting
Algorithmic Complexity of Term Rewriting Systems (CC, SK, MS), pp. 256–273.
RTA-1987-RameshR #parallel #pattern matching
Optimal Speedups for Parallel Pattern Matching in Trees (RR, IVR), pp. 274–285.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.