Commit dcff8ded authored by Robbert Krebbers's avatar Robbert Krebbers
Browse files

Use qualified module names and coqc -Q instead of -R.

parent 11790649
......@@ -3,7 +3,7 @@
(** This file collects common properties of pre-orders and semi lattices. This
theory will mainly be used for the theory on collections and finite maps. *)
Require Export Sorted.
Require Export base decidable tactics list.
Require Export prelude.base prelude.decidable prelude.tactics prelude.list.
(** * Arbitrary pre-, parial and total orders *)
(** Properties about arbitrary pre-, partial, and total orders. We do not use
......
......@@ -7,8 +7,8 @@ trees (uncompressed Patricia trees) and guarantees logarithmic-time operations.
However, we extend Leroy's implementation by packing the trees into a Sigma
type such that canonicity of representation is ensured. This is necesarry for
Leibniz equality to become extensional. *)
Require Import PArith mapset.
Require Export fin_maps.
Require Import PArith prelude.mapset.
Require Export prelude.fin_maps.
Local Open Scope positive_scope.
Local Hint Extern 0 (@eq positive _ _) => congruence.
......
(* Copyright (c) 2012-2015, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
Require Export
base
tactics
decidable
orders
option
vector
numbers
relations
collections
fin_collections
listset
list
lexico.
prelude.base
prelude.tactics
prelude.decidable
prelude.orders
prelude.option
prelude.vector
prelude.numbers
prelude.relations
prelude.collections
prelude.fin_collections
prelude.listset
prelude.list
prelude.lexico.
(* Copyright (c) 2012-2015, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
Require Export numbers option.
Require Import Ascii String relations.
Require Export prelude.numbers prelude.option.
Require Import Ascii String prelude.relations.
Infix "+:+" := String.append (at level 60, right associativity) : C_scope.
Arguments String.append _ _ : simpl never.
......
(* Copyright (c) 2012-2015, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file collects facts on proof irrelevant types/propositions. *)
Require Export Eqdep_dec tactics.
Require Export Eqdep_dec prelude.tactics.
Hint Extern 200 (ProofIrrel _) => progress (lazy beta) : typeclass_instances.
......
......@@ -5,7 +5,7 @@ These are particularly useful as we define the operational semantics as a
small step semantics. This file defines a hint database [ars] containing
some theorems on abstract rewriting systems. *)
Require Import Wf_nat.
Require Export tactics base.
Require Export prelude.tactics prelude.base.
(** * Definitions *)
Section definitions.
......
(* Copyright (c) 2012-2015, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file implements sets as functions into Prop. *)
Require Export prelude.
Require Export prelude.prelude.
Record set (A : Type) : Type := mkSet { set_car : A Prop }.
Arguments mkSet {_} _.
......@@ -28,4 +28,4 @@ Instance set_join : MJoin set := λ A (XX : set (set A)),
Instance set_collection_monad : CollectionMonad set.
Proof. by split; try apply _. Qed.
Global Opaque set_union set_intersection.
\ No newline at end of file
Global Opaque set_union set_intersection.
(* Copyright (c) 2012-2015, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
Require Export tactics.
Require Export prelude.tactics.
CoInductive stream (A : Type) : Type := scons : A stream A stream A.
Arguments scons {_} _ _.
......
......@@ -4,8 +4,8 @@
range over Coq's data type of strings [string]. The implementation uses radix-2
search trees (uncompressed Patricia trees) as implemented in the file [pmap]
and guarantees logarithmic-time operations. *)
Require Export fin_maps pretty.
Require Import Ascii String list pmap mapset.
Require Export prelude.fin_maps prelude.pretty.
Require Import Ascii String prelude.list prelude.pmap prelude.mapset.
(** * Encoding and decoding *)
(** In order to reuse or existing implementation of radix-2 search trees over
......
......@@ -3,7 +3,7 @@
(** This file collects general purpose tactics that are used throughout
the development. *)
Require Export Psatz.
Require Export base.
Require Export prelude.base.
Lemma f_equal_dep {A B} (f g : x : A, B x) x : f = g f x = g x.
Proof. intros ->; reflexivity. Qed.
......
......@@ -5,7 +5,7 @@
definitions from the standard library, but renames or changes their notations,
so that it becomes more consistent with the naming conventions in this
development. *)
Require Import list finite.
Require Import prelude.list prelude.finite.
Open Scope vector_scope.
(** * The fin type *)
......
......@@ -2,8 +2,8 @@
(* This file is distributed under the terms of the BSD license. *)
(** This files extends the implementation of finite over [positive] to finite
maps whose keys range over Coq's data type of binary naturals [Z]. *)
Require Import pmap mapset.
Require Export prelude fin_maps.
Require Import prelude.pmap prelude.mapset.
Require Export prelude.prelude prelude.fin_maps.
Local Open Scope Z_scope.
Record Zmap (A : Type) : Type :=
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment