graph-rewriting 0.4.8 → 0.4.9

raw patch · 4 files changed

+7/−6 lines, 4 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• Data/View.hs +1/−1
• GraphRewriting/Rule.hs +4/−3
• LICENSE +1/−1
• graph-rewriting.cabal +1/−1

@@ -1,4 +1,4 @@--- | The multi-parameter type-class 'View' provides an abstraction @View v n@ of a type @n@ that exposes a value of type (@v@). It allows both to 'inspect' and 'update' the value, while hiding the internal structure of the value type (@n@).+-- | The multi-parameter type-class 'View' provides an abstraction @View v n@ of a type @n@ that exposes a value of type @v@. It allows both to 'inspect' and 'update' the value, while hiding the internal structure of the value type (@n@). module Data.View where  -- | Minimal complete definition: @inspect@ and one of {@update@, @adjust@}

@@ -16,7 +16,7 @@ import Data.Either  --- A rewriting rule is defined as a 'Pattern' that returns a 'Rewrite'+-- | A rewriting rule is defined as a 'Pattern' that returns a 'Rewrite' type Rule n = Pattern n (Rewrite n [Node])  -- rule construction ---------------------------------------------------------@@ -81,6 +81,7 @@ -- combinators ---------------------------------------------------------------  -- | Apply two rules consecutively. Second rule is only applied if first one succeeds. Fails if (and only if) first rule fails.+-- BUG: what if r2 deletes some of the nodes created in r1? Probably it's a bad idea, that the set of created nodes is returned by the rewrite at all. (>>>) ∷ Rule n → Rule n → Rule n r1 >>> r2 = do 	rw1 ← r1@@ -89,11 +90,11 @@ 		ns2 ← apply r2 		return (ns1 ⧺ ns2) --- | Apply a rule repeatedly as long as it is applicable. Fails if rule cannot be applied at all.+-- | Make a rule exhaustive, i.e. such that (when applied) it reduces redexes until no redexes are occur in the graph. exhaustive ∷ Rule n → Rule n exhaustive = foldr1 (>>>) . repeat --- | Apply a rule to all current redexes one by one. Neither new redexes or destroyed redexes are reduced.+-- | Make a rule parallel, i.e. such that (when applied) all current redexes are contracted one by one. Neither new redexes or destroyed redexes are reduced. everywhere ∷ Rule n → Rule n everywhere r = do 	ms ← matches r

@@ -5,6 +5,6 @@  * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.-* Neither the name of the <ORGANIZATION> nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.+* Neither the name of the University of Utrecht nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

@@ -1,5 +1,5 @@ Name:           graph-rewriting-Version:        0.4.8+Version:        0.4.9 Copyright:      (c) 2010, Jan Rochel License:        BSD3 License-File:   LICENSE