homepage: ''
changelog-type: ''
hash: 4351626b6e1e38764a940db21224794bfe3a06db3b85000ba4c5485cff73aa41
test-bench-deps:
  dumb-cas: -any
  base: ! '>=4 && <5'
  tasty-hunit: -any
  tasty: ! '>=0.7'
maintainer: (@) jsagemue $ uni-koeln.de
synopsis: A computer “algebra” system that knows nothing about algebra, at the core.
changelog: ''
basic-deps:
  base: ! '>=4.8 && <4.11'
  unordered-containers: ! '>=0.2 && <0.3'
  decimal-literals: ! '>=0.1 && <0.2'
  containers: -any
  hashable: ! '>=1.2 && <1.3'
  template-haskell: -any
all-versions:
- '0.1.0.0'
author: Justus Sagemüller
latest: '0.1.0.0'
description-type: haddock
description: ! '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.

  standard pattern matching.'
license-name: GPL-3

Update from Hackage at 2017-07-24T13:23:38Z
Update from Hackage at 2017-07-24T13:23:38Z
