Sciweavers

66 search results - page 4 / 14
» Strong Normalization and Equi-(Co)Inductive Types
Sort
View
RTA
2007
Springer
14 years 1 months ago
Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
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...
Kentaro Kikuchi
PPDP
2004
Springer
14 years 27 days ago
Characterizing strong normalization in a language with control operators
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 ...
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lesca...
TACS
2001
Springer
13 years 12 months ago
Strong Normalization of Second Order Symmetric Lambda-mu Calculus
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 ...
Yoriyuki Yamagata
TLCA
2001
Springer
13 years 12 months ago
Strong Normalization of Classical Natural Deduction with Disjunction
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
Philippe de Groote
LPAR
2005
Springer
14 years 1 months ago
Strong Normalization of the Dual Classical Sequent Calculus
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...
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lesca...