Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/14921| Título: | Token-passing nets for functional languages |
| Autor(es): | Almeida, José Bacelar Pinto, Jorge Sousa Vilaça, Miguel |
| Palavras-chave: | Interaction nets Reduction strategies λ-calculus Recursion lambda-calculus |
| Data: | 2008 |
| Editora: | Elsevier |
| Revista: | Electronic Notes in Theoretical Computer Science |
| Resumo(s): | Token-passing nets were proposed by Sinot as a simple mechanism for encoding evaluation strategies for the λ-calculus in interaction nets. This work extends token-passing nets to cover a typed functional language equipped with structured types and unrestricted recursion. The resulting interaction system is derived systematically from the chosen big-step operational semantics. Along the way, we actually characterize and discuss several design decisions of token-passing nets and extend them in order to achieve simpler interaction net systems with a higher degree of embedded parallelism. |
| Tipo: | Artigo |
| Descrição: | Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2007) |
| URI: | https://hdl.handle.net/1822/14921 |
| DOI: | 10.1016/j.entcs.2008.03.061 |
| ISSN: | 1571-0661 |
| Versão da editora: | The original publication is available at http://www.sciencedirect.com/science/article/pii/S1571066108001667 |
| Arbitragem científica: | yes |
| Acesso: | Acesso aberto |
| Aparece nas coleções: | DI/CCTC - Artigos (papers) |
Ficheiros deste registo:
| Ficheiro | Descrição | Tamanho | Formato | |
|---|---|---|---|---|
| WRS07.pdf | Documento principal | 1,17 MB | Adobe PDF | Ver/Abrir |
