Fast binding-time analysis for multi-level specialization
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 261-272
- https://doi.org/10.1007/3-540-62064-8_22
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Binding-time analysis for Standard MLHigher-Order and Symbolic Computation, 1995
- A type system equivalent to flow analysisACM Transactions on Programming Languages and Systems, 1995
- Programming Languages: Implementations, Logics and ProgramsPublished by Springer Nature ,1995
- Efficient analyses for realistic off-line partial evaluationJournal of Functional Programming, 1993
- Binding-time analysis and the taming of C pointersPublished by Association for Computing Machinery (ACM) ,1993
- Two-Level Functional LanguagesPublished by Cambridge University Press (CUP) ,1992
- Automatic autoprojection of higher order recursive equationsScience of Computer Programming, 1991
- Efficient type inference for higher-order binding-time analysisPublished by Springer Nature ,1991
- A partial evaluator for the untyped lambda-calculusJournal of Functional Programming, 1991
- Partial type inference for untyped functional programsPublished by Association for Computing Machinery (ACM) ,1990