Skip to content

Latest commit

 

History

History
8 lines (6 loc) · 339 Bytes

definitions.md

File metadata and controls

8 lines (6 loc) · 339 Bytes

Definitions

  1. Applicative can be thought of as characterizing monoidal functors in Haskell. For a Haskeller's purpose, it's a way to functionally apply a function which is embedded in structure f of the same type as the value your're mapping it over.
fmap  ::    (a -> b) -> f a -> f b
(<*>) :: f  (a -> b) -> f a -> f b