The following pages link to (Q3028326):
Displaying 13 items.
- Inverse image analysis generalises strictness analysis (Q751835) (← links)
- Strictness analysis aids inductive proofs (Q915483) (← links)
- Head-strictness is not a monotonic abstract property (Q1190512) (← links)
- Usage counting analysis for lazy functional languages (Q1275747) (← links)
- On collecting semantics for program analysis (Q2182314) (← links)
- Type-based cost analysis for lazy functional languages (Q2398175) (← links)
- Using Template Haskell for abstract interpretation (Q2873799) (← links)
- On the power and limitations of strictness analysis (Q4376980) (← links)
- Compiling laziness using projections (Q5030197) (← links)
- Projections for polymorphic strictness analysis (Q5096253) (← links)
- Strictness and totality analysis with conjunction (Q5096753) (← links)
- Modular, higher order cardinality analysis in theory and practice (Q5372006) (← links)
- Deciding inclusion of set constants over infinite non-strict data structures (Q5441550) (← links)
