Comparing Flow-Based Binding-Time Analyses

Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jorgensen, and Schwartzbach and the present author. The analyses are formulated in radically different ways, making comparison non-trivial.

[1]  Carsten K. Gomard.  Partial type inference for untyped functional programs , 1990, LISP and Functional Programming.

[2]  Flemming Nielson,et al.  Automatic Binding Time Analysis for a Typed lambda-Calculus , 1988, Sci. Comput. Program..

[3]  Anders Bondorf,et al.  Efficient Analysis for Realistic Off-Line Partial Evaluation , 1993, J. Funct. Program..

[4]  Jens Palsberg,et al.  Safety Analysis versus Type Inference , 1992, Inf. Comput..

[5]  Jens Palsberg,et al.  Closure analysis in constraint form , 1995, TOPL.

[6]  Jens Palsberg,et al.  Binding-time analysis: abstract interpretation versus type inference , 1994, Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94).

[7]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[8]  Anders Bondorf,et al.  Automatic Autoprojection of Higher Order Recursive Equations , 1990, Sci. Comput. Program..

[9]  Flemming Nielson,et al.  Automatic binding time analysis for a typed λ-calculus , 1988, POPL '88.

[10]  Charles Consel,et al.  Binding time analysis for high order untyped functional languages , 1990, LISP and Functional Programming.

[11]  Jens Palsberg,et al.  Safety Analysis Versus Type Inference for Partial Types , 1992, Inf. Process. Lett..

[12]  Peter Sestoft,et al.  Replacing function parameters by global variables , 1989, FPCA.

[13]  Jens Palsberg,et al.  Flobal Program Analysis in Constraint Form , 1994, CAAP.

[14]  Jens Palsberg,et al.  Object-oriented type systems , 1994, Wiley professional computing.

[15]  Jens Palsberg,et al.  Correctness of binding-time analysis , 1993, Journal of Functional Programming.