271 search results - page 48 / 55 » A comparison between two logical formalisms for rewriting |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
DEBS
2008
ACM
13 years 9 months ago
2008
ACM
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
JCSS
2010
13 years 6 months ago
2010
When a file is to be transmitted from a sender to a recipient and when the latter already has a file somewhat similar to it, remote differential compression seeks to determine t...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
TPHOL
2008
IEEE
14 years 2 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...