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
Open sidebar
David Swasey
coq-stdpp
Commits
5a73c4ed
Commit
5a73c4ed
authored
Feb 07, 2015
by
Robbert Krebbers
Browse files
Update copyright headers.
parent
b2109c25
Changes
32
Show whitespace changes
Inline
Side-by-side
Showing
20 changed files
with
20 additions
and
20 deletions
+20
-20
theories/ars.v
theories/ars.v
+1
-1
theories/assoc.v
theories/assoc.v
+1
-1
theories/base.v
theories/base.v
+1
-1
theories/collections.v
theories/collections.v
+1
-1
theories/countable.v
theories/countable.v
+1
-1
theories/decidable.v
theories/decidable.v
+1
-1
theories/error.v
theories/error.v
+1
-1
theories/fin_collections.v
theories/fin_collections.v
+1
-1
theories/fin_map_dom.v
theories/fin_map_dom.v
+1
-1
theories/fin_maps.v
theories/fin_maps.v
+1
-1
theories/finite.v
theories/finite.v
+1
-1
theories/fresh_numbers.v
theories/fresh_numbers.v
+1
-1
theories/hashset.v
theories/hashset.v
+1
-1
theories/lexico.v
theories/lexico.v
+1
-1
theories/list.v
theories/list.v
+1
-1
theories/listset.v
theories/listset.v
+1
-1
theories/listset_nodup.v
theories/listset_nodup.v
+1
-1
theories/mapset.v
theories/mapset.v
+1
-1
theories/natmap.v
theories/natmap.v
+1
-1
theories/nmap.v
theories/nmap.v
+1
-1
No files found.
theories/ars.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file collects definitions and theorems on abstract rewriting systems.
(** This file collects definitions and theorems on abstract rewriting systems.
These are particularly useful as we define the operational semantics as a
These are particularly useful as we define the operational semantics as a
...
...
theories/assoc.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** An implementation of finite maps and finite sets using association lists
(** An implementation of finite maps and finite sets using association lists
ordered by keys. Although the lookup and insert operation are linear-time, the
ordered by keys. Although the lookup and insert operation are linear-time, the
...
...
theories/base.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file collects type class interfaces, notations, and general theorems
(** This file collects type class interfaces, notations, and general theorems
that are used throughout the whole development. Most importantly it contains
that are used throughout the whole development. Most importantly it contains
...
...
theories/collections.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file collects definitions and theorems on collections. Most
(** This file collects definitions and theorems on collections. Most
importantly, it implements some tactics to automatically solve goals involving
importantly, it implements some tactics to automatically solve goals involving
...
...
theories/countable.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
Require
Export
list
.
Require
Export
list
.
Local
Obligation
Tactic
:
=
idtac
.
Local
Obligation
Tactic
:
=
idtac
.
...
...
theories/decidable.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file collects theorems, definitions, tactics, related to propositions
(** This file collects theorems, definitions, tactics, related to propositions
with a decidable equality. Such propositions are collected by the [Decision]
with a decidable equality. Such propositions are collected by the [Decision]
...
...
theories/error.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
Require
Export
list
.
Require
Export
list
.
...
...
theories/fin_collections.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file collects definitions and theorems on finite collections. Most
(** This file collects definitions and theorems on finite collections. Most
importantly, it implements a fold and size function and some useful induction
importantly, it implements a fold and size function and some useful induction
...
...
theories/fin_map_dom.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file provides an axiomatization of the domain function of finite
(** This file provides an axiomatization of the domain function of finite
maps. We provide such an axiomatization, instead of implementing the domain
maps. We provide such an axiomatization, instead of implementing the domain
...
...
theories/fin_maps.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** Finite maps associate data to keys. This file defines an interface for
(** Finite maps associate data to keys. This file defines an interface for
finite maps and collects some theory on it. Most importantly, it proves useful
finite maps and collects some theory on it. Most importantly, it proves useful
...
...
theories/finite.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
Require
Export
countable
list
.
Require
Export
countable
list
.
Obligation
Tactic
:
=
idtac
.
Obligation
Tactic
:
=
idtac
.
...
...
theories/fresh_numbers.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** Given a finite set of binary naturals [N], we generate a fresh element by
(** Given a finite set of binary naturals [N], we generate a fresh element by
taking the maximum, and adding one to it. We declare this operation as an
taking the maximum, and adding one to it. We declare this operation as an
...
...
theories/hashset.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file implements finite set using hash maps. Hash sets are represented
(** This file implements finite set using hash maps. Hash sets are represented
using radix-2 search trees. Each hash bucket is thus indexed using an binary
using radix-2 search trees. Each hash bucket is thus indexed using an binary
...
...
theories/lexico.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This files defines a lexicographic order on various common data structures
(** This files defines a lexicographic order on various common data structures
and proves that it is a partial order having a strong variant of trichotomy. *)
and proves that it is a partial order having a strong variant of trichotomy. *)
...
...
theories/list.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file collects general purpose definitions and theorems on lists that
(** This file collects general purpose definitions and theorems on lists that
are not in the Coq standard library. *)
are not in the Coq standard library. *)
...
...
theories/listset.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file implements finite set as unordered lists without duplicates
(** This file implements finite set as unordered lists without duplicates
removed. This implementation forms a monad. *)
removed. This implementation forms a monad. *)
...
...
theories/listset_nodup.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file implements finite as unordered lists without duplicates.
(** This file implements finite as unordered lists without duplicates.
Although this implementation is slow, it is very useful as decidable equality
Although this implementation is slow, it is very useful as decidable equality
...
...
theories/mapset.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This files gives an implementation of finite sets using finite maps with
(** This files gives an implementation of finite sets using finite maps with
elements of the unit type. Since maps enjoy extensional equality, the
elements of the unit type. Since maps enjoy extensional equality, the
...
...
theories/natmap.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This files implements a type [natmap A] of finite maps whose keys range
(** This files implements a type [natmap A] of finite maps whose keys range
over Coq's data type of unary natural numbers [nat]. The implementation equips
over Coq's data type of unary natural numbers [nat]. The implementation equips
...
...
theories/nmap.v
View file @
5a73c4ed
(* Copyright (c) 2012-201
4
, Robbert Krebbers. *)
(* Copyright (c) 2012-201
5
, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(* This file is distributed under the terms of the BSD license. *)
(** This files extends the implementation of finite over [positive] to finite
(** This files extends the implementation of finite over [positive] to finite
maps whose keys range over Coq's data type of binary naturals [N]. *)
maps whose keys range over Coq's data type of binary naturals [N]. *)
...
...
Prev
1
2
Next
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