Sciweavers

IANDC
2010
121views more  IANDC 2010»
14 years 9 months ago
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
The Curry-Howard correspondence connects derivations in natural deduction with the lambdacalculus. Predicates are types, derivations are terms. This supports reasoning from assump...
Murdoch James Gabbay, Dominic P. Mulligan
100
Voted
ENTCS
2007
82views more  ENTCS 2007»
15 years 11 days ago
On the Computational Representation of Classical Logical Connectives
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
Jayshan Raghunandan, Alexander J. Summers
108
Voted
CADE
2006
Springer
16 years 22 days ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...