The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types
DOI10.1016/J.IC.2012.07.003zbMATH Open1283.03063OpenAlexW2081779849MaRDI QIDQ690505FDOQ690505
Aleksy Schubert, Ken-etsu Fujita
Publication date: 27 November 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2012.07.003
Recommendations
lambda calculusundecidabilitysecond-order unificationtype checkingChurch-style type systemSystem FCurry-style type systemfinitely stratified polymorphic typespartial type inference
Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)
Cites Work
- The undecidability of the semi-unification problem
- Typability and type checking in System F are equivalent and undecidable
- Title not available (Why is that?)
- Finitely stratified polymorphism
- The undecidability of the second order predicate unification problem
- Domain-free \(\lambda\mu\)-calculus
- Title not available (Why is that?)
- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
- Existential Type Systems with No Types in Terms
- Existential type systems between Church and Curry style (type-free style)
- Title not available (Why is that?)
- THE UNDECIDABILITY OF TYPE RELATED PROBLEMS IN TYPE -FREE STYLE SYSTEM F
- Title not available (Why is that?)
- CPS translations and applications: The cube and beyond
- A type inference algorithm for a stratified polymorphic type discipline
- On the undecidability of second-order unification
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690505)
