Effective strictness analysis with HORN constraints

DOI10.1007/3-540-47764-0_5MaRDI QIDQ4778697zbMATH OpenFDO

Authors Kevin Glynn, Peter J. Stuckey, Martin Sulzmann

Publication date 19 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2126/21260073

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Making ``stricterness more relevant
• On the power and limitations of strictness analysis
• Strictness meets data flow
• Strictness and totality analysis
• scientific article; zbMATH DE number 3967886

Cited in

(11)

• Sensitivity analysis for Horn formulae
• Derivation and inference of higher-order strictness types
• On the power and limitations of strictness analysis
• Immediate fixpoints for strictness analysis
• Boolean constraints for binding-time analysis
• Untyped strictness analysis
• scientific article; zbMATH DE number 860040 (Why is no real title available?)
• Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^†
• Strictness meets data flow
• Projections for polymorphic strictness analysis
• Making ``stricterness more relevant

This page was built for publication: Effective strictness analysis with HORN constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778697)