63 search results - page 8 / 13 » Short proofs of strong normalization |
102
click to vote
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
ACNS
2007
Springer
15 years 4 months ago
2007
Springer
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
105
Voted
LOGCOM
2002
15 years 9 days ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
97
Voted
MFCS
2010
Springer
14 years 11 months ago
2010
Springer
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
116
Voted
CORR
2006
Springer
15 years 21 days ago
2006
Springer
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...