THE UNDECIDABILITY OF TYPE RELATED PROBLEMS IN TYPE -FREE STYLE SYSTEM F
From MaRDI portal
Publication:5389138
DOI10.4230/LIPIcs.RTA.2010.103zbMath1236.68128OpenAlexW1557216219MaRDI QIDQ5389138
Aleksy Schubert, Ken-etsu Fujita
Publication date: 25 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_5706.html
undecidabilitytypabilitytype checkingpartial type inferencelambda calculus and related systems2nd order unificationCurry style type system
Related Items (2)
Existential type systems between Church and Curry style (type-free style) ⋮ The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types
This page was built for publication: THE UNDECIDABILITY OF TYPE RELATED PROBLEMS IN TYPE -FREE STYLE SYSTEM F