Springer
Lecture Notes in Computer Science
International Workshop on Higher-Order Algebra, Logic, and Term Rewriting

van de Pol, J. (1995). Two different strong normalization proofs? - computability versus functionals of finite type -. In Higher-Order Algebra, Logic, and Term Rewriting 1995 (HOA 0) (pp. 201–220). Springer.