Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2017.24
URN: urn:nbn:de:0030-drops-77135
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7713/
Kesner, Delia ; Vial, Pierre
Types as Resources for Classical Natural Deduction
| pdf-format: |
|
Abstract
We define two resource aware typing systems for the lambda-mu-calculus based on non-idempotent intersection and union types. Thenon-idempotent approach provides very simple combinatorial arguments - based on decreasing measures of type derivations - to characterize head and strongly normalizing terms. Moreover, typability provides upper bounds for the length of head-reduction sequences and maximal reduction sequences.
BibTeX - Entry
@InProceedings{kesner_et_al:LIPIcs:2017:7713,
author = {Delia Kesner and Pierre Vial},
title = {{Types as Resources for Classical Natural Deduction}},
booktitle = {2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)},
pages = {24:1--24:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-047-7},
ISSN = {1868-8969},
year = {2017},
volume = {84},
editor = {Dale Miller},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7713},
URN = {urn:nbn:de:0030-drops-77135},
doi = {10.4230/LIPIcs.FSCD.2017.24},
annote = {Keywords: lambda-mu-calculus, classical logic, intersection types, normalization}
}
| Keywords: | lambda-mu-calculus, classical logic, intersection types, normalization | |
| Seminar: | 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 30.08.2017 |
