Cabal revisions of graph-rewriting-0.7.10
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
-Name: graph-rewriting-Version: 0.7.10-Copyright: (c) 2010, Jan Rochel-License: BSD3-License-File: LICENSE-Author: Jan Rochel-Maintainer: jan@rochel.info-Homepage: http://rochel.info/#graph-rewriting-Build-Type: Simple-Synopsis: Monadic graph rewriting of hypergraphs with ports and multiedges-Description:- This library provides a monadic EDSL to define your own port graph rewrite system in Haskell. Once you have specified the signature of your nodes and a set of rewrite rules, you can apply these rules on a graph to effect a graph transformation. The aim of this library is to make it as convenient as possible to define such a system and experiment with it and is not intended as a backend for high-performance computation.-Category: Graphs-Cabal-Version: >= 1.6-Extra-Source-Files: AUTHORS--Library- Build-Depends:- base >= 4.8 && < 4.10,- base-unicode-symbols >= 0.2 && < 0.3,- mtl >= 1.1 && < 2.3,- containers >= 0.3 && < 0.6- Exposed-Modules:- Data.View- GraphRewriting- GraphRewriting.Graph- GraphRewriting.Graph.Types- GraphRewriting.Graph.Read- GraphRewriting.Graph.Write- GraphRewriting.Graph.Write.Unsafe- GraphRewriting.Pattern- GraphRewriting.Pattern.InteractionNet- GraphRewriting.Rule- Other-Modules:- GraphRewriting.Graph.Internal- GraphRewriting.Pattern.Internal- GraphRewriting.Rule.Internal- Extensions:- UnicodeSyntax- FlexibleContexts- FlexibleInstances- TypeSynonymInstances- MultiParamTypeClasses- GeneralizedNewtypeDeriving- GHC-Options: -fno-warn-duplicate-exports -fwarn-unused-binds -fwarn-unused-imports -fwarn-unused-do-bind -fwarn-wrong-do-bind -fwarn-unrecognised-pragmas -fno-warn-tabs+Name: graph-rewriting +Version: 0.7.10 +x-revision: 1 +Copyright: (c) 2010, Jan Rochel +License: BSD3 +License-File: LICENSE +Author: Jan Rochel +Maintainer: jan@rochel.info +Homepage: http://rochel.info/#graph-rewriting +Build-Type: Simple +Synopsis: Monadic graph rewriting of hypergraphs with ports and multiedges +Description: + This library provides a monadic EDSL to define your own port graph rewrite system in Haskell. Once you have specified the signature of your nodes and a set of rewrite rules, you can apply these rules on a graph to effect a graph transformation. The aim of this library is to make it as convenient as possible to define such a system and experiment with it and is not intended as a backend for high-performance computation. +Category: Graphs +Cabal-Version: >= 1.6 +Extra-Source-Files: AUTHORS + +Library + Build-Depends: + base >= 4.8 && < 4.9, + base-unicode-symbols >= 0.2 && < 0.3, + mtl >= 1.1 && < 2.3, + containers >= 0.3 && < 0.6 + Exposed-Modules: + Data.View + GraphRewriting + GraphRewriting.Graph + GraphRewriting.Graph.Types + GraphRewriting.Graph.Read + GraphRewriting.Graph.Write + GraphRewriting.Graph.Write.Unsafe + GraphRewriting.Pattern + GraphRewriting.Pattern.InteractionNet + GraphRewriting.Rule + Other-Modules: + GraphRewriting.Graph.Internal + GraphRewriting.Pattern.Internal + GraphRewriting.Rule.Internal + Extensions: + UnicodeSyntax + FlexibleContexts + FlexibleInstances + TypeSynonymInstances + MultiParamTypeClasses + GeneralizedNewtypeDeriving + GHC-Options: -fno-warn-duplicate-exports -fwarn-unused-binds -fwarn-unused-imports -fwarn-unused-do-bind -fwarn-wrong-do-bind -fwarn-unrecognised-pragmas -fno-warn-tabs