TCS
2011
13 years 7 months ago
2011
TCS
2011
13 years 7 months ago
2011
TCS
2011
13 years 7 months ago
2011
TCS
2011
13 years 7 months ago
2011
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
TCS
2011
13 years 7 months ago
2011
We introduce the Danos-Régnier category
TCS
2011
13 years 7 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
TCS
2011
13 years 7 months ago
2011
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
TCS
2011
13 years 7 months ago
2011
TCS
2011
13 years 7 months ago
2011
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .
TCS
2011
13 years 7 months ago
2011