haskell - Applicative functors other than monads and ZipList? -

Two famous examples of applications are Monads and Zipplists. Are there any other examples? Connor McBride:

From the

structure the police will note that < Code> D An application is another example of a fun, which is not a monad - by joining, things will be brought in the near future in the near future, and this will not be better though, however, where generally The heterogeneous ones only pull traceable panels (with so many elements with containers) If, D pulls through all the containers, then it is a little special. I wonder what this is.

and

D The brain represents a certain delay rather than an arbitrary one. I'm dividing time into discrete slices. In the next code, the type of DX a x is D (D x) , because of a x Slices occur at the time, and you can not turn it on anytime!

Read the full post to answer the immediate question, the author's conclusion is

Do not look!

Okay, this implementation is a thief.

  New type DX = D X show - SS, do not tell useless! Example Factor D where FMAP F (D x) = D (F x) example applies D where Pure = D F F; * & Gt; DS = D (F) Fix :: (D X -> X) - & gt; X fixed f = f (d (fine f))