Strong normalization results by translation

Simple item page
dc.creatorDavid, René
dc.creatorNour, Karim
dc.date2009-05-18
dc.date.accessioned2026-07-07T13:16:02Z
dc.date.available2026-07-07T13:16:02Z
dc.descriptionWe 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.
dc.descriptionSubmitted to APAL
dc.identifierhttps://arxiv.org/abs/0905.2892
dc.identifierhttp://arxiv.org/abs/0905.2892
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/230662
dc.subjectLogic
dc.subjectLogic in Computer Science
dc.titleStrong normalization results by translation
dc.typetext

Files

Collections

arXiv