File(s) not publicly available
Linearity and recursion in a typed lambda-calculus
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 PressExternal DOI
Page range
173-182Event name
13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative ProgrammingEvent location
DenmarkEvent type
conferenceBook title
PPDP '11 Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programmingISBN
978-1-4503-0776-5Department affiliated with
- Informatics Publications
Full text available
- No
Peer reviewed?
- Yes
Legacy Posted Date
2012-02-06Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC