53 search results - page 3 / 11 » From Conditional to Unconditional Rewriting |
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
CTRS
1987
15 years 3 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
ISSAC
2001
Springer
15 years 4 months ago
2001
Springer
Maple’s evaluator, together with a feature that is usually known as the assume facility, is a combination of modules with specialised reasoning capabilities. These modules are i...
103
click to vote
ACTA
2005
14 years 11 months ago
2005
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...