Minimality in a Linear Calculus with Iteration

• Tipo: Artigo em Revista Científica Internacional
• Data: 2008

Autores

Alves, S (Autor) FCUP; Florido, M (Autor) FCUP; Mackie, I (Autor) Outra; Sinot, FR (Autor) Outra

Revista

Título: Electronic Notes in Theoretical Computer Science

Vol. 204

Páginas: 163-179

ISSN: 1571-0661

Editora: Elsevier

Indexação

ISI Web of Knowledge

Scopus - 0 Citações

Outras Informações

ID Authenticus: P-007-KS6

DOI: 10.1016/j.entcs.2008.03.060

Abstract (EN): System L is a linear version of Gödel's System T, where the ¿-calculus is replaced with a linear calculus; or alternatively a linear ¿-calculus enriched with some constructs including an iterator. There is thus at the same time in this system a lot of freedom in reduction and a lot of information about resources, which makes it an ideal framework to start a fresh attempt at studying reduction strategies in ¿-calculi. In particular, we show that call-by-need, the standard strategy of functional languages, can be defined directly and effectively in System L, and can be shown minimal among weak strategies.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 17