Iterative Fixed Point Computation for Type-Based Strictness Analysis
Abstract elided by the publisher.
Related papers
- A Syntactic Method for Finding Least Fixed Points of Higher-Order Functions over Finite Domains JFP 1997
- Bounded Fixed Point Iteration POPL 1992
- A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs CAV 2005
- Disjunctive Program Analysis for Algebraic Data Types TOPLAS 1997
- Iterative-free program analysis ICFP 2003
- Local Type Reconstruction by Means of Symbolic Fixed Point Iteration ESOP 1994
- Fast Strictness Analysis Via Symbolic Fixpoint Iteration SAS 1994
- Efficient Incremental GR(1) Synthesis via Monotonic Fixed-Point Reuse OOPSLA 2026