Practical type inference for arbitrary-rank types

DOI10.1017/S0956796806006034MaRDI QIDQ3419812zbMATH OpenOpenAlexFDO

Authors Dimitrios Vytiniotis, Stephanie Weirich, Mark B. Shields, Simon 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)

Recommendations

• Boxy types, inference for higher-rank types and impredicativity
• FPH: first-class polymorphism for Haskell
• Type classes with more higher-order polymorphism
• Hindley-Milner elaboration in applicative style (functional pearl)
• HMF: simple type inference for first-class polymorphism

Cited in

(25)

• HasCasl: integrated higher-order specification and program development
• Recasting ML\(^{\text F}\)
• Threshold voting leads to type-revelation
• Visible type application
• Hindley-Milner elaboration in applicative style (functional pearl)
• Principal type inference for GADTs
• Type-level computation using narrowing in \(\Omega\)mega
• Factorising folds for faster functions
• A pattern for almost compositional functions
• Constraint handling rules with binders, patterns and generic quantification
• \textsc{OutsideIn(X)}: modular type inference with local assumptions
• COCHIS: stable and coherent implicits
• Modular inference of linear types for multiplicity-annotated arrows
• Higher-ranked annotation polymorphic dependency analysis
• Type Inference for Rank 2 Gradual Intersection Types
• FPH: first-class polymorphism for Haskell
• Complete and easy bidirectional typechecking for higher-rank polymorphism
• MRI: modular reasoning about interference in incremental programming
• A language for generic programming in the large
• Stratified type inference for generalized algebraic data types
• Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism
• Boxy types, inference for higher-rank types and impredicativity
• Sound and complete type inference for closed effect rows
• Pragmatic gradual polymorphism with references
• Signature restriction for polymorphic algebraic effects

Describes a project that uses

Uses Software

• Haskell

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3419812)