Strictness analysis via abstract interpretation for recursively defined types

DOI10.1016/0890-5401(92)90028-EzbMATH Open0753.68063MaRDI QIDQ1193597FDOQ1193597

Authors: Gerard R. Renardel de Lavalette 

Publication date: 27 September 1992

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

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

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)

Cites Work

• The Category-Theoretic Solution of Recursive Domain Equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Data Types as Lattices
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Needed reduction and spine strategies for the lambda calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strictness analysis for higher-order functions
• Strictness analysis and denotational abstract interpretation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Interpretations of recursively defined types
• Revisiting the notion of function
• Strictness Analysis Algorithms Based on an Inequality System for Lazy Types
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strictness analysis and denotational abstract interpretation
• Algebraic correctness proofs for compiling recursive function definitions with strictness information
• Title not available (Why is that?)
• Head-strictness is not a monotonic abstract property
• 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)