Projections for polymorphic first-order strictness analysis

DOI10.1017/S0960129500001493MaRDI QIDQ4279259zbMATH OpenFDO

Authors

Publication date 31 October 1994

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0960129500001493

zbMATH Keywords

compile-time analysiscompilers for functional languagespolymorphismprojection- based strictness analysis

Mathematics Subject Classification ID

Theories (e.g., algebraic theories), structure, and semantics (18C10) Theory of compilers and interpreters (68N20)

Recommendations

• Projections for polymorphic strictness analysis
• scientific article; zbMATH DE number 1002941
• Compiling laziness using projections
• scientific article; zbMATH DE number 1678354

Cites work

• Bayes Burn-In Decision Procedures
• scientific article; zbMATH DE number 675533 (Why is no real title available?)
• The Category-Theoretic Solution of Recursive Domain Equations

Cited in

(5)

• scientific article; zbMATH DE number 4014021 (Why is no real title available?)
• scientific article; zbMATH DE number 4016173 (Why is no real title available?)
• scientific article; zbMATH DE number 176724 (Why is no real title available?)
• Compiling laziness using projections
• Projections for polymorphic strictness analysis

This page was built for publication: Projections for polymorphic first-order strictness analysis

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