unique-logic: Solve simple simultaneous equations
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. We do not even check for consistency, since with floating point numbers even simple rules may not be consistent.
The modules ordered with respect to abstraction level:
UniqueLogic.ST.System: Construct and solve sets of functional dependencies. Example:
assignment3 (+) a b cmeaning dependency
a+b -> c.
UniqueLogic.ST.Rule: Combine functional dependencies to rules that can apply in multiple directions. Example:
add a b cmeans relation
a+b = cwhich resolves to dependencies
a+b -> c, c-a -> b, c-b -> a.
UniqueLogic.ST.Expression: Allow to write rules using arithmetic operators. It creates temporary variables automatically. Example:
(a+b)*c =:= dresolves to
a+b = x, x*c = d.
|Versions [faq]||0.2, 0.3, 0.4|
|Dependencies||base (==4.*), transformers (>=0.2 && <0.4), utility-ht (>=0.0.1 && <0.1) [details]|
|Maintainer||Henning Thielemann <firstname.lastname@example.org>|
|Source repo||this: darcs get http://code.haskell.org/~thielema/unique-logic/ --tag 0.2
head: darcs get http://code.haskell.org/~thielema/unique-logic/
|Uploaded||by HenningThielemann at Mon Jun 17 09:01:19 UTC 2013|
|Downloads||1053 total (45 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees