Strictness analysis for higher-order functions
From MaRDI portal
Publication:1082802
DOI10.1016/0167-6423(86)90010-9zbMath0603.68013OpenAlexW2025033165WikidataQ57006964 ScholiaQ57006964MaRDI QIDQ1082802
Chris Hankin, Samson Abramsky, Geoffrey L. Burn
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
functional languagesevaluationparallelismlazy semanticsfunctional programsstrict operatorsAbstract interpretationfirst-order functionsflat domains
Related Items
A safe approach to parallel combinator reduction, Needed reduction and spine strategies for the lambda calculus, Compositional characterization of observable program properties, Strictness and totality analysis with conjunction, A domain-theoretic framework for robustness analysis of neural networks, Two-level semantics and abstract interpretation, Unnamed Item, The powerset operator on abstract interpretations, Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis†, Head-strictness is not a monotonic abstract property, Strictness analysis via abstract interpretation for recursively defined types, A uniform treatment of order of evaluation and aggregate update, A security flow control algorithm and its denotational semantics correctness proof, Payoffs, Intensionality and Abstraction in Games, Using transformations in the implementation of higher-order functions, Strictness, totality, and non-standard-type inference, Decidability of behavioural equivalence in unary PCF, Domains for Higher-Order Games, Representing demand by partial projections, Local higher-order fixpoint iteration, Type inference, abstract interpretation and strictness analysis, Frameworks for abstract interpretation, Semantics-directed program analysis: A tool-maker's perspective, Compiling laziness using projections
