Pages that link to "Item:Q1082802"

The following pages link to Strictness analysis for higher-order functions (Q1082802):

Displaying 31 items.

• A uniform treatment of order of evaluation and aggregate update (Q685390) (← links)
• Two-level semantics and abstract interpretation (Q911319) (← links)
• A safe approach to parallel combinator reduction (Q1095642) (← links)
• Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
• Strictness analysis and denotational abstract interpretation (Q1098274) (← links)
• Head-strictness is not a monotonic abstract property (Q1190512) (← links)
• Strictness analysis via abstract interpretation for recursively defined types (Q1193597) (← links)
• A security flow control algorithm and its denotational semantics correctness proof (Q1203126) (← links)
• Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
• Type inference, abstract interpretation and strictness analysis (Q1314350) (← links)
• Frameworks for abstract interpretation (Q1323307) (← links)
• The tensor product in Wadler's analysis of lists (Q1330441) (← links)
• The powerset operator on abstract interpretations (Q1960538) (← links)
• Local higher-order fixpoint iteration (Q2105477) (← links)
• (Q3026333) (← links)
• (Q3028326) (← links)
• Representing demand by partial projections (Q3125158) (← links)
• Relevance analysis. A combination of strictness and data flow analysis for the efficient evaluation of functional programs (Q3994798) (← links)
• Compositional characterization of observable program properties (Q4020510) (← links)
• On the power and limitations of strictness analysis (Q4376980) (← links)
• (Q4495071) (← links)
• Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^† (Q4880526) (← links)
• Payoffs, Intensionality and Abstraction in Games (Q4922074) (← links)
• Using transformations in the implementation of higher-order functions (Q4939691) (← links)
• (Q5021005) (← links)
• Semantics-directed program analysis: A tool-maker's perspective (Q5030183) (← links)
• Compiling laziness using projections (Q5030197) (← links)
• Strictness and totality analysis with conjunction (Q5096753) (← links)
• Domains for Higher-Order Games (Q5111275) (← links)
• Strictness, totality, and non-standard-type inference (Q5958293) (← links)
• A domain-theoretic framework for robustness analysis of neural networks (Q6149907) (← links)