Generating function versions with rational strictness patterns

DOI10.1016/0167-6423(89)90027-0MaRDI QIDQ1822933zbMATH OpenOpenAlexFDO

Authors Cordelia V. Hall, David S. Wise

Publication date 1989

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(89)90027-0

zbMATH Keywords

compilationExpression evaluationfirst order languagelazy applicative languageslazy list constructorsStrictness analysis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3967886
• Publication:4721629
• On the power and limitations of strictness analysis
• scientific article; zbMATH DE number 1002941
• scientific article; zbMATH DE number 3982495

Cited in

(5)

• V→M: A Virtual Machine for Strict Evaluation of (Co)Recursive Functions
• scientific article; zbMATH DE number 3967886 (Why is no real title available?)
• Algebraic correctness proofs for compiling recursive function definitions with strictness information
• scientific article; zbMATH DE number 3960968 (Why is no real title available?)
• scientific article; zbMATH DE number 3995026 (Why is no real title available?)

Describes a project that uses

Uses Software

• Miranda

This page was built for publication: Generating function versions with rational strictness patterns

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