Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
S
stdpp
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
35
Issues
35
List
Boards
Labels
Milestones
Merge Requests
2
Merge Requests
2
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Iris
stdpp
Commits
4b8807b2
Commit
4b8807b2
authored
Dec 18, 2017
by
Ralf Jung
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
fix changelog typos
parent
d3169b50
Pipeline
#5964
passed with stages
in 12 minutes and 46 seconds
Changes
1
Pipelines
1
Show whitespace changes
Inline
Sidebyside
Showing
1 changed file
with
7 additions
and
8 deletions
+7
8
CHANGELOG.md
CHANGELOG.md
+7
8
No files found.
CHANGELOG.md
View file @
4b8807b2
...
@@ 6,11 +6,11 @@ APIbreaking change is listed.
...
@@ 6,11 +6,11 @@ APIbreaking change is listed.
New features:
New features:

Many new lemmas about lists, vectors, sets, maps.

Many new lemmas about lists, vectors, sets, maps.

Equivalence proofs between
coq++ functions that have a different definition in

Equivalence proofs between
std++ functions and their alternative in the the
the
Coq standard library, e.g.
`List.nth`
,
`List.NoDop`
.
Coq standard library, e.g.
`List.nth`
,
`List.NoDop`
.

Type versions of the logical connectives and list predicates:

Type
class
versions of the logical connectives and list predicates:
`TCOr`
,
`TCAnd`
,
`TCTrue`
,
`TCForall`
,
`TCForall2`
.
`TCOr`
,
`TCAnd`
,
`TCTrue`
,
`TCForall`
,
`TCForall2`
.

A
connective
`tc_opaque`
to make definitions type class opaque.

A
function
`tc_opaque`
to make definitions type class opaque.

A type class
`Infinite`
for infinite types.

A type class
`Infinite`
for infinite types.

A generic implementation to obtain fresh elements of infinite types.

A generic implementation to obtain fresh elements of infinite types.

More theory about curry and uncurry functions on
`gmap`
.

More theory about curry and uncurry functions on
`gmap`
.
...
@@ 35,13 +35,12 @@ Changes to notations:
...
@@ 35,13 +35,12 @@ Changes to notations:

Operational type classes for lattice notations:
`⊑`
,
`⊓`
,
`⊔`
,
`⊤`
`⊥`
.

Operational type classes for lattice notations:
`⊑`
,
`⊓`
,
`⊔`
,
`⊤`
`⊥`
.

Replace
`⊥`
for disjointness with
`##`
, so that
`⊥`
can be used for the

Replace
`⊥`
for disjointness with
`##`
, so that
`⊥`
can be used for the
bottom lattice element.
bottom lattice element.

All notations are now in
`stdpp_scope`
with scope
`stdpp`

All notations are now in
`stdpp_scope`
with scope
key
`stdpp`
(formerly
`C_scope`
and
`C`
).
(formerly
`C_scope`
and
`C`
).

Stronger binding
for
`.1`
and
`.2`
that is compatible with ssreflect.

Higher precedence
for
`.1`
and
`.2`
that is compatible with ssreflect.

Various changes to monadic notation to improve compatibility with Mtac2:

Various changes to monadic notation
s
to improve compatibility with Mtac2:
+
Pattern matching notation for monadic bind
`'pat ← x; y`
where
`pat`
can
+
Pattern matching notation for monadic bind
`'pat ← x; y`
where
`pat`
can
be any Coq pattern.
be any Coq pattern.
+
Change the level of the donotation.
+
Change the level of the donotation.
+
`<$>`
is left associative.
+
`<$>`
is left associative.
+
Notation
`x ;; y`
for
`_ ← x; y`
.
+
Notation
`x ;; y`
for
`_ ← x; y`
.

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