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

Implement partially decomposing with limited recursion depth. #75

Closed

discopt opened this issue Mar 18, 2024 · 1 comment · Fixed by #79

Assignees

Owner

discopt commented Mar 18, 2024

Instead of recomputing a whole tree, it would be interesting to process a node but stop with the unknown children.

discopt self-assigned this

Owner Author

discopt commented Mar 18, 2024

The relevant recursion depth is 1: turn an UNKNOWN node into something else whose children have UNKNOWN type.

discopt mentioned this issue

Implemented partial tree completion. #79

Merged

discopt linked a pull request

that will close this issue

Implemented partial tree completion. #79

Merged

discopt closed this as completed in #79

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment