Making ``stricterness more relevant

DOI10.1007/s10990-011-9079-7zbMath1232.68026OpenAlexW1967925712MaRDI QIDQ656871

Jurriaan Hage, Stefan Holdermans

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

functional languageslazy evaluationtype and effect systemsexplicit strictness annotationsrelevance typingstrictness analysis

Mathematics Subject Classification ID

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

Related Items

Modular, higher order cardinality analysis in theory and practice, Making ``stricterness more relevant, Derivation and inference of higher-order strictness types, Refined typing to localize the impact of forced strictness on free theorems

Uses Software

• CLEAN
• Haskell

Cites Work

• Making ``stricterness more relevant
• Refined typing to localize the impact of forced strictness on free theorems
• Needed reduction and spine strategies for the lambda calculus
• A linear logical framework
• Strictness and totality analysis
• Safety of Nöcker's strictness analysis
• Proof Tool Support for Explicit Strictness
• Polymorphic type, region and effect inference
• A generic usage analysis with subeffect qualifiers
• Strictness, totality, and non-standard-type inference
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item