1193 search results - page 13 / 239 » A primer of simple theories |
102
click to vote
STOC
1999
ACM
15 years 4 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
TACS
1994
Springer
15 years 3 months ago
1994
Springer
We introduce simple object calculi that support method override and object subsumption. We give an untyped calculus, typing rules, and equational rules. We illustrate the expressi...
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
FMCAD
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...
ICFP
2006
ACM
15 years 11 months ago
2006
ACM
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...