Skip to main navigation Skip to search Skip to main content

Multi-focusing on extensional rewriting with sums

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

5 Citations (Scopus)

Abstract

We propose a logical justification for the rewriting-based equivalence procedure for simply-typed lambda-terms with sums of Lindley [8]. It relies on maximally multi-focused proofs, a notion of canonical derivations introduced for linear logic. Lindley's rewriting closely corresponds to preemptive rewriting [5], a technical device used in the meta-theory of maximal multi-focus.

Original languageEnglish
Title of host publication13th International Conference on Typed Lambda Calculi and Applications, TLCA 2015
EditorsThorsten Altenkirch
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages317-331
Number of pages15
ISBN (Electronic)9783939897873
DOIs
Publication statusPublished - 1 Jul 2015
Event13th International Conference on Typed Lambda Calculi and Applications, TLCA 2015 - Warsaw, Poland
Duration: 1 Jul 20153 Jul 2015

Publication series

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

Conference

Conference13th International Conference on Typed Lambda Calculi and Applications, TLCA 2015
Country/TerritoryPoland
CityWarsaw
Period1/07/153/07/15

Keywords

  • Extensional sums
  • Maximal multi-focusing
  • Natural deduction
  • Rewriting

Fingerprint

Dive into the research topics of 'Multi-focusing on extensional rewriting with sums'. Together they form a unique fingerprint.

Cite this