240 search results - page 32 / 48 » Infinite trace equivalence |
APAL
2010
13 years 8 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
IMC
2005
ACM
14 years 2 months ago
2005
ACM
Network engineers and operators are faced with a number of challenges that arise in the context of network monitoring and measurement. These include: i) how much information is in...
APAL
2010
13 years 8 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
POPL
2006
ACM
14 years 9 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...