882 search results - page 112 / 177 » A Taste of Rewrite Systems |
COLING
1992
13 years 10 months ago
1992
This paper proposes a three-level revision model for improving badly-styled Japanese expressions, especially in the field of technical communication. The model is a mixture of the...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We provide a characterisation of strong bisimilarity in a fragment of CCS that contains only prefix, parallel composition, synchronisation and a limited form of replication. The ch...
PPL
2008
13 years 8 months ago
2008
The aim of this work is to introduce a computational costs system associated to a semantic framework for orthogonal data and control parallelism handling. In such a framework a pa...
ESSLLI
2009
Springer
13 years 6 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...