Pages that link to "Item:Q1302292"
From MaRDI portal
The following pages link to Typability and type checking in System F are equivalent and undecidable (Q1302292):
Displaying 26 items.
- The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
- A decidable theory of type assignment (Q365669) (← links)
- Existential type systems between Church and Curry style (type-free style) (Q402117) (← links)
- Inhabitation of polymorphic and existential types (Q636375) (← links)
- Type checking and typability in domain-free lambda calculi (Q655411) (← links)
- Divergence of \(F_{\leq}\) type checking (Q673966) (← links)
- The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types (Q690505) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions (Q764331) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Recasting ML\(^{\text F}\) (Q1023287) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- Bounded quantification is undecidable (Q1327694) (← links)
- The subtyping problem for second-order types is undecidable. (Q1400717) (← links)
- Iteration and coiteration schemes for higher-order and nested datatypes (Q1770412) (← links)
- Undecidability of equality for codata types (Q1798783) (← links)
- Principality and type inference for intersection types using expansion variables (Q1884929) (← links)
- Enhanced type inference for binding-time analysis (Q2061291) (← links)
- A System F with Call-by-Name Exceptions (Q3519511) (← links)
- Existential Type Systems with No Types in Terms (Q3637189) (← links)
- Intersection, Universally Quantified, and Reference Types (Q3644750) (← links)
- (Q5101355) (← links)
- No value restriction is needed for algebraic effects and handlers (Q5372003) (← links)
- THE UNDECIDABILITY OF TYPE RELATED PROBLEMS IN TYPE -FREE STYLE SYSTEM F (Q5389138) (← links)
- (Q6079236) (← links)
- Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) (Q6137845) (← links)
