Higher-order arity raising
- 29 September 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 34 (1) , 27-38
- https://doi.org/10.1145/291251.289426
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- A type-based escape analysis for functional languagesJournal of Functional Programming, 1998
- Lightweight closure conversionACM Transactions on Programming Languages and Systems, 1997
- Typed closure conversionPublished by Association for Computing Machinery (ACM) ,1996
- Using Hindley-Milner type inference to optimise list representationPublished by Association for Computing Machinery (ACM) ,1994
- An efficient implementation of multiple return values in SchemePublished by Association for Computing Machinery (ACM) ,1994
- Using transformations in the implementation of higher-order functionsJournal of Functional Programming, 1991
- Deforestation: transforming programs to eliminate treesTheoretical Computer Science, 1990
- Two-level semantics and code generationTheoretical Computer Science, 1988
- Automatic binding time analysis for a typed λ-calculusScience of Computer Programming, 1988