THE UNDECIDABILITY OF TYPE RELATED PROBLEMS IN TYPE -FREE STYLE SYSTEM F

From MaRDI portal

Publication:5389138

Jump to:navigation, search

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

zbMATH Keywords

undecidability typability type checking partial type inference lambda calculus and related systems 2nd order unification Curry style type system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5389138&oldid=20113791"