The following pages link to (Q4027630):
Displaying 7 items.
- The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types (Q690505) (← links)
- Extending the type checker of Standard ML by polymorphic recursion (Q1275627) (← links)
- Haskell overloading is DEXPTIME-complete (Q1336737) (← links)
- Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence (Q2988360) (← links)
- (Q4625705) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) (Q6137845) (← links)
