Documentation

LeanPool.IrisAlgebra.Algebra.IProp

The recursive Iris proposition model over ordered ghost resources.

Copyright (c) The Iris-Lean Contributors.

@[reducible, inline]

The index type for the global family of ghost-resource functors.

Equations
Instances For
    structure Iris.GFunctor :
    Type (max (max (u + 1) (v + 1)) (w + 1))

    A resource functor admissible in the global ghost state: contractive, with affine algebras.

    Instances For
      structure Iris.BundledGFunctors :
      Type (max (max (u + 1) (v + 1)) (w + 1))

      A global family of admissible ghost-resource functors.

      • get : GType → GFunctor

        The resource functor assigned to each ghost-resource index.

      Instances For

        The global family assigning the constant unit resource to every index.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For

          Replace the resource functor at one global index.

          Equations
          Instances For
            @[reducible, inline]

            The natural-number names used for ghost-resource allocations.

            Equations
            Instances For
              @[reducible, inline]
              abbrev Iris.IResF (GF : BundledGFunctors) (α : Type u_1) (β : Type u_2) [COFE α] [COFE β] :
              Type u_3

              The global ghost-resource functor, built from finite-support maps.

              Equations
              Instances For

                The complete recursive domain used to define Iris propositions.

                Equations
                Instances For
                  @[instance_reducible]
                  Equations

                  The global unital ordered resource algebra over the recursive pre-propositions.

                  Equations
                  Instances For
                    @[instance_reducible]
                    Equations
                    @[reducible, inline]

                    Monotone step-indexed predicates over the global ghost-resource algebra.

                    Equations
                    Instances For

                      Map a proposition to its recursive pre-proposition representation.

                      Equations
                      Instances For

                        Map a recursive pre-proposition back to its proposition representation.

                        Equations
                        Instances For
                          theorem Iris.IProp.fold_unfold (GF : BundledGFunctors) (P : IProp GF) :
                          (fold GF).f ((unfold GF).f P) = P
                          theorem Iris.IProp.unfold_fold (GF : BundledGFunctors) (P : IPre GF) :
                          (unfold GF).f ((fold GF).f P) = P