Minimality in a Linear Calculus with Iteration

• Type: Article in International Scientific Journal
• Date: 2008

Authors

Alves, S (Author) FCUP; Florido, M (Author) FCUP; Mackie, I (Author) Other; Sinot, FR (Author) Other

Journal

Title: Electronic Notes in Theoretical Computer Science

Vol. 204

Pages: 163-179

ISSN: 1571-0661

Publisher: Elsevier

Indexing

ISI Web of Knowledge

Scopus - 0 Citations

Other information

Authenticus ID: 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 17