1. Ammarguellat, Z. A control-flow normalization algorithm and its complexity. IEEE Transactions on Software Engineering 18, 3 (March 1992), 237–251.
2. Ballance, R. A., Maccabe, A. B., and Ottenstein, K. J. The program dependence Web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (White Plains, NY, June 1990), pp. 257–271.
3. Barendregt, H., van Eekelen, M., Glauert, J., Kennaway, J., Plasmeijer, M., and Sleep, M. Term graph rewriting. In Proc. PARLE Conference, Vol. II: Parallel Languages (Eindhoven, The Netherlands, 1987), vol. 259 of Lecture Notes in Computer Science, Springer-Verlag, pp. 141–158.
4. Bergstra, J., Dinesh, T., Field, J., and Heering, J. A complete transformational toolkit for compilers. Report CS-R9601, CWI, Amsterdam, January 1996; also Report RC 20342, IBM T.J. Watson Reseach Center, January 1996.
5. Bergstra,J., and Heering, J. Which data types have ω-complete initial algebra specifications? Theoretical Computer Science 124 (1994), 149–168.