A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Shape Analysis in the Absence of Pointers and Structure
[chapter]
2010
Lecture Notes in Computer Science
Shape analyses (Chase et al. 1990 , Sagiv et al. 2002 ) discover properties of dynamic and/or mutable structures. We ask, "Is there an equivalent to shape analysis for purely functional programs, and if so, what 'shapes' does it discover?" By treating binding environments as dynamically allocated structures, by treating bindings as addresses, and by treating value environments as heaps, we argue that we can analyze the "shape" of higher-order functions. To demonstrate this, we enrich an
doi:10.1007/978-3-642-11319-2_20
fatcat:6iudb7wlbvfwxd7u2vhfrcbv2e