8 search results - page 2 / 2 » Uniqueness of Normal Forms is Decidable for Shallow Term Rew... |
MCMASTER
1993
13 years 9 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
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 7 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 ...