# Monadic translation of classical sequent calculus

Abstract : We study monadic translations of the call-by-name (cbn) and call-by-value (cbv) fragments of the classical sequent calculus ${\overline{\lambda}\mu\tilde{\mu}}$ due to Curien and Herbelin, and give modular and syntactic proofs of strong normalisation. The target of the translations is a new meta-language for classical logic, named monadic λμ. This language is a monadic reworking of Parigot's λμ-calculus, where the monadic binding is confined to commands, thus integrating the monad with the classical features. Also, its μ-reduction rule is replaced by a rule expressing the interaction between monadic binding and μ-abstraction.Our monadic translations produce very tight simulations of the respective fragments of ${\overline{\lambda}\mu\tilde{\mu}}$ within monadic λμ, with reduction steps of ${\overline{\lambda}\mu\tilde{\mu}}$ being translated in a 1–1 fashion, except for β steps, which require two steps. The monad of monadic λμ can be instantiated to the continuations monad so as to ensure strict simulation of monadic λμ within simply typed λ-calculus with β- and η-reduction. Through strict simulation, the strong normalisation of simply typed λ-calculus is inherited by monadic λμ, and then by cbn and cbv ${\overline{\lambda}\mu\tilde{\mu}}$, thus reproving strong normalisation in an elementary syntactical way for these fragments of ${\overline{\lambda}\mu\tilde{\mu}}$, and establishing it for our new calculus. These results extend to second-order logic, with polymorphic λ-calculus as the target, giving new strong normalisation results for classical second-order logic in sequent calculus style.CPS translations of cbn and cbv ${\overline{\lambda}\mu\tilde{\mu}}$ with the strict simulation property are obtained by composing our monadic translations with the continuations-monad instantiation. In an appendix to the paper, we investigate several refinements of the continuations-monad instantiation in order to obtain in a modular way improvements of the CPS translations enjoying extra properties like simulation by cbv β-reduction or reduction of administrative redexes at compile time.
Keywords :
Document type :
Journal articles
Domain :

Cited literature [30 references]

https://hal.archives-ouvertes.fr/hal-01138759
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Thursday, April 2, 2015 - 3:45:36 PM
Last modification on : Thursday, March 18, 2021 - 2:34:29 PM
Long-term archiving on: : Tuesday, April 18, 2017 - 9:16:12 AM

### File

Espirito_12342.pdf
Files produced by the author(s)

### Citation

José Espirito Santo, Ralph Matthes, Koji Nakazawa, Luis Pinto. Monadic translation of classical sequent calculus. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2013, vol. 23 (n° 6), pp. 1111-1162. ⟨10.1017/S0960129512000436⟩. ⟨hal-01138759⟩

Record views