Context Semantics, Linear Logic and Computational Complexity

  • Ugo Dal Lago
  • Published 2006 in
    21st Annual IEEE Symposium on Logic in Computer…

Abstract

We show that context semantics can be fruitfully applied to the quantitative analysis of proof normalization in linear logic. In particular, context semantics lets us define the <i>weight</i> of a proof-net as a measure of its inherent complexity: it is both an upper bound to normalization time (modulo a polynomial overhead, independently on the reduction… (More)
DOI: 10.1145/1555746.1555749

Topics

5 Figures and Tables

Cite this paper

@article{Lago2006ContextSL, title={Context Semantics, Linear Logic and Computational Complexity}, author={Ugo Dal Lago}, journal={21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)}, year={2006}, pages={169-178} }