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

Consider predicates rerooting for RefinedSchema #1

Open
kachayev opened this issue Jun 17, 2018 · 0 comments
Open

Consider predicates rerooting for RefinedSchema #1

kachayev opened this issue Jun 17, 2018 · 0 comments
Labels
question Further information is requested

Comments

@kachayev
Copy link
Contributor

kachayev commented Jun 17, 2018 •
edited
Loading

The basic idea here is to update refined in a way, that

T1 = {v: T | P1(v)}
T2 = {v: T1 | P2(v)}

equals to

T2 = {v: T | P1(v) and P2(v)}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
question Further information is requested
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@kachayev