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

Give the project a top-level name so it can be make installed.

Thanks to Amin Timany for the suggestion.
parent d72200d0
(* Copyright (c) 2012-2015, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
From prelude Require Export
From iris.prelude Require Export
base
tactics
orders
......
(* Copyright (c) 2012-2015, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
From prelude Require Export strings.
From prelude Require Import relations.
From iris.prelude Require Export strings.
From iris.prelude Require Import relations.
From Coq Require Import Ascii.
Class Pretty A := pretty : A string.
......
......@@ -2,7 +2,7 @@
(* This file is distributed under the terms of the BSD license. *)
(** This file collects facts on proof irrelevant types/propositions. *)
From Coq Require Import Eqdep_dec.
From prelude Require Export base.
From iris.prelude Require Export base.
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. *)
From Coq Require Import Wf_nat.
From prelude Require Export tactics base.
From iris.prelude Require Export tactics 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. *)
From prelude Require Export collections.
From iris.prelude Require Export collections.
Record set (A : Type) : Type := mkSet { set_car : A Prop }.
Add Printing Constructor set.
......
(* Copyright (c) 2012-2015, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
From prelude Require Export tactics.
From iris.prelude Require Export 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. *)
From prelude Require Export fin_maps pretty.
From prelude Require Import gmap.
From iris.prelude Require Export fin_maps pretty.
From iris.prelude Require Import gmap.
Notation stringmap := (gmap string).
Notation stringset := (gset string).
......
......@@ -2,7 +2,7 @@
(* This file is distributed under the terms of the BSD license. *)
From Coq Require Import Ascii.
From Coq Require Export String.
From prelude Require Export countable.
From iris.prelude Require Export countable.
(** * Fix scopes *)
Open Scope string_scope.
......
......@@ -4,7 +4,7 @@
the development. *)
From Coq Require Import Omega.
From Coq Require Export Psatz.
From prelude Require Export decidable.
From iris.prelude Require Export decidable.
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. *)
From prelude Require Import list finite.
From iris.prelude Require Import list 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]. *)
From prelude Require Import pmap mapset.
From prelude Require Export prelude fin_maps.
From iris.prelude Require Import pmap mapset.
From iris.prelude Require Export prelude fin_maps.
Local Open Scope Z_scope.
Record Zmap (A : Type) : Type :=
......
From program_logic Require Export hoare.
From program_logic Require Import wsat ownership.
From iris.program_logic Require Export hoare.
From iris.program_logic Require Import wsat ownership.
Local Hint Extern 10 (_ _) => omega.
Local Hint Extern 100 (@eq coPset _ _) => eassumption || set_solver.
Local Hint Extern 10 ({_} _) =>
......
From algebra Require Export auth upred_tactics.
From program_logic Require Export invariants ghost_ownership.
From iris.algebra Require Export auth upred_tactics.
From iris.program_logic Require Export invariants ghost_ownership.
Import uPred.
(* The CMRA we need. *)
......
From prelude Require Export functions.
From algebra Require Export iprod.
From program_logic Require Export pviewshifts global_functor.
From program_logic Require Import ownership.
From iris.prelude Require Export functions.
From iris.algebra Require Export iprod.
From iris.program_logic Require Export pviewshifts global_functor.
From iris.program_logic Require Import ownership.
Import uPred.
Definition own `{inG Λ Σ A} (γ : gname) (a : A) : iPropG Λ Σ :=
......
From algebra Require Export iprod.
From program_logic Require Export model.
From iris.algebra Require Export iprod.
From iris.program_logic Require Export model.
(** Index of a CMRA in the product of global CMRAs. *)
Definition gid := nat.
......
From program_logic Require Export weakestpre viewshifts.
From iris.program_logic Require Export weakestpre viewshifts.
Definition ht {Λ Σ} (E : coPset) (P : iProp Λ Σ)
(e : expr Λ) (Φ : val Λ iProp Λ Σ) : iProp Λ Σ :=
......
From algebra Require Import upred_tactics.
From program_logic Require Export hoare lifting.
From program_logic Require Import ownership.
From iris.algebra Require Import upred_tactics.
From iris.program_logic Require Export hoare lifting.
From iris.program_logic Require Import ownership.
Import uPred.
Local Notation "{{ P } } ef ?@ E {{ Φ } }" :=
......
From algebra Require Export base.
From program_logic Require Import ownership.
From program_logic Require Export namespaces pviewshifts weakestpre.
From iris.algebra Require Export base.
From iris.program_logic Require Import ownership.
From iris.program_logic Require Export namespaces pviewshifts weakestpre.
Import uPred.
Local Hint Extern 100 (@eq coPset _ _) => set_solver.
Local Hint Extern 100 (@subseteq coPset _ _) => set_solver.
......@@ -57,7 +57,7 @@ Qed.
Lemma pvs_open_close E N P Q R :
nclose N E
R inv N P
R ( P - pvs (E nclose N) (E nclose N) ( P Q))
R ( P - |={E nclose N}=> ( P Q))
R (|={E}=> Q).
Proof. intros. by apply: (inv_fsa pvs_fsa). Qed.
......@@ -68,7 +68,7 @@ Lemma wp_open_close E e N P Φ R :
R #> e @ E {{ Φ }}.
Proof. intros. by apply: (inv_fsa (wp_fsa e)). Qed.
Lemma inv_alloc N E P : nclose N E P pvs E E (inv N P).
Lemma inv_alloc N E P : nclose N E P |={E}=> inv N P.
Proof.
intros. rewrite -(pvs_mask_weaken N) //.
by rewrite /inv (pvs_allocI N); last apply coPset_suffixes_infinite.
......
From algebra Require Export cofe.
From iris.algebra Require Export cofe.
Structure language := Language {
expr : Type;
......
From program_logic Require Export weakestpre.
From program_logic Require Import wsat ownership.
From iris.program_logic Require Export weakestpre.
From iris.program_logic Require Import wsat ownership.
Local Hint Extern 10 (_ _) => omega.
Local Hint Extern 100 (@eq coPset _ _) => set_solver.
Local Hint Extern 10 ({_} _) =>
......
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