889 search results - page 99 / 178 » Problems in Rewriting III |
IJSI
2008
13 years 10 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...
JFP
2008
13 years 10 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...
JIIS
2006
13 years 10 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...
ENTCS
2007
13 years 10 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...
KES
2006
Springer
13 years 10 months ago
2006
Springer
The correct web site text content must be help to the visitors to find what they are looking for. However, the reality is quite different, many times the web page text content is a...