Strictness and totality analysis with conjunction

DOI10.1007/3-540-59293-8_216MaRDI QIDQ5096753zbMATH OpenOpenAlexFDO

Authors Kirsten Lackner Solberg

Publication date 18 August 2022

Published in TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59293-8_216

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Strictness and totality analysis
• Strictness, totality, and non-standard-type inference
• scientific article; zbMATH DE number 1088038
• scientific article; zbMATH DE number 1418338
• On the power and limitations of strictness analysis

Cites work

• Abstract Interpretation, Logical Relations, and Kan Extensions
• scientific article; zbMATH DE number 4016173 (Why is no real title available?)
• scientific article; zbMATH DE number 3951980 (Why is no real title available?)
• scientific article; zbMATH DE number 3679159 (Why is no real title available?)
• scientific article; zbMATH DE number 177794 (Why is no real title available?)
• Strictness analysis for higher-order functions
• Strictness and totality analysis

Cited in

(5)

• Strictness and totality analysis
• scientific article; zbMATH DE number 1088038 (Why is no real title available?)
• scientific article; zbMATH DE number 1418338 (Why is no real title available?)
• Strictness, totality, and non-standard-type inference
• Strictness analysis aids inductive proofs

This page was built for publication: Strictness and totality analysis with conjunction

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