Strong normalization results by translation [article]

René David
2009 arXiv   pre-print
We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed lambda-mu-calculus. We also extend Mendler's result on recursive equations to this system.
arXiv:0905.2892v1 fatcat:7kyierp6graqnpulalz675vpku