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.

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

Partial correctness with defined_f predicates #1609

Open
vkuncak opened this issue Dec 5, 2024 · 0 comments
Open

Partial correctness with defined_f predicates #1609

vkuncak opened this issue Dec 5, 2024 · 0 comments
Assignees
Labels

Comments

@vkuncak
Copy link
Collaborator

vkuncak commented Dec 5, 2024

If a function is annotated with @partial we can introduce a predicate that guards the case when it is equal to its recursive case. The function is always equal to the part of the body that contains calls to functions not proven terminating. For functions to be defined, the functions it calls should also be defined.

This seems more efficient encoding into formulas than the Option monad, but it should be sematically equivalent.
One could, however, first implement an option monad.

@vkuncak vkuncak added the feature label Dec 5, 2024
@vkuncak vkuncak self-assigned this Dec 5, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant