Linearity and Recursion in a Typed Lambda-Calculus

• Type: Article in International Conference Proceedings Book
• Date: 2011

Authors

Sandra Alves (Author) FCUP; Maribel Fernandez (Author) Other; Mario Florido (Author) FCUP; Ian Mackie (Author) Other

Conference proceedings International

Title: PPDP 11 - PROCEEDINGS OF THE 2011 SYMPOSIUM ON PRINCIPLES AND PRACTICES OF DECLARATIVE PROGRAMMING

Pages: 173-182

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

Odense, DENMARK, JUL 20-22, 2011

Indexing

ISI Web of Knowledge - 4 Citations

Scopus - 4 Citations

Scientific classification

FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering

Other information

Authenticus ID: P-005-4CE

DOI: 10.1145/2003476.2003500

Abstract (EN): We show that the full PCF language can be encoded in L-rec, a syntactically linear lambda-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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 10