Strictness Analysis Algorithms Based on an Inequality System for Lazy Types

DOI10.1007/978-3-540-78969-7_19MaRDI QIDQ5458441zbMATHOpenAlexFDO

Authors Hirofumi Yokouchi

Publication date 11 April 2008

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78969-7_19

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 2185712
• Strictness and totality analysis
• Strictness analysis via abstract interpretation for recursively defined types
• scientific article; zbMATH DE number 3967886
• Strictness, totality, and non-standard-type inference

Cited in

(3)

• scientific article; zbMATH DE number 4014021 (Why is no real title available?)
• scientific article; zbMATH DE number 2185712 (Why is no real title available?)
• scientific article; zbMATH DE number 1418338 (Why is no real title available?)

This page was built for publication: Strictness Analysis Algorithms Based on an Inequality System for Lazy Types

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