Minimality in a Linear Calculus with Iteration

  • Authors:

  • Sandra Alves;Mário Florido;Ian Mackie;François-Régis Sinot

  • Affiliations:

  • Universidade do Porto, DCC/LIACC, Rua do Campo Alegre 1021--1051, Porto, Portugal;Universidade do Porto, DCC/LIACC, Rua do Campo Alegre 1021--1051, Porto, Portugal;LIX, CNRS UMR 7161, École Polytechnique, 91128 Palaiseau, France;Universidade do Porto, DCC/LIACC, Rua do Campo Alegre 1021--1051, Porto, Portugal

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

System L is a linear version of Godel's System T, where the @l-calculus is replaced with a linear calculus; or alternatively a linear @l-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 @l-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.