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.
@InProceedings{scherer:LIPIcs.TLCA.2015.317, author = {Scherer, Gabriel}, 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 = {Altenkirch, Thorsten}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TLCA.2015.317}, URN = {urn:nbn:de:0030-drops-51721}, doi = {10.4230/LIPIcs.TLCA.2015.317}, annote = {Keywords: Maximal multi-focusing, extensional sums, rewriting, natural deduction} }
Feedback for Dagstuhl Publishing