Abstract
We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typings. Although this set in general does not possess a minimal element, it can be represented compactly by means of symbolic expressions in normal form — such expressions have the property that once values for the constraint variables with negative polarity have been supplied it is straight-forward to compute the minimal values for the constraint variables with positive polarity. The normalization process works on the fly, i.e. by a leaf-to-root traversal of the inference tree.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Torben Amtoft. Minimal thunkification. In 3rd International Workshop on Static Analysis (WSA '93), September 1993, Padova, Italy, number 724 in LNCS, pages 218–229. Springer-Verlag, 1993.
Torben Amtoft. Strictness types: An inference algorithm and an application. Technical Report PB-448, DAIMI, University of Aarhus, Denmark, August 1993.
Geoffrey L. Burn, Chris Hankin, and Samson Abramsky. Strictness analysis for higher-order functions. Science of Computer Programming, 7:249–278, 1986.
Charles Consel and Pierre Jouvelot. Separate polyvariant binding-time analysis. Technical Report CS/E 93-006, Oregon Graduate Institute, Department of Computer Science and Engineering, 1993.
Charles Consel. Fast strictness analysis via symbolic fixpoint iteration. Technical Report YALEU/DCS/RR-867, Yale University, September 1991.
Fritz Henglein. Efficient type inference for higher-order binding-time analysis. In John Hughes, editor, International Conference on Functional Programming Languages and Computer Architecture, number 523 in LNCS, pages 448–472. Springer-Verlag, August 1991.
Thomas P. Jensen. Strictness analysis in logical form. In John Hughes, editor, International Conference on Functional Programming Languages and Computer Architecture, number 523 in LNCS, pages 352-366. Springer-Verlag, August 1991.
Tsung-Min Kuo and Prateek Mishra. Strictness analysis: A new perspective based on type inference. In International Conference on Functional Programming Languages and Computer Architecture '89, pages 260–272. ACM Press, September 1989.
Alan Mycroft. The theory of transforming call-by-need to call-by-value. In B. Robinet, editor, International Symposium on Programming, Paris, number 83 in LNCS, pages 269–281. Springer-Verlag, April 1980.
Barry K. Rosen. Data flow analysis for procedural languages. Journal of the ACM, 26(2):322–344, April 1979.
Kirsten Lackner Solberg, Hanne Riis Nielson, and Flemming Nielson. Inference systems for binding time analysis. In M. Billaud et al., editor, Analyse statique, Bordeaux 92 (WSA '92), pages 247–254, September 1992.
David A. Wright. A new technique for strictness analysis. In TAPSOFT '91, number 494 in LNCS, pages 235–258. Springer-Verlag, April 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amtoft, T. (1994). Local type reconstruction by means of symbolic fixed point iteration. In: Sannella, D. (eds) Programming Languages and Systems — ESOP '94. ESOP 1994. Lecture Notes in Computer Science, vol 788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57880-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-57880-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57880-2
Online ISBN: 978-3-540-48376-2
eBook Packages: Springer Book Archive