Pages that link to "Item:Q1207950"
From MaRDI portal
The following pages link to The undecidability of the semi-unification problem (Q1207950):
Displaying 14 items.
- The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
- The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types (Q690505) (← links)
- On subsumption and semiunification in feature algebras (Q1194340) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- Extending the type checker of Standard ML by polymorphic recursion (Q1275627) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- Type inference with partial types (Q1318726) (← links)
- Semi-unification of two terms in Abelian groups (Q1336738) (← links)
- Iteration and coiteration schemes for higher-order and nested datatypes (Q1770412) (← links)
- Thue trees (Q1861534) (← links)
- Contribution of Warsaw logicians to computational logic (Q2422533) (← links)
- Fast algorithms for uniform semi-unification (Q2643520) (← links)
- Existential Type Systems with No Types in Terms (Q3637189) (← links)
- Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) (Q6137845) (← links)
