@inproceedings{6a2ec8386dab4edfac821160855791b2,
title = "Linearity and recursion in a typed Lambda-Calculus",
abstract = "We show that the full PCF language can be encoded in Lrec, 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 Lrec, exploiting its linearity.",
keywords = "Linear λ-calculus, PCF, Recursion",
author = "Sandra Alves and Maribel Fer{\'n}andez and Ḿario Florido and Ian Mackie",
year = "2011",
month = sep,
day = "2",
doi = "10.1145/2003476.2003500",
language = "English",
isbn = "9781450307765",
series = "PPDP'11 - Proceedings of the 2011 Symposium on Principles and Practices of Declarative Programming",
pages = "173--182",
booktitle = "PPDP'11 - Proceedings of the 2011 Symposium on Principles and Practices of Declarative Programming",
note = "13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, PPDP 2011 ; Conference date: 20-07-2011 Through 22-07-2011",
}