Utilize este identificador para referenciar este registo: https://hdl.handle.net/1822/20889

Registo completo
Campo DCValorIdioma
dc.contributor.authorEspírito Santo, José-
dc.contributor.authorMatthes, Ralph-
dc.contributor.authorNakazawa, Koji-
dc.contributor.authorPinto, Luís F.-
dc.date.accessioned2012-11-21T10:30:37Z-
dc.date.available2012-11-21T10:30:37Z-
dc.date.issued2013-
dc.date.submitted2010-12-21-
dc.identifier.issn0960-1295por
dc.identifier.urihttps://hdl.handle.net/1822/20889-
dc.descriptionEm publicaçãopor
dc.description.abstractWe study monadic translations of the call-by-name (cbn) and the call-by-value (cbv) fragments of the classical sequent calculus lambda-mu-mu~ by Curien and Herbelin and give modular and syntactic proofs of strong normalization. The target of the translations is a new meta-language for classical logic, named monadic lambda-mu . It 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 mu -reduction rule is replaced by one expressing the interaction between monadic binding and mu -abstraction. Our monadic translations produce very tight simulations of the respective fragments of lambda-mu-mu~ inside monadic lambda-mu , with reduction steps of lambda-mu-mu~ being translated in 1-1 fashion, except for beta-steps which require two steps. The monad of monadic lambda-mu can be instantiated to the continuations monad so as to ensure strict simulation of monadic lambda-mu inside simply-typed -calculus with beta- and eta -reduction. Through strict simulation, strong normalization of simply-typed -calculus is inherited to monadic lambda-mu and then to cbn and cbv lambda-mu-mu~, thus reproving in an elementary syntactical way strong normalization for these fragments of lambda-mu-mu~ and establishing it for our new calculus. These results extend to second-order logic, with polymorphic -calculus as target, giving new strong normalization results for classical second-order logic in sequent calculus style. CPS translations of cbn and cbv lambda-mu-mu~ with the strict simulation property are obtained by composing our monadic translations with the continuations-monad instantiation. In an appendix to the article 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 beta -reduction or reduction of administrative redexes at compile time.por
dc.description.sponsorshipJose Espirito Santo and Luis Pinto have been financed by FEDER funds through 'Programa Operacional Factores de Competitividade - COMPETE' and by Portuguese funds through FCT - 'Fundacao para a Ciencia e a Tecnologia', within the project PEst-C/MAT/UI0013/2011.Koji Nakazawa has been supported by the Kyoto University Foundation for an extended research visit to Ralph Matthes.por
dc.language.isoengpor
dc.publisherCambridge University Presspor
dc.rightsopenAccesspor
dc.titleMonadic translation of classical sequent calculuspor
dc.typearticlepor
dc.peerreviewedyespor
sdum.publicationstatusin publicationpor
oaire.citationStartPage1111por
oaire.citationEndPage1162por
oaire.citationIssue6por
oaire.citationTitleMathematical Structures in Computer Sciencepor
oaire.citationVolume23por
dc.identifier.doi10.1017/s0960129512000436-
dc.subject.wosScience & Technologypor
sdum.journalMathematical Structures in Computer Sciencepor
Aparece nas coleções:CMAT - Artigos em revistas com arbitragem / Papers in peer review journals

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
main.pdf480,45 kBAdobe PDFVer/Abrir

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID