Skip to main navigation Skip to search Skip to main content

IMELL Cut Elimination with Linear Overhead

  • University of Bologna

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication9th International Conference on Formal Structures for Computation and Deduction, FSCD 2024
EditorsJakob Rehof
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773232
DOIs
Publication statusPublished - 1 Jul 2024
Event9th International Conference on Formal Structures for Computation and Deduction, FSCD 2024 - Tallinn, Estonia
Duration: 10 Jul 202413 Jul 2024

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume299
ISSN (Print)1868-8969

Conference

Conference9th International Conference on Formal Structures for Computation and Deduction, FSCD 2024
Country/TerritoryEstonia
CityTallinn
Period10/07/2413/07/24

Keywords

  • Lambda calculus
  • abstract machines
  • linear logic

Fingerprint

Dive into the research topics of 'IMELL Cut Elimination with Linear Overhead'. Together they form a unique fingerprint.

Cite this