dumb-cas: A computer “algebra” system that knows nothing about algebra, at the core.
This is a framework for untyped, symbolic computations like a CAS does, without any baked-in rules whatsoever but the ability to define expressions very consisely, as well as any transformation rules you want. The idea is basically to combine the flexibility of a Lisp with the conciseness of a Regex engine, using syntax similar to Haskell's standard pattern matching.
|Versions [faq]||0.1.0.0, 0.1.1.0, 0.1.1.1, 0.1.2.0, 0.2.0.0|
|Dependencies||base (>=4.8 && <4.14), containers, decimal-literals (==0.1.*), hashable (==1.2.*), template-haskell, unordered-containers (==0.2.*) [details]|
|Maintainer||(@) jsagemue $ uni-koeln.de|
|Uploaded||by leftaroundabout at Tue Feb 12 12:42:59 UTC 2019|
|Downloads||1167 total (81 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