68 search results - page 4 / 14 » Strong Normalization with Singleton Types |
CORR
2008
Springer
15 years 2 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
144
click to vote
PPDP
2004
Springer
15 years 7 months ago
2004
Springer
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
110
click to vote
APAL
2010
15 years 2 months ago
2010
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...
119
click to vote
TACS
2001
Springer
15 years 6 months ago
2001
Springer
Parigot suggested symmetric structural reduction rules for ion to µ-abstraction in [9] to ensure unique representation of data type. We prove strong normalization of second order ...
123
click to vote
TLCA
2001
Springer
15 years 6 months ago
2001
Springer
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...