Strictness analysis for higher-order functions

DOI10.1016/0167-6423(86)90010-9zbMATH Open0603.68013OpenAlexW2025033165WikidataQ57006964 ScholiaQ57006964MaRDI QIDQ1082802FDOQ1082802

Authors: Geoffrey L. Burn, Chris Hankin, Samson Abramsky 

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0167-6423(86)90010-9

Recommendations

• scientific article; zbMATH DE number 3960961
• scientific article; zbMATH DE number 3907749
• scientific article; zbMATH DE number 3967886
• scientific article; zbMATH DE number 3982495
• Strictness analysis and denotational abstract interpretation

zbMATH Keywords

evaluationparallelismfunctional programsstrict operatorsfunctional languagesAbstract interpretationfirst-order functionsflat domainslazy semantics

Mathematics Subject Classification ID

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

Cited In (37)

• A uniform treatment of order of evaluation and aggregate update
• Local higher-order fixpoint iteration
• Strictness and totality analysis with conjunction
• Type inference, abstract interpretation and strictness analysis
• Strictness analysis via abstract interpretation for recursively defined types
• A domain-theoretic framework for robustness analysis of neural networks
• Domains for Higher-Order Games
• Payoffs, intensionality and abstraction in games
• Decidability of behavioural equivalence in unary PCF
• Title not available (Why is that?)
• Representing demand by partial projections
• Compositional characterization of observable program properties
• The tensor product in Wadler's analysis of lists
• Frameworks for abstract interpretation
• The powerset operator on abstract interpretations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Compiling laziness using projections
• A safe approach to parallel combinator reduction
• Strictness analysis and denotational abstract interpretation
• Title not available (Why is that?)
• Two-level semantics and abstract interpretation
• Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^†
• Title not available (Why is that?)
• Semantics-directed program analysis: a tool-maker's perspective
• On the power and limitations of strictness analysis
• Head-strictness is not a monotonic abstract property
• Strictness, totality, and non-standard-type inference
• A security flow control algorithm and its denotational semantics correctness proof
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Needed reduction and spine strategies for the lambda calculus
• Using transformations in the implementation of higher-order functions
• Abstract interpretation as a programming language

This page was built for publication: Strictness analysis for higher-order functions

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