compdata-0.5: examples/Examples/Multi/EvalM.hs
{-# LANGUAGE TemplateHaskell, TypeOperators, MultiParamTypeClasses,
FlexibleInstances, FlexibleContexts, UndecidableInstances, GADTs,
OverlappingInstances #-}
--------------------------------------------------------------------------------
-- |
-- Module : Examples.Multi.EvalM
-- Copyright : (c) 2011 Patrick Bahr, Tom Hvitved
-- License : BSD3
-- Maintainer : Tom Hvitved <hvitved@diku.dk>
-- Stability : experimental
-- Portability : non-portable (GHC Extensions)
--
-- Monadic Expression Evaluation
--
-- The example illustrates how to use generalised compositional data types to
-- implement a small expression language, with a sub language of values, and a
-- monadic evaluation function mapping expressions to values.
--
--------------------------------------------------------------------------------
module Examples.Multi.EvalM where
import Data.Comp.Multi
import Data.Comp.Multi.Derive
import Control.Monad (liftM)
import Examples.Multi.Common
-- Monadic term evaluation algebra
class EvalM f v where
evalAlgM :: AlgM Maybe f (Term v)
$(derive [liftSum] [''EvalM])
evalM :: (HTraversable f, EvalM f v) => Term f i -> Maybe (Term v i)
evalM = cataM evalAlgM
instance (f :<: v) => EvalM f v where
evalAlgM = return . inject -- default instance
instance (Value :<: v) => EvalM Op v where
evalAlgM (Add x y) = do n1 <- projC x
n2 <- projC y
return $ iConst $ n1 + n2
evalAlgM (Mult x y) = do n1 <- projC x
n2 <- projC y
return $ iConst $ n1 * n2
evalAlgM (Fst v) = liftM fst $ projP v
evalAlgM (Snd v) = liftM snd $ projP v
projC :: (Value :<: v) => Term v Int -> Maybe Int
projC v = case project v of
Just (Const n) -> return n; _ -> Nothing
projP :: (Value :<: v) => Term v (a,b) -> Maybe (Term v a, Term v b)
projP v = case project v of
Just (Pair x y) -> return (x,y); _ -> Nothing
-- Example: evalMEx = Just (iConst 5)
evalMEx :: Maybe (Term Value Int)
evalMEx = evalM (iConst 1 `iAdd` (iConst 2 `iMult` iConst 2) :: Term Sig Int)