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||0.1.0.0, 0.1.1.0, 0.1.1.1, 0.1.2.0|
|Dependencies||base (>=4.8 && <4.11), 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 Dec 12 01:44:49 UTC 2017|
|Downloads||1006 total (62 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2017-12-12 [all 1 reports]
For package maintainers and hackage trustees