University of Sussex
Browse

File(s) not publicly available

Iterator Types

presentation
posted on 2023-06-08, 08:01 authored by Sandra Alves, Maribel Fernández, Mario Florido, Ian MackieIan Mackie
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.

History

Publication status

  • Published

Publisher

Springer

Pages

14.0

Presentation Type

  • paper

Event name

Lecture Notes in Computer Science

Event type

conference

ISBN

978-3-540-71388-3

Department affiliated with

  • Informatics Publications

Full text available

  • No

Peer reviewed?

  • Yes

Legacy Posted Date

2012-02-06

Usage metrics

    University of Sussex (Publications)

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC