refine reduction from HOL to HOL-Nat#37
Open
BilelGho wants to merge 117 commits into
Open
Conversation
Imp minus (wimmers#23)
Added final HOL version of the Cook-Levin thm
Collaborator
|
Does this have a nat version of the theorem main_hol_lemma? I couldn't find that |
…ns to HOL-computable
… reduced proof length (esp. aux)
Refinement to IMP- using namespaces
stuck on final state proof.
composition was applied in the wrong direction + not all side effects were zeroed-out
…session for Cook Levin Nat
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
4 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
HOL-natis a specification over HOL functions. aHOLfunction or definition isHOL-natif the argument(s) type as well as the return type are exclusivelynatand all the call-back functions are HOL.A refined function takes the same arguments as the original function,encoded as natural numbers, and returns the same the result, also encoded as a natural number.
In this branch a refinement of the already developed the reduction of a IMP- program (a polynomially bounded verificator for a NP problem) to a SAT formula is implemented. The equivalence between the initial function and the refined one is verified.