226 search results - page 3 / 46 » Extensional Theories and Rewriting |
SARA
2007
Springer
13 years 12 months ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...
FSKD
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We introduce a property of set to represent vagueness without using truth value. It has gotten less attention in fuzzy set theory. We introduce it by analyzing a well-kno...
POPL
2004
ACM
14 years 6 months ago
2004
ACM
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
BIRTHDAY
2007
Springer
13 years 12 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
BIRTHDAY
2005
Springer
13 years 11 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...