Sciweavers

ICTCS
2003
Springer
15 years 6 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
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...
Harry G. Mairson, Kazushige Terui
ICTCS
2003
Springer
15 years 6 months ago
Algebraic Theories for Contextual Pre-nets
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...
Roberto Bruni, José Meseguer, Ugo Montanari...
ICTCS
2003
Springer
15 years 6 months ago
Channel Assignment in Honeycomb Networks
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
ICTCS
2003
Springer
15 years 6 months ago
A Calculus for Dynamic Linking
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...
Davide Ancona, Sonia Fagorzi, Elena Zucca
Theoretical Computer Science
Top of PageReset Settings