43 search results - page 2 / 9 » The Elimination of Nesting in SPCF |
ISCA
2012
IEEE
11 years 7 months ago
2012
IEEE
Recent improvements in architectural supports for virtualization have extended traditional hardware page walkers to traverse nested page tables. However, current twodimensional (2...
LICS
1995
IEEE
13 years 8 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
OTM
2009
Springer
13 years 11 months ago
2009
Springer
When automating work, it is often desirable to compensate completed work by undoing the work done by one or more activities. In the context of workflow, where compensation actions...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
TABLEAUX
2009
Springer
13 years 11 months ago
2009
Springer
We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...