Searching for "Strictness Analysis for Higher-Order Functions." – sorted by Relevance.
-
Abstract interpretation using typed decision graphs
- of higher-order functions, showing a great increase in efficiency. 1 Introduction One of the basic problems
- Cited by 8 (3 self) – Add To MetaCart
-
Relational Abstract Interpretation of Higher-Order Functional Programs (Extended Abstract)
- to combinatorial explosion problems as observed, for example, in strictness analysis of higher order functional
- Cited by 3 (1 self) – Add To MetaCart
-
New Techniques for the Analysis and Implementation of Functional Programs
- ] Geoffrey L. Burn, Chris L. Hankin, and Samson Abramsky. Strictness analysis for higher--order functions
- Cited by 1 (1 self) – Add To MetaCart
-
Inference of Polymorphic and Conditional Strictness Properties
- of properties and this lattice is exactly the lattice used in the strictness analysis for higher-order
- Cited by 16 (0 self) – Add To MetaCart
-
A Syntactic Method for Finding Least Fixed Points of Higher-Order Functions Over Finite Domains
- to compute the strictness properties of some higher-order functions over non-flat domains. We will also
- Add To MetaCart
-
Widening BDDs
- Related work Mauborgne [16] shows how to perform strictness analysis of higher-order functions with typed
- Cited by 1 (0 self) – Add To MetaCart
-
Minimal Thunkification
- for useful feedback. Strictness analysis for higher-order functions is treated in [BHA86] and proved correct
- Cited by 16 (1 self) – Add To MetaCart

