The following pages link to Daniel Seidel (Q649011):
Displaying 6 items.
- Countable homogeneous multipartite graphs (Q649012) (← links)
- Refined typing to localize the impact of forced strictness on free theorems (Q766167) (← links)
- Proving Properties about Functions on Lists Involving Element Tests (Q2890338) (← links)
- An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry (Q3003516) (← links)
- Automatically Generating Counterexamples to Naive Free Theorems (Q3558338) (← links)
- (Q4965813) (← links)
