• Media type: E-Article; Text; Electronic Conference Proceeding
  • Title: IMELL Cut Elimination with Linear Overhead
  • Contributor: Accattoli, Beniamino [Author]; Sacerdoti Coen, Claudio [Author]
  • Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.FSCD.2024.24
  • Keywords: Lambda calculus ; linear logic ; abstract machines
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: Recently, Accattoli introduced the Exponential Substitution Calculus (ESC) given by untyped proof terms for Intuitionistic Multiplicative Exponential Linear Logic (IMELL), endowed with rewriting rules at-a-distance for cut elimination. He also introduced a new cut elimination strategy, dubbed the good strategy, and showed that its number of steps is a time cost model with polynomial overhead for ESC/IMELL, and the first such one. Here, we refine Accattoli’s result by introducing an abstract machine for ESC and proving that it implements the good strategy and computes cut-free terms/proofs within a linear overhead.
  • Access State: Open Access