Efficient Strictness Analysis of Haskell
Abstract elided by the publisher.
Related papers
- Exception analysis for non-strict languages ICFP 2002
- Keep your laziness in check ICFP 2018
- Safety of Nöcker's strictness analysis JFP 2008
- Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis POPL 1994
- Haskell 98: Predefined Types and Classes JFP 2003
- Time and Space Profiling for Non-Strict Higher-Order Functional Languages POPL 1995
- Autobahn: using genetic algorithms to infer strictness annotations Haskell 2016
- Free theorems in the presence of seq POPL 2004