You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Aug 24, 2021. It is now read-only.
create a rose-tree by combining a value with a simplifier.
the result should be lazy in the sense that the simplifier function shouldn't be invoked until the rose-tree is searched.
combine 2 rose-trees
transform the value of a rose tree (map operator)
filter the values of a rose tree
the filter doesn't have to be perfect, and may search only up to an arbitrary depth-limit when it needs to find a new root
Note: The name is to be defined. Maybe SimplificationTree would be more appropriate since it serves the simplification process. Althought the datastructure is not specific to the simplification process and is really nothing more nor less than a rose-tree
The text was updated successfully, but these errors were encountered:
jcornaz
changed the title
Introduce RoseTree to represent simplifyable values
Introduce lazy RoseTree to represent simplifyable values
Nov 17, 2020
It should be possible to
map
operator)Note: The name is to be defined. Maybe
SimplificationTree
would be more appropriate since it serves the simplification process. Althought the datastructure is not specific to the simplification process and is really nothing more nor less than a rose-treeThe text was updated successfully, but these errors were encountered: