Sciweavers

3552 search results - page 152 / 711
» Proof theory in the abstract
Sort
View
CORR
2010
Springer
58views Education» more  CORR 2010»
15 years 6 months ago
A calculus for costed computations
We develop a version of the picalculus Picost where channels are interpreted as resources which have costs associated with them. Code runs under the financial responsibility of own...
Matthew Hennessy
JLP
2008
91views more  JLP 2008»
15 years 6 months ago
Local variable scoping and Kleene algebra with tests
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We prov...
Kamal Aboul-Hosn, Dexter Kozen
SLOGICA
1998
128views more  SLOGICA 1998»
15 years 6 months ago
Encoding Modal Logics in Logical Frameworks
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deductionstyle proof systems for ...
Arnon Avron, Furio Honsell, Marino Miculan, Cristi...
SETA
2010
Springer
228views Mathematics» more  SETA 2010»
15 years 4 months ago
Nega-Hadamard Transform, Bent and Negabent Functions
In this paper we start developing a detailed theory of nega– Hadamard transforms. Consequently, we derive several results on negabentness of concatenations, and partially-symmetr...
Pantelimon Stanica, Sugata Gangopadhyay, Ankita Ch...
MST
2011
237views Hardware» more  MST 2011»
15 years 1 months ago
On the Complexity of Computing Winning Strategies for Finite Poset Games
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
Michael Soltys, Craig Wilson