Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/20889
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Espírito Santo, José | - |
dc.contributor.author | Matthes, Ralph | - |
dc.contributor.author | Nakazawa, Koji | - |
dc.contributor.author | Pinto, Luís F. | - |
dc.date.accessioned | 2012-11-21T10:30:37Z | - |
dc.date.available | 2012-11-21T10:30:37Z | - |
dc.date.issued | 2013 | - |
dc.date.submitted | 2010-12-21 | - |
dc.identifier.issn | 0960-1295 | por |
dc.identifier.uri | https://hdl.handle.net/1822/20889 | - |
dc.description | Em publicação | por |
dc.description.abstract | We 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.sponsorship | Jose 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.iso | eng | por |
dc.publisher | Cambridge University Press | por |
dc.rights | openAccess | por |
dc.title | Monadic translation of classical sequent calculus | por |
dc.type | article | por |
dc.peerreviewed | yes | por |
sdum.publicationstatus | in publication | por |
oaire.citationStartPage | 1111 | por |
oaire.citationEndPage | 1162 | por |
oaire.citationIssue | 6 | por |
oaire.citationTitle | Mathematical Structures in Computer Science | por |
oaire.citationVolume | 23 | por |
dc.identifier.doi | 10.1017/s0960129512000436 | - |
dc.subject.wos | Science & Technology | por |
sdum.journal | Mathematical Structures in Computer Science | por |
Aparece nas coleções: | CMAT - Artigos em revistas com arbitragem / Papers in peer review journals |