TCS
2002
13 years 11 months ago
2002
Given a category with a stable system of monics, one can form the corresponding category of partial maps. To each map in this category there is, on the domain of the map, an assoc...
TCS
2002
13 years 11 months ago
2002
A coalgebraic, equational approach to the speci
TCS
2002
13 years 11 months ago
2002
The new Associative Language Description (ALD) model, a combination of locally testable and constituent structure ideas, is proposed, arguing that in practice it equals context-fr...
TCS
2002
13 years 11 months ago
2002
TCS
2002
13 years 11 months ago
2002
Streams are acyclic directed subgraphs of the logical ow graph of a proof representing bundles of paths with the same origin and the same end. The notion of stream is used to desc...
TCS
2002
13 years 11 months ago
2002
A real is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals. A real is random if its binary expansion is a random sequence. Ou...
TCS
2002
13 years 11 months ago
2002
A threshold counter is a shared data structure that assumes integer values. It provides two operations:Increment changesthe current counter value from v to v
TCS
2002
13 years 11 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
TCS
2002
13 years 11 months ago
2002
We study proof systems for reasoning about logical consequences and refinement of structured specifications, based on similar systems proposed earlier in the literature [ST 88, Wi...
TCS
2002
13 years 11 months ago
2002
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or ...