Sciweavers

11 search results - page 2 / 3
» Characterising Strongly Normalising Intuitionistic Sequent T...
Sort
View
CSL
2003
Springer
14 years 23 days ago
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
We propose a method for realising the proofs of Intuitionistic Zermelo-Fraenkel set theory (IZF) by strongly normalising λ-terms. This
Alexandre Miquel
TLCA
1999
Springer
13 years 11 months ago
Strong Normalisation of Cut-Elimination in Classical Logic
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...
Christian Urban, Gavin M. Bierman
BIRTHDAY
2007
Springer
14 years 1 months ago
Superdeduction at Work
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 ...
Paul Brauner, Clément Houtmann, Claude Kirc...
RTA
2007
Springer
14 years 1 months ago
Delayed Substitutions
Abstract. This paper investigates an approach to substitution alternative to the implicit treatment of the λ-calculus and the explicit treatment of explicit substitution calculi. ...
José Espírito Santo
PPDP
2005
Springer
14 years 1 months ago
A new calculus of contexts
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...
Murdoch Gabbay