Proof Tool Support for Explicit Strictness

DOI10.1007/11964681_3zbMATH Open1236.68033OpenAlexW2097149419MaRDI QIDQ3623948FDOQ3623948

Maarten de Mol, Marko van Eekelen

Publication date: 28 April 2009

Published in: Implementation and Application of Functional Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11964681_3

Recommendations

• Proving Properties of Lazy Functional Programs with Sparkle
• scientific article; zbMATH DE number 2086496
• Derivation and inference of higher-order strictness types
• Safety of Nöcker's strictness analysis
• Making ``stricterness more relevant

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cited In (6)

• Trends in trends in functional programming 1999/2000 versus 2007/2008
• Selective strictness and parametricity in structural operational semantics, inequationally
• A family of syntactic logical relations for the semantics of Haskell-like languages
• Title not available (Why is that?)
• Making ``stricterness more relevant
• Proving Properties of Lazy Functional Programs with Sparkle

Uses Software

• Sparkle

This page was built for publication: Proof Tool Support for Explicit Strictness

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