Results 1 -
5 of
5
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
"... Abstract. The intuitionistic fragment of the call-by-name version of Curien and Herbelin’s λµ˜µ-calculus is isolated and proved strongly normalising by means of an embedding into the simply-typed λ-calculus. Our embedding is a continuation-and-garbage-passing style translation, the inspiring idea co ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract. The intuitionistic fragment of the call-by-name version of Curien and Herbelin’s λµ˜µ-calculus is isolated and proved strongly normalising by means of an embedding into the simply-typed λ-calculus. Our embedding is a continuation-and-garbage-passing style translation, the inspiring idea coming from Ikeda and Nakazawa’s translation of Parigot’s λµ-calculus. The embedding simulates reductions while usual continuation-passing-style transformations erase permutative reduction steps. For our intuitionistic sequent calculus, we even only need “units of garbage ” to be passed. We apply the same method to other calculi, namely successive extensions of the simply-typed λ-calculus leading to our intuitionistic system, and already for the simplest extension we consider (λ-calculus with generalised application), this yields the first proof of strong normalisation through a reduction-preserving embedding. 1
Characterising strongly normalising intuitionistic sequent terms
"... Abstract. 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 typing system is reduced to that of a well known typing system with intersection types for the ordinary λ-calc ..."
Abstract
- Add to MetaCart
Abstract. 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 typing system is reduced to that of a well known typing system with intersection types for the ordinary λ-calculus. The completeness of the typing system is obtained from subject expansion at root position. This paper’s sequent term calculus integrates smoothly the λ-terms with generalised application or explicit substitution. Strong normalisability of these terms as sequent terms characterises their typeability in certain “natural ” typing systems with intersection types. The latter are in the natural deduction format, like systems previously studied by Matthes and Lengrand et al., except that they do not contain any extra, exceptional rules for typing generalised applications or substitution.
Monadic translation of intuitionistic sequent calculus
, 2009
"... This paper proposes and analyses a monadic translation of an intuitionistic sequent calculus. The source of the translation is a typed λ-calculus previously introduced by the authors, corresponding to the intuitionistic fragment of the call-by-name variant of λµ˜µ of Curien and Herbelin, and the tar ..."
Abstract
- Add to MetaCart
This paper proposes and analyses a monadic translation of an intuitionistic sequent calculus. The source of the translation is a typed λ-calculus previously introduced by the authors, corresponding to the intuitionistic fragment of the call-by-name variant of λµ˜µ of Curien and Herbelin, and the target is a variant of Moggi’s monadic meta-language, where the rewrite relation includes extra permutation rules that may be seen as variations of the “associativity ” of bind (the Kleisli extension operation of the monad). The main result is that the monadic translation simulates reduction strictly, so that strong normalisation (which is enjoyed at the target, as we show) can be lifted from the target to the source. A variant translation, obtained by adding an extra monad application in the translation of types, still enjoys strict simulation, while requiring one fewer extra permutation rule from the target. Finally we instantiate, for the cases of the identity monad and the continuations monad, the meta-language into the simply-typed λ-calculus. By this means, we give a generic account of translations of sequent calculus into natural deduction, which encompasses the traditional mapping studied by Zucker and Pottinger, and CPS translations of intuitionistic sequent calculus.

