The following pages link to (Q3875320):
Displayed 21 items.
- Making ``stricterness'' more relevant (Q656871) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Refined typing to localize the impact of forced strictness on free theorems (Q766167) (← links)
- Bi-inductive structural semantics (Q1012127) (← links)
- A refinement of strong sequentiality for term rewriting with constructors (Q1093366) (← links)
- Parameter-reduction of higher level grammars (Q1099634) (← links)
- Strictness analysis of the untyped \(\lambda\)-calculus (Q1114667) (← links)
- Strictness analysis via abstract interpretation for recursively defined types (Q1193597) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- The powerset operator on abstract interpretations (Q1960538) (← links)
- Local higher-order fixpoint iteration (Q2105477) (← links)
- On collecting semantics for program analysis (Q2182314) (← links)
- Transforming Boolean equalities into constraints (Q2628300) (← links)
- Bi-inductive Structural Semantics (Q2871828) (← links)
- (Q5021005) (← links)
- Compiling laziness using projections (Q5030197) (← links)
- Lazy rewriting and eager machinery (Q5055828) (← links)
- Projections for polymorphic strictness analysis (Q5096253) (← links)
- Strictness and totality analysis with conjunction (Q5096753) (← links)
- From Boolean Equalities to Constraints (Q5743586) (← links)
- On the transformation between direct and continuation semantics (Q5890072) (← links)