| T. Altenkirch. A formalisation of the strong normalization proof for System F in LEGO. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, Utrecht, March 1993. |
....Firstly, as for combinatory logic we shall use formulations a la Church, which arise by first considering formalization of natural deduction systems for intuitionistic implicational calculus. This is one approach; we do not claim that it is the canonical one. Compare for example Altenkirch [2] and Huet [14] who use ordinary de Bruijn indices in their implementations of proofs about calculi. Secondly, we focus on normal terms, since these are the only ones we need for building models. One model can then be used for normalization proofs of several essentially equivalent calculi. We ....
T. Altenkirch. A formalisation of the strong normalization proof for System F in LEGO. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, Utrecht, March 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