2000 character limit reached
Strong normalization results by translation (0905.2892v1)
Published 18 May 2009 in math.LO and cs.LO
Abstract: 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.