Fast Strictness Analysis Based on Demand Propagation
Abstract
Strictnessanalysis is a well-known technique used in compilers for optimization of sequential and '90..
Related papers
- EQUALS - A Fast Parallel Implementation of a Lazy Language JFP 1997
- Small Domains Spell Fast Strictness Analysis POPL 1990
- Fast Strictness Analysis Via Symbolic Fixpoint Iteration SAS 1994
- A Practical Framework for Demand-Driven Interprocedural Data Flow Analysis TOPLAS 1997
- Prioritizing constraint evaluation for efficient points-to analysis CGO 2011
- Representing Demand by Partial Projections JFP 1996
- Promises are made to be broken: migrating R to strict semantics OOPSLA 2021
- Fast Interprocedural Class Analysis POPL 1998