Short proofs of strong normalization

Simple item page
dc.creatorWojdyga, Aleksander
dc.date2008-04-16
dc.date.accessioned2026-07-07T09:32:55Z
dc.date.available2026-07-07T09:32:55Z
dc.descriptionThis paper presents simple, syntactic strong normalization proofs for the simply-typed lambda-calculus and the polymorphic lambda-calculus (system F) with the full set of logical connectives, and all the permutative reductions. The normalization proofs use translations of terms and types to systems, for which strong normalization property is known.
dc.identifierhttps://arxiv.org/abs/0804.2535
dc.identifierhttp://arxiv.org/abs/0804.2535
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158952
dc.subjectLogic in Computer Science
dc.subjectF.4.1
dc.titleShort proofs of strong normalization
dc.typetext

Files

Collections

arXiv