Tools
Mackie, Ian (2011) Linearity and recursion in a typed lambda-calculus. In: PPDP '11 Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming. ACM Press, pp. 173-182. ISBN 978-1-4503-0776-5
Full text not available from this repository.
Official URL: http://dx.doi.org/978-1-4503-0776-5
Abstract
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.
Item Type: | Book Section |
---|---|
Schools and Departments: | School of Engineering and Informatics > Informatics |
Related URLs: | |
Depositing User: | Ian Mackie |
Date Deposited: | 06 Feb 2012 20:34 |
Last Modified: | 10 Sep 2013 11:11 |
URI: | http://sro.sussex.ac.uk/id/eprint/26735 |