100
click to vote
ICTCS
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
ICTCS
2003
Springer
15 years 4 months ago
2003
Springer
ICTCS
2003
Springer
15 years 4 months ago
2003
Springer
ICTCS
2003
Springer
15 years 4 months ago
2003
Springer
ICTCS
2003
Springer
15 years 4 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
ICTCS
2003
Springer
15 years 4 months ago
2003
Springer
102
click to vote
ICTCS
2003
Springer
15 years 4 months ago
2003
Springer
The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious beh...
ICTCS
2003
Springer
15 years 4 months ago
2003
Springer
ICTCS
2003
Springer
15 years 4 months ago
2003
Springer
ICTCS
2003
Springer
15 years 4 months ago
2003
Springer
We define a calculus for modeling dynamic linking independently of the details of a particular programming environment. The calculus distinguishes at the language level the notion...