Information and Computation, Volume 183

Volume 183, Number 1, 25 May 2003

International Workshop on Implicit Computational Complexity (ICC'99), Trento, Italy, 30 June - 1 July 1999

Anuj Dawar, Daniel Leivant:
Guest editorial. 1
Jean-Yves Marion:
Analysing the implicit complexity of programs. 2-18
Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg:
Term rewriting for normalization by evaluation. 19-42
Dieter Hofbauer:
An upper bound on the derivational complexity of Knuth-Bendix orderings. 43-56
Martin Hofmann:
Linear types and non-size-increasing polynomial time computation. 57-85
Frank Neven, Thomas Schwentick:
On the power of tree-walking automata. 86-103
Georg Gottlob, Christos H. Papadimitriou:
On the complexity of single-rule datalog queries. 104-122
Vincent Danos, Jean-Baptiste Joinet:
Linear logic and elementary time. 123-137

12th International Conference on Rewriting Techniques and Applications (RTA 2001), Utrecht, The Netherlands, 22 - 24 May 2001

Aart Middeldorp:
Preface. 139
Alessandro Armando, Silvio Ranise, Michaël Rusinowitch:
A rewriting approach to satisfiability procedures. 140-164
Konstantin Korovin, Andrei Voronkov:
Orienting rewrite rules with the Knuth-Bendix order. 165-186
Michio Oyamaguchi, Yoshikatsu Ohta:
The unification problem for confluent right-ground term rewriting systems. 187-211
René Vestergaard, James Brotherston:
A formalised first-order confluence proof for the -calculus using one-sorted variable names. 212-244
Jens R. Woinowski:
The context-splittable normal form for Church-Rosser language systems. 245-274

Last update Tue Feb 14 04:18:17 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page