License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TLCA.2015.317
URN: urn:nbn:de:0030-drops-51721
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5172/
Scherer, Gabriel
Multi-Focusing on Extensional Rewriting with Sums
Abstract
We propose a logical justification for the rewriting-based equivalence procedure for simply-typed lambda-terms with sums of Lindley. It relies on maximally multi-focused proofs, a notion of canonical derivations introduced for linear logic. Lindley’s rewriting closely corresponds to preemptive rewriting, a technical device used in the meta-theory of maximal multi-focus.
BibTeX - Entry
@InProceedings{scherer:LIPIcs:2015:5172,
author = {Gabriel Scherer},
title = {{Multi-Focusing on Extensional Rewriting with Sums}},
booktitle = {13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015)},
pages = {317--331},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-87-3},
ISSN = {1868-8969},
year = {2015},
volume = {38},
editor = {Thorsten Altenkirch},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5172},
URN = {urn:nbn:de:0030-drops-51721},
doi = {10.4230/LIPIcs.TLCA.2015.317},
annote = {Keywords: Maximal multi-focusing, extensional sums, rewriting, natural deduction}
}
Keywords: |
|
Maximal multi-focusing, extensional sums, rewriting, natural deduction |
Collection: |
|
13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015) |
Issue Date: |
|
2015 |
Date of publication: |
|
15.06.2015 |