University of Sussex
Browse

File(s) not publicly available

Linearity and recursion in a typed lambda-calculus

chapter
posted on 2023-06-08, 06:50 authored by Ian MackieIan Mackie
We show that the full PCF language can be encoded in L_rec, a syntactically linear ?-calculus extended with numbers, pairs, and an unbounded recursor that preserves the syntactic linearity of the calculus. We give call-by-name and call-by-value evaluation strategies and discuss implementation techniques for L_rec, exploiting its linearity.

History

Publication status

  • Published

Publisher

ACM Press

External DOI

Page range

173-182

Event name

13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming

Event location

Denmark

Event type

conference

Book title

PPDP '11 Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming

ISBN

978-1-4503-0776-5

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

    Keywords

    Uncategorised value

    Licence

    Copyright not evaluated

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC