Making ``stricterness more relevant

DOI10.1007/S10990-011-9079-7zbMATH Open1232.68026OpenAlexW1967925712MaRDI QIDQ656871FDOQ656871

Authors Stefan Holdermans, Jurriaan Hage

Publication date 13 January 2012

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10990-011-9079-7

zbMATH Keywords

type and effect systemslazy evaluationfunctional languagesexplicit strictness annotationsrelevance typingstrictness analysis

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 1832219
• scientific article; zbMATH DE number 1088038
• Strictness and totality analysis
• Untyped strictness analysis
• Strictness meets data flow

Cites work

• scientific article; zbMATH DE number 1678354 (Why is no real title available?)
• scientific article; zbMATH DE number 1002941 (Why is no real title available?)
• scientific article; zbMATH DE number 3960961 (Why is no real title available?)
• scientific article; zbMATH DE number 4035108 (Why is no real title available?)
• scientific article; zbMATH DE number 3679159 (Why is no real title available?)
• scientific article; zbMATH DE number 3504935 (Why is no real title available?)
• scientific article; zbMATH DE number 596497 (Why is no real title available?)
• scientific article; zbMATH DE number 1952947 (Why is no real title available?)
• scientific article; zbMATH DE number 1832219 (Why is no real title available?)
• scientific article; zbMATH DE number 5033863 (Why is no real title available?)
• A generic usage analysis with subeffect qualifiers
• A linear logical framework
• Making ``stricterness more relevant
• Needed reduction and spine strategies for the lambda calculus
• Polymorphic type, region and effect inference
• Proof Tool Support for Explicit Strictness
• Refined typing to localize the impact of forced strictness on free theorems
• Safety of Nöcker's strictness analysis
• Strictness and totality analysis
• Strictness, totality, and non-standard-type inference

Cited in

(8)

• Modular, higher order cardinality analysis in theory and practice
• Proof Tool Support for Explicit Strictness
• scientific article; zbMATH DE number 4106302 (Why is no real title available?)
• scientific article; zbMATH DE number 1832219 (Why is no real title available?)
• Refined typing to localize the impact of forced strictness on free theorems
• Derivation and inference of higher-order strictness types
• Untyped strictness analysis
• Making ``stricterness more relevant

Describes a project that uses

Uses Software

• CLEAN
• Haskell

This page was built for publication: Making ``stricterness more relevant

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