Getting started with Haskell Language Overloaded Literals Foldable Traversable Lens QuickCheck Common GHC Language Extensions Free Monads Type Classes IO Record Syntax Partial Application Monoid Category Theory Lists Sorting Algorithms Type Families Monads Stack Generalized Algebraic Data Types Recursion Schemes Data.Text Using GHCi Strictness Syntax in Functions Functor Testing with Tasty Creating Custom Data Types Reactive-banana Optimization Concurrency Function composition Databases Data.Aeson - JSON in Haskell Higher-order functions Containers - Data.Map Fixity declarations Web Development Vectors Cabal Type algebra Arrows Typed holes Rewrite rules (GHC)Date and Time List Comprehensions Streaming IO Google Protocol Buffers Template Haskell & QuasiQuotes Phantom types Modules Tuples (Pairs, Triples, ...)Graphics with Gloss State Monad Pipes Infix operators Parallelism Parsing HTML with taggy-lens and lens Foreign Function Interface Gtk3 Monad Transformers Bifunctor Proxies Applicative Functor Common monads as free monads Common functors as the base of cofree comonads Arithmetic Role Arbitrary-rank polymorphism with RankNTypes GHCJS XML Reader / ReaderT Function call syntax Logging Attoparsec zipWithM Profunctor Type Application

Arbitrary-rank polymorphism with RankNTypes

RankNTypes

StackOverflow forces me to have one example. If this topic is approved, we should move this example here.

Syntax:

Arbitrary rank quantification is enabled with either the Rank2Types or RankNTypes language extension.
With this extension enabled, the forall keyword can be used to add higher-rank quantification.

Contributors

Topic Id: 8984

Example Ids: 27949

This site is not affiliated with any of the contributors.