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

Formalize the duality between expressiveness and efficiency #5

Open
ptal opened this issue Feb 25, 2020 · 0 comments
Open

Formalize the duality between expressiveness and efficiency #5

ptal opened this issue Feb 25, 2020 · 0 comments
Labels
research type-inference

Comments

@ptal
Copy link
Owner

ptal commented Feb 25, 2020

For a constranit, we sometimes want the most specialized domain (e.g. x + y + 3z <= w on polyhedra) which is costly to execute, or sometimes the least specialized domain (e.g. x < 10 in box if x doesn't occur in other constraints) which is very efficient. This duality should be encoded in the inference engine.

This issue is a research project.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
research type-inference
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ptal