Back to Results
First PageMeta Content
Software engineering / Theoretical computer science / Lambda calculus / Inference / Type inference / Hindley–Milner / System F / Greek alphabet / Type theory / Type systems / Programming language theory


FPH: First-class Polymorphism for Haskell Declarative, Constraint-free Type Inference for Impredicative Polymorphism Dimitrios Vytiniotis Stephanie Weirich
Add to Reading List

Document Date: 2014-07-10 05:47:09


Open Document

File Size: 206,37 KB

Share Result on Facebook
UPDATE