-
Notifications
You must be signed in to change notification settings - Fork 1
feat: arbitrary solutions for thm/ax challenges #7
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
Open
JasonGross
wants to merge
2
commits into
leanprover:master
Choose a base branch
from
JasonGross:arbitrary-solutions
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Conversation
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
We remove the error "Challenge and solution constant kind don't match" in favor of permitting any kind of solution to a challenge that is a theorem or axiom. Note that permitted axioms must still be declared as axioms or theorems in the solution; it would invite inconsistency if we allowed instantiating informative axioms with definitions. This allows challenges that demand the construction of terms of non-Prop types. Fixes #3 (mostly) Closes leanprover#5 (better alternative)
JasonGross
added a commit
to JasonGross/comparator
that referenced
this pull request
Dec 20, 2025
This PR allows challenges that demand the construction of terms of non-Prop types. We remove the error "Challenge and solution constant kind don't match" in favor of permitting any kind of solution to a challenge that is a theorem or axiom. Note that permitted axioms must still be declared as axioms or theorems in the solution; it would invite inconsistency if we allowed instantiating informative axioms with definitions. The optional field "allow_partial" indicates whether or not challenges may be solved with `partial def` solutions. We uniformly forbid unsafe solutions. We rely on the Lean kernel to mark as unsafe (resp. partial) any definitions that make use of unsafe (resp. partial) dependencies. Fixes #3 (mostly) Fixes #4 Closes leanprover#5 Closes leanprover#6 Closes leanprover#7
9962d2b to
a12b832
Compare
JasonGross
added a commit
to JasonGross/comparator
that referenced
this pull request
Dec 20, 2025
This PR allows challenges that demand the construction of terms of non-Prop types. We remove the error "Challenge and solution constant kind don't match" in favor of permitting any kind of solution to a challenge that is a theorem or axiom. Note that permitted axioms must still be declared as axioms or theorems in the solution; it would invite inconsistency if we allowed instantiating informative axioms with definitions. The optional field "allow_partial" indicates whether or not challenges may be solved with `partial def` solutions. We uniformly forbid unsafe solutions. We rely on the Lean kernel to mark as unsafe (resp. partial) any definitions that make use of unsafe (resp. partial) dependencies. Fixes #3 (mostly) Fixes #4 Closes leanprover#5 Closes leanprover#6 Closes leanprover#7
a12b832 to
b68a819
Compare
JasonGross
added a commit
to JasonGross/comparator
that referenced
this pull request
Dec 20, 2025
This PR allows challenges that demand the construction of terms of non-Prop types. We remove the error "Challenge and solution constant kind don't match" in favor of permitting any kind of solution to a challenge that is a theorem or axiom. Note that permitted axioms must still be declared as axioms or theorems in the solution; it would invite inconsistency if we allowed instantiating informative axioms with definitions. The optional field "allow_partial" indicates whether or not challenges may be solved with `partial def` solutions. We uniformly forbid unsafe solutions. We rely on the Lean kernel to mark as unsafe (resp. partial) any definitions that make use of unsafe (resp. partial) dependencies. Fixes #3 (mostly) Fixes #4 Closes leanprover#5 Closes leanprover#6 Closes leanprover#7
JasonGross
added a commit
to JasonGross/comparator
that referenced
this pull request
Dec 20, 2025
This PR allows challenges that demand the construction of terms of non-Prop types. We remove the error "Challenge and solution constant kind don't match" in favor of permitting any kind of solution to a challenge that is a theorem or axiom. Note that permitted axioms must still be declared as axioms or theorems in the solution; it would invite inconsistency if we allowed instantiating informative axioms with definitions. The optional field "allow_partial" indicates whether or not challenges may be solved with `partial def` solutions. We uniformly forbid unsafe solutions. We rely on the Lean kernel to mark as unsafe (resp. partial) any definitions that make use of unsafe (resp. partial) dependencies. Fixes #3 (mostly) Fixes #4 Closes leanprover#5 Closes leanprover#6 Closes leanprover#7
JasonGross
added a commit
to JasonGross/comparator
that referenced
this pull request
Dec 20, 2025
This PR allows challenges that demand the construction of terms of non-Prop types. We remove the error "Challenge and solution constant kind don't match" in favor of permitting any kind of solution to a challenge that is a theorem or axiom. Note that permitted axioms must still be declared as axioms or theorems in the solution; it would invite inconsistency if we allowed instantiating informative axioms with definitions. The optional field "allow_partial" indicates whether or not challenges may be solved with `partial def` solutions. We uniformly forbid unsafe solutions. We rely on the Lean kernel to mark as unsafe (resp. partial) any definitions that make use of unsafe (resp. partial) dependencies. Fixes #3 (mostly) Fixes #4 Closes leanprover#5 Closes leanprover#6 Closes leanprover#7
JasonGross
added a commit
to JasonGross/comparator
that referenced
this pull request
Dec 20, 2025
This PR allows challenges that demand the construction of terms of non-Prop types. We remove the error "Challenge and solution constant kind don't match" in favor of permitting any kind of solution to a challenge that is a theorem or axiom. Note that permitted axioms must still be declared as axioms or theorems in the solution; it would invite inconsistency if we allowed instantiating informative axioms with definitions. The optional field "allow_partial" indicates whether or not challenges may be solved with `partial def` solutions. We uniformly forbid unsafe solutions. We rely on the Lean kernel to mark as unsafe (resp. partial) any definitions that make use of unsafe (resp. partial) dependencies. Fixes #3 (mostly) Fixes #4 Closes leanprover#5 Closes leanprover#6 Closes leanprover#7
JasonGross
added a commit
to JasonGross/comparator
that referenced
this pull request
Dec 20, 2025
This PR allows challenges that demand the construction of terms of non-Prop types. We remove the error "Challenge and solution constant kind don't match" in favor of permitting any kind of solution to a challenge that is a theorem or axiom. Note that permitted axioms must still be declared as axioms or theorems in the solution; it would invite inconsistency if we allowed instantiating informative axioms with definitions. The optional field "allow_partial" indicates whether or not challenges may be solved with `partial def` solutions. We uniformly forbid unsafe solutions. We rely on the Lean kernel to mark as unsafe (resp. partial) any definitions that make use of unsafe (resp. partial) dependencies. Axioms is now responsible for ensuring that solutions to challenges are present and have valid kinds (no forbidden axioms recursively; only partial if permitted; not unsafe) Compare is is responsible for ensuring that: - targets are present and are axioms or theorems in the challenge file - targets have the same type in the challenge and solution - any dependency of a solution, which is not an explicit target, and which occurs in both the challenge and the solution, has the same contents in both Fixes #3 (mostly) Fixes #4 Closes leanprover#5 Closes leanprover#6 Closes leanprover#7
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
We remove the error "Challenge and solution constant kind don't match"
in favor of permitting any kind of solution to a challenge that is a
theorem or axiom.
Note that permitted axioms must still be declared as axioms or theorems
in the solution; it would invite inconsistency if we allowed
instantiating informative axioms with definitions.
This allows challenges that demand the construction of terms of non-Prop
types.
Fixes #3 (mostly)
Closes #5 (better alternative)