Pages that link to "Item:Q879358"
From MaRDI portal
The following pages link to Flow analysis of lazy higher-order functional programs (Q879358):
Displaying 15 items.
- Infinitary combinatory reduction systems (Q550248) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Flow analysis of lazy higher-order functional programs (Q879358) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs (Q1098614) (← links)
- Usage counting analysis for lazy functional languages (Q1275747) (← links)
- Order-of-demand analysis for lazy languages (Q1352133) (← links)
- (Q2980977) (← links)
- Analysing the complexity of functional programs: higher-order meets first-order (Q2981952) (← links)
- Systematic abstraction of abstract machines (Q3165529) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies (Q3454088) (← links)
- Relevance analysis. A combination of strictness and data flow analysis for the efficient evaluation of functional programs (Q3994798) (← links)
- (Q4380998) (← links)
- Verification of tree-processing programs via higher-order mode checking (Q5740641) (← links)