11 search results - page 2 / 3 » Characterising Strongly Normalising Intuitionistic Sequent T... |
115
click to vote
CSL
2003
Springer
15 years 9 months ago
2003
Springer
We propose a method for realising the proofs of Intuitionistic Zermelo-Fraenkel set theory (IZF) by strongly normalising λ-terms. This
135
Voted
TLCA
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
131
click to vote
BIRTHDAY
2007
Springer
15 years 10 months ago
2007
Springer
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...
155
click to vote
RTA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper investigates an approach to substitution alternative to the implicit treatment of the λ-calculus and the explicit treatment of explicit substitution calculi. ...
126
click to vote
PPDP
2005
Springer
15 years 9 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...