Polymorphism, Subtyping, Whole Program Analysis and Accurate Data Types in Usage Analysis

There are a number of choices to be made in the design of a type based usage analysis. Some of these are: Should the analysis be monomorphic or have some degree of polymorphism? What aboutsubtyping? How should the analysis deal with user defined algebraic data types? Should it be a whole program analysis? Several researchers have speculated that these features are important but there has been a lack of empirical evidence. In this paper we present a systematic evaluation of each of these features in the context of a full scale implementation of a usage analysis for Haskell. Our measurements show that all features increase the precision. It is, however, not necessary to have them all to obtain an acceptable precision

spacetelescope/spherical_geometry: Multiple bug fixes and compatibility improvements

<ul> <li>Improved compatibility with <code>numpy</code> 2.0</li> <li>Fixed crash in multi-union for nearly identical input polygons [#233]</li> <li>Fixed crash in convex_hull when input includes repeated points [#254]</li> <li>Fixed a bug in quad-precision functions normalize and intersection functions [#256]</li> </ul&gt

spacetelescope/spherical_geometry: Update built-in qd library to version 2.3.24

<p>This is a maintenance release as the new version of the <code>qd</code> library is essentially the same library as the modified v2.3.23 previously shipped with the <code>spherical_geometry</code>. It again allows the use of system-installed <code>qd</code> library (version >=2.3.24).</p&gt