srtree-2.0.0.2: A general library to work with Symbolic Regression expression trees.

Copyright	(c) Fabricio Olivetti 2021 - 2024
License	BSD3
Maintainer	[email protected]
Stability	experimental
Portability
Safe Haskell	None
Language	Haskell2010

Algorithm.EqSat.Simplify

Description

Module containing the algebraic rules and simplification function.

Synopsis

data Rule
- = Pattern :=> Pattern
- | Pattern :==: Pattern
- | Rule :| Condition
simplifyEqSatDefault :: Fix SRTree -> Fix SRTree
applyMergeOnlyDftl :: forall (m :: Type -> Type). Monad m => CostFun -> EGraphST m ()
rewrites :: [Rule]
rewriteBasic :: [Rule]
rewritesFun :: [Rule]

Documentation

data Rule Source #

Constructors

Pattern :=> Pattern infix 3
Pattern :==: Pattern infix 3
Rule :\| Condition infixl 2

Instances

Instances details

Show Rule Source #
Instance details Defined in Algorithm.EqSat.DB Methods showsPrec :: Int -> Rule -> ShowS # show :: Rule -> String # showList :: [Rule] -> ShowS #

simplifyEqSatDefault :: Fix SRTree -> Fix SRTree Source #

simplify using the default parameters

applyMergeOnlyDftl :: forall (m :: Type -> Type). Monad m => CostFun -> EGraphST m () Source #

apply a single step of merge-only using default rules

rewrites :: [Rule] Source #

rewriteBasic :: [Rule] Source #

rewritesFun :: [Rule] Source #