M. Parigot. Strong normalisation for second order classical natural deduction. In Proceedings of the eighth annual IEEE symposium on logic in computer science, 1993. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A Constructive Restriction of the lambda µ-calculus - Crolard (1999) (Correct)
....to stay in an intuitionistic (propositional) framework. In this paper, we generalize H. Nakano s result in several ways: ffl We use M. Parigot s calculus and its type system, the Classical Natural deduction (CND) 18, 19] which is confluent and strongly normalizing in the second order framework [20]. ffl We deal with the first and second order frameworks. ffl We consider a type system a la Curry, which allows us to rephrase the above restriction on pure (i.e. untyped) terms, and not only on typed terms as in [17] ffl We propose a computational interpretation of our restriction. ffl On ....
M. Parigot. Strong normalisation for second order classical natural deduction. In Proceedings of the eighth annual IEEE symposium on logic in computer science, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC