Binding-time analysis: abstract interpretation versus type inference
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Safety Analysis versus Type InferenceInformation and Computation, 1995
- Correctness of binding-time analysisJournal of Functional Programming, 1993
- Safety analysis versus type inference for partial typesInformation Processing Letters, 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
- Strictness analysis in logical formPublished by Springer Nature ,1991
- A partial evaluator for the untyped lambda-calculusJournal of Functional Programming, 1991
- Binding time analysis for polymorphically typed higher order languagesPublished by Springer Nature ,1989
- Automatic binding time analysis for a typed λ-calculusScience of Computer Programming, 1988
- Flow analysis of lambda expressionsLecture Notes in Computer Science, 1981