The following pages link to (Q3142167):
Displaying 12 items.
- Existential type systems between Church and Curry style (type-free style) (Q402117) (← links)
- Using typed lambda calculus to implement formal systems on a machine (Q688571) (← links)
- The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types (Q690505) (← links)
- Recasting ML\(^{\text F}\) (Q1023287) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- Undecidability of equality for codata types (Q1798783) (← links)
- Semi-explicit first-class polymorphism for ML. (Q1854319) (← links)
- On polymorphic types of untyped terms (Q2453585) (← links)
- Existential Type Systems with No Types in Terms (Q3637189) (← links)
- (Q4303686) (← links)
- COCHIS: Stable and coherent implicits (Q4972074) (← links)
- Type inhabitation of atomic polymorphism is undecidable (Q5858127) (← links)
