Lazy Type Inference for the Strictness Analysis of Lists
Abstract elided by the publisher.
Related papers
- Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis POPL 1994
- Promises are made to be broken: migrating R to strict semantics OOPSLA 2021
- Calculating PSSM probabilities with lazy dynamic programming JFP 2006
- On Strictness and its Analysis POPL 1987
- Typing Strictness POPL 2026
- Exception analysis for non-strict languages ICFP 2002
- Strictness Analysis Aids Time Analysis POPL 1988
- Autobahn: using genetic algorithms to infer strictness annotations Haskell 2016