Skip to content
This repository has been archived by the owner on Aug 24, 2021. It is now read-only.

Introduce lazy RoseTree to represent simplifyable values #236

Open
jcornaz opened this issue Nov 17, 2020 · 0 comments
Open

Introduce lazy RoseTree to represent simplifyable values #236

jcornaz opened this issue Nov 17, 2020 · 0 comments

Comments

@jcornaz
Copy link
Owner

jcornaz commented Nov 17, 2020

It should be possible to

  • 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

@jcornaz jcornaz changed the title Introduce RoseTree to represent simplifyable values Introduce lazy RoseTree to represent simplifyable values Nov 17, 2020
@jcornaz jcornaz added this to the Simplification process rework milestone Feb 8, 2021
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant