Abstract
We consider an operator definable in the intuitionistic theory of monadic predicates and we axiomatize some of its properties in a definitional extension of that monadic logic. The axiomatization lends itself to a natural deduction formulation to which the Curry-Howard isomorphism can be applied. The resulting Church style type system has the property that an untyped term is typable if and only if it is strongly normalizable.
BibTeX - Entry
@InProceedings{statman:LIPIcs:2013:4223,
author = {Rick Statman},
title = {{A New Type Assignment for Strongly Normalizable Terms}},
booktitle = {Computer Science Logic 2013 (CSL 2013)},
pages = {634--652},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-60-6},
ISSN = {1868-8969},
year = {2013},
volume = {23},
editor = {Simona Ronchi Della Rocca},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4223},
URN = {urn:nbn:de:0030-drops-42233},
doi = {10.4230/LIPIcs.CSL.2013.634},
annote = {Keywords: lambda calculus}
}
|
Keywords: |
|
lambda calculus |
|
Collection: |
|
Computer Science Logic 2013 (CSL 2013) |
|
Issue Date: |
|
2013 |
|
Date of publication: |
|
02.09.2013 |
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)