Binding-Time Analysis for MetaML via Type Inference and Constraint Solving
Abstract elided by the publisher.
Related papers
- Polymorphic specialization for ML TOPLAS 2004
- OutsideIn(X) Modular type inference with local assumptions JFP 2011
- Points-to Analysis in Almost Linear Time POPL 1996
- Efficient Analysis for Realistic Off-Line Partial Evaluation JFP 1993
- Making Type Inference Practical ECOOP 1992
- Automating sized-type inference for complexity analysis ICFP 2017
- Incremental type-checking for type-reflective metaprograms GPCE 2010
- HM(X) type inference is CLP(X) solving JFP 2008