Iterator Types

Alves, Sandra, Fernández, Maribel, Florido, Mario and Mackie, Ian (2007) Iterator Types. In: Lecture Notes in Computer Science.

Full text not available from this repository.

Abstract

System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of Gödel’s System T. System L owes its power to two features: the use of a closed reduction strategy (which permits the construction of an iterator on an open function, but only iterates the function after it becomes closed), and the use of a liberal typing rule for iterators based on iterative types. In this paper, we study these new types, and show how they relate to intersection types. We also give a sound and complete type reconstruction algorithm for System L.

Item Type: Conference or Workshop Item (Paper)
Schools and Departments: School of Engineering and Informatics > Informatics
Depositing User: Ian Mackie
Date Deposited: 06 Feb 2012 20:50
Last Modified: 13 Apr 2012 11:22
URI: http://sro.sussex.ac.uk/id/eprint/28425
📧 Request an update