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

Convert a Variables to two Admitted statements #54

Merged
merged 1 commit into from
Sep 10, 2024

Conversation

arnoudvanderleer
Copy link
Contributor

in a Birmingham 2017 exercise set, to make the CI compile again with coq 8.20 and above

@benediktahrens
Copy link
Member

I think a slightly better solution would be to put the Variables in a section? Using Variable signals that we consider those things variables, or hypotheses. Using Admitted might make one think that these are things that should be proved?

@arnoudvanderleer
Copy link
Contributor Author

Generally, this is true. However, in this case, the context of these variables was

(* FILL IN THE DEFINITIONS OF istrans AND issymm *)
(* Definition istrans {X : UU} (R : hrel X) : UU := *)
(* Definition issymm {X : UU} (R : hrel X) : UU := *)
Variables istrans issymm: forall {X: UU}, hrel X -> UU. (* to be deleted *)

So I think these actually were supposed to be proved (or constructed)

@benediktahrens
Copy link
Member

I think it is the types that are to be defined as an exercise, but not terms of those types?

@arnoudvanderleer
Copy link
Contributor Author

arnoudvanderleer commented Sep 9, 2024

The types of istrans and issymm are already filled in here, right? They are just forall {X : UU}, hrelX -> UU.
And why would it say to be deleted in the comment after Variables, and are there two commented Definition statements, if these things are supposed to be variables?

@arnoudvanderleer
Copy link
Contributor Author

arnoudvanderleer commented Sep 9, 2024

The corresponding part in the 2024-Minneapolis exercises is

(** ** Definitions *)

Definition hrel (X : UU) : UU := X -> X -> hProp.

Definition isrefl {X : UU} (R : hrel X) : UU
  := ∏ x : X, R x x.
Definition istrans {X : UU} (R : hrel X) : UU := fill_me.
Definition issymm {X : UU} (R : hrel X) : UU := fill_me.

Definition ispreorder {X : UU} (R : hrel X) : UU := istrans R × isrefl R.

@benediktahrens
Copy link
Member

@arnoudvanderleer : sorry, I had misread the code! This looks good, I'll merge.

@benediktahrens benediktahrens merged commit 752abd3 into UniMath:master Sep 10, 2024
1 check passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants