550 search results - page 1 / 110 » Context Semantics, Linear Logic and Computational Complexity |
LICS
2006
IEEE
13 years 11 months ago
2006
IEEE
TCS
2011
12 years 11 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...
CONTEXT
2003
Springer
13 years 10 months ago
2003
Springer
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
LICS
2006
IEEE
13 years 11 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
ICTCS
2003
Springer
13 years 10 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...