4 search results - page 1 / 1 » A polynomial algorithm for uniqueness of normal forms of lin... |
AAECC
2010
Springer
13 years 5 months ago
2010
Springer
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
AAECC
2008
Springer
13 years 5 months ago
2008
Springer
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...
LFP
1990
13 years 6 months ago
1990
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...