Completing herbelin's programme
| Main Author: | |
|---|---|
| Publication Date: | 2007 |
| Language: | eng |
| Source: | Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| Download full: | http://hdl.handle.net/1822/8427 |
Summary: | In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the $\lambda$-calculus, specifically a variant which manipulates formally ``applicative contexts'' and inverts the associativity of ``applicative terms''. Herbelin worked with a fragment of sequent calculus with constraints on left introduction. In this paper we complete Herbelin's programme for full sequent calculus, that is, sequent calculus without the mentioned constraints, but where permutative conversions necessarily show up. This requires the introduction of a lambda-like calculus for full sequent calculus and an extension of natural deduction that gives meaning to ``applicative contexts'' and ``applicative terms''. Such extension is a calculus with \emph{modus ponens} and primitive substitution that refines von Plato's natural deduction; it is also a ``coercion calculus'', in the sense of Cervesato and Pfenning. The proof-theoretical outcome is noteworthy: the puzzling relationship between cut and substitution is settled; and cut-elimination in sequent calculus is proven isomorphic to normalisation in the proposed natural deduction system. The isomorphism is the mapping that inverts the associativity of applicative terms. |
| id |
RCAP_7246a27b59c61c207464ff96292995c3 |
|---|---|
| oai_identifier_str |
oai:repositorium.sdum.uminho.pt:1822/8427 |
| network_acronym_str |
RCAP |
| network_name_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| repository_id_str |
https://opendoar.ac.uk/repository/7160 |
| spelling |
Completing herbelin's programmeScience & TechnologyIn 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the $\lambda$-calculus, specifically a variant which manipulates formally ``applicative contexts'' and inverts the associativity of ``applicative terms''. Herbelin worked with a fragment of sequent calculus with constraints on left introduction. In this paper we complete Herbelin's programme for full sequent calculus, that is, sequent calculus without the mentioned constraints, but where permutative conversions necessarily show up. This requires the introduction of a lambda-like calculus for full sequent calculus and an extension of natural deduction that gives meaning to ``applicative contexts'' and ``applicative terms''. Such extension is a calculus with \emph{modus ponens} and primitive substitution that refines von Plato's natural deduction; it is also a ``coercion calculus'', in the sense of Cervesato and Pfenning. The proof-theoretical outcome is noteworthy: the puzzling relationship between cut and substitution is settled; and cut-elimination in sequent calculus is proven isomorphic to normalisation in the proposed natural deduction system. The isomorphism is the mapping that inverts the associativity of applicative terms.Springer VerlagUniversidade do MinhoEspírito Santo, José20072007-01-01T00:00:00Zconference paperinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/1822/8427engINTERNATIONAL CONFERENCE ON TYPED LAMBDA CALCULI AND APPLICATIONS, Paris, 2007 – “International Conference on Typed Lambda Calculi and Applications : (TLCA 2007)”. [S.l.: s. n.,] 2007.97835407322730302-9743www.springerlink.cominfo:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-05-11T07:33:29Zoai:repositorium.sdum.uminho.pt:1822/8427Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T16:31:26.472032Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse |
| dc.title.none.fl_str_mv |
Completing herbelin's programme |
| title |
Completing herbelin's programme |
| spellingShingle |
Completing herbelin's programme Espírito Santo, José Science & Technology |
| title_short |
Completing herbelin's programme |
| title_full |
Completing herbelin's programme |
| title_fullStr |
Completing herbelin's programme |
| title_full_unstemmed |
Completing herbelin's programme |
| title_sort |
Completing herbelin's programme |
| author |
Espírito Santo, José |
| author_facet |
Espírito Santo, José |
| author_role |
author |
| dc.contributor.none.fl_str_mv |
Universidade do Minho |
| dc.contributor.author.fl_str_mv |
Espírito Santo, José |
| dc.subject.por.fl_str_mv |
Science & Technology |
| topic |
Science & Technology |
| description |
In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the $\lambda$-calculus, specifically a variant which manipulates formally ``applicative contexts'' and inverts the associativity of ``applicative terms''. Herbelin worked with a fragment of sequent calculus with constraints on left introduction. In this paper we complete Herbelin's programme for full sequent calculus, that is, sequent calculus without the mentioned constraints, but where permutative conversions necessarily show up. This requires the introduction of a lambda-like calculus for full sequent calculus and an extension of natural deduction that gives meaning to ``applicative contexts'' and ``applicative terms''. Such extension is a calculus with \emph{modus ponens} and primitive substitution that refines von Plato's natural deduction; it is also a ``coercion calculus'', in the sense of Cervesato and Pfenning. The proof-theoretical outcome is noteworthy: the puzzling relationship between cut and substitution is settled; and cut-elimination in sequent calculus is proven isomorphic to normalisation in the proposed natural deduction system. The isomorphism is the mapping that inverts the associativity of applicative terms. |
| publishDate |
2007 |
| dc.date.none.fl_str_mv |
2007 2007-01-01T00:00:00Z |
| dc.type.driver.fl_str_mv |
conference paper |
| dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
| status_str |
publishedVersion |
| dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/1822/8427 |
| url |
http://hdl.handle.net/1822/8427 |
| dc.language.iso.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
INTERNATIONAL CONFERENCE ON TYPED LAMBDA CALCULI AND APPLICATIONS, Paris, 2007 – “International Conference on Typed Lambda Calculi and Applications : (TLCA 2007)”. [S.l.: s. n.,] 2007. 9783540732273 0302-9743 www.springerlink.com |
| dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
application/pdf |
| dc.publisher.none.fl_str_mv |
Springer Verlag |
| publisher.none.fl_str_mv |
Springer Verlag |
| dc.source.none.fl_str_mv |
reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia instacron:RCAAP |
| instname_str |
FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
| instacron_str |
RCAAP |
| institution |
RCAAP |
| reponame_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| collection |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| repository.name.fl_str_mv |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
| repository.mail.fl_str_mv |
info@rcaap.pt |
| _version_ |
1833595998147969024 |