Strictness analysis via abstract interpretation for recursively defined types

DOI10.1016/0890-5401(92)90028-EMaRDI QIDQ1193597zbMATH OpenFDO

Authors Gerard R. Renardel de Lavalette

Publication date 27 September 1992

Published in Information and Computation (Search for Journal in Brave)

zbMATH Keywords

program correctnessterminationfunctional programsstatic analysis of programsanalysis of lazytype verification

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Preorders, orders, domains and lattices (viewed as categories) (18B35)

Recommendations

• Type inference, abstract interpretation and strictness analysis
• Strictness analysis and denotational abstract interpretation
• Interpretations of recursively defined types
• Derivation and inference of higher-order strictness types
• scientific article; zbMATH DE number 549959
• Substructural Type Systems for Program Analysis
• scientific article; zbMATH DE number 4014021
• Types and higher-order recursion schemes for verification of higher-order programs
• scientific article; zbMATH DE number 2087540

Cites work

• scientific article; zbMATH DE number 4014021 (Why is no real title available?)
• scientific article; zbMATH DE number 3874579 (Why is no real title available?)
• scientific article; zbMATH DE number 3875232 (Why is no real title available?)
• scientific article; zbMATH DE number 3817015 (Why is no real title available?)
• scientific article; zbMATH DE number 3947598 (Why is no real title available?)
• scientific article; zbMATH DE number 3679159 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 3582349 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Data Types as Lattices
• Needed reduction and spine strategies for the lambda calculus
• Strictness analysis and denotational abstract interpretation
• Strictness analysis for higher-order functions
• The Category-Theoretic Solution of Recursive Domain Equations
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs

Cited in

(10)

• Interpretations of recursively defined types
• Revisiting the notion of function
• Strictness Analysis Algorithms Based on an Inequality System for Lazy Types
• scientific article; zbMATH DE number 4014021 (Why is no real title available?)
• scientific article; zbMATH DE number 1487944 (Why is no real title available?)
• Strictness analysis and denotational abstract interpretation
• Algebraic correctness proofs for compiling recursive function definitions with strictness information
• Head-strictness is not a monotonic abstract property
• scientific article; zbMATH DE number 1953027 (Why is no real title available?)
• Conjunctive Type Systems and Abstract Interpretation of Higher-order Functional Programs

This page was built for publication: Strictness analysis via abstract interpretation for recursively defined types

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