Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
C
coq-stdpp
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Service Desk
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Incidents
Environments
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
David Swasey
coq-stdpp
Commits
d61ed9a8
Commit
d61ed9a8
authored
Mar 08, 2018
by
Robbert Krebbers
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Get rid of some deprecated notations.
parent
bd4a6a84
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
4 additions
and
4 deletions
+4
-4
theories/countable.v
theories/countable.v
+2
-2
theories/numbers.v
theories/numbers.v
+2
-2
No files found.
theories/countable.v
View file @
d61ed9a8
...
...
@@ -37,9 +37,9 @@ Section choice.
Context
`
{
Countable
A
}
(
P
:
A
→
Prop
).
Inductive
choose_step
:
relation
positive
:
=
|
choose_step_None
{
p
}
:
decode
(
A
:
=
A
)
p
=
None
→
choose_step
(
Psucc
p
)
p
|
choose_step_None
{
p
}
:
decode
(
A
:
=
A
)
p
=
None
→
choose_step
(
P
os
.
succ
p
)
p
|
choose_step_Some
{
p
}
{
x
:
A
}
:
decode
p
=
Some
x
→
¬
P
x
→
choose_step
(
Psucc
p
)
p
.
decode
p
=
Some
x
→
¬
P
x
→
choose_step
(
P
os
.
succ
p
)
p
.
Lemma
choose_step_acc
:
(
∃
x
,
P
x
)
→
Acc
choose_step
1
%
positive
.
Proof
.
intros
[
x
Hx
].
cut
(
∀
i
p
,
...
...
theories/numbers.v
View file @
d61ed9a8
...
...
@@ -223,10 +223,10 @@ Proof. by injection 1. Qed.
Instance
N_eq_dec
:
EqDecision
N
:
=
N
.
eq_dec
.
Program
Instance
N_le_dec
:
RelDecision
N
.
le
:
=
λ
x
y
,
match
Ncompare
x
y
with
Gt
=>
right
_
|
_
=>
left
_
end
.
match
N
.
compare
x
y
with
Gt
=>
right
_
|
_
=>
left
_
end
.
Solve
Obligations
with
naive_solver
.
Program
Instance
N_lt_dec
:
RelDecision
N
.
lt
:
=
λ
x
y
,
match
Ncompare
x
y
with
Lt
=>
left
_
|
_
=>
right
_
end
.
match
N
.
compare
x
y
with
Lt
=>
left
_
|
_
=>
right
_
end
.
Solve
Obligations
with
naive_solver
.
Instance
N_inhabited
:
Inhabited
N
:
=
populate
1
%
N
.
Instance
N_le_po
:
PartialOrder
(
≤
)%
N
.
...
...
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