The following pages link to (Q3204025):
Displaying 10 items.
- Efficient general AGH-unification (Q462489) (← links)
- On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)
- On subsumption and semiunification in feature algebras (Q1194340) (← links)
- Type inference with partial types (Q1318726) (← links)
- On complexity of the anti-unification problem (Q3184519) (← links)
- (Q3722253) (← links)
- (Q3991208) (← links)
- (Q4217942) (← links)
- Type inference in polymorphic type discipline (Q5096210) (← links)
- Generalized partial computation using disunification to solve constraints (Q5881205) (← links)