58 search results - page 7 / 12 » Resolution Proof Systems with Weak Transformation Rules |
LICS
1990
IEEE
13 years 11 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
JLP
2010
13 years 2 months ago
2010
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
DEON
2004
Springer
13 years 11 months ago
2004
Springer
Often a set of imperatives or norms seems satisfiable from the outset, but conflicts arise when ways to fulfill all are ruled out by unfortunate circumstances. Semantic methods to ...
ER
2000
Springer
13 years 11 months ago
2000
Springer
Relational database systems represent the current standard technology for implementing database applications. Now that the object-oriented paradigm becomes more and more mature in...
ACTA
2010
13 years 7 months ago
2010
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...