Publicação
Permutability in proof terms for intuitionistic sequent calculus with cuts
| Resumo: | This paper gives a comprehensive and coherent view on permutability in the intuitionistic sequent calculus with cuts. Specifically we show that, once permutability is packaged into appropriate global reduction procedures, it organizes the internal structure of the system and determines fragments with computational interest, both for the computation-as-proof-normalization and the computation-as-proof-search paradigms. The vehicle of the study is a lambda-calculus of multiary proof terms with generalized application, previously developed by the authors (the paper argues this system represents the simplest fragment of ordinary sequent calculus that does not fall into mere natural deduction). We start by adapting to our setting the concept of normal proof, developed by Mints, Dyckhoff, and Pinto, and by defining natural proofs, so that a proof is normal iff it is natural and cut-free. Natural proofs form a subsystem with a transparent Curry-Howard interpretation (a kind of formal vector notation for lambda-terms with vectors consisting of lists of lists of arguments), while searching for normal proofs corresponds to a slight relaxation of focusing (in the sense of LJT). Next, we define a process of permutative conversion to natural form, and show that its combination with cut elimination gives a concept of normalization for the sequent calculus. We derive a systematic picture of the full system comprehending a rich set of reduction procedures (cut elimination, flattening, permutative conversion, normalization, focalization), organizing the relevant subsystems and the important subclasses of cut-free, normal, and focused proofs. |
|---|---|
| Autores principais: | Espírito Santo, José |
| Outros Autores: | Frade, M. J.; Pinto, Luís F. |
| Assunto: | Sequent calculus Permutative conversion Curry-Howard isomorphism Vector of arguments Generalized application Normal proof Natural proof Cut elimination Flatenning Normalization Focalization |
| Ano: | 2018 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
Registos relacionados
article A calculus of multiary sequent terms
por: Espírito Santo, José
Publicado em: (2011)
por: Espírito Santo, José
Publicado em: (2011)
article Permutability of proofs in intuitionistic sequent calculi
por: Pinto, Luís F.
Publicado em: (1999)
por: Pinto, Luís F.
Publicado em: (1999)
book Permutative conversions in intuitionistic multiary sequent calculi with cuts
por: Espírito Santo, José
Publicado em: (2003)
por: Espírito Santo, José
Publicado em: (2003)
article A proof-theoretic study of bi-intuitionistic propositional sequent calculus
por: Pinto, Luís F.
Publicado em: (2018)
por: Pinto, Luís F.
Publicado em: (2018)
article A coinductive approach to proof search through typed lambda-calculi
por: Espírito Santo, José
Publicado em: (2021)
por: Espírito Santo, José
Publicado em: (2021)
article Proof search in constructive logics
por: Pinto, Luís F.
Publicado em: (1999)
por: Pinto, Luís F.
Publicado em: (1999)
article Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications
por: Espírito Santo, José
Publicado em: (2023)
por: Espírito Santo, José
Publicado em: (2023)
article Cut formulae and logic programming
por: Pinto, Luís F.
Publicado em: (1994)
por: Pinto, Luís F.
Publicado em: (1994)
article Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
por: Pinto, Luís F.
Publicado em: (1998)
por: Pinto, Luís F.
Publicado em: (1998)
article Sequent calculi for the normal terms of the $\lambda\Pi$- and $\lambda\Pi\Sigma$-calculi
por: Pinto, Luís F.
Publicado em: (2000)
por: Pinto, Luís F.
Publicado em: (2000)
article Relating sequent calculi for bi-intuitionistic propositional logic
por: Pinto, Luís F.
Publicado em: (2011)
por: Pinto, Luís F.
Publicado em: (2011)
article Revisiting the correspondence between cut-elimination and normalisation
por: Espírito Santo, José
Publicado em: (2000)
por: Espírito Santo, José
Publicado em: (2000)
article Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents
por: Pinto, Luís F.
Publicado em: (2009)
por: Pinto, Luís F.
Publicado em: (2009)
article Characterization of strong normalizability for a sequent lambda calculus with co-control
por: Espírito Santo, José
Publicado em: (2017)
por: Espírito Santo, José
Publicado em: (2017)
article An isomorphism between a fragment of sequent calculus and an extension of natural deduction
por: Espírito Santo, José
Publicado em: (2002)
por: Espírito Santo, José
Publicado em: (2002)
article The logical essence of compiling with continuations
por: Espírito Santo, José
Publicado em: (2023)
por: Espírito Santo, José
Publicado em: (2023)
article A coinductive approach to proof search
por: Espírito Santo, José
Publicado em: (2013)
por: Espírito Santo, José
Publicado em: (2013)
book Confluence and strong normalisation of the generalised multiary lambda-calculus
por: Espírito Santo, José
Publicado em: (2004)
por: Espírito Santo, José
Publicado em: (2004)
article Characterising strongly normalising intuitionistic terms
por: Espírito Santo, José
Publicado em: (2012)
por: Espírito Santo, José
Publicado em: (2012)
article Encoding linear logic with interaction combinators
por: Mackie, Ian
Publicado em: (2002)
por: Mackie, Ian
Publicado em: (2002)
article Normality of necessary optimality conditions for calculus of variations problems with state constraints
por: Khalil, N.
Publicado em: (2019)
por: Khalil, N.
Publicado em: (2019)
assignment Proof Nets as Processes
por: Mostrous, Dimitris
Publicado em: (2012)
por: Mostrous, Dimitris
Publicado em: (2012)
article Decidability of several concepts of finiteness for simple types
por: Espírito Santo, José
Publicado em: (2019)
por: Espírito Santo, José
Publicado em: (2019)
school Revisão da língua portuguesa em contexto jornalístico
por: Sousa, Daniela Sofia Ribeiro de
Publicado em: (2015)
por: Sousa, Daniela Sofia Ribeiro de
Publicado em: (2015)
article ADSNARK: Nearly practical and privacy-preserving proofs on authenticated data
por: Backes, Michael
Publicado em: (2015)
por: Backes, Michael
Publicado em: (2015)
category Introdução ao sistema COQ de assistência à prova
por: Frade, M. J.
Publicado em: (1998)
por: Frade, M. J.
Publicado em: (1998)
school Estudo de viabilidade de paralelização de códigos de análise de dados em PROOF
por: Silva, Rafael Caldeira
Publicado em: (2014)
por: Silva, Rafael Caldeira
Publicado em: (2014)
image Lissom, a source level proof carrying code platform
por: Gomes, João
Publicado em: (2006)
por: Gomes, João
Publicado em: (2006)
article A machine-checked proof of security for AWS key management service
por: Almeida, José Bacelar
Publicado em: (2019)
por: Almeida, José Bacelar
Publicado em: (2019)
article Galois: a language for proofs using galois connections and fork algebras
por: Silva, Paulo F.
Publicado em: (2009)
por: Silva, Paulo F.
Publicado em: (2009)
article On normal forms of necessary conditions of optimality for dynamic optimization problems with constraints
por: Lopes, Sofia Oliveira
Publicado em: (2009)
por: Lopes, Sofia Oliveira
Publicado em: (2009)
article The Russell-Prawitz embedding and the atomization of universal instantiation
por: Espírito Santo, José
Publicado em: (2021)
por: Espírito Santo, José
Publicado em: (2021)
school O regime fiscal das perdas por imparidade em dívidas a receber
por: Rosendo, Ana Raquel Barros
Publicado em: (2019)
por: Rosendo, Ana Raquel Barros
Publicado em: (2019)
category Guiões das aulas práticas laboratoriais sobre o sistema COQ
por: Frade, M. J.
Publicado em: (1998)
por: Frade, M. J.
Publicado em: (1998)
article The original sin of proof-theoretic semantics
por: Dicher, Bogdan
Publicado em: (2018)
por: Dicher, Bogdan
Publicado em: (2018)
school Assédio moral no local de trabalho : um problema de prova
por: Costa, Marlene Sofia Rodrigues da
Publicado em: (2018)
por: Costa, Marlene Sofia Rodrigues da
Publicado em: (2018)
article A refined interpretation of intuitionistic logic by means of atomic polymorphism
por: Espírito Santo, José
Publicado em: (2020)
por: Espírito Santo, José
Publicado em: (2020)
article Curry-Howard for sequent calculus at last!
por: Espírito Santo, José
Publicado em: (2015)
por: Espírito Santo, José
Publicado em: (2015)
school Proof-of-Attention: uma implementação em blockchain segura e confiável?
por: Nelas, Nuno Gonçalo Gomes Silva de Loureiro
Publicado em: (2022)
por: Nelas, Nuno Gonçalo Gomes Silva de Loureiro
Publicado em: (2022)
article Kostant’s problem for fully commutative permutations
por: Mackaay, Marco
Publicado em: (2023)
por: Mackaay, Marco
Publicado em: (2023)
Registos relacionados
-
article A calculus of multiary sequent terms
por: Espírito Santo, José
Publicado em: (2011) -
article Permutability of proofs in intuitionistic sequent calculi
por: Pinto, Luís F.
Publicado em: (1999) -
book Permutative conversions in intuitionistic multiary sequent calculi with cuts
por: Espírito Santo, José
Publicado em: (2003) -
article A proof-theoretic study of bi-intuitionistic propositional sequent calculus
por: Pinto, Luís F.
Publicado em: (2018) -
article A coinductive approach to proof search through typed lambda-calculi
por: Espírito Santo, José
Publicado em: (2021)