550 search results - page 1 / 110 » Context Semantics, Linear Logic and Computational Complexity |
137
Voted
LICS
2006
IEEE
16 years 1 months ago
2006
IEEE
217
Voted
TCS
2011
15 years 2 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...
208
Voted
CONTEXT
2003
Springer
16 years 8 days 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 ...
156
Voted
LICS
2006
IEEE
16 years 1 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...
198
Voted
ICTCS
2003
Springer
16 years 7 days 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...