Abstract
We introduce λμ→∧∨⊥ an extension of Parigot's λμ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal deductions satisfy the subformula property. From a computer science point of view, →∧∨⊥ may be seen as the core of a typed cbn functional language featuring product, coproduct, and control operators. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
De Groote, P. (2001). Strong normalization of classical natural deduction with disjunction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2044 LNCS, pp. 182–196). Springer Verlag. https://doi.org/10.1007/3-540-45413-6_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
