9 search results - page 1 / 2 » Refocusing Generalised Normalisation |
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. When defined with general elimination/application rules, natural deduction and λ-calculus become closer to sequent calculus. In order to get real isomorphism, normalisa...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are nor...
ENTCS
2002
13 years 4 months ago
2002
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
TYPES
2007
Springer
13 years 11 months ago
2007
Springer
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the ...
RTA
2007
Springer
13 years 11 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. ...