Strictness analysis via abstract interpretation for recursively defined types
From MaRDI portal
Publication:1193597
DOI10.1016/0890-5401(92)90028-EzbMath0753.68063MaRDI QIDQ1193597
Gerard R. Renardel de Lavalette
Publication date: 27 September 1992
Published in: Information and Computation (Search for Journal in Brave)
termination; program correctness; functional programs; static analysis of programs; analysis of lazy; type verification
68N15: Theory of programming languages
68Q55: Semantics in the theory of computing
18B35: Preorders, orders, domains and lattices (viewed as categories)
Related Items
Cites Work
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Strictness analysis for higher-order functions
- Needed reduction and spine strategies for the lambda calculus
- Strictness analysis and denotational abstract interpretation
- The Category-Theoretic Solution of Recursive Domain Equations
- Data Types as Lattices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item