Strictness analysis via abstract interpretation for recursively defined types

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)

zbMATH Keywords

terminationprogram correctnessfunctional programsstatic analysis of programsanalysis of lazytype verification

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Preorders, orders, domains and lattices (viewed as categories) (18B35)

Related Items

Revisiting the notion of function

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