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

City

Victoria / /

Company

Microsoft / /

Country

Canada / /

Currency

USD / /

/

Facility

Impredicative Polymorphism Dimitrios Vytiniotis Stephanie Weirich University of Pennsylvania / /

IndustryTerm

machinery / actual algorithm / type inference algorithm / function applications / decidable type inference algorithm / inference algorithm / low-level algorithm / simpler type inference algorithm / low-level constraint-based algorithm / /

Organization

University of Pennsylvania / /

Person

Peyton Jones / DamasMilner / /

Position

first author / General / programmer / /

ProgrammingLanguage

Haskell / R / ML / /

ProvinceOrState

British Columbia / Pennsylvania / Victoria / /

Technology

inference algorithm / decidable type inference algorithm / type inference algorithm / low-level algorithm / much simpler type inference algorithm / same algorithm / low-level constraint-based algorithm / actual algorithm / /

URL

www.cis.upenn.edu/~dimitriv/fph / /

SocialTag