Sciweavers

113 search results - page 3 / 23
» Strict Canonical Constructive Systems
Sort
View
CADE
2006
Springer
14 years 8 months ago
Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Anna Zamansky, Arnon Avron
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
14 years 1 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 8 months ago
Canonical calculi with (n,k)-ary quantifiers
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Arnon Avron, Anna Zamansky
LFCS
2009
Springer
14 years 2 months ago
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
Canonical propositional Gentzen-type calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one ...
Arnon Avron, Anna Zamansky
CADE
2001
Springer
14 years 8 months ago
Canonical Propositional Gentzen-Type Systems
Canonical propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the subformula property, in...
Arnon Avron, Iddo Lev