Statistics on graph reduction of SASL programs

The execution has been studied of four small and four medium‐sized SASL programs, when interpreted by a variant of Turner's combinator reducer. Size, structure and composition of the combinator graph have been analysed at frequent intervals during the reduction process. The most interesting results are summarized and discussed. Nodes of the graph live rather short lives and are usually not shared. Cycles are rare, and linear lists are often short. In most aspects the behaviour of the graph is quite ordinary in the sense that a simple model is sufficient to obtain a good approximation.

[1]  Paul Hudak,et al.  Serial Combinators: "Optimal" Grains of Parallelism , 1985, FPCA.

[2]  Hugh Glaser,et al.  Principles of functional programming , 1984 .

[3]  Simon L. Peyton Jones,et al.  Yacc in sasl — an exercise in functional programming , 1985, Softw. Pract. Exp..

[4]  Richard P. Gabriel,et al.  Performance and evaluation of Lisp systems , 1985 .

[5]  D. A. Turner,et al.  A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[6]  Reinhold Weicker,et al.  Dhrystone: a synthetic systems programming benchmark , 1984, CACM.

[7]  Douglas W. Clark,et al.  An empirical study of list structure in Lisp , 1977, CACM.

[8]  H. Zedan,et al.  A note on deadlock-free proofs of network of processes , 1984, SIGP.

[9]  David M. Ungar,et al.  Generation Scavenging: A non-disruptive high performance storage reclamation algorithm , 1984, SDE 1.

[10]  Pieter Koopman,et al.  Functional programs as executable specifications , 1990 .

[11]  David R. Brownbridge.  Cyclic Reference Counting for Combinator Machines , 1985, FPCA.

[12]  de Ng Dick Bruijn,et al.  THE AVERAGE HEIGHT OF PLANTED PLANE TREES , 1972 .

[13]  R. J. M. Hughes,et al.  Super-combinators a new implementation method for applicative languages , 1982, LFP '82.

[14]  Simon L. Peyton Jones.  An investigation of the relative efficiencies of combinators and lambda expressions , 1982, LFP '82.

[15]  A. C. Norman,et al.  Some practical methods for rapid combinator reduction , 1984, LFP '84.

[16]  Willem G. Vree,et al.  The Dutch parallel reduction machine project , 1987, Future Gener. Comput. Syst..

[17]  Teruo Hikita,et al.  On the Average Size of Turner's Translation to Combinator Programs , 1984 .

[18]  Pieter W. M. Koopman.  Interactive programs in a functional language: A functional implementation of an editor , 1987, Softw. Pract. Exp..

[19]  Thomas Johnsson,et al.  Efficient compilation of lazy evaluation , 1984, SIGPLAN '84.

[20]  D. A. Turner.  The semantic elegance of applicative languages , 1981, FPCA '81.

[21]  D. A. Turner.  Another Algorithm for Bracket Abstraction , 1979, J. Symb. Log..