The following pages link to (Q3819992):
Displaying 4 items.
- Extending the type checker of Standard ML by polymorphic recursion (Q1275627) (← links)
- Fast algorithms for uniform semi-unification (Q2643520) (← links)
- It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair (Q5096169) (← links)
- Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) (Q6137845) (← links)
