Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Investigate the use of e-graph/equality saturation #64

Open
brandonwillard opened this issue Oct 5, 2022 · 0 comments
Open

Investigate the use of e-graph/equality saturation #64

brandonwillard opened this issue Oct 5, 2022 · 0 comments
Labels
enhancement New feature or request performance question Further information is requested stream processing Operations related to (goal) stream processing term rewriting

Comments

@brandonwillard
Copy link
Member

Per some external conversations, it might be worth looking into a means of encoding and enumerating stream disjunctions in a global e-graph-like miniKanren state and using those as part of the complete search process.

Basically, an e-graph-like structure would serve as a "global" component of a miniKanren state and consist of logic variable mappings that—unlike standard state objects—would map variables to multiple unification results, such as those arising from conde disjunctions.
@brandonwillard brandonwillard added enhancement New feature or request question Further information is requested stream processing Operations related to (goal) stream processing term rewriting performance labels Oct 5, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request performance question Further information is requested stream processing Operations related to (goal) stream processing term rewriting
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@brandonwillard