codo-notation

A notation for comonads, analogous to the do-notation for monads.

LTS Haskell 14.27:0.5.2
Stackage Nightly 2019-09-21:0.5.2
Latest on Hackage:0.5.2

See all snapshots codo-notation appears in

BSD-3-Clause licensed and maintained by Dominic Orchard
This version can be pinned in stack with:codo-notation-0.5.2@sha256:f6d6fd39aa2f410db0910a49cc39d16b1712f11cbe8026f6b5047f4332ce2637,2783

Module documentation for 0.5.2

A notation for comonads, analogous to the do-notation for monads.

Requires the TemplateHaskell and QuasiQuotes extensions.

Example 1:

{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE QuasiQuotes #-}

import Control.Comonad
import Language.Haskell.Codo

foo :: (Comonad c, Num a) => c a -> a
foo = [codo| x => extract x + 1 |]

Example 2:

import Data.Monoid
instance Monoid Double where
       mempty = 0.0
       mappend = (+)

differentiate f = ((f 0.001) - f 0) / 0.001

minima :: (Double -> Double) -> Bool
minima = [codo| f => f'  <- differentiate f
                     f'' <- differentiate f'
                     (extract f' < 0.001) && (extract f'' > 0) |]

Further explanation of the syntax can be found in the following (short) paper: http://www.cl.cam.ac.uk/~dao29/drafts/codo-notation-orchard-ifl12.pdf with a numer of examples.

Further examples can be found here: https://github.com/dorchard/codo-notation.