Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
Marco Maida
PROSA - Formally Proven Schedulability Analysis
Commits
92d1cf07
Commit
92d1cf07
authored
Jan 12, 2016
by
Felipe Cerqueira
Browse files
Give a better name to the equality relation
parent
ed7438a0
Changes
1
Show whitespace changes
Inline
Side-by-side
arrival_sequence.v
View file @
92d1cf07
...
...
@@ -48,9 +48,9 @@ Module ArrivalSequence.
(* Finally, we assume a decidable equality for JobIn. We don't care about
its definition. It's just to make JobIn compatible with ssreflect. *)
Definition
f
(
arr_seq
:
arrival_sequence
Job
)
:
=
Definition
jobin_eqde
f
(
arr_seq
:
arrival_sequence
Job
)
:
=
(
fun
j1
j2
:
JobIn
arr_seq
=>
(
JobIn_is_Job
j1
)
==
(
JobIn_is_Job
j2
)).
Axiom
eqn_jobin
:
forall
arr_seq
,
Equality
.
axiom
(
f
arr_seq
).
Axiom
eqn_jobin
:
forall
arr_seq
,
Equality
.
axiom
(
jobin_eqde
f
arr_seq
).
Canonical
jobin_eqMixin
arr_seq
:
=
EqMixin
(
eqn_jobin
arr_seq
).
Canonical
jobin_eqType
arr_seq
:
=
Eval
hnf
in
EqType
(
JobIn
arr_seq
)
(
jobin_eqMixin
arr_seq
).
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment