66 search results - page 4 / 14 » Strong Normalization and Equi-(Co)Inductive Types |
140
click to vote
RTA
2007
Springer
15 years 9 months ago
2007
Springer
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
158
Voted
PPDP
2004
Springer
15 years 9 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 ...
130
Voted
TACS
2001
Springer
15 years 8 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 ...
135
Voted
TLCA
2001
Springer
15 years 8 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...
140
Voted
LPAR
2005
Springer
15 years 9 months ago
2005
Springer
We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λµ calculus co...