TAKAFUMI SAKURAI   
International Journal of Foundations of Computer Science 12(02) 213-244 2001年4月 [査読有り]
It is observed that the proof of strong normalizability of typed terms of typed λ-calculus looks like the process of the model construction. The observation is clarified by the works of Hyland and Ong [8], Altenkirch [2], Stefanova and Geuvers [15...