Practical type inference for arbitrary-rank types

DOI10.1017/S0956796806006034zbMath1107.68030OpenAlexW2131916293MaRDI QIDQ3419812

Stephanie Weirich, Mark B. Shields, Dimitrios Vytiniotis, Simon L. Peyton Jones

Publication date: 7 February 2007

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796806006034

zbMATH Keywords

Haskell

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (15)

Higher-Ranked Annotation Polymorphic Dependency Analysis ⋮ MRI: Modular reasoning about interference in incremental programming ⋮ Constraint handling rules with binders, patterns and generic quantification ⋮ A pattern for almost compositional functions ⋮ <scp>OutsideIn(X)</scp>Modular type inference with local assumptions ⋮ A language for generic programming in the large ⋮ Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism ⋮ Pragmatic gradual polymorphism with references ⋮ Visible Type Application ⋮ Factorising folds for faster functions ⋮ Signature restriction for polymorphic algebraic effects ⋮ HasCasl: integrated higher-order specification and program development ⋮ COCHIS: Stable and coherent implicits ⋮ Recasting ML\(^{\text F}\) ⋮ Type-level Computation Using Narrowing in Ωmega

Uses Software

• Haskell

This page was built for publication: Practical type inference for arbitrary-rank types