Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/8426
Título: | Delayed substitutions |
Autor(es): | Espírito Santo, José |
Data: | 2007 |
Editora: | Springer Verlag |
Revista: | Lecture Notes in Computer Science |
Citação: | INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS, 18, Paris, 2007 - “ International Conference on Rewriting Techniques and Applications, (RTA 2007)”. [S.l.: s.n.,] 2007. |
Resumo(s): | This paper investigates an approach to substitution alternative to the implicit treatment of the $\lambda$-calculus and the explicit treatment of explicit substitution calculi. In this approach, substitutions are delayed (but not executed) explicitly. We implement this idea with two calculi, one where substitution is a primitive construction of the calculus, the other where substitutions is represented by a $\beta$-redex. For both calculi, confluence and (preservation of) strong normalisation are proved (the latter fails for a related system due to Revesz, as we show). Applications of delayed substitutions are of theoretical nature. The strong normalisation result implies strong normalisation for other calculi, like the computational lambda-calculus, lambda-calculi with generalised applications, or calculi of cut-elimination for sequent calculus. We give an investigation of the computational interpretation of cut-elimination in terms of generation, execution, and delaying of substitutions, paying particular attention to how generalised applications improve such interpretation. |
Tipo: | Artigo em ata de conferência |
URI: | https://hdl.handle.net/1822/8426 |
ISBN: | 9783540734475 |
ISSN: | 0302-9743 |
Versão da editora: | www.springerlink.com |
Arbitragem científica: | yes |
Acesso: | Acesso aberto |
Aparece nas coleções: |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
DelayedSubst(camera-ready).pdf | 232,62 kB | Adobe PDF | Ver/Abrir |