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

Implement sorts in the core model-finding algorithm #49

Open
salmans opened this issue May 9, 2019 · 0 comments
Open

Implement sorts in the core model-finding algorithm #49

salmans opened this issue May 9, 2019 · 0 comments
Labels
question Further information is requested to investigate To learn about the root cause of the behavior

Comments

@salmans
Copy link
Owner

salmans commented May 9, 2019

Collecting some thoughts:

  • Sorted chase seems to be pretty straight forward
  • Sorted chase would dramatically improve performance (restricting the possible ways of instantiating sequents)
  • Requires change in the syntax of the parser
  • Reasoning about languages with types inherently requires a performant support for sorts

Questions

  • Do we want to preserve a non-sorted mode?
@salmans salmans added to investigate To learn about the root cause of the behavior question Further information is requested labels May 9, 2019
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 to investigate To learn about the root cause of the behavior
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@salmans