data-reify-cse 0.0.1 → 0.0.3

raw patch · 2 files changed

+8/−7 lines, 2 filesdep ~basedep ~containersdep ~data-reifyPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: base, containers, data-reify

API changes (from Hackage documentation)

Files

• data-reify-cse.cabal +5/−4
• src/Data/Reify/Graph/CSE.hs +3/−3

@@ -1,15 +1,16 @@ Name:             data-reify-cse-Version:          0.0.1+Version:          0.0.3 Description:      Common Sub-Expression Elimination for graphs generated by Data.Reify. Synopsis:         Common Sub-Expression Elimination for graphs generated by Data.Reify. Category:         Data, Language License:          BSD3 License-file:     LICENSE Author:           Sebastiaan Visser-Maintainer:       sfvisser@cs.uu.nl-Cabal-Version:    >= 1.6+Maintainer:       haskell@fvisser.nl Build-Type:       Simple-Build-Depends:    base ==3.*, containers ==0.2.*, data-reify ==0.4.*+Build-Depends:    base       >= 3.0 && < 5.0+                , containers >= 0.2 && < 0.6+                , data-reify >= 0.4 && < 0.7  GHC-Options:      -Wall Extensions:       CPP

@@ -37,8 +37,9 @@ -- semantics. Evidently, we assume our language is referential transparent language. -- -- >myTerm :: Fix Val--- >myTerm = In $ (Prim "2" `add` Prim "5") `mul` (Prim "2" `add` Prim "5")--- >  where add a b = Prim "+" `app` a `app` b+-- >myTerm = In $ clc `mul` clc+-- >  where clc = Prim "2" `add` Prim "5"+-- >        add a b = Prim "+" `app` a `app` b -- >        mul a b = Prim "*" `app` a `app` b -- >        app a b = App (In a) (In b) --@@ -67,7 +68,6 @@ import Data.Map (Map, toList, fromListWith, filter, update, mapKeysWith) import Data.Reify import Prelude hiding (filter)-import qualified Data.Map as Map  {- | Perform CSE on the input graph. -}