11740 search results - page 210 / 2348 » More Problems in Rewriting |
150
click to vote
IJSI
2008
15 years 4 months ago
2008
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
126
Voted
JFP
2008
15 years 4 months ago
2008
This paper presents an operational semantics for the core of Scheme. Our specification improves over the denotational semantics from the Revised5 Report on Scheme specification in...
148
click to vote
JIIS
2006
15 years 4 months ago
2006
Abstract In recent years, researchers have begun to study inductive databases, a new generation of databases for leveraging decision support applications. In this context, the user...
157
click to vote
ENTCS
2007
15 years 4 months ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
130
click to vote
SIGIR
2008
ACM
15 years 4 months ago
2008
ACM
In Japanese, it is quite common for the same word to be written in several different ways. This is especially true for katakana words which are typically used for transliterating ...