The following pages link to (Q3742761):
Displaying 13 items.
- Difference-list transformation for Prolog (Q685124) (← links)
- Finite-tree analysis for constraint logic-based languages (Q817224) (← links)
- Deriving escape analysis by abstract interpretation (Q857916) (← links)
- Non-strict independence-based program parallelization using sharing and freeness information (Q1035704) (← links)
- Precise goal-independent abstract interpretation of constraint logic programs. (Q1395430) (← links)
- Set-sharing is redundant for pair-sharing (Q1605223) (← links)
- Pair-independence and freeness analysis through linear refinement. (Q1873754) (← links)
- Design of abstract domains using first-order logic (Q1960541) (← links)
- Non-discriminating Arguments and Their Uses (Q4649724) (← links)
- A freeness and sharing analysis of logic programs based on a pre-interpretation (Q5030191) (← links)
- Negative Ternary Set-Sharing (Q5504663) (← links)
- Parallel Logic Programming: A Sequel (Q6063892) (← links)
- A relaxed condition for avoiding the occur-check (Q6076347) (← links)
