Cabal revisions of unique-logic-tf-0.5.1
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
-Name: unique-logic-tf-Version: 0.5.1-License: BSD3-License-File: LICENSE-Author: Henning Thielemann-Maintainer: Henning Thielemann <haskell@henning-thielemann.de>-Homepage: http://hub.darcs.net/thielema/unique-logic-tf/-Category: Logic programming-Synopsis: Solve simple simultaneous equations-Description:- Solve a number of equations simultaneously.- This is not Computer Algebra,- better think of a kind of type inference algorithm- or logic programming with only one allowed solution.- .- Only one solution is computed.- Simultaneous equations with multiple solutions are not allowed.- However, variables may remain undefined.- The solver may optionally check for consistency.- It does not do so by default- since with floating point numbers or symbolic expressions- even simple rules may not be consistent.- .- The modules ordered with respect to abstraction level are:- .- * "UniqueLogic.ST.TF.System":- Construct and solve sets of functional dependencies.- Example: @assignment3 (+) a b c@ means dependency @a+b -> c@.- .- * "UniqueLogic.ST.TF.Rule":- Combine functional dependencies to rules- that can apply in multiple directions.- Example: @add a b c@ means relation @a+b = c@- which resolves to dependencies @a+b -> c, c-a -> b, c-b -> a@.- For an executable example see "UniqueLogic.ST.TF.Example.Rule".- .- * "UniqueLogic.ST.TF.Expression":- Allows to write rules using arithmetic operators.- It creates temporary variables automatically.- Example: @(a+b)*c =:= d@ resolves to @a+b = x, x*c = d@.- For an executable example see "UniqueLogic.ST.TF.Example.Expression".- .- * "UniqueLogic.ST.TF.System.Simple":- Provides specialised functions from "UniqueLogic.ST.TF.System"- for the case of a system without labels and consistency checks.- .- * "UniqueLogic.ST.TF.System.Label":- Provides a custom constructor for variables.- When creating a variable you decide whether and how- an assignment to this variable shall be logged.- There is an example that shows how to solve a logic system- using symbolic expressions.- The naming and logging allows us to observe shared intermediate results.- For an executable example see "UniqueLogic.ST.TF.Example.Label".- .- * By using more sophisticated monad transformers,- we can check the equations for consistency,- report inconsistencies and how they arised.- We demonstrate that in "UniqueLogic.ST.TF.Example.Verify".- .- This variant of the package requires type families.-Tested-With: GHC==7.4.2-Cabal-Version: >=1.8-Build-Type: Simple-Extra-Source-Files:- Changes.md--Source-Repository this- Tag: 0.5.1- Type: darcs- Location: http://hub.darcs.net/thielema/unique-logic-tf/--Source-Repository head- Type: darcs- Location: http://hub.darcs.net/thielema/unique-logic-tf/--Library- Build-Depends:- data-ref >=0.0 && <0.1,- transformers >=0.4 && <0.6,- semigroups >=0.1 && <1.0,- containers >=0.4 && <0.7,- utility-ht >=0.0.9 && <0.1,- base >= 4 && <5- GHC-Options: -Wall- Hs-Source-Dirs: src-- Exposed-Modules:- UniqueLogic.ST.TF.MonadTrans- UniqueLogic.ST.TF.System- UniqueLogic.ST.TF.System.Simple- UniqueLogic.ST.TF.System.Label- UniqueLogic.ST.TF.ZeroFractional- UniqueLogic.ST.TF.Rule- UniqueLogic.ST.TF.Expression- -- example modules- UniqueLogic.ST.TF.Example.Rule- UniqueLogic.ST.TF.Example.Label- UniqueLogic.ST.TF.Example.Expression- UniqueLogic.ST.TF.Example.Verify- UniqueLogic.ST.TF.Example.Term- UniqueLogic.ST.TF.Example.Incremental--Test-Suite test-unique-logic- Type: exitcode-stdio-1.0- Main-Is: src/UniqueLogic/ST/TF/Test.hs- GHC-Options: -Wall- Build-Depends:- unique-logic-tf,- QuickCheck >=2.4 && <3,- non-empty >=0.0 && <0.4,- transformers,- utility-ht,- semigroups,- base+Name: unique-logic-tf +Version: 0.5.1 +x-revision: 1 +License: BSD3 +License-File: LICENSE +Author: Henning Thielemann +Maintainer: Henning Thielemann <haskell@henning-thielemann.de> +Homepage: http://hub.darcs.net/thielema/unique-logic-tf/ +Category: Logic programming +Synopsis: Solve simple simultaneous equations +Description: + Solve a number of equations simultaneously. + This is not Computer Algebra, + better think of a kind of type inference algorithm + or logic programming with only one allowed solution. + . + Only one solution is computed. + Simultaneous equations with multiple solutions are not allowed. + However, variables may remain undefined. + The solver may optionally check for consistency. + It does not do so by default + since with floating point numbers or symbolic expressions + even simple rules may not be consistent. + . + The modules ordered with respect to abstraction level are: + . + * "UniqueLogic.ST.TF.System": + Construct and solve sets of functional dependencies. + Example: @assignment3 (+) a b c@ means dependency @a+b -> c@. + . + * "UniqueLogic.ST.TF.Rule": + Combine functional dependencies to rules + that can apply in multiple directions. + Example: @add a b c@ means relation @a+b = c@ + which resolves to dependencies @a+b -> c, c-a -> b, c-b -> a@. + For an executable example see "UniqueLogic.ST.TF.Example.Rule". + . + * "UniqueLogic.ST.TF.Expression": + Allows to write rules using arithmetic operators. + It creates temporary variables automatically. + Example: @(a+b)*c =:= d@ resolves to @a+b = x, x*c = d@. + For an executable example see "UniqueLogic.ST.TF.Example.Expression". + . + * "UniqueLogic.ST.TF.System.Simple": + Provides specialised functions from "UniqueLogic.ST.TF.System" + for the case of a system without labels and consistency checks. + . + * "UniqueLogic.ST.TF.System.Label": + Provides a custom constructor for variables. + When creating a variable you decide whether and how + an assignment to this variable shall be logged. + There is an example that shows how to solve a logic system + using symbolic expressions. + The naming and logging allows us to observe shared intermediate results. + For an executable example see "UniqueLogic.ST.TF.Example.Label". + . + * By using more sophisticated monad transformers, + we can check the equations for consistency, + report inconsistencies and how they arised. + We demonstrate that in "UniqueLogic.ST.TF.Example.Verify". + . + This variant of the package requires type families. +Tested-With: GHC==7.4.2 +Cabal-Version: >=1.8 +Build-Type: Simple +Extra-Source-Files: + Changes.md + +Source-Repository this + Tag: 0.5.1 + Type: darcs + Location: http://hub.darcs.net/thielema/unique-logic-tf/ + +Source-Repository head + Type: darcs + Location: http://hub.darcs.net/thielema/unique-logic-tf/ + +Library + Build-Depends: + data-ref >=0.0 && <0.1, + transformers >=0.4 && <0.7, + semigroups >=0.1 && <1.0, + containers >=0.4 && <0.7, + utility-ht >=0.0.9 && <0.1, + base >= 4 && <5 + GHC-Options: -Wall + Hs-Source-Dirs: src + + Exposed-Modules: + UniqueLogic.ST.TF.MonadTrans + UniqueLogic.ST.TF.System + UniqueLogic.ST.TF.System.Simple + UniqueLogic.ST.TF.System.Label + UniqueLogic.ST.TF.ZeroFractional + UniqueLogic.ST.TF.Rule + UniqueLogic.ST.TF.Expression + -- example modules + UniqueLogic.ST.TF.Example.Rule + UniqueLogic.ST.TF.Example.Label + UniqueLogic.ST.TF.Example.Expression + UniqueLogic.ST.TF.Example.Verify + UniqueLogic.ST.TF.Example.Term + UniqueLogic.ST.TF.Example.Incremental + +Test-Suite test-unique-logic + Type: exitcode-stdio-1.0 + Main-Is: src/UniqueLogic/ST/TF/Test.hs + GHC-Options: -Wall + Build-Depends: + unique-logic-tf, + QuickCheck >=2.4 && <3, + non-empty >=0.0 && <0.4, + transformers, + utility-ht, + semigroups, + base
revision 2
Name: unique-logic-tf Version: 0.5.1 -x-revision: 1 +x-revision: 2 License: BSD3 License-File: LICENSE Author: Henning Thielemann Library Build-Depends: - data-ref >=0.0 && <0.1, + data-ref >=0.0 && <0.2, transformers >=0.4 && <0.7, semigroups >=0.1 && <1.0, containers >=0.4 && <0.7,
revision 3
Name: unique-logic-tf Version: 0.5.1 -x-revision: 2 +x-revision: 3 License: BSD3 License-File: LICENSE Author: Henning Thielemann data-ref >=0.0 && <0.2, transformers >=0.4 && <0.7, semigroups >=0.1 && <1.0, - containers >=0.4 && <0.7, + containers >=0.4 && <0.8, utility-ht >=0.0.9 && <0.1, base >= 4 && <5 GHC-Options: -Wall
revision 4
Name: unique-logic-tf Version: 0.5.1 -x-revision: 3 +x-revision: 4 License: BSD3 License-File: LICENSE Author: Henning Thielemann data-ref >=0.0 && <0.2, transformers >=0.4 && <0.7, semigroups >=0.1 && <1.0, - containers >=0.4 && <0.8, + containers >=0.4 && <0.9, utility-ht >=0.0.9 && <0.1, base >= 4 && <5 GHC-Options: -Wall