TCS
2011
13 years 10 months ago
2011
A new complete characterization of β-strong normalization is given, both in the classical and in the lazy λ-calculus, through the notion of potential valuability inside two suit...
AML
2002
14 years 2 months ago
2002
Abstract We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
TCS
2008
14 years 2 months ago
2008
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
IPL
2006
14 years 2 months ago
2006
In this paper, we propose a new proof method for strong normalization of calculi with control operators, and, by this method, we prove strong normalization of the system
APAL
2008
14 years 3 months ago
2008
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper...
APAL
2010
14 years 3 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...
TLCA
1993
Springer
14 years 7 months ago
1993
Springer
This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and...
TACS
2001
Springer
14 years 7 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 ...
IFIP
2004
Springer
14 years 8 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...