Statistics on graph reduction of SASL programs

Share/Save/Bookmark

Hartel, Pieter H. and Veen, Arthur H. (1988) Statistics on graph reduction of SASL programs. Software: Practice and Experience, 18 (3). pp. 239-253. ISSN 0038-0644

open access
[img]
Preview
PDF
860kB
Abstract: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.
Item Type:Article
Copyright:© 1988 John Wiley & Sons
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/57075
Official URL:http://dx.doi.org/10.1002/spe.4380180305
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page