Copyright | Copyright 2025 Yoo Chung |
---|---|
License | Apache-2.0 |
Maintainer | dev@chungyc.org |
Safe Haskell | None |
Language | GHC2021 |
This merges symbolic terms as much as it can to simplify expressions. Simplifications are finitely equivalent; i.e., any calculation with finite inputs should result in the equivalent finite input.
Synopsis
- simplify :: Expression -> Expression
Documentation
simplify :: Expression -> Expression Source #
Folds symbolic terms as much as it can to simplify expressions.
Assumes algebraic ring ordering has been applied.