Computer Science – Logic in Computer Science
Scientific paper
2008-04-16
Computer Science
Logic in Computer Science
Scientific paper
This 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.
No associations
LandOfFree
Short proofs of strong normalization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Short proofs of strong normalization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Short proofs of strong normalization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-607069