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
From heap_lang Require Export notation.
From iris.heap_lang Require Export notation.
Definition newbarrier : val := λ: <>, ref #0.
Definition signal : val := λ: "x", '"x" <- #1.
......
From barrier Require Import proof.
From heap_lang Require Import par.
From program_logic Require Import auth sts saved_prop hoare ownership.
From iris.barrier Require Import proof.
From iris.heap_lang Require Import par.
From iris.program_logic Require Import auth sts saved_prop hoare ownership.
Import uPred.
Definition worker (n : Z) : val :=
......
From prelude Require Import functions.
From algebra Require Import upred_big_op.
From program_logic Require Import sts saved_prop tactics.
From heap_lang Require Export heap wp_tactics.
From barrier Require Export barrier.
From barrier Require Import protocol.
From iris.prelude Require Import functions.
From iris.algebra Require Import upred_big_op.
From iris.program_logic Require Import sts saved_prop tactics.
From iris.heap_lang Require Export heap wp_tactics.
From iris.barrier Require Export barrier.
From iris.barrier Require Import protocol.
Import uPred.
(** The CMRAs we need. *)
......
From algebra Require Export sts.
From program_logic Require Import ghost_ownership.
From iris.algebra Require Export sts.
From iris.program_logic Require Import ghost_ownership.
(** The STS describing the main barrier protocol. Every state has an index-set
associated with it. These indices are actually [gname], because we use them
......
From program_logic Require Export hoare.
From barrier Require Export barrier.
From barrier Require Import proof.
From iris.program_logic Require Export hoare.
From iris.barrier Require Export barrier.
From iris.barrier Require Import proof.
Import uPred.
Section spec.
......
From heap_lang Require Export lifting.
From iris.heap_lang Require Export lifting.
Import uPred.
(** Define some derived forms, and derived lemmas about them. *)
......
From heap_lang Require Export lifting.
From algebra Require Import upred_big_op frac dec_agree.
From program_logic Require Export invariants ghost_ownership.
From program_logic Require Import ownership auth.
From iris.heap_lang Require Export lifting.
From iris.algebra Require Import upred_big_op frac dec_agree.
From iris.program_logic Require Export invariants ghost_ownership.
From iris.program_logic Require Import ownership auth.
Import uPred.
(* TODO: The entire construction could be generalized to arbitrary languages that have
a finmap as their state. Or maybe even beyond "as their state", i.e. arbitrary
......
From program_logic Require Export language.
From prelude Require Export strings.
From prelude Require Import gmap.
From iris.program_logic Require Export language.
From iris.prelude Require Export strings.
From iris.prelude Require Import gmap.
Module heap_lang.
Open Scope Z_scope.
......
From program_logic Require Export weakestpre.
From heap_lang Require Export lang.
From program_logic Require Import lifting.
From program_logic Require Import ownership. (* for ownP *)
From heap_lang Require Import tactics.
From iris.program_logic Require Export weakestpre.
From iris.heap_lang Require Export lang.
From iris.program_logic Require Import lifting.
From iris.program_logic Require Import ownership. (* for ownP *)
From iris.heap_lang Require Import tactics.
Import uPred.
Local Hint Extern 0 (language.reducible _ _) => do_step ltac:(eauto 2).
......
From heap_lang Require Export derived.
From iris.heap_lang Require Export derived.
Export heap_lang.
Arguments wp {_ _} _ _%E _.
......
From heap_lang Require Export heap spawn.
From heap_lang Require Import wp_tactics notation.
From iris.heap_lang Require Export heap spawn.
From iris.heap_lang Require Import wp_tactics notation.
Import uPred.
Definition par : val :=
......
From program_logic Require Export global_functor.
From heap_lang Require Export heap.
From heap_lang Require Import wp_tactics notation.
From iris.program_logic Require Export global_functor.
From iris.heap_lang Require Export heap.
From iris.heap_lang Require Import wp_tactics notation.
Import uPred.
Definition spawn : val :=
......
From heap_lang Require Export lang.
From iris.heap_lang Require Export lang.
Import heap_lang.
(** The tactic [simpl_subst] performs substitutions in the goal. Its behavior
......
From heap_lang Require Export substitution.
From prelude Require Import fin_maps.
From iris.heap_lang Require Export substitution.
From iris.prelude Require Import fin_maps.
Import heap_lang.
(** The tactic [inv_step] performs inversion on hypotheses of the shape
......
(** This file is essentially a bunch of testcases. *)
From program_logic Require Import ownership hoare auth.
From heap_lang Require Import wp_tactics heap notation.
From iris.program_logic Require Import ownership hoare auth.
From iris.heap_lang Require Import wp_tactics heap notation.
Import uPred.
Section LangTests.
......
From algebra Require Export upred_tactics.
From heap_lang Require Export tactics derived substitution.
From iris.algebra Require Export upred_tactics.
From iris.heap_lang Require Export tactics derived substitution.
Import uPred.
(** wp-specific helper tactics *)
......
(* Copyright (c) 2012-2015, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
(** This file implements bsets as functions into Prop. *)
From prelude Require Export prelude.
From iris.prelude Require Export prelude.
Record bset (A : Type) : Type := mkBSet { bset_car : A bool }.
Arguments mkBSet {_} _.
......
......@@ -2,8 +2,8 @@
(* This file is distributed under the terms of the BSD license. *)
(** This files implements an efficient implementation of finite/cofinite sets
of positive binary naturals [positive]. *)
From prelude Require Export collections.
From prelude Require Import pmap gmap mapset.
From iris.prelude Require Export collections.
From iris.prelude Require Import pmap gmap mapset.
Local Open Scope positive_scope.
(** * The tree data structure *)
......
......@@ -3,7 +3,7 @@
(** This file collects definitions and theorems on collections. Most
importantly, it implements some tactics to automatically solve goals involving
collections. *)
From prelude Require Export base tactics orders.
From iris.prelude Require Export base tactics orders.
Instance collection_subseteq `{ElemOf A C} : SubsetEq C := λ X Y,
x, x X x Y.
......
(* Copyright (c) 2012-2015, Robbert Krebbers. *)
(* This file is distributed under the terms of the BSD license. *)
From prelude Require Export list.
From iris.prelude Require Export list.
Local Open Scope positive.
Class Countable A `{ x y : A, Decision (x = y)} := {
......
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