diff --git a/_sources/coq.rst.txt b/_sources/coq.rst.txt
index b899cfdd98..ef0cbffe03 100644
--- a/_sources/coq.rst.txt
+++ b/_sources/coq.rst.txt
@@ -44,7 +44,7 @@ file:
   def test(a: BigInt, b: BigInt, c: BigInt): BigInt = {
     require(a > b && c > BigInt(0))
     c + a
-  } ensuring( _ > c + b )
+ }.ensuring( _ > c + b )
 
 Running ``stainless-scalac --coq frontends/benchmarks/coq/Arith.scala``
 generates the file ``tmp/test.v`` which contains the following Coq definition.
diff --git a/_sources/faq.rst.txt b/_sources/faq.rst.txt
index c80f0acb18..6c56b13d9d 100644
--- a/_sources/faq.rst.txt
+++ b/_sources/faq.rst.txt
@@ -75,7 +75,7 @@ I have defined a size function on my algebraic data type.
   def size(l: List) : Int = (l match {
     case Nil => 0
     case Cons(_, t) => 1 + size(t)
-  }) ensuring(_ >= 0)
+  }).ensuring(_ >= 0)
 
 Stainless neither proves nor gives a counterexample. Why?
 
diff --git a/_sources/genc.rst.txt b/_sources/genc.rst.txt
index 584a4928a5..76cc2c865d 100644
--- a/_sources/genc.rst.txt
+++ b/_sources/genc.rst.txt
@@ -319,7 +319,7 @@ example:
     state.data(state.y) = 1
     state.stable = true
     if (state.y > 0) move()
-  }.ensuring(_ => state.stable)
+ }.ensuring(_ => state.stable)
 
 After compilation to C, we get the following function, with global declarations
 ``stable``, ``x``, ``y``, and ``data``.
diff --git a/_sources/ghost.rst.txt b/_sources/ghost.rst.txt
index 220d0cdecc..faa337ce7f 100644
--- a/_sources/ghost.rst.txt
+++ b/_sources/ghost.rst.txt
@@ -25,7 +25,7 @@ and prove that some properties are satisfied by the program.
 
   def sort(list: List[BigInt]): List[BigInt] = {
     /* ... */
-  } ensuring { res =>
+ }.ensuring { res =>
     res.contents == list.contents &&
     isSorted(res) &&
     res.size == l.size
@@ -104,21 +104,21 @@ Case study
         val result = _take()
         msgs = msgs.tailOption.getOrElse(Nil())
         result
-      } ensuring { res =>
+     }.ensuring { res =>
         res == old(this).msgs.headOption
       }
 
       @extern @pure
       private def _take(): Option[A] = {
         Option(queue.pollFirst())
-      } ensuring { res =>
+     }.ensuring { res =>
         res == msgs.headOption
       }
 
       @extern @pure
       def isEmpty: Boolean = {
         queue.size() == 0
-      } ensuring { res =>
+     }.ensuring { res =>
         res == msgs.isEmpty
       }
     }
@@ -127,7 +127,7 @@ Case study
       @extern @pure
       def empty[A]: MsgQueue[A] = {
         MsgQueue(new ArrayDeque(), Nil())
-      } ensuring { res =>
+     }.ensuring { res =>
         res.isEmpty && res.msgs.isEmpty
       }
     }
diff --git a/_sources/imperative.rst.txt b/_sources/imperative.rst.txt
index 819ea74877..5380333a07 100644
--- a/_sources/imperative.rst.txt
+++ b/_sources/imperative.rst.txt
@@ -212,7 +212,7 @@ properties:
   case class A(var x: Int)
   def inc(a: A): Unit = {
     a.x = a.x + 1
-  } ensuring(_ => a.x == old(a).x + 1)
+ }.ensuring(_ => a.x == old(a).x + 1)
 
 ``old`` can be wrapped around any identifier that is affected by the body. You can also use
 ``old`` for variables in scope, in the case of nested functions:
@@ -223,7 +223,7 @@ properties:
     var x = 0
     def inc(): Unit = {
       x = x + 1
-    } ensuring(_ => x == old(x) + 1)
+   }.ensuring(_ => x == old(x) + 1)
 
     inc(); inc();
     assert(x == 2)
@@ -472,7 +472,7 @@ the ``ReturnElimination`` phase. Here is a function taken from `ReturnInWhile.sc
 
       assert(false, "unreachable code")
       0
-    }.ensuring((res: Int) => res == n)
+   }.ensuring((res: Int) => res == n)
 
 After transformation, we get a recursive (local) function named ``returnWhile``
 that returns a control flow element to indicate whether the loop terminated
@@ -515,7 +515,7 @@ the postcondition of the top-level holds (see comment).
                 Proceed[Int, Unit](())
               }
           }
-        } ensuring {
+       }.ensuring {
           (cfWhile: ControlFlow[Int, Unit]) => cfWhile match {
             case Return(retValue) =>
               // we check the postcondition `retValue == n` of the top-level function
@@ -537,7 +537,7 @@ the postcondition of the top-level holds (see comment).
           assert(false, "unreachable code")
           0
       }
-    } ensuring {
+   }.ensuring {
       (res: Int) => res == n
     }
 
diff --git a/_sources/installation.rst.txt b/_sources/installation.rst.txt
index 63e5cf670e..9eb08f0e44 100644
--- a/_sources/installation.rst.txt
+++ b/_sources/installation.rst.txt
@@ -12,7 +12,7 @@ General Requirement
   It suffices to have headless OpenJDK JRE 17 (e.g. one that one gets with ``apt install openjdk-17-jre-headless`` on Debian/Ubuntu).
   Make sure that ``java -version`` reports a version starting with 1.17, such as ``openjdk version "1.17`` or ``java version "1.17``.
 
-Stainless bundles Scala compiler front-end and runs it before it starts compilation. We recommend using the Scala 3 front end (originally named dotty), though Scala 2 is also available.
+Stainless bundles Scala 3 compiler front-end and runs it before it starts compilation.
 
 .. _standalone-release:
 
@@ -158,19 +158,13 @@ Note that the dependencies specified in ``stainlessExtraDeps`` must be available
 Running Code with Stainless dependencies
 ----------------------------------------
 
-Using sources:
-
-1. Clone the sources from https://github.com/epfl-lara/stainless
+If you are debugging your scala code before running stainless on it (e.g. using a simple editor with `scala-cli --watch`), you can use this workflow with stainless as well; you just need to make sure that Stainless libraries are visible to the Scala compiler.
 
-2. Create a folder to put compiled Scala objects: ``mkdir -p ~/.scala_objects``
+The simplest way is to use the release package, which contains `stainless-cli` script, a simple wrapper around `scala-cli` that adds the jar dependency on the compiled and source version of stainless library.
 
-3. Compile your code (here in ``MyFile.scala``, though you can have more than one file) while referring to the Stainless library sources: ``scalac -d ~/.scala_objects $(find /path/to/stainless/frontends/library/stainless/ -name "*.scala") MyFile.scala``
+Building a jar:
 
-4. Run your code (replace ``MyMainClass`` with the name of your main object): ``scala -cp ~/.scala_objects MyMainClass``
-
-Using jar:
-
-You can package the Stainless library into a jar to avoid the need to compile it every time:
+You can package the Stainless library into a jar like this:
 
 .. code-block:: bash
 
@@ -182,11 +176,22 @@ Add the generated Stainless library jar file when invoking the compiler with ``s
 .. code-block:: bash
 
     $ mkdir -p ~/.scala_objects
-    $ scalac -d ~/.scala_objects -cp /path/to/stainless/frontends/library/target/scala-2.13/stainless-library_2.13-X.Y.Z-A-BCDEFGHI.jar MyFile1.scala MyFile2.scala # and so on
-    $ scala -cp ~/.scala_objects:/path/to/stainless/frontends/library/target/scala-2.13/stainless-library_2.13-X.Y.Z-A-BCDEFGHI.jar MyMainClass
+    $ scalac -d ~/.scala_objects -cp /path/to/stainless/frontends/library/target/scala-3.3.3/stainless-library_3-X.Y.Z-A-BCDEFGHI.jar MyFile1.scala MyFile2.scala # and so on
+    $ scala -cp ~/.scala_objects:/path/to/stainless/frontends/library/target/scala-3.3.3/stainless-library_3-X.Y.Z-A-BCDEFGHI.jar MyMainClass
 
 where ``X.Y.Z`` is the Stainless version and ``A-BCDEFGHI`` is some hash (which can be autocompleted by the terminal).
 
+Using sources:
+
+1. Clone the sources from https://github.com/epfl-lara/stainless
+
+2. Create a folder to put compiled Scala objects: ``mkdir -p ~/.scala_objects``
+
+3. Compile your code (here in ``MyFile.scala``, though you can have more than one file) while referring to the Stainless library sources: ``scalac -d ~/.scala_objects $(find /path/to/stainless/frontends/library/stainless/ -name "*.scala") MyFile.scala``
+
+4. Run your code (replace ``MyMainClass`` with the name of your main object): ``scala -cp ~/.scala_objects MyMainClass``
+
+
 .. _smt-solvers:
 
 External Solver Binaries
@@ -264,8 +269,10 @@ Get the sources of Stainless by cloning the official Stainless repository:
 
 .. code-block:: bash
 
-  $ git clone https://github.com/epfl-lara/stainless.git
+  $ git clone --recursive https://github.com/epfl-lara/stainless.git
   Cloning into 'stainless'...
+  $ cd stainless
+  $ git submodule update --init --recursive
 
 **Run SBT**
 
@@ -273,12 +280,11 @@ The following instructions will invoke SBT while using a stainless sub-directory
 
 .. code-block:: bash
 
-  $ cd stainless
   $ sbt universal:stage
 
 **Where to find generated files**
 
-The compilation will automatically generate the bash script ``stainless-dotty`` (and the Scala2 one ``stainless-scalac``).
+The compilation will automatically generate the bash script ``stainless-dotty``.
 
 You may want to introduce a soft-link from to a file called ``stainless``:
 
@@ -286,9 +292,6 @@ You may want to introduce a soft-link from to a file called ``stainless``:
 
   $ ln -s frontends/dotty/target/universal/stage/bin/stainless-dotty stainless
 
-and, for the Scala2 version of the front end,
-
-  $ ln -s frontends/scalac/target/universal/stage/bin/stainless-scalac stainless-scalac-old
 
 Analogous scripts work for various platforms and allow additional control over the execution, such as passing JVM arguments or system properties:
 
@@ -296,24 +299,25 @@ Analogous scripts work for various platforms and allow additional control over t
 
   $ stainless -Dscalaz3.debug.load=true -J-Xmx6G --help
 
-Note that Stainless is organized as a structure of several projects. The main project lives in ``core`` while the two available frontends can be found in ``frontends/dotty`` (and ``frontends/scalac``).  From a user point of view, this should most of the time be transparent and the build command should take care of everything.
+Note that Stainless is organized as a structure of several projects. The main project lives in ``core`` while the Scala 3 frontend can be found in ``frontends/dotty``.  From a user point of view, this should most of the time be transparent and the build command should take care of everything.
 
 Build from Source on Windows 10
 -------------------------------
 
-Before following the infrequently updated instructions in this section, considering running Ubuntu on Windows 10 (through e.g. WSL) and following the instructions for Linux.
+Before following the infrequently updated instructions in this section, considering running Ubuntu on Windows 10 (through e.g. WSL2) and following the instructions for Linux.
 
 Get the sources of Stainless by cloning the official Stainless repository. You will need a Git shell for windows, e.g.  `Git for Windows <https://git-for-windows.github.io/>`_.
 On Windows, please do not use ``sbt universal:stage`` as this generates a Windows batch file which is unusable, because it contains commands that are too long for Windows.
-Instead, please use ``sbt stainless-scalac-standalone/assembly`` as follows:
+Instead, please use ``sbt stainless-dotty-standalone/assembly`` as follows:
 
 .. code-block:: bash
 
-  $ git clone https://github.com/epfl-lara/stainless.git
+  $ git clone --recursive https://github.com/epfl-lara/stainless.git
   Cloning into 'stainless'...
   // ...
   $ cd stainless
-  $ sbt stainless-scalac-standalone/assembly
+  $ git submodule update --init --recursive
+  $ sbt stainless-dotty-standalone/assembly
   // takes about 1 minutes
 
 Running Stainless can then be done with the command: ``java -jar frontends\stainless-dotty-standalone\target\scala-3.3.3\stainless-dotty-standalone-{VERSION}.jar``, where ``VERSION`` denotes Stainless version.
diff --git a/_sources/intro.rst.txt b/_sources/intro.rst.txt
index 3203e7f894..16d423c5c5 100644
--- a/_sources/intro.rst.txt
+++ b/_sources/intro.rst.txt
@@ -70,7 +70,7 @@ precondition does hold. A simple example:
     } else {
       n * factorial(n - 1)
     }
-  } ensuring(res => res >= 0)
+ }.ensuring(res => res >= 0)
 
 Stainless generates a ``postcondition`` verification condition for the above
 function, corresponding to the predicate parameter to the ``ensuring``
@@ -128,7 +128,7 @@ can be shown terminating as follows:
   def M(n: BigInt): BigInt = {
     decreases(stainless.math.max(101 - n, 0))
     if (n > 100) n - 10 else M(M(n + 11))
-  } ensuring (_ == (if (n > 100) n - 10 else BigInt(91)))
+ }.ensuring(_ == (if (n > 100) n - 10 else BigInt(91)))
 
 
 It is also possible to add a pre-condition (``require(...)``) *before* ``decreases``.
diff --git a/_sources/laws.rst.txt b/_sources/laws.rst.txt
index 06d5a5f713..4df17eae5b 100644
--- a/_sources/laws.rst.txt
+++ b/_sources/laws.rst.txt
@@ -429,7 +429,7 @@ into methods with explicit postconditions.
      @abstract
      def law_associativity$0(x$109: A$85, y$25: A$85, z$11: A$85): Boolean = {
        <empty tree>[Boolean]
-     } ensuring {
+    }.ensuring {
        (res$82: Boolean) => res$82 && this.law_associativity$2(x$109, y$25, z$11)
      }
    }
@@ -448,7 +448,7 @@ into methods with explicit postconditions.
      @abstract
      def law_leftIdentity$0(x$110: A$86): Boolean = {
        <empty tree>[Boolean]
-     } ensuring {
+    }.ensuring {
        (res$77: Boolean) => res$77 && this.law_leftIdentity$1(x$110)
      }
 
@@ -461,14 +461,14 @@ into methods with explicit postconditions.
      @abstract
      def law_rightIdentity$0(x$111: A$86): Boolean = {
        <empty tree>[Boolean]
-     } ensuring {
+    }.ensuring {
        (res$80: Boolean) => res$80 && this.law_rightIdentity$2(x$111)
      }
 
      @law
      def law_associativity$1(x$112: A$86, y$26: A$86, z$12: A$86): Boolean = {
        this.law_associativity$2(x$112, y$26, z$12) && refineLaw$0[A$86](x$112, y$26, z$12)
-     } ensuring {
+    }.ensuring {
        (res$84: Boolean) => res$84 && this.law_associativity$2(x$112, y$26, z$12)
      }
    }
@@ -483,14 +483,14 @@ into methods with explicit postconditions.
      @derived(law_leftIdentity$0)
      def law_leftIdentity$2(x$119: BigInt): Boolean = {
        true
-     } ensuring {
+    }.ensuring {
        (res$84: Boolean) => this.law_leftIdentity$1(x$119)
      }
 
      @law
      def law_rightIdentity$1(x$115: BigInt): Boolean = {
        someProof$0
-     } ensuring {
+    }.ensuring {
        (res$79: Boolean) => res$79 && this.law_rightIdentity$2(x$115)
      }
 
@@ -498,7 +498,7 @@ into methods with explicit postconditions.
      @derived(law_associativity$0)
      def law_associativity$2(x$120: BigInt, y$29: BigInt, z$13: BigInt): Boolean = {
        true
-     } ensuring {
+    }.ensuring {
        (res$85: Boolean) => this.law_associativity$1(x$120, y$29, z$13)
      }
    }
@@ -539,7 +539,7 @@ There are a few things going on here:
      @abstract
      def law_associativity$0(x$109: A$85, y$25: A$85, z$11: A$85): Boolean = {
        <empty tree>[Boolean]
-     } ensuring {
+    }.ensuring {
        (res$82: Boolean) => res$82 && this.law_associativity$2(x$109, y$25, z$11)
      }
 
@@ -556,7 +556,7 @@ There are a few things going on here:
      @law
      def law_associativity$1(x$112: A$86, y$26: A$86, z$12: A$86): Boolean = {
        this.law_associativity$2(x$112, y$26, z$12) && refineLaw$0[A$86](x$112, y$26, z$12)
-     } ensuring {
+    }.ensuring {
        (res$84: Boolean) => res$84 && this.law_associativity$2(x$112, y$26, z$12)
      }
 
@@ -572,7 +572,7 @@ There are a few things going on here:
      @law
      def law_rightIdentity$1(x$115: BigInt): Boolean = {
        someProof$0
-     } ensuring {
+    }.ensuring {
        (res$79: Boolean) => res$79 && this.law_rightIdentity$2(x$115)
      }
 
@@ -590,7 +590,7 @@ There are a few things going on here:
      @derived(law_leftIdentity$0)
      def law_leftIdentity$2(x$119: BigInt): Boolean = {
        true
-     } ensuring {
+    }.ensuring {
        (res$84: Boolean) => this.law_leftIdentity$1(x$119)
      }
 
diff --git a/_sources/neon.rst.txt b/_sources/neon.rst.txt
index 866dbfe454..b9f99c3e61 100644
--- a/_sources/neon.rst.txt
+++ b/_sources/neon.rst.txt
@@ -87,7 +87,7 @@ answer this question, we need to have a look at the definition of the
   def ++(that: List[T]): List[T] = (this match {
     case Nil()       => that
     case Cons(x, xs) => Cons(x, xs ++ that)
-  }) ensuring { res => /* ... */ }
+  }).ensuring { res => /* ... */ }
 
 Note that the implementation of ``++`` is recursive in its first
 argument ``this`` but *not* in its second argument ``that``.  This is
@@ -292,7 +292,7 @@ verification conditions for postconditions, while ``check``'s are.
     def foo(): Unit = {
       assert(b1) // verification condition: b1
       check(b2)  // verification condition: b1 ==> b2
-    }.ensuring(_ => b3) // verification condition b2 ==> b3 (b1 might not be visible to the solver)
+   }.ensuring(_ => b3) // verification condition b2 ==> b3 (b1 might not be visible to the solver)
 
 
 .. _induction:
@@ -831,7 +831,7 @@ the rationality and positiveness properties are correctly preserved:
     def +(that: Rational): Rational = {
       require(isRational && that.isRational)
       Rational(n * that.d + that.n * d, d * that.d)
-    } ensuring { res =>
+   }.ensuring { res =>
       res.isRational &&
       (this.isPositive == that.isPositive ==> res.isPositive == this.isPositive)
     }
@@ -844,7 +844,7 @@ multiplication in a similar fashion:
     def *(that: Rational): Rational = {
       require(isRational && that.isRational)
       Rational(n * that.n, d * that.d)
-    } ensuring { res =>
+   }.ensuring { res =>
       res.isRational &&
       (res.isNonZero  == (this.isNonZero && that.isNonZero)) &&
       (res.isPositive == (!res.isNonZero || this.isPositive == that.isPositive))
@@ -916,7 +916,7 @@ induction on ``this`` inside the postcondition as follows:
         case Empty()       => Rational(0, 1)
         case Cons(x, w, m) => if (xs contains x) w + m(xs) else m(xs)
       }
-    } ensuring { res =>
+   }.ensuring { res =>
       res.isPositive because {
         this match {
           case Empty()       => trivial
diff --git a/_sources/purescala.rst.txt b/_sources/purescala.rst.txt
index 290e13ce03..f6640f2984 100644
--- a/_sources/purescala.rst.txt
+++ b/_sources/purescala.rst.txt
@@ -209,7 +209,7 @@ Multiple layers of inheritance are allowed, as is the ability to override concre
     def x(a: Int) = {
       require(a > 0)
       42
-    } ensuring { _ >= 0 }
+   }.ensuring { _ >= 0 }
   }
 
   case class C(c: Int) extends B {
@@ -217,7 +217,7 @@ Multiple layers of inheritance are allowed, as is the ability to override concre
       require(i >= 0)
       if (i == 0) 0
       else c + x(i-1)
-    } ensuring ( _ == c * i )
+   }.ensuring( _ == c * i )
   }
 
   case class D() extends B
@@ -247,7 +247,7 @@ syntax uses ``???`` and is as follows:
     def add[T](t: T): Set[T] = {
       require(!this.contains(t))
       (??? : Set[T])
-    }.ensuring(res => res.contains(t))
+   }.ensuring(res => res.contains(t))
   }
 
 You can then extend such abstract classes by concrete implementations, and
@@ -461,7 +461,7 @@ Postconditions constraint the resulting value, and is expressed using `ensuring`
 
   def foo(a: Int): Int = {
     a + 1
-  } ensuring { res => res > a }
+ }.ensuring { res => res > a }
 
 Body Assertions
 ***************
diff --git a/_sources/tutorial.rst.txt b/_sources/tutorial.rst.txt
index cc4eb0a501..512f45ceca 100644
--- a/_sources/tutorial.rst.txt
+++ b/_sources/tutorial.rst.txt
@@ -34,7 +34,7 @@ Consider the following definition inside of an object `TestMax`.
       val d = x - y
       if (d > 0) x
       else y
-    } ensuring(res =>
+   }.ensuring(res =>
       x <= res && y <= res && (res == x || res == y))
   }
 
@@ -142,7 +142,7 @@ expected, passes all the test cases).
       val d = x - y
       if (d > 0) x
       else y
-    } ensuring(res =>
+   }.ensuring(res =>
       x <= res && y <= res && (res == x || res == y))
 
 As a possibly simpler specification, we could have also
@@ -209,7 +209,7 @@ conditions on input, we use the `require` clause.
     val d = x - y
     if (d > 0) x
     else y
-  } ensuring (res =>
+ }.ensuring(res =>
     x <= res && y <= res && (res == x || res == y))
 
 This program verifies and indeed works correctly on
@@ -334,7 +334,7 @@ One useful way to do this is to define function as follows:
           if (rSize == Int.Max) rSize
           else 1 + rSize
         }
-    }) ensuring(res => res >= 0)
+    }).ensuring(res => res >= 0)
 
 The above ``isize`` function satisfies the usual recursive definition for all but a huge
 lists, returns a non-negative integer, and ensures that if isize returns a small
@@ -373,7 +373,7 @@ building block for an insertion sort.
       case Cons(e, rest) if (x < e) => Cons(x, Cons(e,rest))
       case Cons(e, rest) if (x > e) => Cons(e, sInsert(x,rest))
     }
-  } ensuring {(res:List) => isSorted(res)}
+ }.ensuring {(res:List) => isSorted(res)}
 
 Stainless verifies that the returned list is indeed sorted. Note
 how we are again using a recursively defined function to
@@ -391,7 +391,7 @@ Note, however, that a function such as this one is also correct.
     def fsInsert(x : BigInt, l : List) : List = {
       require(isSorted(l))
       Nil
-    } ensuring {(res:List) => isSorted(res)}
+   }.ensuring {(res:List) => isSorted(res)}
 
 So, our specification may be considered weak, because it does
 not say anything about the elements.
@@ -429,7 +429,7 @@ of the list.
       case Cons(e, rest) if (x < e) => Cons(x, Cons(e,rest))
       case Cons(e, rest) if (x > e) => Cons(e, sInsert(x,rest))
     }
-  } ensuring {(res:List) =>
+ }.ensuring {(res:List) =>
      isSorted(res) && content(res) == content(l) ++ Set(x)}
 
 To compute `content`, in this example we use sets (even
diff --git a/_sources/verification.rst.txt b/_sources/verification.rst.txt
index 06f05b71b7..65a12b50d2 100644
--- a/_sources/verification.rst.txt
+++ b/_sources/verification.rst.txt
@@ -52,7 +52,7 @@ the following for any number of parameters):
    def f(x: A): B = {
      require(prec)
      body
-   } ensuring(r => post)
+  }.ensuring(r => post)
 
 where, :math:`\mbox{prec}(x)` is a Boolean expression with free variables
 contained in :math:`\{ x \}`, :math:`\mbox{body}(x)` is an expression with
diff --git a/_sources/wrap.rst.txt b/_sources/wrap.rst.txt
index 7094bda356..ae1ec9a83e 100644
--- a/_sources/wrap.rst.txt
+++ b/_sources/wrap.rst.txt
@@ -114,7 +114,7 @@ for any key ``k`` of type ``K``, the result of ``TrieMapWrapper.empty`` does not
     @extern
     def empty[K, V]: TrieMapWrapper[K, V] = {
       TrieMapWrapper(TrieMap.empty[K, V])
-    } ensuring { res =>
+   }.ensuring { res =>
       forall((k: K) => !res.contains(k))
     }
   }
@@ -192,7 +192,7 @@ We can now define the other methods of interest, with their appropriate contract
     @extern
     def insert(k: K, v: V): Unit = {
       theMap.update(k, v)
-    } ensuring {
+   }.ensuring {
       this.contains(k) &&
       this.apply(k) == v
     }
@@ -208,7 +208,7 @@ We can now define the other methods of interest, with their appropriate contract
     @extern @pure
     def empty[K, V]: TrieMapWrapper[K, V] = {
       TrieMapWrapper(TrieMap.empty[K, V])
-    } ensuring { res =>
+   }.ensuring { res =>
       forall((k: K) => !res.contains(k))
     }
   }
diff --git a/_static/basic.css b/_static/basic.css
index 603f6a8798..f316efcb47 100644
--- a/_static/basic.css
+++ b/_static/basic.css
@@ -4,7 +4,7 @@
  *
  * Sphinx stylesheet -- basic theme.
  *
- * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2024 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
@@ -222,7 +222,7 @@ table.modindextable td {
 /* -- general body styles --------------------------------------------------- */
 
 div.body {
-    min-width: 450px;
+    min-width: 360px;
     max-width: 800px;
 }
 
@@ -237,14 +237,8 @@ a.headerlink {
     visibility: hidden;
 }
 
-a.brackets:before,
-span.brackets > a:before{
-    content: "[";
-}
-
-a.brackets:after,
-span.brackets > a:after {
-    content: "]";
+a:visited {
+    color: #551A8B;
 }
 
 h1:hover > a.headerlink,
@@ -335,12 +329,16 @@ p.sidebar-title {
     font-weight: bold;
 }
 
+nav.contents,
+aside.topic,
 div.admonition, div.topic, blockquote {
     clear: left;
 }
 
 /* -- topics ---------------------------------------------------------------- */
 
+nav.contents,
+aside.topic,
 div.topic {
     border: 1px solid #ccc;
     padding: 7px;
@@ -379,6 +377,8 @@ div.body p.centered {
 
 div.sidebar > :last-child,
 aside.sidebar > :last-child,
+nav.contents > :last-child,
+aside.topic > :last-child,
 div.topic > :last-child,
 div.admonition > :last-child {
     margin-bottom: 0;
@@ -386,6 +386,8 @@ div.admonition > :last-child {
 
 div.sidebar::after,
 aside.sidebar::after,
+nav.contents::after,
+aside.topic::after,
 div.topic::after,
 div.admonition::after,
 blockquote::after {
@@ -428,10 +430,6 @@ table.docutils td, table.docutils th {
     border-bottom: 1px solid #aaa;
 }
 
-table.footnote td, table.footnote th {
-    border: 0 !important;
-}
-
 th {
     text-align: left;
     padding-right: 5px;
@@ -615,19 +613,26 @@ ul.simple p {
     margin-bottom: 0;
 }
 
-dl.footnote > dt,
-dl.citation > dt {
+aside.footnote > span,
+div.citation > span {
     float: left;
-    margin-right: 0.5em;
 }
-
-dl.footnote > dd,
-dl.citation > dd {
+aside.footnote > span:last-of-type,
+div.citation > span:last-of-type {
+  padding-right: 0.5em;
+}
+aside.footnote > p {
+  margin-left: 2em;
+}
+div.citation > p {
+  margin-left: 4em;
+}
+aside.footnote > p:last-of-type,
+div.citation > p:last-of-type {
     margin-bottom: 0em;
 }
-
-dl.footnote > dd:after,
-dl.citation > dd:after {
+aside.footnote > p:last-of-type:after,
+div.citation > p:last-of-type:after {
     content: "";
     clear: both;
 }
@@ -644,10 +649,6 @@ dl.field-list > dt {
     padding-right: 5px;
 }
 
-dl.field-list > dt:after {
-    content: ":";
-}
-
 dl.field-list > dd {
     padding-left: 0.5em;
     margin-top: 0em;
@@ -673,6 +674,16 @@ dd {
     margin-left: 30px;
 }
 
+.sig dd {
+    margin-top: 0px;
+    margin-bottom: 0px;
+}
+
+.sig dl {
+    margin-top: 0px;
+    margin-bottom: 0px;
+}
+
 dl > dd:last-child,
 dl > dd:last-child > :last-child {
     margin-bottom: 0;
@@ -741,6 +752,14 @@ abbr, acronym {
     cursor: help;
 }
 
+.translated {
+    background-color: rgba(207, 255, 207, 0.2)
+}
+
+.untranslated {
+    background-color: rgba(255, 207, 207, 0.2)
+}
+
 /* -- code displays --------------------------------------------------------- */
 
 pre {
@@ -757,6 +776,7 @@ span.pre {
     -ms-hyphens: none;
     -webkit-hyphens: none;
     hyphens: none;
+    white-space: nowrap;
 }
 
 div[class*="highlight-"] {
diff --git a/_static/css/badge_only.css b/_static/css/badge_only.css
index e380325bc6..c718cee441 100644
--- a/_static/css/badge_only.css
+++ b/_static/css/badge_only.css
@@ -1 +1 @@
-.fa:before{-webkit-font-smoothing:antialiased}.clearfix{*zoom:1}.clearfix:after,.clearfix:before{display:table;content:""}.clearfix:after{clear:both}@font-face{font-family:FontAwesome;font-style:normal;font-weight:400;src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713?#iefix) format("embedded-opentype"),url(fonts/fontawesome-webfont.woff2?af7ae505a9eed503f8b8e6982036873e) format("woff2"),url(fonts/fontawesome-webfont.woff?fee66e712a8a08eef5805a46892932ad) format("woff"),url(fonts/fontawesome-webfont.ttf?b06871f281fee6b241d60582ae9369b9) format("truetype"),url(fonts/fontawesome-webfont.svg?912ec66d7572ff821749319396470bde#FontAwesome) format("svg")}.fa:before{font-family:FontAwesome;font-style:normal;font-weight:400;line-height:1}.fa:before,a .fa{text-decoration:inherit}.fa:before,a .fa,li .fa{display:inline-block}li .fa-large:before{width:1.875em}ul.fas{list-style-type:none;margin-left:2em;text-indent:-.8em}ul.fas li .fa{width:.8em}ul.fas li .fa-large:before{vertical-align:baseline}.fa-book:before,.icon-book:before{content:"\f02d"}.fa-caret-down:before,.icon-caret-down:before{content:"\f0d7"}.fa-caret-up:before,.icon-caret-up:before{content:"\f0d8"}.fa-caret-left:before,.icon-caret-left:before{content:"\f0d9"}.fa-caret-right:before,.icon-caret-right:before{content:"\f0da"}.rst-versions{position:fixed;bottom:0;left:0;width:300px;color:#fcfcfc;background:#1f1d1d;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;z-index:400}.rst-versions a{color:#2980b9;text-decoration:none}.rst-versions .rst-badge-small{display:none}.rst-versions .rst-current-version{padding:12px;background-color:#272525;display:block;text-align:right;font-size:90%;cursor:pointer;color:#27ae60}.rst-versions .rst-current-version:after{clear:both;content:"";display:block}.rst-versions .rst-current-version .fa{color:#fcfcfc}.rst-versions .rst-current-version .fa-book,.rst-versions .rst-current-version .icon-book{float:left}.rst-versions .rst-current-version.rst-out-of-date{background-color:#e74c3c;color:#fff}.rst-versions .rst-current-version.rst-active-old-version{background-color:#f1c40f;color:#000}.rst-versions.shift-up{height:auto;max-height:100%;overflow-y:scroll}.rst-versions.shift-up .rst-other-versions{display:block}.rst-versions .rst-other-versions{font-size:90%;padding:12px;color:grey;display:none}.rst-versions .rst-other-versions hr{display:block;height:1px;border:0;margin:20px 0;padding:0;border-top:1px solid #413d3d}.rst-versions .rst-other-versions dd{display:inline-block;margin:0}.rst-versions .rst-other-versions dd a{display:inline-block;padding:6px;color:#fcfcfc}.rst-versions.rst-badge{width:auto;bottom:20px;right:20px;left:auto;border:none;max-width:300px;max-height:90%}.rst-versions.rst-badge .fa-book,.rst-versions.rst-badge .icon-book{float:none;line-height:30px}.rst-versions.rst-badge.shift-up .rst-current-version{text-align:right}.rst-versions.rst-badge.shift-up .rst-current-version .fa-book,.rst-versions.rst-badge.shift-up .rst-current-version .icon-book{float:left}.rst-versions.rst-badge>.rst-current-version{width:auto;height:30px;line-height:30px;padding:0 6px;display:block;text-align:center}@media screen and (max-width:768px){.rst-versions{width:85%;display:none}.rst-versions.shift{display:block}}
\ No newline at end of file
+.clearfix{*zoom:1}.clearfix:after,.clearfix:before{display:table;content:""}.clearfix:after{clear:both}@font-face{font-family:FontAwesome;font-style:normal;font-weight:400;src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713?#iefix) format("embedded-opentype"),url(fonts/fontawesome-webfont.woff2?af7ae505a9eed503f8b8e6982036873e) format("woff2"),url(fonts/fontawesome-webfont.woff?fee66e712a8a08eef5805a46892932ad) format("woff"),url(fonts/fontawesome-webfont.ttf?b06871f281fee6b241d60582ae9369b9) format("truetype"),url(fonts/fontawesome-webfont.svg?912ec66d7572ff821749319396470bde#FontAwesome) format("svg")}.fa:before{font-family:FontAwesome;font-style:normal;font-weight:400;line-height:1}.fa:before,a .fa{text-decoration:inherit}.fa:before,a .fa,li .fa{display:inline-block}li .fa-large:before{width:1.875em}ul.fas{list-style-type:none;margin-left:2em;text-indent:-.8em}ul.fas li .fa{width:.8em}ul.fas li .fa-large:before{vertical-align:baseline}.fa-book:before,.icon-book:before{content:"\f02d"}.fa-caret-down:before,.icon-caret-down:before{content:"\f0d7"}.fa-caret-up:before,.icon-caret-up:before{content:"\f0d8"}.fa-caret-left:before,.icon-caret-left:before{content:"\f0d9"}.fa-caret-right:before,.icon-caret-right:before{content:"\f0da"}.rst-versions{position:fixed;bottom:0;left:0;width:300px;color:#fcfcfc;background:#1f1d1d;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;z-index:400}.rst-versions a{color:#2980b9;text-decoration:none}.rst-versions .rst-badge-small{display:none}.rst-versions .rst-current-version{padding:12px;background-color:#272525;display:block;text-align:right;font-size:90%;cursor:pointer;color:#27ae60}.rst-versions .rst-current-version:after{clear:both;content:"";display:block}.rst-versions .rst-current-version .fa{color:#fcfcfc}.rst-versions .rst-current-version .fa-book,.rst-versions .rst-current-version .icon-book{float:left}.rst-versions .rst-current-version.rst-out-of-date{background-color:#e74c3c;color:#fff}.rst-versions .rst-current-version.rst-active-old-version{background-color:#f1c40f;color:#000}.rst-versions.shift-up{height:auto;max-height:100%;overflow-y:scroll}.rst-versions.shift-up .rst-other-versions{display:block}.rst-versions .rst-other-versions{font-size:90%;padding:12px;color:grey;display:none}.rst-versions .rst-other-versions hr{display:block;height:1px;border:0;margin:20px 0;padding:0;border-top:1px solid #413d3d}.rst-versions .rst-other-versions dd{display:inline-block;margin:0}.rst-versions .rst-other-versions dd a{display:inline-block;padding:6px;color:#fcfcfc}.rst-versions.rst-badge{width:auto;bottom:20px;right:20px;left:auto;border:none;max-width:300px;max-height:90%}.rst-versions.rst-badge .fa-book,.rst-versions.rst-badge .icon-book{float:none;line-height:30px}.rst-versions.rst-badge.shift-up .rst-current-version{text-align:right}.rst-versions.rst-badge.shift-up .rst-current-version .fa-book,.rst-versions.rst-badge.shift-up .rst-current-version .icon-book{float:left}.rst-versions.rst-badge>.rst-current-version{width:auto;height:30px;line-height:30px;padding:0 6px;display:block;text-align:center}@media screen and (max-width:768px){.rst-versions{width:85%;display:none}.rst-versions.shift{display:block}}
\ No newline at end of file
diff --git a/_static/css/theme.css b/_static/css/theme.css
index 42c1cfee6e..19a446a0e7 100644
--- a/_static/css/theme.css
+++ b/_static/css/theme.css
@@ -1,4 +1,4 @@
-html{box-sizing:border-box}*,:after,:before{box-sizing:inherit}article,aside,details,figcaption,figure,footer,header,hgroup,nav,section{display:block}audio,canvas,video{display:inline-block;*display:inline;*zoom:1}[hidden],audio:not([controls]){display:none}*{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}html{font-size:100%;-webkit-text-size-adjust:100%;-ms-text-size-adjust:100%}body{margin:0}a:active,a:hover{outline:0}abbr[title]{border-bottom:1px dotted}b,strong{font-weight:700}blockquote{margin:0}dfn{font-style:italic}ins{background:#ff9;text-decoration:none}ins,mark{color:#000}mark{background:#ff0;font-style:italic;font-weight:700}.rst-content code,.rst-content tt,code,kbd,pre,samp{font-family:monospace,serif;_font-family:courier new,monospace;font-size:1em}pre{white-space:pre}q{quotes:none}q:after,q:before{content:"";content:none}small{font-size:85%}sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}sup{top:-.5em}sub{bottom:-.25em}dl,ol,ul{margin:0;padding:0;list-style:none;list-style-image:none}li{list-style:none}dd{margin:0}img{border:0;-ms-interpolation-mode:bicubic;vertical-align:middle;max-width:100%}svg:not(:root){overflow:hidden}figure,form{margin:0}label{cursor:pointer}button,input,select,textarea{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle}button,input{line-height:normal}button,input[type=button],input[type=reset],input[type=submit]{cursor:pointer;-webkit-appearance:button;*overflow:visible}button[disabled],input[disabled]{cursor:default}input[type=search]{-webkit-appearance:textfield;-moz-box-sizing:content-box;-webkit-box-sizing:content-box;box-sizing:content-box}textarea{resize:vertical}table{border-collapse:collapse;border-spacing:0}td{vertical-align:top}.chromeframe{margin:.2em 0;background:#ccc;color:#000;padding:.2em 0}.ir{display:block;border:0;text-indent:-999em;overflow:hidden;background-color:transparent;background-repeat:no-repeat;text-align:left;direction:ltr;*line-height:0}.ir br{display:none}.hidden{display:none!important;visibility:hidden}.visuallyhidden{border:0;clip:rect(0 0 0 0);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}.visuallyhidden.focusable:active,.visuallyhidden.focusable:focus{clip:auto;height:auto;margin:0;overflow:visible;position:static;width:auto}.invisible{visibility:hidden}.relative{position:relative}big,small{font-size:100%}@media print{body,html,section{background:none!important}*{box-shadow:none!important;text-shadow:none!important;filter:none!important;-ms-filter:none!important}a,a:visited{text-decoration:underline}.ir a:after,a[href^="#"]:after,a[href^="javascript:"]:after{content:""}blockquote,pre{page-break-inside:avoid}thead{display:table-header-group}img,tr{page-break-inside:avoid}img{max-width:100%!important}@page{margin:.5cm}.rst-content .toctree-wrapper>p.caption,h2,h3,p{orphans:3;widows:3}.rst-content .toctree-wrapper>p.caption,h2,h3{page-break-after:avoid}}.btn,.fa:before,.icon:before,.rst-content .admonition,.rst-content .admonition-title:before,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .code-block-caption .headerlink:before,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning,.rst-content code.download span:first-child:before,.rst-content dl dt .headerlink:before,.rst-content h1 .headerlink:before,.rst-content h2 .headerlink:before,.rst-content h3 .headerlink:before,.rst-content h4 .headerlink:before,.rst-content h5 .headerlink:before,.rst-content h6 .headerlink:before,.rst-content p.caption .headerlink:before,.rst-content table>caption .headerlink:before,.rst-content tt.download span:first-child:before,.wy-alert,.wy-dropdown .caret:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before,.wy-menu-vertical li.current>a,.wy-menu-vertical li.current>a span.toctree-expand:before,.wy-menu-vertical li.on a,.wy-menu-vertical li.on a span.toctree-expand:before,.wy-menu-vertical li span.toctree-expand:before,.wy-nav-top a,.wy-side-nav-search .wy-dropdown>a,.wy-side-nav-search>a,input[type=color],input[type=date],input[type=datetime-local],input[type=datetime],input[type=email],input[type=month],input[type=number],input[type=password],input[type=search],input[type=tel],input[type=text],input[type=time],input[type=url],input[type=week],select,textarea{-webkit-font-smoothing:antialiased}.clearfix{*zoom:1}.clearfix:after,.clearfix:before{display:table;content:""}.clearfix:after{clear:both}/*!
+html{box-sizing:border-box}*,:after,:before{box-sizing:inherit}article,aside,details,figcaption,figure,footer,header,hgroup,nav,section{display:block}audio,canvas,video{display:inline-block;*display:inline;*zoom:1}[hidden],audio:not([controls]){display:none}*{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}html{font-size:100%;-webkit-text-size-adjust:100%;-ms-text-size-adjust:100%}body{margin:0}a:active,a:hover{outline:0}abbr[title]{border-bottom:1px dotted}b,strong{font-weight:700}blockquote{margin:0}dfn{font-style:italic}ins{background:#ff9;text-decoration:none}ins,mark{color:#000}mark{background:#ff0;font-style:italic;font-weight:700}.rst-content code,.rst-content tt,code,kbd,pre,samp{font-family:monospace,serif;_font-family:courier new,monospace;font-size:1em}pre{white-space:pre}q{quotes:none}q:after,q:before{content:"";content:none}small{font-size:85%}sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}sup{top:-.5em}sub{bottom:-.25em}dl,ol,ul{margin:0;padding:0;list-style:none;list-style-image:none}li{list-style:none}dd{margin:0}img{border:0;-ms-interpolation-mode:bicubic;vertical-align:middle;max-width:100%}svg:not(:root){overflow:hidden}figure,form{margin:0}label{cursor:pointer}button,input,select,textarea{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle}button,input{line-height:normal}button,input[type=button],input[type=reset],input[type=submit]{cursor:pointer;-webkit-appearance:button;*overflow:visible}button[disabled],input[disabled]{cursor:default}input[type=search]{-webkit-appearance:textfield;-moz-box-sizing:content-box;-webkit-box-sizing:content-box;box-sizing:content-box}textarea{resize:vertical}table{border-collapse:collapse;border-spacing:0}td{vertical-align:top}.chromeframe{margin:.2em 0;background:#ccc;color:#000;padding:.2em 0}.ir{display:block;border:0;text-indent:-999em;overflow:hidden;background-color:transparent;background-repeat:no-repeat;text-align:left;direction:ltr;*line-height:0}.ir br{display:none}.hidden{display:none!important;visibility:hidden}.visuallyhidden{border:0;clip:rect(0 0 0 0);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}.visuallyhidden.focusable:active,.visuallyhidden.focusable:focus{clip:auto;height:auto;margin:0;overflow:visible;position:static;width:auto}.invisible{visibility:hidden}.relative{position:relative}big,small{font-size:100%}@media print{body,html,section{background:none!important}*{box-shadow:none!important;text-shadow:none!important;filter:none!important;-ms-filter:none!important}a,a:visited{text-decoration:underline}.ir a:after,a[href^="#"]:after,a[href^="javascript:"]:after{content:""}blockquote,pre{page-break-inside:avoid}thead{display:table-header-group}img,tr{page-break-inside:avoid}img{max-width:100%!important}@page{margin:.5cm}.rst-content .toctree-wrapper>p.caption,h2,h3,p{orphans:3;widows:3}.rst-content .toctree-wrapper>p.caption,h2,h3{page-break-after:avoid}}.btn,.fa:before,.icon:before,.rst-content .admonition,.rst-content .admonition-title:before,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .code-block-caption .headerlink:before,.rst-content .danger,.rst-content .eqno .headerlink:before,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning,.rst-content code.download span:first-child:before,.rst-content dl dt .headerlink:before,.rst-content h1 .headerlink:before,.rst-content h2 .headerlink:before,.rst-content h3 .headerlink:before,.rst-content h4 .headerlink:before,.rst-content h5 .headerlink:before,.rst-content h6 .headerlink:before,.rst-content p.caption .headerlink:before,.rst-content p .headerlink:before,.rst-content table>caption .headerlink:before,.rst-content tt.download span:first-child:before,.wy-alert,.wy-dropdown .caret:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before,.wy-menu-vertical li.current>a button.toctree-expand:before,.wy-menu-vertical li.on a button.toctree-expand:before,.wy-menu-vertical li button.toctree-expand:before,input[type=color],input[type=date],input[type=datetime-local],input[type=datetime],input[type=email],input[type=month],input[type=number],input[type=password],input[type=search],input[type=tel],input[type=text],input[type=time],input[type=url],input[type=week],select,textarea{-webkit-font-smoothing:antialiased}.clearfix{*zoom:1}.clearfix:after,.clearfix:before{display:table;content:""}.clearfix:after{clear:both}/*!
  *  Font Awesome 4.7.0 by @davegandy - http://fontawesome.io - @fontawesome
  *  License - http://fontawesome.io/license (Font: SIL OFL 1.1, CSS: MIT License)
- */@font-face{font-family:FontAwesome;src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713);src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713?#iefix&v=4.7.0) format("embedded-opentype"),url(fonts/fontawesome-webfont.woff2?af7ae505a9eed503f8b8e6982036873e) format("woff2"),url(fonts/fontawesome-webfont.woff?fee66e712a8a08eef5805a46892932ad) format("woff"),url(fonts/fontawesome-webfont.ttf?b06871f281fee6b241d60582ae9369b9) format("truetype"),url(fonts/fontawesome-webfont.svg?912ec66d7572ff821749319396470bde#fontawesomeregular) format("svg");font-weight:400;font-style:normal}.fa,.icon,.rst-content .admonition-title,.rst-content .code-block-caption .headerlink,.rst-content code.download span:first-child,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content table>caption .headerlink,.rst-content tt.download span:first-child,.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand,.wy-menu-vertical li span.toctree-expand{display:inline-block;font:normal normal normal 14px/1 FontAwesome;font-size:inherit;text-rendering:auto;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale}.fa-lg{font-size:1.33333em;line-height:.75em;vertical-align:-15%}.fa-2x{font-size:2em}.fa-3x{font-size:3em}.fa-4x{font-size:4em}.fa-5x{font-size:5em}.fa-fw{width:1.28571em;text-align:center}.fa-ul{padding-left:0;margin-left:2.14286em;list-style-type:none}.fa-ul>li{position:relative}.fa-li{position:absolute;left:-2.14286em;width:2.14286em;top:.14286em;text-align:center}.fa-li.fa-lg{left:-1.85714em}.fa-border{padding:.2em .25em .15em;border:.08em solid #eee;border-radius:.1em}.fa-pull-left{float:left}.fa-pull-right{float:right}.fa-pull-left.icon,.fa.fa-pull-left,.rst-content .code-block-caption .fa-pull-left.headerlink,.rst-content .fa-pull-left.admonition-title,.rst-content code.download span.fa-pull-left:first-child,.rst-content dl dt .fa-pull-left.headerlink,.rst-content h1 .fa-pull-left.headerlink,.rst-content h2 .fa-pull-left.headerlink,.rst-content h3 .fa-pull-left.headerlink,.rst-content h4 .fa-pull-left.headerlink,.rst-content h5 .fa-pull-left.headerlink,.rst-content h6 .fa-pull-left.headerlink,.rst-content p.caption .fa-pull-left.headerlink,.rst-content table>caption .fa-pull-left.headerlink,.rst-content tt.download span.fa-pull-left:first-child,.wy-menu-vertical li.current>a span.fa-pull-left.toctree-expand,.wy-menu-vertical li.on a span.fa-pull-left.toctree-expand,.wy-menu-vertical li span.fa-pull-left.toctree-expand{margin-right:.3em}.fa-pull-right.icon,.fa.fa-pull-right,.rst-content .code-block-caption .fa-pull-right.headerlink,.rst-content .fa-pull-right.admonition-title,.rst-content code.download span.fa-pull-right:first-child,.rst-content dl dt .fa-pull-right.headerlink,.rst-content h1 .fa-pull-right.headerlink,.rst-content h2 .fa-pull-right.headerlink,.rst-content h3 .fa-pull-right.headerlink,.rst-content h4 .fa-pull-right.headerlink,.rst-content h5 .fa-pull-right.headerlink,.rst-content h6 .fa-pull-right.headerlink,.rst-content p.caption .fa-pull-right.headerlink,.rst-content table>caption .fa-pull-right.headerlink,.rst-content tt.download span.fa-pull-right:first-child,.wy-menu-vertical li.current>a span.fa-pull-right.toctree-expand,.wy-menu-vertical li.on a span.fa-pull-right.toctree-expand,.wy-menu-vertical li span.fa-pull-right.toctree-expand{margin-left:.3em}.pull-right{float:right}.pull-left{float:left}.fa.pull-left,.pull-left.icon,.rst-content .code-block-caption .pull-left.headerlink,.rst-content .pull-left.admonition-title,.rst-content code.download span.pull-left:first-child,.rst-content dl dt .pull-left.headerlink,.rst-content h1 .pull-left.headerlink,.rst-content h2 .pull-left.headerlink,.rst-content h3 .pull-left.headerlink,.rst-content h4 .pull-left.headerlink,.rst-content h5 .pull-left.headerlink,.rst-content h6 .pull-left.headerlink,.rst-content p.caption .pull-left.headerlink,.rst-content table>caption .pull-left.headerlink,.rst-content tt.download span.pull-left:first-child,.wy-menu-vertical li.current>a span.pull-left.toctree-expand,.wy-menu-vertical li.on a span.pull-left.toctree-expand,.wy-menu-vertical li span.pull-left.toctree-expand{margin-right:.3em}.fa.pull-right,.pull-right.icon,.rst-content .code-block-caption .pull-right.headerlink,.rst-content .pull-right.admonition-title,.rst-content code.download span.pull-right:first-child,.rst-content dl dt .pull-right.headerlink,.rst-content h1 .pull-right.headerlink,.rst-content h2 .pull-right.headerlink,.rst-content h3 .pull-right.headerlink,.rst-content h4 .pull-right.headerlink,.rst-content h5 .pull-right.headerlink,.rst-content h6 .pull-right.headerlink,.rst-content p.caption .pull-right.headerlink,.rst-content table>caption .pull-right.headerlink,.rst-content tt.download span.pull-right:first-child,.wy-menu-vertical li.current>a span.pull-right.toctree-expand,.wy-menu-vertical li.on a span.pull-right.toctree-expand,.wy-menu-vertical li span.pull-right.toctree-expand{margin-left:.3em}.fa-spin{-webkit-animation:fa-spin 2s linear infinite;animation:fa-spin 2s linear infinite}.fa-pulse{-webkit-animation:fa-spin 1s steps(8) infinite;animation:fa-spin 1s steps(8) infinite}@-webkit-keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(359deg);transform:rotate(359deg)}}@keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(359deg);transform:rotate(359deg)}}.fa-rotate-90{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=1)";-webkit-transform:rotate(90deg);-ms-transform:rotate(90deg);transform:rotate(90deg)}.fa-rotate-180{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=2)";-webkit-transform:rotate(180deg);-ms-transform:rotate(180deg);transform:rotate(180deg)}.fa-rotate-270{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=3)";-webkit-transform:rotate(270deg);-ms-transform:rotate(270deg);transform:rotate(270deg)}.fa-flip-horizontal{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=0, mirror=1)";-webkit-transform:scaleX(-1);-ms-transform:scaleX(-1);transform:scaleX(-1)}.fa-flip-vertical{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=2, mirror=1)";-webkit-transform:scaleY(-1);-ms-transform:scaleY(-1);transform:scaleY(-1)}:root .fa-flip-horizontal,:root .fa-flip-vertical,:root .fa-rotate-90,:root .fa-rotate-180,:root .fa-rotate-270{filter:none}.fa-stack{position:relative;display:inline-block;width:2em;height:2em;line-height:2em;vertical-align:middle}.fa-stack-1x,.fa-stack-2x{position:absolute;left:0;width:100%;text-align:center}.fa-stack-1x{line-height:inherit}.fa-stack-2x{font-size:2em}.fa-inverse{color:#fff}.fa-glass:before{content:""}.fa-music:before{content:""}.fa-search:before,.icon-search:before{content:""}.fa-envelope-o:before{content:""}.fa-heart:before{content:""}.fa-star:before{content:""}.fa-star-o:before{content:""}.fa-user:before{content:""}.fa-film:before{content:""}.fa-th-large:before{content:""}.fa-th:before{content:""}.fa-th-list:before{content:""}.fa-check:before{content:""}.fa-close:before,.fa-remove:before,.fa-times:before{content:""}.fa-search-plus:before{content:""}.fa-search-minus:before{content:""}.fa-power-off:before{content:""}.fa-signal:before{content:""}.fa-cog:before,.fa-gear:before{content:""}.fa-trash-o:before{content:""}.fa-home:before,.icon-home:before{content:""}.fa-file-o:before{content:""}.fa-clock-o:before{content:""}.fa-road:before{content:""}.fa-download:before,.rst-content code.download span:first-child:before,.rst-content tt.download span:first-child:before{content:""}.fa-arrow-circle-o-down:before{content:""}.fa-arrow-circle-o-up:before{content:""}.fa-inbox:before{content:""}.fa-play-circle-o:before{content:""}.fa-repeat:before,.fa-rotate-right:before{content:""}.fa-refresh:before{content:""}.fa-list-alt:before{content:""}.fa-lock:before{content:""}.fa-flag:before{content:""}.fa-headphones:before{content:""}.fa-volume-off:before{content:""}.fa-volume-down:before{content:""}.fa-volume-up:before{content:""}.fa-qrcode:before{content:""}.fa-barcode:before{content:""}.fa-tag:before{content:""}.fa-tags:before{content:""}.fa-book:before,.icon-book:before{content:""}.fa-bookmark:before{content:""}.fa-print:before{content:""}.fa-camera:before{content:""}.fa-font:before{content:""}.fa-bold:before{content:""}.fa-italic:before{content:""}.fa-text-height:before{content:""}.fa-text-width:before{content:""}.fa-align-left:before{content:""}.fa-align-center:before{content:""}.fa-align-right:before{content:""}.fa-align-justify:before{content:""}.fa-list:before{content:""}.fa-dedent:before,.fa-outdent:before{content:""}.fa-indent:before{content:""}.fa-video-camera:before{content:""}.fa-image:before,.fa-photo:before,.fa-picture-o:before{content:""}.fa-pencil:before{content:""}.fa-map-marker:before{content:""}.fa-adjust:before{content:""}.fa-tint:before{content:""}.fa-edit:before,.fa-pencil-square-o:before{content:""}.fa-share-square-o:before{content:""}.fa-check-square-o:before{content:""}.fa-arrows:before{content:""}.fa-step-backward:before{content:""}.fa-fast-backward:before{content:""}.fa-backward:before{content:""}.fa-play:before{content:""}.fa-pause:before{content:""}.fa-stop:before{content:""}.fa-forward:before{content:""}.fa-fast-forward:before{content:""}.fa-step-forward:before{content:""}.fa-eject:before{content:""}.fa-chevron-left:before{content:""}.fa-chevron-right:before{content:""}.fa-plus-circle:before{content:""}.fa-minus-circle:before{content:""}.fa-times-circle:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before{content:""}.fa-check-circle:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before{content:""}.fa-question-circle:before{content:""}.fa-info-circle:before{content:""}.fa-crosshairs:before{content:""}.fa-times-circle-o:before{content:""}.fa-check-circle-o:before{content:""}.fa-ban:before{content:""}.fa-arrow-left:before{content:""}.fa-arrow-right:before{content:""}.fa-arrow-up:before{content:""}.fa-arrow-down:before{content:""}.fa-mail-forward:before,.fa-share:before{content:""}.fa-expand:before{content:""}.fa-compress:before{content:""}.fa-plus:before{content:""}.fa-minus:before{content:""}.fa-asterisk:before{content:""}.fa-exclamation-circle:before,.rst-content .admonition-title:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before{content:""}.fa-gift:before{content:""}.fa-leaf:before{content:""}.fa-fire:before,.icon-fire:before{content:""}.fa-eye:before{content:""}.fa-eye-slash:before{content:""}.fa-exclamation-triangle:before,.fa-warning:before{content:""}.fa-plane:before{content:""}.fa-calendar:before{content:""}.fa-random:before{content:""}.fa-comment:before{content:""}.fa-magnet:before{content:""}.fa-chevron-up:before{content:""}.fa-chevron-down:before{content:""}.fa-retweet:before{content:""}.fa-shopping-cart:before{content:""}.fa-folder:before{content:""}.fa-folder-open:before{content:""}.fa-arrows-v:before{content:""}.fa-arrows-h:before{content:""}.fa-bar-chart-o:before,.fa-bar-chart:before{content:""}.fa-twitter-square:before{content:""}.fa-facebook-square:before{content:""}.fa-camera-retro:before{content:""}.fa-key:before{content:""}.fa-cogs:before,.fa-gears:before{content:""}.fa-comments:before{content:""}.fa-thumbs-o-up:before{content:""}.fa-thumbs-o-down:before{content:""}.fa-star-half:before{content:""}.fa-heart-o:before{content:""}.fa-sign-out:before{content:""}.fa-linkedin-square:before{content:""}.fa-thumb-tack:before{content:""}.fa-external-link:before{content:""}.fa-sign-in:before{content:""}.fa-trophy:before{content:""}.fa-github-square:before{content:""}.fa-upload:before{content:""}.fa-lemon-o:before{content:""}.fa-phone:before{content:""}.fa-square-o:before{content:""}.fa-bookmark-o:before{content:""}.fa-phone-square:before{content:""}.fa-twitter:before{content:""}.fa-facebook-f:before,.fa-facebook:before{content:""}.fa-github:before,.icon-github:before{content:""}.fa-unlock:before{content:""}.fa-credit-card:before{content:""}.fa-feed:before,.fa-rss:before{content:""}.fa-hdd-o:before{content:""}.fa-bullhorn:before{content:""}.fa-bell:before{content:""}.fa-certificate:before{content:""}.fa-hand-o-right:before{content:""}.fa-hand-o-left:before{content:""}.fa-hand-o-up:before{content:""}.fa-hand-o-down:before{content:""}.fa-arrow-circle-left:before,.icon-circle-arrow-left:before{content:""}.fa-arrow-circle-right:before,.icon-circle-arrow-right:before{content:""}.fa-arrow-circle-up:before{content:""}.fa-arrow-circle-down:before{content:""}.fa-globe:before{content:""}.fa-wrench:before{content:""}.fa-tasks:before{content:""}.fa-filter:before{content:""}.fa-briefcase:before{content:""}.fa-arrows-alt:before{content:""}.fa-group:before,.fa-users:before{content:""}.fa-chain:before,.fa-link:before,.icon-link:before{content:""}.fa-cloud:before{content:""}.fa-flask:before{content:""}.fa-cut:before,.fa-scissors:before{content:""}.fa-copy:before,.fa-files-o:before{content:""}.fa-paperclip:before{content:""}.fa-floppy-o:before,.fa-save:before{content:""}.fa-square:before{content:""}.fa-bars:before,.fa-navicon:before,.fa-reorder:before{content:""}.fa-list-ul:before{content:""}.fa-list-ol:before{content:""}.fa-strikethrough:before{content:""}.fa-underline:before{content:""}.fa-table:before{content:""}.fa-magic:before{content:""}.fa-truck:before{content:""}.fa-pinterest:before{content:""}.fa-pinterest-square:before{content:""}.fa-google-plus-square:before{content:""}.fa-google-plus:before{content:""}.fa-money:before{content:""}.fa-caret-down:before,.icon-caret-down:before,.wy-dropdown .caret:before{content:""}.fa-caret-up:before{content:""}.fa-caret-left:before{content:""}.fa-caret-right:before{content:""}.fa-columns:before{content:""}.fa-sort:before,.fa-unsorted:before{content:""}.fa-sort-desc:before,.fa-sort-down:before{content:""}.fa-sort-asc:before,.fa-sort-up:before{content:""}.fa-envelope:before{content:""}.fa-linkedin:before{content:""}.fa-rotate-left:before,.fa-undo:before{content:""}.fa-gavel:before,.fa-legal:before{content:""}.fa-dashboard:before,.fa-tachometer:before{content:""}.fa-comment-o:before{content:""}.fa-comments-o:before{content:""}.fa-bolt:before,.fa-flash:before{content:""}.fa-sitemap:before{content:""}.fa-umbrella:before{content:""}.fa-clipboard:before,.fa-paste:before{content:""}.fa-lightbulb-o:before{content:""}.fa-exchange:before{content:""}.fa-cloud-download:before{content:""}.fa-cloud-upload:before{content:""}.fa-user-md:before{content:""}.fa-stethoscope:before{content:""}.fa-suitcase:before{content:""}.fa-bell-o:before{content:""}.fa-coffee:before{content:""}.fa-cutlery:before{content:""}.fa-file-text-o:before{content:""}.fa-building-o:before{content:""}.fa-hospital-o:before{content:""}.fa-ambulance:before{content:""}.fa-medkit:before{content:""}.fa-fighter-jet:before{content:""}.fa-beer:before{content:""}.fa-h-square:before{content:""}.fa-plus-square:before{content:""}.fa-angle-double-left:before{content:""}.fa-angle-double-right:before{content:""}.fa-angle-double-up:before{content:""}.fa-angle-double-down:before{content:""}.fa-angle-left:before{content:""}.fa-angle-right:before{content:""}.fa-angle-up:before{content:""}.fa-angle-down:before{content:""}.fa-desktop:before{content:""}.fa-laptop:before{content:""}.fa-tablet:before{content:""}.fa-mobile-phone:before,.fa-mobile:before{content:""}.fa-circle-o:before{content:""}.fa-quote-left:before{content:""}.fa-quote-right:before{content:""}.fa-spinner:before{content:""}.fa-circle:before{content:""}.fa-mail-reply:before,.fa-reply:before{content:""}.fa-github-alt:before{content:""}.fa-folder-o:before{content:""}.fa-folder-open-o:before{content:""}.fa-smile-o:before{content:""}.fa-frown-o:before{content:""}.fa-meh-o:before{content:""}.fa-gamepad:before{content:""}.fa-keyboard-o:before{content:""}.fa-flag-o:before{content:""}.fa-flag-checkered:before{content:""}.fa-terminal:before{content:""}.fa-code:before{content:""}.fa-mail-reply-all:before,.fa-reply-all:before{content:""}.fa-star-half-empty:before,.fa-star-half-full:before,.fa-star-half-o:before{content:""}.fa-location-arrow:before{content:""}.fa-crop:before{content:""}.fa-code-fork:before{content:""}.fa-chain-broken:before,.fa-unlink:before{content:""}.fa-question:before{content:""}.fa-info:before{content:""}.fa-exclamation:before{content:""}.fa-superscript:before{content:""}.fa-subscript:before{content:""}.fa-eraser:before{content:""}.fa-puzzle-piece:before{content:""}.fa-microphone:before{content:""}.fa-microphone-slash:before{content:""}.fa-shield:before{content:""}.fa-calendar-o:before{content:""}.fa-fire-extinguisher:before{content:""}.fa-rocket:before{content:""}.fa-maxcdn:before{content:""}.fa-chevron-circle-left:before{content:""}.fa-chevron-circle-right:before{content:""}.fa-chevron-circle-up:before{content:""}.fa-chevron-circle-down:before{content:""}.fa-html5:before{content:""}.fa-css3:before{content:""}.fa-anchor:before{content:""}.fa-unlock-alt:before{content:""}.fa-bullseye:before{content:""}.fa-ellipsis-h:before{content:""}.fa-ellipsis-v:before{content:""}.fa-rss-square:before{content:""}.fa-play-circle:before{content:""}.fa-ticket:before{content:""}.fa-minus-square:before{content:""}.fa-minus-square-o:before,.wy-menu-vertical li.current>a span.toctree-expand:before,.wy-menu-vertical li.on a span.toctree-expand:before{content:""}.fa-level-up:before{content:""}.fa-level-down:before{content:""}.fa-check-square:before{content:""}.fa-pencil-square:before{content:""}.fa-external-link-square:before{content:""}.fa-share-square:before{content:""}.fa-compass:before{content:""}.fa-caret-square-o-down:before,.fa-toggle-down:before{content:""}.fa-caret-square-o-up:before,.fa-toggle-up:before{content:""}.fa-caret-square-o-right:before,.fa-toggle-right:before{content:""}.fa-eur:before,.fa-euro:before{content:""}.fa-gbp:before{content:""}.fa-dollar:before,.fa-usd:before{content:""}.fa-inr:before,.fa-rupee:before{content:""}.fa-cny:before,.fa-jpy:before,.fa-rmb:before,.fa-yen:before{content:""}.fa-rouble:before,.fa-rub:before,.fa-ruble:before{content:""}.fa-krw:before,.fa-won:before{content:""}.fa-bitcoin:before,.fa-btc:before{content:""}.fa-file:before{content:""}.fa-file-text:before{content:""}.fa-sort-alpha-asc:before{content:""}.fa-sort-alpha-desc:before{content:""}.fa-sort-amount-asc:before{content:""}.fa-sort-amount-desc:before{content:""}.fa-sort-numeric-asc:before{content:""}.fa-sort-numeric-desc:before{content:""}.fa-thumbs-up:before{content:""}.fa-thumbs-down:before{content:""}.fa-youtube-square:before{content:""}.fa-youtube:before{content:""}.fa-xing:before{content:""}.fa-xing-square:before{content:""}.fa-youtube-play:before{content:""}.fa-dropbox:before{content:""}.fa-stack-overflow:before{content:""}.fa-instagram:before{content:""}.fa-flickr:before{content:""}.fa-adn:before{content:""}.fa-bitbucket:before,.icon-bitbucket:before{content:""}.fa-bitbucket-square:before{content:""}.fa-tumblr:before{content:""}.fa-tumblr-square:before{content:""}.fa-long-arrow-down:before{content:""}.fa-long-arrow-up:before{content:""}.fa-long-arrow-left:before{content:""}.fa-long-arrow-right:before{content:""}.fa-apple:before{content:""}.fa-windows:before{content:""}.fa-android:before{content:""}.fa-linux:before{content:""}.fa-dribbble:before{content:""}.fa-skype:before{content:""}.fa-foursquare:before{content:""}.fa-trello:before{content:""}.fa-female:before{content:""}.fa-male:before{content:""}.fa-gittip:before,.fa-gratipay:before{content:""}.fa-sun-o:before{content:""}.fa-moon-o:before{content:""}.fa-archive:before{content:""}.fa-bug:before{content:""}.fa-vk:before{content:""}.fa-weibo:before{content:""}.fa-renren:before{content:""}.fa-pagelines:before{content:""}.fa-stack-exchange:before{content:""}.fa-arrow-circle-o-right:before{content:""}.fa-arrow-circle-o-left:before{content:""}.fa-caret-square-o-left:before,.fa-toggle-left:before{content:""}.fa-dot-circle-o:before{content:""}.fa-wheelchair:before{content:""}.fa-vimeo-square:before{content:""}.fa-try:before,.fa-turkish-lira:before{content:""}.fa-plus-square-o:before,.wy-menu-vertical li span.toctree-expand:before{content:""}.fa-space-shuttle:before{content:""}.fa-slack:before{content:""}.fa-envelope-square:before{content:""}.fa-wordpress:before{content:""}.fa-openid:before{content:""}.fa-bank:before,.fa-institution:before,.fa-university:before{content:""}.fa-graduation-cap:before,.fa-mortar-board:before{content:""}.fa-yahoo:before{content:""}.fa-google:before{content:""}.fa-reddit:before{content:""}.fa-reddit-square:before{content:""}.fa-stumbleupon-circle:before{content:""}.fa-stumbleupon:before{content:""}.fa-delicious:before{content:""}.fa-digg:before{content:""}.fa-pied-piper-pp:before{content:""}.fa-pied-piper-alt:before{content:""}.fa-drupal:before{content:""}.fa-joomla:before{content:""}.fa-language:before{content:""}.fa-fax:before{content:""}.fa-building:before{content:""}.fa-child:before{content:""}.fa-paw:before{content:""}.fa-spoon:before{content:""}.fa-cube:before{content:""}.fa-cubes:before{content:""}.fa-behance:before{content:""}.fa-behance-square:before{content:""}.fa-steam:before{content:""}.fa-steam-square:before{content:""}.fa-recycle:before{content:""}.fa-automobile:before,.fa-car:before{content:""}.fa-cab:before,.fa-taxi:before{content:""}.fa-tree:before{content:""}.fa-spotify:before{content:""}.fa-deviantart:before{content:""}.fa-soundcloud:before{content:""}.fa-database:before{content:""}.fa-file-pdf-o:before{content:""}.fa-file-word-o:before{content:""}.fa-file-excel-o:before{content:""}.fa-file-powerpoint-o:before{content:""}.fa-file-image-o:before,.fa-file-photo-o:before,.fa-file-picture-o:before{content:""}.fa-file-archive-o:before,.fa-file-zip-o:before{content:""}.fa-file-audio-o:before,.fa-file-sound-o:before{content:""}.fa-file-movie-o:before,.fa-file-video-o:before{content:""}.fa-file-code-o:before{content:""}.fa-vine:before{content:""}.fa-codepen:before{content:""}.fa-jsfiddle:before{content:""}.fa-life-bouy:before,.fa-life-buoy:before,.fa-life-ring:before,.fa-life-saver:before,.fa-support:before{content:""}.fa-circle-o-notch:before{content:""}.fa-ra:before,.fa-rebel:before,.fa-resistance:before{content:""}.fa-empire:before,.fa-ge:before{content:""}.fa-git-square:before{content:""}.fa-git:before{content:""}.fa-hacker-news:before,.fa-y-combinator-square:before,.fa-yc-square:before{content:""}.fa-tencent-weibo:before{content:""}.fa-qq:before{content:""}.fa-wechat:before,.fa-weixin:before{content:""}.fa-paper-plane:before,.fa-send:before{content:""}.fa-paper-plane-o:before,.fa-send-o:before{content:""}.fa-history:before{content:""}.fa-circle-thin:before{content:""}.fa-header:before{content:""}.fa-paragraph:before{content:""}.fa-sliders:before{content:""}.fa-share-alt:before{content:""}.fa-share-alt-square:before{content:""}.fa-bomb:before{content:""}.fa-futbol-o:before,.fa-soccer-ball-o:before{content:""}.fa-tty:before{content:""}.fa-binoculars:before{content:""}.fa-plug:before{content:""}.fa-slideshare:before{content:""}.fa-twitch:before{content:""}.fa-yelp:before{content:""}.fa-newspaper-o:before{content:""}.fa-wifi:before{content:""}.fa-calculator:before{content:""}.fa-paypal:before{content:""}.fa-google-wallet:before{content:""}.fa-cc-visa:before{content:""}.fa-cc-mastercard:before{content:""}.fa-cc-discover:before{content:""}.fa-cc-amex:before{content:""}.fa-cc-paypal:before{content:""}.fa-cc-stripe:before{content:""}.fa-bell-slash:before{content:""}.fa-bell-slash-o:before{content:""}.fa-trash:before{content:""}.fa-copyright:before{content:""}.fa-at:before{content:""}.fa-eyedropper:before{content:""}.fa-paint-brush:before{content:""}.fa-birthday-cake:before{content:""}.fa-area-chart:before{content:""}.fa-pie-chart:before{content:""}.fa-line-chart:before{content:""}.fa-lastfm:before{content:""}.fa-lastfm-square:before{content:""}.fa-toggle-off:before{content:""}.fa-toggle-on:before{content:""}.fa-bicycle:before{content:""}.fa-bus:before{content:""}.fa-ioxhost:before{content:""}.fa-angellist:before{content:""}.fa-cc:before{content:""}.fa-ils:before,.fa-shekel:before,.fa-sheqel:before{content:""}.fa-meanpath:before{content:""}.fa-buysellads:before{content:""}.fa-connectdevelop:before{content:""}.fa-dashcube:before{content:""}.fa-forumbee:before{content:""}.fa-leanpub:before{content:""}.fa-sellsy:before{content:""}.fa-shirtsinbulk:before{content:""}.fa-simplybuilt:before{content:""}.fa-skyatlas:before{content:""}.fa-cart-plus:before{content:""}.fa-cart-arrow-down:before{content:""}.fa-diamond:before{content:""}.fa-ship:before{content:""}.fa-user-secret:before{content:""}.fa-motorcycle:before{content:""}.fa-street-view:before{content:""}.fa-heartbeat:before{content:""}.fa-venus:before{content:""}.fa-mars:before{content:""}.fa-mercury:before{content:""}.fa-intersex:before,.fa-transgender:before{content:""}.fa-transgender-alt:before{content:""}.fa-venus-double:before{content:""}.fa-mars-double:before{content:""}.fa-venus-mars:before{content:""}.fa-mars-stroke:before{content:""}.fa-mars-stroke-v:before{content:""}.fa-mars-stroke-h:before{content:""}.fa-neuter:before{content:""}.fa-genderless:before{content:""}.fa-facebook-official:before{content:""}.fa-pinterest-p:before{content:""}.fa-whatsapp:before{content:""}.fa-server:before{content:""}.fa-user-plus:before{content:""}.fa-user-times:before{content:""}.fa-bed:before,.fa-hotel:before{content:""}.fa-viacoin:before{content:""}.fa-train:before{content:""}.fa-subway:before{content:""}.fa-medium:before{content:""}.fa-y-combinator:before,.fa-yc:before{content:""}.fa-optin-monster:before{content:""}.fa-opencart:before{content:""}.fa-expeditedssl:before{content:""}.fa-battery-4:before,.fa-battery-full:before,.fa-battery:before{content:""}.fa-battery-3:before,.fa-battery-three-quarters:before{content:""}.fa-battery-2:before,.fa-battery-half:before{content:""}.fa-battery-1:before,.fa-battery-quarter:before{content:""}.fa-battery-0:before,.fa-battery-empty:before{content:""}.fa-mouse-pointer:before{content:""}.fa-i-cursor:before{content:""}.fa-object-group:before{content:""}.fa-object-ungroup:before{content:""}.fa-sticky-note:before{content:""}.fa-sticky-note-o:before{content:""}.fa-cc-jcb:before{content:""}.fa-cc-diners-club:before{content:""}.fa-clone:before{content:""}.fa-balance-scale:before{content:""}.fa-hourglass-o:before{content:""}.fa-hourglass-1:before,.fa-hourglass-start:before{content:""}.fa-hourglass-2:before,.fa-hourglass-half:before{content:""}.fa-hourglass-3:before,.fa-hourglass-end:before{content:""}.fa-hourglass:before{content:""}.fa-hand-grab-o:before,.fa-hand-rock-o:before{content:""}.fa-hand-paper-o:before,.fa-hand-stop-o:before{content:""}.fa-hand-scissors-o:before{content:""}.fa-hand-lizard-o:before{content:""}.fa-hand-spock-o:before{content:""}.fa-hand-pointer-o:before{content:""}.fa-hand-peace-o:before{content:""}.fa-trademark:before{content:""}.fa-registered:before{content:""}.fa-creative-commons:before{content:""}.fa-gg:before{content:""}.fa-gg-circle:before{content:""}.fa-tripadvisor:before{content:""}.fa-odnoklassniki:before{content:""}.fa-odnoklassniki-square:before{content:""}.fa-get-pocket:before{content:""}.fa-wikipedia-w:before{content:""}.fa-safari:before{content:""}.fa-chrome:before{content:""}.fa-firefox:before{content:""}.fa-opera:before{content:""}.fa-internet-explorer:before{content:""}.fa-television:before,.fa-tv:before{content:""}.fa-contao:before{content:""}.fa-500px:before{content:""}.fa-amazon:before{content:""}.fa-calendar-plus-o:before{content:""}.fa-calendar-minus-o:before{content:""}.fa-calendar-times-o:before{content:""}.fa-calendar-check-o:before{content:""}.fa-industry:before{content:""}.fa-map-pin:before{content:""}.fa-map-signs:before{content:""}.fa-map-o:before{content:""}.fa-map:before{content:""}.fa-commenting:before{content:""}.fa-commenting-o:before{content:""}.fa-houzz:before{content:""}.fa-vimeo:before{content:""}.fa-black-tie:before{content:""}.fa-fonticons:before{content:""}.fa-reddit-alien:before{content:""}.fa-edge:before{content:""}.fa-credit-card-alt:before{content:""}.fa-codiepie:before{content:""}.fa-modx:before{content:""}.fa-fort-awesome:before{content:""}.fa-usb:before{content:""}.fa-product-hunt:before{content:""}.fa-mixcloud:before{content:""}.fa-scribd:before{content:""}.fa-pause-circle:before{content:""}.fa-pause-circle-o:before{content:""}.fa-stop-circle:before{content:""}.fa-stop-circle-o:before{content:""}.fa-shopping-bag:before{content:""}.fa-shopping-basket:before{content:""}.fa-hashtag:before{content:""}.fa-bluetooth:before{content:""}.fa-bluetooth-b:before{content:""}.fa-percent:before{content:""}.fa-gitlab:before,.icon-gitlab:before{content:""}.fa-wpbeginner:before{content:""}.fa-wpforms:before{content:""}.fa-envira:before{content:""}.fa-universal-access:before{content:""}.fa-wheelchair-alt:before{content:""}.fa-question-circle-o:before{content:""}.fa-blind:before{content:""}.fa-audio-description:before{content:""}.fa-volume-control-phone:before{content:""}.fa-braille:before{content:""}.fa-assistive-listening-systems:before{content:""}.fa-american-sign-language-interpreting:before,.fa-asl-interpreting:before{content:""}.fa-deaf:before,.fa-deafness:before,.fa-hard-of-hearing:before{content:""}.fa-glide:before{content:""}.fa-glide-g:before{content:""}.fa-sign-language:before,.fa-signing:before{content:""}.fa-low-vision:before{content:""}.fa-viadeo:before{content:""}.fa-viadeo-square:before{content:""}.fa-snapchat:before{content:""}.fa-snapchat-ghost:before{content:""}.fa-snapchat-square:before{content:""}.fa-pied-piper:before{content:""}.fa-first-order:before{content:""}.fa-yoast:before{content:""}.fa-themeisle:before{content:""}.fa-google-plus-circle:before,.fa-google-plus-official:before{content:""}.fa-fa:before,.fa-font-awesome:before{content:""}.fa-handshake-o:before{content:""}.fa-envelope-open:before{content:""}.fa-envelope-open-o:before{content:""}.fa-linode:before{content:""}.fa-address-book:before{content:""}.fa-address-book-o:before{content:""}.fa-address-card:before,.fa-vcard:before{content:""}.fa-address-card-o:before,.fa-vcard-o:before{content:""}.fa-user-circle:before{content:""}.fa-user-circle-o:before{content:""}.fa-user-o:before{content:""}.fa-id-badge:before{content:""}.fa-drivers-license:before,.fa-id-card:before{content:""}.fa-drivers-license-o:before,.fa-id-card-o:before{content:""}.fa-quora:before{content:""}.fa-free-code-camp:before{content:""}.fa-telegram:before{content:""}.fa-thermometer-4:before,.fa-thermometer-full:before,.fa-thermometer:before{content:""}.fa-thermometer-3:before,.fa-thermometer-three-quarters:before{content:""}.fa-thermometer-2:before,.fa-thermometer-half:before{content:""}.fa-thermometer-1:before,.fa-thermometer-quarter:before{content:""}.fa-thermometer-0:before,.fa-thermometer-empty:before{content:""}.fa-shower:before{content:""}.fa-bath:before,.fa-bathtub:before,.fa-s15:before{content:""}.fa-podcast:before{content:""}.fa-window-maximize:before{content:""}.fa-window-minimize:before{content:""}.fa-window-restore:before{content:""}.fa-times-rectangle:before,.fa-window-close:before{content:""}.fa-times-rectangle-o:before,.fa-window-close-o:before{content:""}.fa-bandcamp:before{content:""}.fa-grav:before{content:""}.fa-etsy:before{content:""}.fa-imdb:before{content:""}.fa-ravelry:before{content:""}.fa-eercast:before{content:""}.fa-microchip:before{content:""}.fa-snowflake-o:before{content:""}.fa-superpowers:before{content:""}.fa-wpexplorer:before{content:""}.fa-meetup:before{content:""}.sr-only{position:absolute;width:1px;height:1px;padding:0;margin:-1px;overflow:hidden;clip:rect(0,0,0,0);border:0}.sr-only-focusable:active,.sr-only-focusable:focus{position:static;width:auto;height:auto;margin:0;overflow:visible;clip:auto}.fa,.icon,.rst-content .admonition-title,.rst-content .code-block-caption .headerlink,.rst-content code.download span:first-child,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content table>caption .headerlink,.rst-content tt.download span:first-child,.wy-dropdown .caret,.wy-inline-validate.wy-inline-validate-danger .wy-input-context,.wy-inline-validate.wy-inline-validate-info .wy-input-context,.wy-inline-validate.wy-inline-validate-success .wy-input-context,.wy-inline-validate.wy-inline-validate-warning .wy-input-context,.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand,.wy-menu-vertical li span.toctree-expand{font-family:inherit}.fa:before,.icon:before,.rst-content .admonition-title:before,.rst-content .code-block-caption .headerlink:before,.rst-content code.download span:first-child:before,.rst-content dl dt .headerlink:before,.rst-content h1 .headerlink:before,.rst-content h2 .headerlink:before,.rst-content h3 .headerlink:before,.rst-content h4 .headerlink:before,.rst-content h5 .headerlink:before,.rst-content h6 .headerlink:before,.rst-content p.caption .headerlink:before,.rst-content table>caption .headerlink:before,.rst-content tt.download span:first-child:before,.wy-dropdown .caret:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before,.wy-menu-vertical li.current>a span.toctree-expand:before,.wy-menu-vertical li.on a span.toctree-expand:before,.wy-menu-vertical li span.toctree-expand:before{font-family:FontAwesome;display:inline-block;font-style:normal;font-weight:400;line-height:1;text-decoration:inherit}.rst-content .code-block-caption a .headerlink,.rst-content a .admonition-title,.rst-content code.download a span:first-child,.rst-content dl dt a .headerlink,.rst-content h1 a .headerlink,.rst-content h2 a .headerlink,.rst-content h3 a .headerlink,.rst-content h4 a .headerlink,.rst-content h5 a .headerlink,.rst-content h6 a .headerlink,.rst-content p.caption a .headerlink,.rst-content table>caption a .headerlink,.rst-content tt.download a span:first-child,.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand,.wy-menu-vertical li a span.toctree-expand,a .fa,a .icon,a .rst-content .admonition-title,a .rst-content .code-block-caption .headerlink,a .rst-content code.download span:first-child,a .rst-content dl dt .headerlink,a .rst-content h1 .headerlink,a .rst-content h2 .headerlink,a .rst-content h3 .headerlink,a .rst-content h4 .headerlink,a .rst-content h5 .headerlink,a .rst-content h6 .headerlink,a .rst-content p.caption .headerlink,a .rst-content table>caption .headerlink,a .rst-content tt.download span:first-child,a .wy-menu-vertical li span.toctree-expand{display:inline-block;text-decoration:inherit}.btn .fa,.btn .icon,.btn .rst-content .admonition-title,.btn .rst-content .code-block-caption .headerlink,.btn .rst-content code.download span:first-child,.btn .rst-content dl dt .headerlink,.btn .rst-content h1 .headerlink,.btn .rst-content h2 .headerlink,.btn .rst-content h3 .headerlink,.btn .rst-content h4 .headerlink,.btn .rst-content h5 .headerlink,.btn .rst-content h6 .headerlink,.btn .rst-content p.caption .headerlink,.btn .rst-content table>caption .headerlink,.btn .rst-content tt.download span:first-child,.btn .wy-menu-vertical li.current>a span.toctree-expand,.btn .wy-menu-vertical li.on a span.toctree-expand,.btn .wy-menu-vertical li span.toctree-expand,.nav .fa,.nav .icon,.nav .rst-content .admonition-title,.nav .rst-content .code-block-caption .headerlink,.nav .rst-content code.download span:first-child,.nav .rst-content dl dt .headerlink,.nav .rst-content h1 .headerlink,.nav .rst-content h2 .headerlink,.nav .rst-content h3 .headerlink,.nav .rst-content h4 .headerlink,.nav .rst-content h5 .headerlink,.nav .rst-content h6 .headerlink,.nav .rst-content p.caption .headerlink,.nav .rst-content table>caption .headerlink,.nav .rst-content tt.download span:first-child,.nav .wy-menu-vertical li.current>a span.toctree-expand,.nav .wy-menu-vertical li.on a span.toctree-expand,.nav .wy-menu-vertical li span.toctree-expand,.rst-content .btn .admonition-title,.rst-content .code-block-caption .btn .headerlink,.rst-content .code-block-caption .nav .headerlink,.rst-content .nav .admonition-title,.rst-content code.download .btn span:first-child,.rst-content code.download .nav span:first-child,.rst-content dl dt .btn .headerlink,.rst-content dl dt .nav .headerlink,.rst-content h1 .btn .headerlink,.rst-content h1 .nav .headerlink,.rst-content h2 .btn .headerlink,.rst-content h2 .nav .headerlink,.rst-content h3 .btn .headerlink,.rst-content h3 .nav .headerlink,.rst-content h4 .btn .headerlink,.rst-content h4 .nav .headerlink,.rst-content h5 .btn .headerlink,.rst-content h5 .nav .headerlink,.rst-content h6 .btn .headerlink,.rst-content h6 .nav .headerlink,.rst-content p.caption .btn .headerlink,.rst-content p.caption .nav .headerlink,.rst-content table>caption .btn .headerlink,.rst-content table>caption .nav .headerlink,.rst-content tt.download .btn span:first-child,.rst-content tt.download .nav span:first-child,.wy-menu-vertical li .btn span.toctree-expand,.wy-menu-vertical li.current>a .btn span.toctree-expand,.wy-menu-vertical li.current>a .nav span.toctree-expand,.wy-menu-vertical li .nav span.toctree-expand,.wy-menu-vertical li.on a .btn span.toctree-expand,.wy-menu-vertical li.on a .nav span.toctree-expand{display:inline}.btn .fa-large.icon,.btn .fa.fa-large,.btn .rst-content .code-block-caption .fa-large.headerlink,.btn .rst-content .fa-large.admonition-title,.btn .rst-content code.download span.fa-large:first-child,.btn .rst-content dl dt .fa-large.headerlink,.btn .rst-content h1 .fa-large.headerlink,.btn .rst-content h2 .fa-large.headerlink,.btn .rst-content h3 .fa-large.headerlink,.btn .rst-content h4 .fa-large.headerlink,.btn .rst-content h5 .fa-large.headerlink,.btn .rst-content h6 .fa-large.headerlink,.btn .rst-content p.caption .fa-large.headerlink,.btn .rst-content table>caption .fa-large.headerlink,.btn .rst-content tt.download span.fa-large:first-child,.btn .wy-menu-vertical li span.fa-large.toctree-expand,.nav .fa-large.icon,.nav .fa.fa-large,.nav .rst-content .code-block-caption .fa-large.headerlink,.nav .rst-content .fa-large.admonition-title,.nav .rst-content code.download span.fa-large:first-child,.nav .rst-content dl dt .fa-large.headerlink,.nav .rst-content h1 .fa-large.headerlink,.nav .rst-content h2 .fa-large.headerlink,.nav .rst-content h3 .fa-large.headerlink,.nav .rst-content h4 .fa-large.headerlink,.nav .rst-content h5 .fa-large.headerlink,.nav .rst-content h6 .fa-large.headerlink,.nav .rst-content p.caption .fa-large.headerlink,.nav .rst-content table>caption .fa-large.headerlink,.nav .rst-content tt.download span.fa-large:first-child,.nav .wy-menu-vertical li span.fa-large.toctree-expand,.rst-content .btn .fa-large.admonition-title,.rst-content .code-block-caption .btn .fa-large.headerlink,.rst-content .code-block-caption .nav .fa-large.headerlink,.rst-content .nav .fa-large.admonition-title,.rst-content code.download .btn span.fa-large:first-child,.rst-content code.download .nav span.fa-large:first-child,.rst-content dl dt .btn .fa-large.headerlink,.rst-content dl dt .nav .fa-large.headerlink,.rst-content h1 .btn .fa-large.headerlink,.rst-content h1 .nav .fa-large.headerlink,.rst-content h2 .btn .fa-large.headerlink,.rst-content h2 .nav .fa-large.headerlink,.rst-content h3 .btn .fa-large.headerlink,.rst-content h3 .nav .fa-large.headerlink,.rst-content h4 .btn .fa-large.headerlink,.rst-content h4 .nav .fa-large.headerlink,.rst-content h5 .btn .fa-large.headerlink,.rst-content h5 .nav .fa-large.headerlink,.rst-content h6 .btn .fa-large.headerlink,.rst-content h6 .nav .fa-large.headerlink,.rst-content p.caption .btn .fa-large.headerlink,.rst-content p.caption .nav .fa-large.headerlink,.rst-content table>caption .btn .fa-large.headerlink,.rst-content table>caption .nav .fa-large.headerlink,.rst-content tt.download .btn span.fa-large:first-child,.rst-content tt.download .nav span.fa-large:first-child,.wy-menu-vertical li .btn span.fa-large.toctree-expand,.wy-menu-vertical li .nav span.fa-large.toctree-expand{line-height:.9em}.btn .fa-spin.icon,.btn .fa.fa-spin,.btn .rst-content .code-block-caption .fa-spin.headerlink,.btn .rst-content .fa-spin.admonition-title,.btn .rst-content code.download span.fa-spin:first-child,.btn .rst-content dl dt .fa-spin.headerlink,.btn .rst-content h1 .fa-spin.headerlink,.btn .rst-content h2 .fa-spin.headerlink,.btn .rst-content h3 .fa-spin.headerlink,.btn .rst-content h4 .fa-spin.headerlink,.btn .rst-content h5 .fa-spin.headerlink,.btn .rst-content h6 .fa-spin.headerlink,.btn .rst-content p.caption .fa-spin.headerlink,.btn .rst-content table>caption .fa-spin.headerlink,.btn .rst-content tt.download span.fa-spin:first-child,.btn .wy-menu-vertical li span.fa-spin.toctree-expand,.nav .fa-spin.icon,.nav .fa.fa-spin,.nav .rst-content .code-block-caption .fa-spin.headerlink,.nav .rst-content .fa-spin.admonition-title,.nav .rst-content code.download span.fa-spin:first-child,.nav .rst-content dl dt .fa-spin.headerlink,.nav .rst-content h1 .fa-spin.headerlink,.nav .rst-content h2 .fa-spin.headerlink,.nav .rst-content h3 .fa-spin.headerlink,.nav .rst-content h4 .fa-spin.headerlink,.nav .rst-content h5 .fa-spin.headerlink,.nav .rst-content h6 .fa-spin.headerlink,.nav .rst-content p.caption .fa-spin.headerlink,.nav .rst-content table>caption .fa-spin.headerlink,.nav .rst-content tt.download span.fa-spin:first-child,.nav .wy-menu-vertical li span.fa-spin.toctree-expand,.rst-content .btn .fa-spin.admonition-title,.rst-content .code-block-caption .btn .fa-spin.headerlink,.rst-content .code-block-caption .nav .fa-spin.headerlink,.rst-content .nav .fa-spin.admonition-title,.rst-content code.download .btn span.fa-spin:first-child,.rst-content code.download .nav span.fa-spin:first-child,.rst-content dl dt .btn .fa-spin.headerlink,.rst-content dl dt .nav .fa-spin.headerlink,.rst-content h1 .btn .fa-spin.headerlink,.rst-content h1 .nav .fa-spin.headerlink,.rst-content h2 .btn .fa-spin.headerlink,.rst-content h2 .nav .fa-spin.headerlink,.rst-content h3 .btn .fa-spin.headerlink,.rst-content h3 .nav .fa-spin.headerlink,.rst-content h4 .btn .fa-spin.headerlink,.rst-content h4 .nav .fa-spin.headerlink,.rst-content h5 .btn .fa-spin.headerlink,.rst-content h5 .nav .fa-spin.headerlink,.rst-content h6 .btn .fa-spin.headerlink,.rst-content h6 .nav .fa-spin.headerlink,.rst-content p.caption .btn .fa-spin.headerlink,.rst-content p.caption .nav .fa-spin.headerlink,.rst-content table>caption .btn .fa-spin.headerlink,.rst-content table>caption .nav .fa-spin.headerlink,.rst-content tt.download .btn span.fa-spin:first-child,.rst-content tt.download .nav span.fa-spin:first-child,.wy-menu-vertical li .btn span.fa-spin.toctree-expand,.wy-menu-vertical li .nav span.fa-spin.toctree-expand{display:inline-block}.btn.fa:before,.btn.icon:before,.rst-content .btn.admonition-title:before,.rst-content .code-block-caption .btn.headerlink:before,.rst-content code.download span.btn:first-child:before,.rst-content dl dt .btn.headerlink:before,.rst-content h1 .btn.headerlink:before,.rst-content h2 .btn.headerlink:before,.rst-content h3 .btn.headerlink:before,.rst-content h4 .btn.headerlink:before,.rst-content h5 .btn.headerlink:before,.rst-content h6 .btn.headerlink:before,.rst-content p.caption .btn.headerlink:before,.rst-content table>caption .btn.headerlink:before,.rst-content tt.download span.btn:first-child:before,.wy-menu-vertical li span.btn.toctree-expand:before{opacity:.5;-webkit-transition:opacity .05s ease-in;-moz-transition:opacity .05s ease-in;transition:opacity .05s ease-in}.btn.fa:hover:before,.btn.icon:hover:before,.rst-content .btn.admonition-title:hover:before,.rst-content .code-block-caption .btn.headerlink:hover:before,.rst-content code.download span.btn:first-child:hover:before,.rst-content dl dt .btn.headerlink:hover:before,.rst-content h1 .btn.headerlink:hover:before,.rst-content h2 .btn.headerlink:hover:before,.rst-content h3 .btn.headerlink:hover:before,.rst-content h4 .btn.headerlink:hover:before,.rst-content h5 .btn.headerlink:hover:before,.rst-content h6 .btn.headerlink:hover:before,.rst-content p.caption .btn.headerlink:hover:before,.rst-content table>caption .btn.headerlink:hover:before,.rst-content tt.download span.btn:first-child:hover:before,.wy-menu-vertical li span.btn.toctree-expand:hover:before{opacity:1}.btn-mini .fa:before,.btn-mini .icon:before,.btn-mini .rst-content .admonition-title:before,.btn-mini .rst-content .code-block-caption .headerlink:before,.btn-mini .rst-content code.download span:first-child:before,.btn-mini .rst-content dl dt .headerlink:before,.btn-mini .rst-content h1 .headerlink:before,.btn-mini .rst-content h2 .headerlink:before,.btn-mini .rst-content h3 .headerlink:before,.btn-mini .rst-content h4 .headerlink:before,.btn-mini .rst-content h5 .headerlink:before,.btn-mini .rst-content h6 .headerlink:before,.btn-mini .rst-content p.caption .headerlink:before,.btn-mini .rst-content table>caption .headerlink:before,.btn-mini .rst-content tt.download span:first-child:before,.btn-mini .wy-menu-vertical li span.toctree-expand:before,.rst-content .btn-mini .admonition-title:before,.rst-content .code-block-caption .btn-mini .headerlink:before,.rst-content code.download .btn-mini span:first-child:before,.rst-content dl dt .btn-mini .headerlink:before,.rst-content h1 .btn-mini .headerlink:before,.rst-content h2 .btn-mini .headerlink:before,.rst-content h3 .btn-mini .headerlink:before,.rst-content h4 .btn-mini .headerlink:before,.rst-content h5 .btn-mini .headerlink:before,.rst-content h6 .btn-mini .headerlink:before,.rst-content p.caption .btn-mini .headerlink:before,.rst-content table>caption .btn-mini .headerlink:before,.rst-content tt.download .btn-mini span:first-child:before,.wy-menu-vertical li .btn-mini span.toctree-expand:before{font-size:14px;vertical-align:-15%}.rst-content .admonition,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning,.wy-alert{padding:12px;line-height:24px;margin-bottom:24px;background:#e7f2fa}.rst-content .admonition-title,.wy-alert-title{font-weight:700;display:block;color:#fff;background:#6ab0de;padding:6px 12px;margin:-12px -12px 12px}.rst-content .danger,.rst-content .error,.rst-content .wy-alert-danger.admonition,.rst-content .wy-alert-danger.admonition-todo,.rst-content .wy-alert-danger.attention,.rst-content .wy-alert-danger.caution,.rst-content .wy-alert-danger.hint,.rst-content .wy-alert-danger.important,.rst-content .wy-alert-danger.note,.rst-content .wy-alert-danger.seealso,.rst-content .wy-alert-danger.tip,.rst-content .wy-alert-danger.warning,.wy-alert.wy-alert-danger{background:#fdf3f2}.rst-content .danger .admonition-title,.rst-content .danger .wy-alert-title,.rst-content .error .admonition-title,.rst-content .error .wy-alert-title,.rst-content .wy-alert-danger.admonition-todo .admonition-title,.rst-content .wy-alert-danger.admonition-todo .wy-alert-title,.rst-content .wy-alert-danger.admonition .admonition-title,.rst-content .wy-alert-danger.admonition .wy-alert-title,.rst-content .wy-alert-danger.attention .admonition-title,.rst-content .wy-alert-danger.attention .wy-alert-title,.rst-content .wy-alert-danger.caution .admonition-title,.rst-content .wy-alert-danger.caution .wy-alert-title,.rst-content .wy-alert-danger.hint .admonition-title,.rst-content .wy-alert-danger.hint .wy-alert-title,.rst-content .wy-alert-danger.important .admonition-title,.rst-content .wy-alert-danger.important .wy-alert-title,.rst-content .wy-alert-danger.note .admonition-title,.rst-content .wy-alert-danger.note .wy-alert-title,.rst-content .wy-alert-danger.seealso .admonition-title,.rst-content .wy-alert-danger.seealso .wy-alert-title,.rst-content .wy-alert-danger.tip .admonition-title,.rst-content .wy-alert-danger.tip .wy-alert-title,.rst-content .wy-alert-danger.warning .admonition-title,.rst-content .wy-alert-danger.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-danger .admonition-title,.wy-alert.wy-alert-danger .rst-content .admonition-title,.wy-alert.wy-alert-danger .wy-alert-title{background:#f29f97}.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .warning,.rst-content .wy-alert-warning.admonition,.rst-content .wy-alert-warning.danger,.rst-content .wy-alert-warning.error,.rst-content .wy-alert-warning.hint,.rst-content .wy-alert-warning.important,.rst-content .wy-alert-warning.note,.rst-content .wy-alert-warning.seealso,.rst-content .wy-alert-warning.tip,.wy-alert.wy-alert-warning{background:#ffedcc}.rst-content .admonition-todo .admonition-title,.rst-content .admonition-todo .wy-alert-title,.rst-content .attention .admonition-title,.rst-content .attention .wy-alert-title,.rst-content .caution .admonition-title,.rst-content .caution .wy-alert-title,.rst-content .warning .admonition-title,.rst-content .warning .wy-alert-title,.rst-content .wy-alert-warning.admonition .admonition-title,.rst-content .wy-alert-warning.admonition .wy-alert-title,.rst-content .wy-alert-warning.danger .admonition-title,.rst-content .wy-alert-warning.danger .wy-alert-title,.rst-content .wy-alert-warning.error .admonition-title,.rst-content .wy-alert-warning.error .wy-alert-title,.rst-content .wy-alert-warning.hint .admonition-title,.rst-content .wy-alert-warning.hint .wy-alert-title,.rst-content .wy-alert-warning.important .admonition-title,.rst-content .wy-alert-warning.important .wy-alert-title,.rst-content .wy-alert-warning.note .admonition-title,.rst-content .wy-alert-warning.note .wy-alert-title,.rst-content .wy-alert-warning.seealso .admonition-title,.rst-content .wy-alert-warning.seealso .wy-alert-title,.rst-content .wy-alert-warning.tip .admonition-title,.rst-content .wy-alert-warning.tip .wy-alert-title,.rst-content .wy-alert.wy-alert-warning .admonition-title,.wy-alert.wy-alert-warning .rst-content .admonition-title,.wy-alert.wy-alert-warning .wy-alert-title{background:#f0b37e}.rst-content .note,.rst-content .seealso,.rst-content .wy-alert-info.admonition,.rst-content .wy-alert-info.admonition-todo,.rst-content .wy-alert-info.attention,.rst-content .wy-alert-info.caution,.rst-content .wy-alert-info.danger,.rst-content .wy-alert-info.error,.rst-content .wy-alert-info.hint,.rst-content .wy-alert-info.important,.rst-content .wy-alert-info.tip,.rst-content .wy-alert-info.warning,.wy-alert.wy-alert-info{background:#e7f2fa}.rst-content .note .admonition-title,.rst-content .note .wy-alert-title,.rst-content .seealso .admonition-title,.rst-content .seealso .wy-alert-title,.rst-content .wy-alert-info.admonition-todo .admonition-title,.rst-content .wy-alert-info.admonition-todo .wy-alert-title,.rst-content .wy-alert-info.admonition .admonition-title,.rst-content .wy-alert-info.admonition .wy-alert-title,.rst-content .wy-alert-info.attention .admonition-title,.rst-content .wy-alert-info.attention .wy-alert-title,.rst-content .wy-alert-info.caution .admonition-title,.rst-content .wy-alert-info.caution .wy-alert-title,.rst-content .wy-alert-info.danger .admonition-title,.rst-content .wy-alert-info.danger .wy-alert-title,.rst-content .wy-alert-info.error .admonition-title,.rst-content .wy-alert-info.error .wy-alert-title,.rst-content .wy-alert-info.hint .admonition-title,.rst-content .wy-alert-info.hint .wy-alert-title,.rst-content .wy-alert-info.important .admonition-title,.rst-content .wy-alert-info.important .wy-alert-title,.rst-content .wy-alert-info.tip .admonition-title,.rst-content .wy-alert-info.tip .wy-alert-title,.rst-content .wy-alert-info.warning .admonition-title,.rst-content .wy-alert-info.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-info .admonition-title,.wy-alert.wy-alert-info .rst-content .admonition-title,.wy-alert.wy-alert-info .wy-alert-title{background:#6ab0de}.rst-content .hint,.rst-content .important,.rst-content .tip,.rst-content .wy-alert-success.admonition,.rst-content .wy-alert-success.admonition-todo,.rst-content .wy-alert-success.attention,.rst-content .wy-alert-success.caution,.rst-content .wy-alert-success.danger,.rst-content .wy-alert-success.error,.rst-content .wy-alert-success.note,.rst-content .wy-alert-success.seealso,.rst-content .wy-alert-success.warning,.wy-alert.wy-alert-success{background:#dbfaf4}.rst-content .hint .admonition-title,.rst-content .hint .wy-alert-title,.rst-content .important .admonition-title,.rst-content .important .wy-alert-title,.rst-content .tip .admonition-title,.rst-content .tip .wy-alert-title,.rst-content .wy-alert-success.admonition-todo .admonition-title,.rst-content .wy-alert-success.admonition-todo .wy-alert-title,.rst-content .wy-alert-success.admonition .admonition-title,.rst-content .wy-alert-success.admonition .wy-alert-title,.rst-content .wy-alert-success.attention .admonition-title,.rst-content .wy-alert-success.attention .wy-alert-title,.rst-content .wy-alert-success.caution .admonition-title,.rst-content .wy-alert-success.caution .wy-alert-title,.rst-content .wy-alert-success.danger .admonition-title,.rst-content .wy-alert-success.danger .wy-alert-title,.rst-content .wy-alert-success.error .admonition-title,.rst-content .wy-alert-success.error .wy-alert-title,.rst-content .wy-alert-success.note .admonition-title,.rst-content .wy-alert-success.note .wy-alert-title,.rst-content .wy-alert-success.seealso .admonition-title,.rst-content .wy-alert-success.seealso .wy-alert-title,.rst-content .wy-alert-success.warning .admonition-title,.rst-content .wy-alert-success.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-success .admonition-title,.wy-alert.wy-alert-success .rst-content .admonition-title,.wy-alert.wy-alert-success .wy-alert-title{background:#1abc9c}.rst-content .wy-alert-neutral.admonition,.rst-content .wy-alert-neutral.admonition-todo,.rst-content .wy-alert-neutral.attention,.rst-content .wy-alert-neutral.caution,.rst-content .wy-alert-neutral.danger,.rst-content .wy-alert-neutral.error,.rst-content .wy-alert-neutral.hint,.rst-content .wy-alert-neutral.important,.rst-content .wy-alert-neutral.note,.rst-content .wy-alert-neutral.seealso,.rst-content .wy-alert-neutral.tip,.rst-content .wy-alert-neutral.warning,.wy-alert.wy-alert-neutral{background:#f3f6f6}.rst-content .wy-alert-neutral.admonition-todo .admonition-title,.rst-content .wy-alert-neutral.admonition-todo .wy-alert-title,.rst-content .wy-alert-neutral.admonition .admonition-title,.rst-content .wy-alert-neutral.admonition .wy-alert-title,.rst-content .wy-alert-neutral.attention .admonition-title,.rst-content .wy-alert-neutral.attention .wy-alert-title,.rst-content .wy-alert-neutral.caution .admonition-title,.rst-content .wy-alert-neutral.caution .wy-alert-title,.rst-content .wy-alert-neutral.danger .admonition-title,.rst-content .wy-alert-neutral.danger .wy-alert-title,.rst-content .wy-alert-neutral.error .admonition-title,.rst-content .wy-alert-neutral.error .wy-alert-title,.rst-content .wy-alert-neutral.hint .admonition-title,.rst-content .wy-alert-neutral.hint .wy-alert-title,.rst-content .wy-alert-neutral.important .admonition-title,.rst-content .wy-alert-neutral.important .wy-alert-title,.rst-content .wy-alert-neutral.note .admonition-title,.rst-content .wy-alert-neutral.note .wy-alert-title,.rst-content .wy-alert-neutral.seealso .admonition-title,.rst-content .wy-alert-neutral.seealso .wy-alert-title,.rst-content .wy-alert-neutral.tip .admonition-title,.rst-content .wy-alert-neutral.tip .wy-alert-title,.rst-content .wy-alert-neutral.warning .admonition-title,.rst-content .wy-alert-neutral.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-neutral .admonition-title,.wy-alert.wy-alert-neutral .rst-content .admonition-title,.wy-alert.wy-alert-neutral .wy-alert-title{color:#404040;background:#e1e4e5}.rst-content .wy-alert-neutral.admonition-todo a,.rst-content .wy-alert-neutral.admonition a,.rst-content .wy-alert-neutral.attention a,.rst-content .wy-alert-neutral.caution a,.rst-content .wy-alert-neutral.danger a,.rst-content .wy-alert-neutral.error a,.rst-content .wy-alert-neutral.hint a,.rst-content .wy-alert-neutral.important a,.rst-content .wy-alert-neutral.note a,.rst-content .wy-alert-neutral.seealso a,.rst-content .wy-alert-neutral.tip a,.rst-content .wy-alert-neutral.warning a,.wy-alert.wy-alert-neutral a{color:#2980b9}.rst-content .admonition-todo p:last-child,.rst-content .admonition p:last-child,.rst-content .attention p:last-child,.rst-content .caution p:last-child,.rst-content .danger p:last-child,.rst-content .error p:last-child,.rst-content .hint p:last-child,.rst-content .important p:last-child,.rst-content .note p:last-child,.rst-content .seealso p:last-child,.rst-content .tip p:last-child,.rst-content .warning p:last-child,.wy-alert p:last-child{margin-bottom:0}.wy-tray-container{position:fixed;bottom:0;left:0;z-index:600}.wy-tray-container li{display:block;width:300px;background:transparent;color:#fff;text-align:center;box-shadow:0 5px 5px 0 rgba(0,0,0,.1);padding:0 24px;min-width:20%;opacity:0;height:0;line-height:56px;overflow:hidden;-webkit-transition:all .3s ease-in;-moz-transition:all .3s ease-in;transition:all .3s ease-in}.wy-tray-container li.wy-tray-item-success{background:#27ae60}.wy-tray-container li.wy-tray-item-info{background:#2980b9}.wy-tray-container li.wy-tray-item-warning{background:#e67e22}.wy-tray-container li.wy-tray-item-danger{background:#e74c3c}.wy-tray-container li.on{opacity:1;height:56px}@media screen and (max-width:768px){.wy-tray-container{bottom:auto;top:0;width:100%}.wy-tray-container li{width:100%}}button{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle;cursor:pointer;line-height:normal;-webkit-appearance:button;*overflow:visible}button::-moz-focus-inner,input::-moz-focus-inner{border:0;padding:0}button[disabled]{cursor:default}.btn{display:inline-block;border-radius:2px;line-height:normal;white-space:nowrap;text-align:center;cursor:pointer;font-size:100%;padding:6px 12px 8px;color:#fff;border:1px solid rgba(0,0,0,.1);background-color:#27ae60;text-decoration:none;font-weight:400;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;box-shadow:inset 0 1px 2px -1px hsla(0,0%,100%,.5),inset 0 -2px 0 0 rgba(0,0,0,.1);outline-none:false;vertical-align:middle;*display:inline;zoom:1;-webkit-user-drag:none;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;-webkit-transition:all .1s linear;-moz-transition:all .1s linear;transition:all .1s linear}.btn-hover{background:#2e8ece;color:#fff}.btn:hover{background:#2cc36b;color:#fff}.btn:focus{background:#2cc36b;outline:0}.btn:active{box-shadow:inset 0 -1px 0 0 rgba(0,0,0,.05),inset 0 2px 0 0 rgba(0,0,0,.1);padding:8px 12px 6px}.btn:visited{color:#fff}.btn-disabled,.btn-disabled:active,.btn-disabled:focus,.btn-disabled:hover,.btn:disabled{background-image:none;filter:progid:DXImageTransform.Microsoft.gradient(enabled = false);filter:alpha(opacity=40);opacity:.4;cursor:not-allowed;box-shadow:none}.btn::-moz-focus-inner{padding:0;border:0}.btn-small{font-size:80%}.btn-info{background-color:#2980b9!important}.btn-info:hover{background-color:#2e8ece!important}.btn-neutral{background-color:#f3f6f6!important;color:#404040!important}.btn-neutral:hover{background-color:#e5ebeb!important;color:#404040}.btn-neutral:visited{color:#404040!important}.btn-success{background-color:#27ae60!important}.btn-success:hover{background-color:#295!important}.btn-danger{background-color:#e74c3c!important}.btn-danger:hover{background-color:#ea6153!important}.btn-warning{background-color:#e67e22!important}.btn-warning:hover{background-color:#e98b39!important}.btn-invert{background-color:#222}.btn-invert:hover{background-color:#2f2f2f!important}.btn-link{background-color:transparent!important;color:#2980b9;box-shadow:none;border-color:transparent!important}.btn-link:active,.btn-link:hover{background-color:transparent!important;color:#409ad5!important;box-shadow:none}.btn-link:visited{color:#9b59b6}.wy-btn-group .btn,.wy-control .btn{vertical-align:middle}.wy-btn-group{margin-bottom:24px;*zoom:1}.wy-btn-group:after,.wy-btn-group:before{display:table;content:""}.wy-btn-group:after{clear:both}.wy-dropdown{position:relative;display:inline-block}.wy-dropdown-active .wy-dropdown-menu{display:block}.wy-dropdown-menu{position:absolute;left:0;display:none;float:left;top:100%;min-width:100%;background:#fcfcfc;z-index:100;border:1px solid #cfd7dd;box-shadow:0 2px 2px 0 rgba(0,0,0,.1);padding:12px}.wy-dropdown-menu>dd>a{display:block;clear:both;color:#404040;white-space:nowrap;font-size:90%;padding:0 12px;cursor:pointer}.wy-dropdown-menu>dd>a:hover{background:#2980b9;color:#fff}.wy-dropdown-menu>dd.divider{border-top:1px solid #cfd7dd;margin:6px 0}.wy-dropdown-menu>dd.search{padding-bottom:12px}.wy-dropdown-menu>dd.search input[type=search]{width:100%}.wy-dropdown-menu>dd.call-to-action{background:#e3e3e3;text-transform:uppercase;font-weight:500;font-size:80%}.wy-dropdown-menu>dd.call-to-action:hover{background:#e3e3e3}.wy-dropdown-menu>dd.call-to-action .btn{color:#fff}.wy-dropdown.wy-dropdown-up .wy-dropdown-menu{bottom:100%;top:auto;left:auto;right:0}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu{background:#fcfcfc;margin-top:2px}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu a{padding:6px 12px}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu a:hover{background:#2980b9;color:#fff}.wy-dropdown.wy-dropdown-left .wy-dropdown-menu{right:0;left:auto;text-align:right}.wy-dropdown-arrow:before{content:" ";border-bottom:5px solid #f5f5f5;border-left:5px solid transparent;border-right:5px solid transparent;position:absolute;display:block;top:-4px;left:50%;margin-left:-3px}.wy-dropdown-arrow.wy-dropdown-arrow-left:before{left:11px}.wy-form-stacked select{display:block}.wy-form-aligned .wy-help-inline,.wy-form-aligned input,.wy-form-aligned label,.wy-form-aligned select,.wy-form-aligned textarea{display:inline-block;*display:inline;*zoom:1;vertical-align:middle}.wy-form-aligned .wy-control-group>label{display:inline-block;vertical-align:middle;width:10em;margin:6px 12px 0 0;float:left}.wy-form-aligned .wy-control{float:left}.wy-form-aligned .wy-control label{display:block}.wy-form-aligned .wy-control select{margin-top:6px}fieldset{margin:0}fieldset,legend{border:0;padding:0}legend{width:100%;white-space:normal;margin-bottom:24px;font-size:150%;*margin-left:-7px}label,legend{display:block}label{margin:0 0 .3125em;color:#333;font-size:90%}input,select,textarea{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle}.wy-control-group{margin-bottom:24px;max-width:1200px;margin-left:auto;margin-right:auto;*zoom:1}.wy-control-group:after,.wy-control-group:before{display:table;content:""}.wy-control-group:after{clear:both}.wy-control-group.wy-control-group-required>label:after{content:" *";color:#e74c3c}.wy-control-group .wy-form-full,.wy-control-group .wy-form-halves,.wy-control-group .wy-form-thirds{padding-bottom:12px}.wy-control-group .wy-form-full input[type=color],.wy-control-group .wy-form-full input[type=date],.wy-control-group .wy-form-full input[type=datetime-local],.wy-control-group .wy-form-full input[type=datetime],.wy-control-group .wy-form-full input[type=email],.wy-control-group .wy-form-full input[type=month],.wy-control-group .wy-form-full input[type=number],.wy-control-group .wy-form-full input[type=password],.wy-control-group .wy-form-full input[type=search],.wy-control-group .wy-form-full input[type=tel],.wy-control-group .wy-form-full input[type=text],.wy-control-group .wy-form-full input[type=time],.wy-control-group .wy-form-full input[type=url],.wy-control-group .wy-form-full input[type=week],.wy-control-group .wy-form-full select,.wy-control-group .wy-form-halves input[type=color],.wy-control-group .wy-form-halves input[type=date],.wy-control-group .wy-form-halves input[type=datetime-local],.wy-control-group .wy-form-halves input[type=datetime],.wy-control-group .wy-form-halves input[type=email],.wy-control-group .wy-form-halves input[type=month],.wy-control-group .wy-form-halves input[type=number],.wy-control-group .wy-form-halves input[type=password],.wy-control-group .wy-form-halves input[type=search],.wy-control-group .wy-form-halves input[type=tel],.wy-control-group .wy-form-halves input[type=text],.wy-control-group .wy-form-halves input[type=time],.wy-control-group .wy-form-halves input[type=url],.wy-control-group .wy-form-halves input[type=week],.wy-control-group .wy-form-halves select,.wy-control-group .wy-form-thirds input[type=color],.wy-control-group .wy-form-thirds input[type=date],.wy-control-group .wy-form-thirds input[type=datetime-local],.wy-control-group .wy-form-thirds input[type=datetime],.wy-control-group .wy-form-thirds input[type=email],.wy-control-group .wy-form-thirds input[type=month],.wy-control-group .wy-form-thirds input[type=number],.wy-control-group .wy-form-thirds input[type=password],.wy-control-group .wy-form-thirds input[type=search],.wy-control-group .wy-form-thirds input[type=tel],.wy-control-group .wy-form-thirds input[type=text],.wy-control-group .wy-form-thirds input[type=time],.wy-control-group .wy-form-thirds input[type=url],.wy-control-group .wy-form-thirds input[type=week],.wy-control-group .wy-form-thirds select{width:100%}.wy-control-group .wy-form-full{float:left;display:block;width:100%;margin-right:0}.wy-control-group .wy-form-full:last-child{margin-right:0}.wy-control-group .wy-form-halves{float:left;display:block;margin-right:2.35765%;width:48.82117%}.wy-control-group .wy-form-halves:last-child,.wy-control-group .wy-form-halves:nth-of-type(2n){margin-right:0}.wy-control-group .wy-form-halves:nth-of-type(odd){clear:left}.wy-control-group .wy-form-thirds{float:left;display:block;margin-right:2.35765%;width:31.76157%}.wy-control-group .wy-form-thirds:last-child,.wy-control-group .wy-form-thirds:nth-of-type(3n){margin-right:0}.wy-control-group .wy-form-thirds:nth-of-type(3n+1){clear:left}.wy-control-group.wy-control-group-no-input .wy-control,.wy-control-no-input{margin:6px 0 0;font-size:90%}.wy-control-no-input{display:inline-block}.wy-control-group.fluid-input input[type=color],.wy-control-group.fluid-input input[type=date],.wy-control-group.fluid-input input[type=datetime-local],.wy-control-group.fluid-input input[type=datetime],.wy-control-group.fluid-input input[type=email],.wy-control-group.fluid-input input[type=month],.wy-control-group.fluid-input input[type=number],.wy-control-group.fluid-input input[type=password],.wy-control-group.fluid-input input[type=search],.wy-control-group.fluid-input input[type=tel],.wy-control-group.fluid-input input[type=text],.wy-control-group.fluid-input input[type=time],.wy-control-group.fluid-input input[type=url],.wy-control-group.fluid-input input[type=week]{width:100%}.wy-form-message-inline{padding-left:.3em;color:#666;font-size:90%}.wy-form-message{display:block;color:#999;font-size:70%;margin-top:.3125em;font-style:italic}.wy-form-message p{font-size:inherit;font-style:italic;margin-bottom:6px}.wy-form-message p:last-child{margin-bottom:0}input{line-height:normal}input[type=button],input[type=reset],input[type=submit]{-webkit-appearance:button;cursor:pointer;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;*overflow:visible}input[type=color],input[type=date],input[type=datetime-local],input[type=datetime],input[type=email],input[type=month],input[type=number],input[type=password],input[type=search],input[type=tel],input[type=text],input[type=time],input[type=url],input[type=week]{-webkit-appearance:none;padding:6px;display:inline-block;border:1px solid #ccc;font-size:80%;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;box-shadow:inset 0 1px 3px #ddd;border-radius:0;-webkit-transition:border .3s linear;-moz-transition:border .3s linear;transition:border .3s linear}input[type=datetime-local]{padding:.34375em .625em}input[disabled]{cursor:default}input[type=checkbox],input[type=radio]{padding:0;margin-right:.3125em;*height:13px;*width:13px}input[type=checkbox],input[type=radio],input[type=search]{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}input[type=search]::-webkit-search-cancel-button,input[type=search]::-webkit-search-decoration{-webkit-appearance:none}input[type=color]:focus,input[type=date]:focus,input[type=datetime-local]:focus,input[type=datetime]:focus,input[type=email]:focus,input[type=month]:focus,input[type=number]:focus,input[type=password]:focus,input[type=search]:focus,input[type=tel]:focus,input[type=text]:focus,input[type=time]:focus,input[type=url]:focus,input[type=week]:focus{outline:0;outline:thin dotted\9;border-color:#333}input.no-focus:focus{border-color:#ccc!important}input[type=checkbox]:focus,input[type=file]:focus,input[type=radio]:focus{outline:thin dotted #333;outline:1px auto #129fea}input[type=color][disabled],input[type=date][disabled],input[type=datetime-local][disabled],input[type=datetime][disabled],input[type=email][disabled],input[type=month][disabled],input[type=number][disabled],input[type=password][disabled],input[type=search][disabled],input[type=tel][disabled],input[type=text][disabled],input[type=time][disabled],input[type=url][disabled],input[type=week][disabled]{cursor:not-allowed;background-color:#fafafa}input:focus:invalid,select:focus:invalid,textarea:focus:invalid{color:#e74c3c;border:1px solid #e74c3c}input:focus:invalid:focus,select:focus:invalid:focus,textarea:focus:invalid:focus{border-color:#e74c3c}input[type=checkbox]:focus:invalid:focus,input[type=file]:focus:invalid:focus,input[type=radio]:focus:invalid:focus{outline-color:#e74c3c}input.wy-input-large{padding:12px;font-size:100%}textarea{overflow:auto;vertical-align:top;width:100%;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif}select,textarea{padding:.5em .625em;display:inline-block;border:1px solid #ccc;font-size:80%;box-shadow:inset 0 1px 3px #ddd;-webkit-transition:border .3s linear;-moz-transition:border .3s linear;transition:border .3s linear}select{border:1px solid #ccc;background-color:#fff}select[multiple]{height:auto}select:focus,textarea:focus{outline:0}input[readonly],select[disabled],select[readonly],textarea[disabled],textarea[readonly]{cursor:not-allowed;background-color:#fafafa}input[type=checkbox][disabled],input[type=radio][disabled]{cursor:not-allowed}.wy-checkbox,.wy-radio{margin:6px 0;color:#404040;display:block}.wy-checkbox input,.wy-radio input{vertical-align:baseline}.wy-form-message-inline{display:inline-block;*display:inline;*zoom:1;vertical-align:middle}.wy-input-prefix,.wy-input-suffix{white-space:nowrap;padding:6px}.wy-input-prefix .wy-input-context,.wy-input-suffix .wy-input-context{line-height:27px;padding:0 8px;display:inline-block;font-size:80%;background-color:#f3f6f6;border:1px solid #ccc;color:#999}.wy-input-suffix .wy-input-context{border-left:0}.wy-input-prefix .wy-input-context{border-right:0}.wy-switch{position:relative;display:block;height:24px;margin-top:12px;cursor:pointer}.wy-switch:before{left:0;top:0;width:36px;height:12px;background:#ccc}.wy-switch:after,.wy-switch:before{position:absolute;content:"";display:block;border-radius:4px;-webkit-transition:all .2s ease-in-out;-moz-transition:all .2s ease-in-out;transition:all .2s ease-in-out}.wy-switch:after{width:18px;height:18px;background:#999;left:-3px;top:-3px}.wy-switch span{position:absolute;left:48px;display:block;font-size:12px;color:#ccc;line-height:1}.wy-switch.active:before{background:#1e8449}.wy-switch.active:after{left:24px;background:#27ae60}.wy-switch.disabled{cursor:not-allowed;opacity:.8}.wy-control-group.wy-control-group-error .wy-form-message,.wy-control-group.wy-control-group-error>label{color:#e74c3c}.wy-control-group.wy-control-group-error input[type=color],.wy-control-group.wy-control-group-error input[type=date],.wy-control-group.wy-control-group-error input[type=datetime-local],.wy-control-group.wy-control-group-error input[type=datetime],.wy-control-group.wy-control-group-error input[type=email],.wy-control-group.wy-control-group-error input[type=month],.wy-control-group.wy-control-group-error input[type=number],.wy-control-group.wy-control-group-error input[type=password],.wy-control-group.wy-control-group-error input[type=search],.wy-control-group.wy-control-group-error input[type=tel],.wy-control-group.wy-control-group-error input[type=text],.wy-control-group.wy-control-group-error input[type=time],.wy-control-group.wy-control-group-error input[type=url],.wy-control-group.wy-control-group-error input[type=week],.wy-control-group.wy-control-group-error textarea{border:1px solid #e74c3c}.wy-inline-validate{white-space:nowrap}.wy-inline-validate .wy-input-context{padding:.5em .625em;display:inline-block;font-size:80%}.wy-inline-validate.wy-inline-validate-success .wy-input-context{color:#27ae60}.wy-inline-validate.wy-inline-validate-danger .wy-input-context{color:#e74c3c}.wy-inline-validate.wy-inline-validate-warning .wy-input-context{color:#e67e22}.wy-inline-validate.wy-inline-validate-info .wy-input-context{color:#2980b9}.rotate-90{-webkit-transform:rotate(90deg);-moz-transform:rotate(90deg);-ms-transform:rotate(90deg);-o-transform:rotate(90deg);transform:rotate(90deg)}.rotate-180{-webkit-transform:rotate(180deg);-moz-transform:rotate(180deg);-ms-transform:rotate(180deg);-o-transform:rotate(180deg);transform:rotate(180deg)}.rotate-270{-webkit-transform:rotate(270deg);-moz-transform:rotate(270deg);-ms-transform:rotate(270deg);-o-transform:rotate(270deg);transform:rotate(270deg)}.mirror{-webkit-transform:scaleX(-1);-moz-transform:scaleX(-1);-ms-transform:scaleX(-1);-o-transform:scaleX(-1);transform:scaleX(-1)}.mirror.rotate-90{-webkit-transform:scaleX(-1) rotate(90deg);-moz-transform:scaleX(-1) rotate(90deg);-ms-transform:scaleX(-1) rotate(90deg);-o-transform:scaleX(-1) rotate(90deg);transform:scaleX(-1) rotate(90deg)}.mirror.rotate-180{-webkit-transform:scaleX(-1) rotate(180deg);-moz-transform:scaleX(-1) rotate(180deg);-ms-transform:scaleX(-1) rotate(180deg);-o-transform:scaleX(-1) rotate(180deg);transform:scaleX(-1) rotate(180deg)}.mirror.rotate-270{-webkit-transform:scaleX(-1) rotate(270deg);-moz-transform:scaleX(-1) rotate(270deg);-ms-transform:scaleX(-1) rotate(270deg);-o-transform:scaleX(-1) rotate(270deg);transform:scaleX(-1) rotate(270deg)}@media only screen and (max-width:480px){.wy-form button[type=submit]{margin:.7em 0 0}.wy-form input[type=color],.wy-form input[type=date],.wy-form input[type=datetime-local],.wy-form input[type=datetime],.wy-form input[type=email],.wy-form input[type=month],.wy-form input[type=number],.wy-form input[type=password],.wy-form input[type=search],.wy-form input[type=tel],.wy-form input[type=text],.wy-form input[type=time],.wy-form input[type=url],.wy-form input[type=week],.wy-form label{margin-bottom:.3em;display:block}.wy-form input[type=color],.wy-form input[type=date],.wy-form input[type=datetime-local],.wy-form input[type=datetime],.wy-form input[type=email],.wy-form input[type=month],.wy-form input[type=number],.wy-form input[type=password],.wy-form input[type=search],.wy-form input[type=tel],.wy-form input[type=time],.wy-form input[type=url],.wy-form input[type=week]{margin-bottom:0}.wy-form-aligned .wy-control-group label{margin-bottom:.3em;text-align:left;display:block;width:100%}.wy-form-aligned .wy-control{margin:1.5em 0 0}.wy-form-message,.wy-form-message-inline,.wy-form .wy-help-inline{display:block;font-size:80%;padding:6px 0}}@media screen and (max-width:768px){.tablet-hide{display:none}}@media screen and (max-width:480px){.mobile-hide{display:none}}.float-left{float:left}.float-right{float:right}.full-width{width:100%}.rst-content table.docutils,.rst-content table.field-list,.wy-table{border-collapse:collapse;border-spacing:0;empty-cells:show;margin-bottom:24px}.rst-content table.docutils caption,.rst-content table.field-list caption,.wy-table caption{color:#000;font:italic 85%/1 arial,sans-serif;padding:1em 0;text-align:center}.rst-content table.docutils td,.rst-content table.docutils th,.rst-content table.field-list td,.rst-content table.field-list th,.wy-table td,.wy-table th{font-size:90%;margin:0;overflow:visible;padding:8px 16px}.rst-content table.docutils td:first-child,.rst-content table.docutils th:first-child,.rst-content table.field-list td:first-child,.rst-content table.field-list th:first-child,.wy-table td:first-child,.wy-table th:first-child{border-left-width:0}.rst-content table.docutils thead,.rst-content table.field-list thead,.wy-table thead{color:#000;text-align:left;vertical-align:bottom;white-space:nowrap}.rst-content table.docutils thead th,.rst-content table.field-list thead th,.wy-table thead th{font-weight:700;border-bottom:2px solid #e1e4e5}.rst-content table.docutils td,.rst-content table.field-list td,.wy-table td{background-color:transparent;vertical-align:middle}.rst-content table.docutils td p,.rst-content table.field-list td p,.wy-table td p{line-height:18px}.rst-content table.docutils td p:last-child,.rst-content table.field-list td p:last-child,.wy-table td p:last-child{margin-bottom:0}.rst-content table.docutils .wy-table-cell-min,.rst-content table.field-list .wy-table-cell-min,.wy-table .wy-table-cell-min{width:1%;padding-right:0}.rst-content table.docutils .wy-table-cell-min input[type=checkbox],.rst-content table.field-list .wy-table-cell-min input[type=checkbox],.wy-table .wy-table-cell-min input[type=checkbox]{margin:0}.wy-table-secondary{color:grey;font-size:90%}.wy-table-tertiary{color:grey;font-size:80%}.rst-content table.docutils:not(.field-list) tr:nth-child(2n-1) td,.wy-table-backed,.wy-table-odd td,.wy-table-striped tr:nth-child(2n-1) td{background-color:#f3f6f6}.rst-content table.docutils,.wy-table-bordered-all{border:1px solid #e1e4e5}.rst-content table.docutils td,.wy-table-bordered-all td{border-bottom:1px solid #e1e4e5;border-left:1px solid #e1e4e5}.rst-content table.docutils tbody>tr:last-child td,.wy-table-bordered-all tbody>tr:last-child td{border-bottom-width:0}.wy-table-bordered{border:1px solid #e1e4e5}.wy-table-bordered-rows td{border-bottom:1px solid #e1e4e5}.wy-table-bordered-rows tbody>tr:last-child td{border-bottom-width:0}.wy-table-horizontal td,.wy-table-horizontal th{border-width:0 0 1px;border-bottom:1px solid #e1e4e5}.wy-table-horizontal tbody>tr:last-child td{border-bottom-width:0}.wy-table-responsive{margin-bottom:24px;max-width:100%;overflow:auto}.wy-table-responsive table{margin-bottom:0!important}.wy-table-responsive table td,.wy-table-responsive table th{white-space:nowrap}a{color:#2980b9;text-decoration:none;cursor:pointer}a:hover{color:#3091d1}a:visited{color:#9b59b6}html{height:100%}body,html{overflow-x:hidden}body{font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;font-weight:400;color:#404040;min-height:100%;background:#edf0f2}.wy-text-left{text-align:left}.wy-text-center{text-align:center}.wy-text-right{text-align:right}.wy-text-large{font-size:120%}.wy-text-normal{font-size:100%}.wy-text-small,small{font-size:80%}.wy-text-strike{text-decoration:line-through}.wy-text-warning{color:#e67e22!important}a.wy-text-warning:hover{color:#eb9950!important}.wy-text-info{color:#2980b9!important}a.wy-text-info:hover{color:#409ad5!important}.wy-text-success{color:#27ae60!important}a.wy-text-success:hover{color:#36d278!important}.wy-text-danger{color:#e74c3c!important}a.wy-text-danger:hover{color:#ed7669!important}.wy-text-neutral{color:#404040!important}a.wy-text-neutral:hover{color:#595959!important}.rst-content .toctree-wrapper>p.caption,h1,h2,h3,h4,h5,h6,legend{margin-top:0;font-weight:700;font-family:Roboto Slab,ff-tisa-web-pro,Georgia,Arial,sans-serif}p{line-height:24px;font-size:16px;margin:0 0 24px}h1{font-size:175%}.rst-content .toctree-wrapper>p.caption,h2{font-size:150%}h3{font-size:125%}h4{font-size:115%}h5{font-size:110%}h6{font-size:100%}hr{display:block;height:1px;border:0;border-top:1px solid #e1e4e5;margin:24px 0;padding:0}.rst-content code,.rst-content tt,code{white-space:nowrap;max-width:100%;background:#fff;border:1px solid #e1e4e5;font-size:75%;padding:0 5px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;color:#e74c3c;overflow-x:auto}.rst-content tt.code-large,code.code-large{font-size:90%}.rst-content .section ul,.rst-content .toctree-wrapper ul,.wy-plain-list-disc,article ul{list-style:disc;line-height:24px;margin-bottom:24px}.rst-content .section ul li,.rst-content .toctree-wrapper ul li,.wy-plain-list-disc li,article ul li{list-style:disc;margin-left:24px}.rst-content .section ul li p:last-child,.rst-content .section ul li ul,.rst-content .toctree-wrapper ul li p:last-child,.rst-content .toctree-wrapper ul li ul,.wy-plain-list-disc li p:last-child,.wy-plain-list-disc li ul,article ul li p:last-child,article ul li ul{margin-bottom:0}.rst-content .section ul li li,.rst-content .toctree-wrapper ul li li,.wy-plain-list-disc li li,article ul li li{list-style:circle}.rst-content .section ul li li li,.rst-content .toctree-wrapper ul li li li,.wy-plain-list-disc li li li,article ul li li li{list-style:square}.rst-content .section ul li ol li,.rst-content .toctree-wrapper ul li ol li,.wy-plain-list-disc li ol li,article ul li ol li{list-style:decimal}.rst-content .section ol,.rst-content ol.arabic,.wy-plain-list-decimal,article ol{list-style:decimal;line-height:24px;margin-bottom:24px}.rst-content .section ol li,.rst-content ol.arabic li,.wy-plain-list-decimal li,article ol li{list-style:decimal;margin-left:24px}.rst-content .section ol li p:last-child,.rst-content .section ol li ul,.rst-content ol.arabic li p:last-child,.rst-content ol.arabic li ul,.wy-plain-list-decimal li p:last-child,.wy-plain-list-decimal li ul,article ol li p:last-child,article ol li ul{margin-bottom:0}.rst-content .section ol li ul li,.rst-content ol.arabic li ul li,.wy-plain-list-decimal li ul li,article ol li ul li{list-style:disc}.wy-breadcrumbs{*zoom:1}.wy-breadcrumbs:after,.wy-breadcrumbs:before{display:table;content:""}.wy-breadcrumbs:after{clear:both}.wy-breadcrumbs li{display:inline-block}.wy-breadcrumbs li.wy-breadcrumbs-aside{float:right}.wy-breadcrumbs li a{display:inline-block;padding:5px}.wy-breadcrumbs li a:first-child{padding-left:0}.rst-content .wy-breadcrumbs li tt,.wy-breadcrumbs li .rst-content tt,.wy-breadcrumbs li code{padding:5px;border:none;background:none}.rst-content .wy-breadcrumbs li tt.literal,.wy-breadcrumbs li .rst-content tt.literal,.wy-breadcrumbs li code.literal{color:#404040}.wy-breadcrumbs-extra{margin-bottom:0;color:#b3b3b3;font-size:80%;display:inline-block}@media screen and (max-width:480px){.wy-breadcrumbs-extra,.wy-breadcrumbs li.wy-breadcrumbs-aside{display:none}}@media print{.wy-breadcrumbs li.wy-breadcrumbs-aside{display:none}}html{font-size:16px}.wy-affix{position:fixed;top:1.618em}.wy-menu a:hover{text-decoration:none}.wy-menu-horiz{*zoom:1}.wy-menu-horiz:after,.wy-menu-horiz:before{display:table;content:""}.wy-menu-horiz:after{clear:both}.wy-menu-horiz li,.wy-menu-horiz ul{display:inline-block}.wy-menu-horiz li:hover{background:hsla(0,0%,100%,.1)}.wy-menu-horiz li.divide-left{border-left:1px solid #404040}.wy-menu-horiz li.divide-right{border-right:1px solid #404040}.wy-menu-horiz a{height:32px;display:inline-block;line-height:32px;padding:0 16px}.wy-menu-vertical{width:300px}.wy-menu-vertical header,.wy-menu-vertical p.caption{color:#55a5d9;height:32px;line-height:32px;padding:0 1.618em;margin:12px 0 0;display:block;font-weight:700;text-transform:uppercase;font-size:85%;white-space:nowrap}.wy-menu-vertical ul{margin-bottom:0}.wy-menu-vertical li.divide-top{border-top:1px solid #404040}.wy-menu-vertical li.divide-bottom{border-bottom:1px solid #404040}.wy-menu-vertical li.current{background:#e3e3e3}.wy-menu-vertical li.current a{color:grey;border-right:1px solid #c9c9c9;padding:.4045em 2.427em}.wy-menu-vertical li.current a:hover{background:#d6d6d6}.rst-content .wy-menu-vertical li tt,.wy-menu-vertical li .rst-content tt,.wy-menu-vertical li code{border:none;background:inherit;color:inherit;padding-left:0;padding-right:0}.wy-menu-vertical li span.toctree-expand{display:block;float:left;margin-left:-1.2em;line-height:18px;color:#4d4d4d}.wy-menu-vertical li.current>a,.wy-menu-vertical li.on a{color:#404040;font-weight:700;position:relative;background:#fcfcfc;border:none;padding:.4045em 1.618em}.wy-menu-vertical li.current>a:hover,.wy-menu-vertical li.on a:hover{background:#fcfcfc}.wy-menu-vertical li.current>a:hover span.toctree-expand,.wy-menu-vertical li.on a:hover span.toctree-expand{color:grey}.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand{display:block;line-height:18px;color:#333}.wy-menu-vertical li.toctree-l1.current>a{border-bottom:1px solid #c9c9c9;border-top:1px solid #c9c9c9}.wy-menu-vertical .toctree-l1.current .toctree-l2>ul,.wy-menu-vertical .toctree-l2.current .toctree-l3>ul,.wy-menu-vertical .toctree-l3.current .toctree-l4>ul,.wy-menu-vertical .toctree-l4.current .toctree-l5>ul,.wy-menu-vertical .toctree-l5.current .toctree-l6>ul,.wy-menu-vertical .toctree-l6.current .toctree-l7>ul,.wy-menu-vertical .toctree-l7.current .toctree-l8>ul,.wy-menu-vertical .toctree-l8.current .toctree-l9>ul,.wy-menu-vertical .toctree-l9.current .toctree-l10>ul,.wy-menu-vertical .toctree-l10.current .toctree-l11>ul{display:none}.wy-menu-vertical .toctree-l1.current .current.toctree-l2>ul,.wy-menu-vertical .toctree-l2.current .current.toctree-l3>ul,.wy-menu-vertical .toctree-l3.current .current.toctree-l4>ul,.wy-menu-vertical .toctree-l4.current .current.toctree-l5>ul,.wy-menu-vertical .toctree-l5.current .current.toctree-l6>ul,.wy-menu-vertical .toctree-l6.current .current.toctree-l7>ul,.wy-menu-vertical .toctree-l7.current .current.toctree-l8>ul,.wy-menu-vertical .toctree-l8.current .current.toctree-l9>ul,.wy-menu-vertical .toctree-l9.current .current.toctree-l10>ul,.wy-menu-vertical .toctree-l10.current .current.toctree-l11>ul{display:block}.wy-menu-vertical li.toctree-l3,.wy-menu-vertical li.toctree-l4{font-size:.9em}.wy-menu-vertical li.toctree-l2 a,.wy-menu-vertical li.toctree-l3 a,.wy-menu-vertical li.toctree-l4 a,.wy-menu-vertical li.toctree-l5 a,.wy-menu-vertical li.toctree-l6 a,.wy-menu-vertical li.toctree-l7 a,.wy-menu-vertical li.toctree-l8 a,.wy-menu-vertical li.toctree-l9 a,.wy-menu-vertical li.toctree-l10 a{color:#404040}.wy-menu-vertical li.toctree-l2 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l3 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l4 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l5 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l6 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l7 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l8 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l9 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l10 a:hover span.toctree-expand{color:grey}.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a,.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a,.wy-menu-vertical li.toctree-l4.current li.toctree-l5>a,.wy-menu-vertical li.toctree-l5.current li.toctree-l6>a,.wy-menu-vertical li.toctree-l6.current li.toctree-l7>a,.wy-menu-vertical li.toctree-l7.current li.toctree-l8>a,.wy-menu-vertical li.toctree-l8.current li.toctree-l9>a,.wy-menu-vertical li.toctree-l9.current li.toctree-l10>a,.wy-menu-vertical li.toctree-l10.current li.toctree-l11>a{display:block}.wy-menu-vertical li.toctree-l2.current>a{padding:.4045em 2.427em}.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a{padding:.4045em 1.618em .4045em 4.045em}.wy-menu-vertical li.toctree-l3.current>a{padding:.4045em 4.045em}.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a{padding:.4045em 1.618em .4045em 5.663em}.wy-menu-vertical li.toctree-l4.current>a{padding:.4045em 5.663em}.wy-menu-vertical li.toctree-l4.current li.toctree-l5>a{padding:.4045em 1.618em .4045em 7.281em}.wy-menu-vertical li.toctree-l5.current>a{padding:.4045em 7.281em}.wy-menu-vertical li.toctree-l5.current li.toctree-l6>a{padding:.4045em 1.618em .4045em 8.899em}.wy-menu-vertical li.toctree-l6.current>a{padding:.4045em 8.899em}.wy-menu-vertical li.toctree-l6.current li.toctree-l7>a{padding:.4045em 1.618em .4045em 10.517em}.wy-menu-vertical li.toctree-l7.current>a{padding:.4045em 10.517em}.wy-menu-vertical li.toctree-l7.current li.toctree-l8>a{padding:.4045em 1.618em .4045em 12.135em}.wy-menu-vertical li.toctree-l8.current>a{padding:.4045em 12.135em}.wy-menu-vertical li.toctree-l8.current li.toctree-l9>a{padding:.4045em 1.618em .4045em 13.753em}.wy-menu-vertical li.toctree-l9.current>a{padding:.4045em 13.753em}.wy-menu-vertical li.toctree-l9.current li.toctree-l10>a{padding:.4045em 1.618em .4045em 15.371em}.wy-menu-vertical li.toctree-l10.current>a{padding:.4045em 15.371em}.wy-menu-vertical li.toctree-l10.current li.toctree-l11>a{padding:.4045em 1.618em .4045em 16.989em}.wy-menu-vertical li.toctree-l2.current>a,.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a{background:#c9c9c9}.wy-menu-vertical li.toctree-l2 span.toctree-expand{color:#a3a3a3}.wy-menu-vertical li.toctree-l3.current>a,.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a{background:#bdbdbd}.wy-menu-vertical li.toctree-l3 span.toctree-expand{color:#969696}.wy-menu-vertical li.current ul{display:block}.wy-menu-vertical li ul{margin-bottom:0;display:none}.wy-menu-vertical li ul li a{margin-bottom:0;color:#d9d9d9;font-weight:400}.wy-menu-vertical a{line-height:18px;padding:.4045em 1.618em;display:block;position:relative;font-size:90%;color:#d9d9d9}.wy-menu-vertical a:hover{background-color:#4e4a4a;cursor:pointer}.wy-menu-vertical a:hover span.toctree-expand{color:#d9d9d9}.wy-menu-vertical a:active{background-color:#2980b9;cursor:pointer;color:#fff}.wy-menu-vertical a:active span.toctree-expand{color:#fff}.wy-side-nav-search{display:block;width:300px;padding:.809em;margin-bottom:.809em;z-index:200;background-color:#2980b9;text-align:center;color:#fcfcfc}.wy-side-nav-search input[type=text]{width:100%;border-radius:50px;padding:6px 12px;border-color:#2472a4}.wy-side-nav-search img{display:block;margin:auto auto .809em;height:45px;width:45px;background-color:#2980b9;padding:5px;border-radius:100%}.wy-side-nav-search .wy-dropdown>a,.wy-side-nav-search>a{color:#fcfcfc;font-size:100%;font-weight:700;display:inline-block;padding:4px 6px;margin-bottom:.809em}.wy-side-nav-search .wy-dropdown>a:hover,.wy-side-nav-search>a:hover{background:hsla(0,0%,100%,.1)}.wy-side-nav-search .wy-dropdown>a img.logo,.wy-side-nav-search>a img.logo{display:block;margin:0 auto;height:auto;width:auto;border-radius:0;max-width:100%;background:transparent}.wy-side-nav-search .wy-dropdown>a.icon img.logo,.wy-side-nav-search>a.icon img.logo{margin-top:.85em}.wy-side-nav-search>div.version{margin-top:-.4045em;margin-bottom:.809em;font-weight:400;color:hsla(0,0%,100%,.3)}.wy-nav .wy-menu-vertical header{color:#2980b9}.wy-nav .wy-menu-vertical a{color:#b3b3b3}.wy-nav .wy-menu-vertical a:hover{background-color:#2980b9;color:#fff}[data-menu-wrap]{-webkit-transition:all .2s ease-in;-moz-transition:all .2s ease-in;transition:all .2s ease-in;position:absolute;opacity:1;width:100%;opacity:0}[data-menu-wrap].move-center{left:0;right:auto;opacity:1}[data-menu-wrap].move-left{right:auto;left:-100%;opacity:0}[data-menu-wrap].move-right{right:-100%;left:auto;opacity:0}.wy-body-for-nav{background:#fcfcfc}.wy-grid-for-nav{position:absolute;width:100%;height:100%}.wy-nav-side{position:fixed;top:0;bottom:0;left:0;padding-bottom:2em;width:300px;overflow-x:hidden;overflow-y:hidden;min-height:100%;color:#9b9b9b;background:#343131;z-index:200}.wy-side-scroll{width:320px;position:relative;overflow-x:hidden;overflow-y:scroll;height:100%}.wy-nav-top{display:none;background:#2980b9;color:#fff;padding:.4045em .809em;position:relative;line-height:50px;text-align:center;font-size:100%;*zoom:1}.wy-nav-top:after,.wy-nav-top:before{display:table;content:""}.wy-nav-top:after{clear:both}.wy-nav-top a{color:#fff;font-weight:700}.wy-nav-top img{margin-right:12px;height:45px;width:45px;background-color:#2980b9;padding:5px;border-radius:100%}.wy-nav-top i{font-size:30px;float:left;cursor:pointer;padding-top:inherit}.wy-nav-content-wrap{margin-left:300px;background:#fcfcfc;min-height:100%}.wy-nav-content{padding:1.618em 3.236em;height:100%;max-width:800px;margin:auto}.wy-body-mask{position:fixed;width:100%;height:100%;background:rgba(0,0,0,.2);display:none;z-index:499}.wy-body-mask.on{display:block}footer{color:grey}footer p{margin-bottom:12px}.rst-content footer span.commit tt,footer span.commit .rst-content tt,footer span.commit code{padding:0;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;font-size:1em;background:none;border:none;color:grey}.rst-footer-buttons{*zoom:1}.rst-footer-buttons:after,.rst-footer-buttons:before{width:100%;display:table;content:""}.rst-footer-buttons:after{clear:both}.rst-breadcrumbs-buttons{margin-top:12px;*zoom:1}.rst-breadcrumbs-buttons:after,.rst-breadcrumbs-buttons:before{display:table;content:""}.rst-breadcrumbs-buttons:after{clear:both}#search-results .search li{margin-bottom:24px;border-bottom:1px solid #e1e4e5;padding-bottom:24px}#search-results .search li:first-child{border-top:1px solid #e1e4e5;padding-top:24px}#search-results .search li a{font-size:120%;margin-bottom:12px;display:inline-block}#search-results .context{color:grey;font-size:90%}.genindextable li>ul{margin-left:24px}@media screen and (max-width:768px){.wy-body-for-nav{background:#fcfcfc}.wy-nav-top{display:block}.wy-nav-side{left:-300px}.wy-nav-side.shift{width:85%;left:0}.wy-menu.wy-menu-vertical,.wy-side-nav-search,.wy-side-scroll{width:auto}.wy-nav-content-wrap{margin-left:0}.wy-nav-content-wrap .wy-nav-content{padding:1.618em}.wy-nav-content-wrap.shift{position:fixed;min-width:100%;left:85%;top:0;height:100%;overflow:hidden}}@media screen and (min-width:1100px){.wy-nav-content-wrap{background:rgba(0,0,0,.05)}.wy-nav-content{margin:0;background:#fcfcfc}}@media print{.rst-versions,.wy-nav-side,footer{display:none}.wy-nav-content-wrap{margin-left:0}}.rst-versions{position:fixed;bottom:0;left:0;width:300px;color:#fcfcfc;background:#1f1d1d;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;z-index:400}.rst-versions a{color:#2980b9;text-decoration:none}.rst-versions .rst-badge-small{display:none}.rst-versions .rst-current-version{padding:12px;background-color:#272525;display:block;text-align:right;font-size:90%;cursor:pointer;color:#27ae60;*zoom:1}.rst-versions .rst-current-version:after,.rst-versions .rst-current-version:before{display:table;content:""}.rst-versions .rst-current-version:after{clear:both}.rst-content .code-block-caption .rst-versions .rst-current-version .headerlink,.rst-content .rst-versions .rst-current-version .admonition-title,.rst-content code.download .rst-versions .rst-current-version span:first-child,.rst-content dl dt .rst-versions .rst-current-version .headerlink,.rst-content h1 .rst-versions .rst-current-version .headerlink,.rst-content h2 .rst-versions .rst-current-version .headerlink,.rst-content h3 .rst-versions .rst-current-version .headerlink,.rst-content h4 .rst-versions .rst-current-version .headerlink,.rst-content h5 .rst-versions .rst-current-version .headerlink,.rst-content h6 .rst-versions .rst-current-version .headerlink,.rst-content p.caption .rst-versions .rst-current-version .headerlink,.rst-content table>caption .rst-versions .rst-current-version .headerlink,.rst-content tt.download .rst-versions .rst-current-version span:first-child,.rst-versions .rst-current-version .fa,.rst-versions .rst-current-version .icon,.rst-versions .rst-current-version .rst-content .admonition-title,.rst-versions .rst-current-version .rst-content .code-block-caption .headerlink,.rst-versions .rst-current-version .rst-content code.download span:first-child,.rst-versions .rst-current-version .rst-content dl dt .headerlink,.rst-versions .rst-current-version .rst-content h1 .headerlink,.rst-versions .rst-current-version .rst-content h2 .headerlink,.rst-versions .rst-current-version .rst-content h3 .headerlink,.rst-versions .rst-current-version .rst-content h4 .headerlink,.rst-versions .rst-current-version .rst-content h5 .headerlink,.rst-versions .rst-current-version .rst-content h6 .headerlink,.rst-versions .rst-current-version .rst-content p.caption .headerlink,.rst-versions .rst-current-version .rst-content table>caption .headerlink,.rst-versions .rst-current-version .rst-content tt.download span:first-child,.rst-versions .rst-current-version .wy-menu-vertical li span.toctree-expand,.wy-menu-vertical li .rst-versions .rst-current-version span.toctree-expand{color:#fcfcfc}.rst-versions .rst-current-version .fa-book,.rst-versions .rst-current-version .icon-book{float:left}.rst-versions .rst-current-version.rst-out-of-date{background-color:#e74c3c;color:#fff}.rst-versions .rst-current-version.rst-active-old-version{background-color:#f1c40f;color:#000}.rst-versions.shift-up{height:auto;max-height:100%;overflow-y:scroll}.rst-versions.shift-up .rst-other-versions{display:block}.rst-versions .rst-other-versions{font-size:90%;padding:12px;color:grey;display:none}.rst-versions .rst-other-versions hr{display:block;height:1px;border:0;margin:20px 0;padding:0;border-top:1px solid #413d3d}.rst-versions .rst-other-versions dd{display:inline-block;margin:0}.rst-versions .rst-other-versions dd a{display:inline-block;padding:6px;color:#fcfcfc}.rst-versions.rst-badge{width:auto;bottom:20px;right:20px;left:auto;border:none;max-width:300px;max-height:90%}.rst-versions.rst-badge .fa-book,.rst-versions.rst-badge .icon-book{float:none;line-height:30px}.rst-versions.rst-badge.shift-up .rst-current-version{text-align:right}.rst-versions.rst-badge.shift-up .rst-current-version .fa-book,.rst-versions.rst-badge.shift-up .rst-current-version .icon-book{float:left}.rst-versions.rst-badge>.rst-current-version{width:auto;height:30px;line-height:30px;padding:0 6px;display:block;text-align:center}@media screen and (max-width:768px){.rst-versions{width:85%;display:none}.rst-versions.shift{display:block}}.rst-content img{max-width:100%;height:auto}.rst-content div.figure{margin-bottom:24px}.rst-content div.figure p.caption{font-style:italic}.rst-content div.figure p:last-child.caption{margin-bottom:0}.rst-content div.figure.align-center{text-align:center}.rst-content .section>a>img,.rst-content .section>img{margin-bottom:24px}.rst-content abbr[title]{text-decoration:none}.rst-content.style-external-links a.reference.external:after{font-family:FontAwesome;content:"\f08e";color:#b3b3b3;vertical-align:super;font-size:60%;margin:0 .2em}.rst-content blockquote{margin-left:24px;line-height:24px;margin-bottom:24px}.rst-content pre.literal-block{white-space:pre;margin:0;padding:12px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;display:block;overflow:auto}.rst-content div[class^=highlight],.rst-content pre.literal-block{border:1px solid #e1e4e5;overflow-x:auto;margin:1px 0 24px}.rst-content div[class^=highlight] div[class^=highlight],.rst-content pre.literal-block div[class^=highlight]{padding:0;border:none;margin:0}.rst-content div[class^=highlight] td.code{width:100%}.rst-content .linenodiv pre{border-right:1px solid #e6e9ea;margin:0;padding:12px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;user-select:none;pointer-events:none}.rst-content div[class^=highlight] pre{white-space:pre;margin:0;padding:12px;display:block;overflow:auto}.rst-content div[class^=highlight] pre .hll{display:block;margin:0 -12px;padding:0 12px}.rst-content .linenodiv pre,.rst-content div[class^=highlight] pre,.rst-content pre.literal-block{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;font-size:12px;line-height:1.4}.rst-content div.highlight .gp{user-select:none;pointer-events:none}.rst-content .code-block-caption{font-style:italic;font-size:85%;line-height:1;padding:1em 0;text-align:center}@media print{.rst-content .codeblock,.rst-content div[class^=highlight],.rst-content div[class^=highlight] pre{white-space:pre-wrap}}.rst-content .admonition,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning{clear:both}.rst-content .admonition-todo .last,.rst-content .admonition-todo>:last-child,.rst-content .admonition .last,.rst-content .admonition>:last-child,.rst-content .attention .last,.rst-content .attention>:last-child,.rst-content .caution .last,.rst-content .caution>:last-child,.rst-content .danger .last,.rst-content .danger>:last-child,.rst-content .error .last,.rst-content .error>:last-child,.rst-content .hint .last,.rst-content .hint>:last-child,.rst-content .important .last,.rst-content .important>:last-child,.rst-content .note .last,.rst-content .note>:last-child,.rst-content .seealso .last,.rst-content .seealso>:last-child,.rst-content .tip .last,.rst-content .tip>:last-child,.rst-content .warning .last,.rst-content .warning>:last-child{margin-bottom:0}.rst-content .admonition-title:before{margin-right:4px}.rst-content .admonition table{border-color:rgba(0,0,0,.1)}.rst-content .admonition table td,.rst-content .admonition table th{background:transparent!important;border-color:rgba(0,0,0,.1)!important}.rst-content .section ol.loweralpha,.rst-content .section ol.loweralpha>li{list-style:lower-alpha}.rst-content .section ol.upperalpha,.rst-content .section ol.upperalpha>li{list-style:upper-alpha}.rst-content .section ol li>*,.rst-content .section ul li>*{margin-top:12px;margin-bottom:12px}.rst-content .section ol li>:first-child,.rst-content .section ul li>:first-child{margin-top:0}.rst-content .section ol li>p,.rst-content .section ol li>p:last-child,.rst-content .section ul li>p,.rst-content .section ul li>p:last-child{margin-bottom:12px}.rst-content .section ol li>p:only-child,.rst-content .section ol li>p:only-child:last-child,.rst-content .section ul li>p:only-child,.rst-content .section ul li>p:only-child:last-child{margin-bottom:0}.rst-content .section ol li>ol,.rst-content .section ol li>ul,.rst-content .section ul li>ol,.rst-content .section ul li>ul{margin-bottom:12px}.rst-content .section ol.simple li>*,.rst-content .section ol.simple li ol,.rst-content .section ol.simple li ul,.rst-content .section ul.simple li>*,.rst-content .section ul.simple li ol,.rst-content .section ul.simple li ul{margin-top:0;margin-bottom:0}.rst-content .line-block{margin-left:0;margin-bottom:24px;line-height:24px}.rst-content .line-block .line-block{margin-left:24px;margin-bottom:0}.rst-content .topic-title{font-weight:700;margin-bottom:12px}.rst-content .toc-backref{color:#404040}.rst-content .align-right{float:right;margin:0 0 24px 24px}.rst-content .align-left{float:left;margin:0 24px 24px 0}.rst-content .align-center{margin:auto}.rst-content .align-center:not(table){display:block}.rst-content .code-block-caption .headerlink,.rst-content .toctree-wrapper>p.caption .headerlink,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content table>caption .headerlink{visibility:hidden;font-size:14px}.rst-content .code-block-caption .headerlink:after,.rst-content .toctree-wrapper>p.caption .headerlink:after,.rst-content dl dt .headerlink:after,.rst-content h1 .headerlink:after,.rst-content h2 .headerlink:after,.rst-content h3 .headerlink:after,.rst-content h4 .headerlink:after,.rst-content h5 .headerlink:after,.rst-content h6 .headerlink:after,.rst-content p.caption .headerlink:after,.rst-content table>caption .headerlink:after{content:"\f0c1";font-family:FontAwesome}.rst-content .code-block-caption:hover .headerlink:after,.rst-content .toctree-wrapper>p.caption:hover .headerlink:after,.rst-content dl dt:hover .headerlink:after,.rst-content h1:hover .headerlink:after,.rst-content h2:hover .headerlink:after,.rst-content h3:hover .headerlink:after,.rst-content h4:hover .headerlink:after,.rst-content h5:hover .headerlink:after,.rst-content h6:hover .headerlink:after,.rst-content p.caption:hover .headerlink:after,.rst-content table>caption:hover .headerlink:after{visibility:visible}.rst-content table>caption .headerlink:after{font-size:12px}.rst-content .centered{text-align:center}.rst-content .sidebar{float:right;width:40%;display:block;margin:0 0 24px 24px;padding:24px;background:#f3f6f6;border:1px solid #e1e4e5}.rst-content .sidebar dl,.rst-content .sidebar p,.rst-content .sidebar ul{font-size:90%}.rst-content .sidebar .last,.rst-content .sidebar>:last-child{margin-bottom:0}.rst-content .sidebar .sidebar-title{display:block;font-family:Roboto Slab,ff-tisa-web-pro,Georgia,Arial,sans-serif;font-weight:700;background:#e1e4e5;padding:6px 12px;margin:-24px -24px 24px;font-size:100%}.rst-content .highlighted{background:#f1c40f;box-shadow:0 0 0 2px #f1c40f;display:inline;font-weight:700}.rst-content .citation-reference,.rst-content .footnote-reference{vertical-align:baseline;position:relative;top:-.4em;line-height:0;font-size:90%}.rst-content .hlist{width:100%}html.writer-html4 .rst-content table.docutils.citation,html.writer-html4 .rst-content table.docutils.footnote{background:none;border:none}html.writer-html4 .rst-content table.docutils.citation td,html.writer-html4 .rst-content table.docutils.citation tr,html.writer-html4 .rst-content table.docutils.footnote td,html.writer-html4 .rst-content table.docutils.footnote tr{border:none;background-color:transparent!important;white-space:normal}html.writer-html4 .rst-content table.docutils.citation td.label,html.writer-html4 .rst-content table.docutils.footnote td.label{padding-left:0;padding-right:0;vertical-align:top}html.writer-html5 .rst-content dl dt span.classifier:before{content:" : "}html.writer-html5 .rst-content dl.field-list,html.writer-html5 .rst-content dl.footnote{display:grid;grid-template-columns:max-content auto}html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dt{padding-left:1rem}html.writer-html5 .rst-content dl.field-list>dt:after,html.writer-html5 .rst-content dl.footnote>dt:after{content:":"}html.writer-html5 .rst-content dl.field-list>dd,html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dd,html.writer-html5 .rst-content dl.footnote>dt{margin-bottom:0}html.writer-html5 .rst-content dl.footnote{font-size:.9rem}html.writer-html5 .rst-content dl.footnote>dt{margin:0 .5rem .5rem 0;line-height:1.2rem;word-break:break-all;font-weight:400}html.writer-html5 .rst-content dl.footnote>dt>span.brackets{margin-right:.5rem}html.writer-html5 .rst-content dl.footnote>dt>span.brackets:before{content:"["}html.writer-html5 .rst-content dl.footnote>dt>span.brackets:after{content:"]"}html.writer-html5 .rst-content dl.footnote>dt>span.fn-backref{font-style:italic}html.writer-html5 .rst-content dl.footnote>dd{margin:0 0 .5rem;line-height:1.2rem}html.writer-html5 .rst-content dl.footnote>dd p,html.writer-html5 .rst-content dl.option-list kbd{font-size:.9rem}.rst-content table.docutils.footnote,html.writer-html4 .rst-content table.docutils.citation,html.writer-html5 .rst-content dl.footnote{color:grey}.rst-content table.docutils.footnote code,.rst-content table.docutils.footnote tt,html.writer-html4 .rst-content table.docutils.citation code,html.writer-html4 .rst-content table.docutils.citation tt,html.writer-html5 .rst-content dl.footnote code,html.writer-html5 .rst-content dl.footnote tt{color:#555}.rst-content .wy-table-responsive.citation,.rst-content .wy-table-responsive.footnote{margin-bottom:0}.rst-content .wy-table-responsive.citation+:not(.citation),.rst-content .wy-table-responsive.footnote+:not(.footnote){margin-top:24px}.rst-content .wy-table-responsive.citation:last-child,.rst-content .wy-table-responsive.footnote:last-child{margin-bottom:24px}.rst-content table.docutils th{border-color:#e1e4e5}html.writer-html5 .rst-content table.docutils th{border:1px solid #e1e4e5}html.writer-html5 .rst-content table.docutils td>p,html.writer-html5 .rst-content table.docutils th>p{line-height:1rem;margin-bottom:0;font-size:.9rem}.rst-content table.docutils td .last,.rst-content table.docutils td .last>:last-child{margin-bottom:0}.rst-content table.field-list,.rst-content table.field-list td{border:none}.rst-content table.field-list td p{font-size:inherit;line-height:inherit}.rst-content table.field-list td>strong{display:inline-block}.rst-content table.field-list .field-name{padding-right:10px;text-align:left;white-space:nowrap}.rst-content table.field-list .field-body{text-align:left}.rst-content code,.rst-content tt{color:#000;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;padding:2px 5px}.rst-content code big,.rst-content code em,.rst-content tt big,.rst-content tt em{font-size:100%!important;line-height:normal}.rst-content code.literal,.rst-content tt.literal{color:#e74c3c;white-space:normal}.rst-content code.xref,.rst-content tt.xref,a .rst-content code,a .rst-content tt{font-weight:700;color:#404040}.rst-content kbd,.rst-content pre,.rst-content samp{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace}.rst-content a code,.rst-content a tt{color:#2980b9}.rst-content dl{margin-bottom:24px}.rst-content dl dt{font-weight:700;margin-bottom:12px}.rst-content dl ol,.rst-content dl p,.rst-content dl table,.rst-content dl ul{margin-bottom:12px}.rst-content dl dd{margin:0 0 12px 24px;line-height:24px}html.writer-html4 .rst-content dl:not(.docutils),html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple){margin-bottom:24px}html.writer-html4 .rst-content dl:not(.docutils)>dt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt{display:table;margin:6px 0;font-size:90%;line-height:normal;background:#e7f2fa;color:#2980b9;border-top:3px solid #6ab0de;padding:6px;position:relative}html.writer-html4 .rst-content dl:not(.docutils)>dt:before,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt:before{color:#6ab0de}html.writer-html4 .rst-content dl:not(.docutils)>dt .headerlink,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt .headerlink{color:#404040;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils) dl:not(.field-list)>dt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dl:not(.field-list)>dt{margin-bottom:6px;border:none;border-left:3px solid #ccc;background:#f0f0f0;color:#555}html.writer-html4 .rst-content dl:not(.docutils) dl:not(.field-list)>dt .headerlink,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dl:not(.field-list)>dt .headerlink{color:#404040;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils)>dt:first-child,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt:first-child{margin-top:0}html.writer-html4 .rst-content dl:not(.docutils) code,html.writer-html4 .rst-content dl:not(.docutils) tt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt{font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) code.descclassname,html.writer-html4 .rst-content dl:not(.docutils) code.descname,html.writer-html4 .rst-content dl:not(.docutils) tt.descclassname,html.writer-html4 .rst-content dl:not(.docutils) tt.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code.descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt.descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt.descname{background-color:transparent;border:none;padding:0;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils) code.descname,html.writer-html4 .rst-content dl:not(.docutils) tt.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt.descname{font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) .optional,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) .optional{display:inline-block;padding:0 4px;color:#000;font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) .property,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) .property{display:inline-block;padding-right:8px}.rst-content .viewcode-back,.rst-content .viewcode-link{display:inline-block;color:#27ae60;font-size:80%;padding-left:24px}.rst-content .viewcode-back{display:block;float:right}.rst-content p.rubric{margin-bottom:12px;font-weight:700}.rst-content code.download,.rst-content tt.download{background:inherit;padding:inherit;font-weight:400;font-family:inherit;font-size:inherit;color:inherit;border:inherit;white-space:inherit}.rst-content code.download span:first-child,.rst-content tt.download span:first-child{-webkit-font-smoothing:subpixel-antialiased}.rst-content code.download span:first-child:before,.rst-content tt.download span:first-child:before{margin-right:4px}.rst-content .guilabel{border:1px solid #7fbbe3;background:#e7f2fa;font-size:80%;font-weight:700;border-radius:4px;padding:2.4px 6px;margin:auto 2px}.rst-content .versionmodified{font-style:italic}@media screen and (max-width:480px){.rst-content .sidebar{width:100%}}span[id*=MathJax-Span]{color:#404040}.math{text-align:center}@font-face{font-family:Lato;src:url(fonts/lato-normal.woff2?bd03a2cc277bbbc338d464e679fe9942) format("woff2"),url(fonts/lato-normal.woff?27bd77b9162d388cb8d4c4217c7c5e2a) format("woff");font-weight:400;font-style:normal;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-bold.woff2?cccb897485813c7c256901dbca54ecf2) format("woff2"),url(fonts/lato-bold.woff?d878b6c29b10beca227e9eef4246111b) format("woff");font-weight:700;font-style:normal;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-bold-italic.woff2?0b6bb6725576b072c5d0b02ecdd1900d) format("woff2"),url(fonts/lato-bold-italic.woff?9c7e4e9eb485b4a121c760e61bc3707c) format("woff");font-weight:700;font-style:italic;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-normal-italic.woff2?4eb103b4d12be57cb1d040ed5e162e9d) format("woff2"),url(fonts/lato-normal-italic.woff?f28f2d6482446544ef1ea1ccc6dd5892) format("woff");font-weight:400;font-style:italic;font-display:block}@font-face{font-family:Roboto Slab;font-style:normal;font-weight:400;src:url(fonts/Roboto-Slab-Regular.woff2?7abf5b8d04d26a2cafea937019bca958) format("woff2"),url(fonts/Roboto-Slab-Regular.woff?c1be9284088d487c5e3ff0a10a92e58c) format("woff");font-display:block}@font-face{font-family:Roboto Slab;font-style:normal;font-weight:700;src:url(fonts/Roboto-Slab-Bold.woff2?9984f4a9bda09be08e83f2506954adbe) format("woff2"),url(fonts/Roboto-Slab-Bold.woff?bed5564a116b05148e3b3bea6fb1162a) format("woff");font-display:block}
\ No newline at end of file
+ */@font-face{font-family:FontAwesome;src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713);src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713?#iefix&v=4.7.0) format("embedded-opentype"),url(fonts/fontawesome-webfont.woff2?af7ae505a9eed503f8b8e6982036873e) format("woff2"),url(fonts/fontawesome-webfont.woff?fee66e712a8a08eef5805a46892932ad) format("woff"),url(fonts/fontawesome-webfont.ttf?b06871f281fee6b241d60582ae9369b9) format("truetype"),url(fonts/fontawesome-webfont.svg?912ec66d7572ff821749319396470bde#fontawesomeregular) format("svg");font-weight:400;font-style:normal}.fa,.icon,.rst-content .admonition-title,.rst-content .code-block-caption .headerlink,.rst-content .eqno .headerlink,.rst-content code.download span:first-child,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content p .headerlink,.rst-content table>caption .headerlink,.rst-content tt.download span:first-child,.wy-menu-vertical li.current>a button.toctree-expand,.wy-menu-vertical li.on a button.toctree-expand,.wy-menu-vertical li button.toctree-expand{display:inline-block;font:normal normal normal 14px/1 FontAwesome;font-size:inherit;text-rendering:auto;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale}.fa-lg{font-size:1.33333em;line-height:.75em;vertical-align:-15%}.fa-2x{font-size:2em}.fa-3x{font-size:3em}.fa-4x{font-size:4em}.fa-5x{font-size:5em}.fa-fw{width:1.28571em;text-align:center}.fa-ul{padding-left:0;margin-left:2.14286em;list-style-type:none}.fa-ul>li{position:relative}.fa-li{position:absolute;left:-2.14286em;width:2.14286em;top:.14286em;text-align:center}.fa-li.fa-lg{left:-1.85714em}.fa-border{padding:.2em .25em .15em;border:.08em solid #eee;border-radius:.1em}.fa-pull-left{float:left}.fa-pull-right{float:right}.fa-pull-left.icon,.fa.fa-pull-left,.rst-content .code-block-caption .fa-pull-left.headerlink,.rst-content .eqno .fa-pull-left.headerlink,.rst-content .fa-pull-left.admonition-title,.rst-content code.download span.fa-pull-left:first-child,.rst-content dl dt .fa-pull-left.headerlink,.rst-content h1 .fa-pull-left.headerlink,.rst-content h2 .fa-pull-left.headerlink,.rst-content h3 .fa-pull-left.headerlink,.rst-content h4 .fa-pull-left.headerlink,.rst-content h5 .fa-pull-left.headerlink,.rst-content h6 .fa-pull-left.headerlink,.rst-content p .fa-pull-left.headerlink,.rst-content table>caption .fa-pull-left.headerlink,.rst-content tt.download span.fa-pull-left:first-child,.wy-menu-vertical li.current>a button.fa-pull-left.toctree-expand,.wy-menu-vertical li.on a button.fa-pull-left.toctree-expand,.wy-menu-vertical li button.fa-pull-left.toctree-expand{margin-right:.3em}.fa-pull-right.icon,.fa.fa-pull-right,.rst-content .code-block-caption .fa-pull-right.headerlink,.rst-content .eqno .fa-pull-right.headerlink,.rst-content .fa-pull-right.admonition-title,.rst-content code.download span.fa-pull-right:first-child,.rst-content dl dt .fa-pull-right.headerlink,.rst-content h1 .fa-pull-right.headerlink,.rst-content h2 .fa-pull-right.headerlink,.rst-content h3 .fa-pull-right.headerlink,.rst-content h4 .fa-pull-right.headerlink,.rst-content h5 .fa-pull-right.headerlink,.rst-content h6 .fa-pull-right.headerlink,.rst-content p .fa-pull-right.headerlink,.rst-content table>caption .fa-pull-right.headerlink,.rst-content tt.download span.fa-pull-right:first-child,.wy-menu-vertical li.current>a button.fa-pull-right.toctree-expand,.wy-menu-vertical li.on a button.fa-pull-right.toctree-expand,.wy-menu-vertical li button.fa-pull-right.toctree-expand{margin-left:.3em}.pull-right{float:right}.pull-left{float:left}.fa.pull-left,.pull-left.icon,.rst-content .code-block-caption .pull-left.headerlink,.rst-content .eqno .pull-left.headerlink,.rst-content .pull-left.admonition-title,.rst-content code.download span.pull-left:first-child,.rst-content dl dt .pull-left.headerlink,.rst-content h1 .pull-left.headerlink,.rst-content h2 .pull-left.headerlink,.rst-content h3 .pull-left.headerlink,.rst-content h4 .pull-left.headerlink,.rst-content h5 .pull-left.headerlink,.rst-content h6 .pull-left.headerlink,.rst-content p .pull-left.headerlink,.rst-content table>caption .pull-left.headerlink,.rst-content tt.download span.pull-left:first-child,.wy-menu-vertical li.current>a button.pull-left.toctree-expand,.wy-menu-vertical li.on a button.pull-left.toctree-expand,.wy-menu-vertical li button.pull-left.toctree-expand{margin-right:.3em}.fa.pull-right,.pull-right.icon,.rst-content .code-block-caption .pull-right.headerlink,.rst-content .eqno .pull-right.headerlink,.rst-content .pull-right.admonition-title,.rst-content code.download span.pull-right:first-child,.rst-content dl dt .pull-right.headerlink,.rst-content h1 .pull-right.headerlink,.rst-content h2 .pull-right.headerlink,.rst-content h3 .pull-right.headerlink,.rst-content h4 .pull-right.headerlink,.rst-content h5 .pull-right.headerlink,.rst-content h6 .pull-right.headerlink,.rst-content p .pull-right.headerlink,.rst-content table>caption .pull-right.headerlink,.rst-content tt.download span.pull-right:first-child,.wy-menu-vertical li.current>a button.pull-right.toctree-expand,.wy-menu-vertical li.on a button.pull-right.toctree-expand,.wy-menu-vertical li button.pull-right.toctree-expand{margin-left:.3em}.fa-spin{-webkit-animation:fa-spin 2s linear infinite;animation:fa-spin 2s linear infinite}.fa-pulse{-webkit-animation:fa-spin 1s steps(8) infinite;animation:fa-spin 1s steps(8) infinite}@-webkit-keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(359deg);transform:rotate(359deg)}}@keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(359deg);transform:rotate(359deg)}}.fa-rotate-90{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=1)";-webkit-transform:rotate(90deg);-ms-transform:rotate(90deg);transform:rotate(90deg)}.fa-rotate-180{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=2)";-webkit-transform:rotate(180deg);-ms-transform:rotate(180deg);transform:rotate(180deg)}.fa-rotate-270{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=3)";-webkit-transform:rotate(270deg);-ms-transform:rotate(270deg);transform:rotate(270deg)}.fa-flip-horizontal{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=0, mirror=1)";-webkit-transform:scaleX(-1);-ms-transform:scaleX(-1);transform:scaleX(-1)}.fa-flip-vertical{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=2, mirror=1)";-webkit-transform:scaleY(-1);-ms-transform:scaleY(-1);transform:scaleY(-1)}:root .fa-flip-horizontal,:root .fa-flip-vertical,:root .fa-rotate-90,:root .fa-rotate-180,:root .fa-rotate-270{filter:none}.fa-stack{position:relative;display:inline-block;width:2em;height:2em;line-height:2em;vertical-align:middle}.fa-stack-1x,.fa-stack-2x{position:absolute;left:0;width:100%;text-align:center}.fa-stack-1x{line-height:inherit}.fa-stack-2x{font-size:2em}.fa-inverse{color:#fff}.fa-glass:before{content:""}.fa-music:before{content:""}.fa-search:before,.icon-search:before{content:""}.fa-envelope-o:before{content:""}.fa-heart:before{content:""}.fa-star:before{content:""}.fa-star-o:before{content:""}.fa-user:before{content:""}.fa-film:before{content:""}.fa-th-large:before{content:""}.fa-th:before{content:""}.fa-th-list:before{content:""}.fa-check:before{content:""}.fa-close:before,.fa-remove:before,.fa-times:before{content:""}.fa-search-plus:before{content:""}.fa-search-minus:before{content:""}.fa-power-off:before{content:""}.fa-signal:before{content:""}.fa-cog:before,.fa-gear:before{content:""}.fa-trash-o:before{content:""}.fa-home:before,.icon-home:before{content:""}.fa-file-o:before{content:""}.fa-clock-o:before{content:""}.fa-road:before{content:""}.fa-download:before,.rst-content code.download span:first-child:before,.rst-content tt.download span:first-child:before{content:""}.fa-arrow-circle-o-down:before{content:""}.fa-arrow-circle-o-up:before{content:""}.fa-inbox:before{content:""}.fa-play-circle-o:before{content:""}.fa-repeat:before,.fa-rotate-right:before{content:""}.fa-refresh:before{content:""}.fa-list-alt:before{content:""}.fa-lock:before{content:""}.fa-flag:before{content:""}.fa-headphones:before{content:""}.fa-volume-off:before{content:""}.fa-volume-down:before{content:""}.fa-volume-up:before{content:""}.fa-qrcode:before{content:""}.fa-barcode:before{content:""}.fa-tag:before{content:""}.fa-tags:before{content:""}.fa-book:before,.icon-book:before{content:""}.fa-bookmark:before{content:""}.fa-print:before{content:""}.fa-camera:before{content:""}.fa-font:before{content:""}.fa-bold:before{content:""}.fa-italic:before{content:""}.fa-text-height:before{content:""}.fa-text-width:before{content:""}.fa-align-left:before{content:""}.fa-align-center:before{content:""}.fa-align-right:before{content:""}.fa-align-justify:before{content:""}.fa-list:before{content:""}.fa-dedent:before,.fa-outdent:before{content:""}.fa-indent:before{content:""}.fa-video-camera:before{content:""}.fa-image:before,.fa-photo:before,.fa-picture-o:before{content:""}.fa-pencil:before{content:""}.fa-map-marker:before{content:""}.fa-adjust:before{content:""}.fa-tint:before{content:""}.fa-edit:before,.fa-pencil-square-o:before{content:""}.fa-share-square-o:before{content:""}.fa-check-square-o:before{content:""}.fa-arrows:before{content:""}.fa-step-backward:before{content:""}.fa-fast-backward:before{content:""}.fa-backward:before{content:""}.fa-play:before{content:""}.fa-pause:before{content:""}.fa-stop:before{content:""}.fa-forward:before{content:""}.fa-fast-forward:before{content:""}.fa-step-forward:before{content:""}.fa-eject:before{content:""}.fa-chevron-left:before{content:""}.fa-chevron-right:before{content:""}.fa-plus-circle:before{content:""}.fa-minus-circle:before{content:""}.fa-times-circle:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before{content:""}.fa-check-circle:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before{content:""}.fa-question-circle:before{content:""}.fa-info-circle:before{content:""}.fa-crosshairs:before{content:""}.fa-times-circle-o:before{content:""}.fa-check-circle-o:before{content:""}.fa-ban:before{content:""}.fa-arrow-left:before{content:""}.fa-arrow-right:before{content:""}.fa-arrow-up:before{content:""}.fa-arrow-down:before{content:""}.fa-mail-forward:before,.fa-share:before{content:""}.fa-expand:before{content:""}.fa-compress:before{content:""}.fa-plus:before{content:""}.fa-minus:before{content:""}.fa-asterisk:before{content:""}.fa-exclamation-circle:before,.rst-content .admonition-title:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before{content:""}.fa-gift:before{content:""}.fa-leaf:before{content:""}.fa-fire:before,.icon-fire:before{content:""}.fa-eye:before{content:""}.fa-eye-slash:before{content:""}.fa-exclamation-triangle:before,.fa-warning:before{content:""}.fa-plane:before{content:""}.fa-calendar:before{content:""}.fa-random:before{content:""}.fa-comment:before{content:""}.fa-magnet:before{content:""}.fa-chevron-up:before{content:""}.fa-chevron-down:before{content:""}.fa-retweet:before{content:""}.fa-shopping-cart:before{content:""}.fa-folder:before{content:""}.fa-folder-open:before{content:""}.fa-arrows-v:before{content:""}.fa-arrows-h:before{content:""}.fa-bar-chart-o:before,.fa-bar-chart:before{content:""}.fa-twitter-square:before{content:""}.fa-facebook-square:before{content:""}.fa-camera-retro:before{content:""}.fa-key:before{content:""}.fa-cogs:before,.fa-gears:before{content:""}.fa-comments:before{content:""}.fa-thumbs-o-up:before{content:""}.fa-thumbs-o-down:before{content:""}.fa-star-half:before{content:""}.fa-heart-o:before{content:""}.fa-sign-out:before{content:""}.fa-linkedin-square:before{content:""}.fa-thumb-tack:before{content:""}.fa-external-link:before{content:""}.fa-sign-in:before{content:""}.fa-trophy:before{content:""}.fa-github-square:before{content:""}.fa-upload:before{content:""}.fa-lemon-o:before{content:""}.fa-phone:before{content:""}.fa-square-o:before{content:""}.fa-bookmark-o:before{content:""}.fa-phone-square:before{content:""}.fa-twitter:before{content:""}.fa-facebook-f:before,.fa-facebook:before{content:""}.fa-github:before,.icon-github:before{content:""}.fa-unlock:before{content:""}.fa-credit-card:before{content:""}.fa-feed:before,.fa-rss:before{content:""}.fa-hdd-o:before{content:""}.fa-bullhorn:before{content:""}.fa-bell:before{content:""}.fa-certificate:before{content:""}.fa-hand-o-right:before{content:""}.fa-hand-o-left:before{content:""}.fa-hand-o-up:before{content:""}.fa-hand-o-down:before{content:""}.fa-arrow-circle-left:before,.icon-circle-arrow-left:before{content:""}.fa-arrow-circle-right:before,.icon-circle-arrow-right:before{content:""}.fa-arrow-circle-up:before{content:""}.fa-arrow-circle-down:before{content:""}.fa-globe:before{content:""}.fa-wrench:before{content:""}.fa-tasks:before{content:""}.fa-filter:before{content:""}.fa-briefcase:before{content:""}.fa-arrows-alt:before{content:""}.fa-group:before,.fa-users:before{content:""}.fa-chain:before,.fa-link:before,.icon-link:before{content:""}.fa-cloud:before{content:""}.fa-flask:before{content:""}.fa-cut:before,.fa-scissors:before{content:""}.fa-copy:before,.fa-files-o:before{content:""}.fa-paperclip:before{content:""}.fa-floppy-o:before,.fa-save:before{content:""}.fa-square:before{content:""}.fa-bars:before,.fa-navicon:before,.fa-reorder:before{content:""}.fa-list-ul:before{content:""}.fa-list-ol:before{content:""}.fa-strikethrough:before{content:""}.fa-underline:before{content:""}.fa-table:before{content:""}.fa-magic:before{content:""}.fa-truck:before{content:""}.fa-pinterest:before{content:""}.fa-pinterest-square:before{content:""}.fa-google-plus-square:before{content:""}.fa-google-plus:before{content:""}.fa-money:before{content:""}.fa-caret-down:before,.icon-caret-down:before,.wy-dropdown .caret:before{content:""}.fa-caret-up:before{content:""}.fa-caret-left:before{content:""}.fa-caret-right:before{content:""}.fa-columns:before{content:""}.fa-sort:before,.fa-unsorted:before{content:""}.fa-sort-desc:before,.fa-sort-down:before{content:""}.fa-sort-asc:before,.fa-sort-up:before{content:""}.fa-envelope:before{content:""}.fa-linkedin:before{content:""}.fa-rotate-left:before,.fa-undo:before{content:""}.fa-gavel:before,.fa-legal:before{content:""}.fa-dashboard:before,.fa-tachometer:before{content:""}.fa-comment-o:before{content:""}.fa-comments-o:before{content:""}.fa-bolt:before,.fa-flash:before{content:""}.fa-sitemap:before{content:""}.fa-umbrella:before{content:""}.fa-clipboard:before,.fa-paste:before{content:""}.fa-lightbulb-o:before{content:""}.fa-exchange:before{content:""}.fa-cloud-download:before{content:""}.fa-cloud-upload:before{content:""}.fa-user-md:before{content:""}.fa-stethoscope:before{content:""}.fa-suitcase:before{content:""}.fa-bell-o:before{content:""}.fa-coffee:before{content:""}.fa-cutlery:before{content:""}.fa-file-text-o:before{content:""}.fa-building-o:before{content:""}.fa-hospital-o:before{content:""}.fa-ambulance:before{content:""}.fa-medkit:before{content:""}.fa-fighter-jet:before{content:""}.fa-beer:before{content:""}.fa-h-square:before{content:""}.fa-plus-square:before{content:""}.fa-angle-double-left:before{content:""}.fa-angle-double-right:before{content:""}.fa-angle-double-up:before{content:""}.fa-angle-double-down:before{content:""}.fa-angle-left:before{content:""}.fa-angle-right:before{content:""}.fa-angle-up:before{content:""}.fa-angle-down:before{content:""}.fa-desktop:before{content:""}.fa-laptop:before{content:""}.fa-tablet:before{content:""}.fa-mobile-phone:before,.fa-mobile:before{content:""}.fa-circle-o:before{content:""}.fa-quote-left:before{content:""}.fa-quote-right:before{content:""}.fa-spinner:before{content:""}.fa-circle:before{content:""}.fa-mail-reply:before,.fa-reply:before{content:""}.fa-github-alt:before{content:""}.fa-folder-o:before{content:""}.fa-folder-open-o:before{content:""}.fa-smile-o:before{content:""}.fa-frown-o:before{content:""}.fa-meh-o:before{content:""}.fa-gamepad:before{content:""}.fa-keyboard-o:before{content:""}.fa-flag-o:before{content:""}.fa-flag-checkered:before{content:""}.fa-terminal:before{content:""}.fa-code:before{content:""}.fa-mail-reply-all:before,.fa-reply-all:before{content:""}.fa-star-half-empty:before,.fa-star-half-full:before,.fa-star-half-o:before{content:""}.fa-location-arrow:before{content:""}.fa-crop:before{content:""}.fa-code-fork:before{content:""}.fa-chain-broken:before,.fa-unlink:before{content:""}.fa-question:before{content:""}.fa-info:before{content:""}.fa-exclamation:before{content:""}.fa-superscript:before{content:""}.fa-subscript:before{content:""}.fa-eraser:before{content:""}.fa-puzzle-piece:before{content:""}.fa-microphone:before{content:""}.fa-microphone-slash:before{content:""}.fa-shield:before{content:""}.fa-calendar-o:before{content:""}.fa-fire-extinguisher:before{content:""}.fa-rocket:before{content:""}.fa-maxcdn:before{content:""}.fa-chevron-circle-left:before{content:""}.fa-chevron-circle-right:before{content:""}.fa-chevron-circle-up:before{content:""}.fa-chevron-circle-down:before{content:""}.fa-html5:before{content:""}.fa-css3:before{content:""}.fa-anchor:before{content:""}.fa-unlock-alt:before{content:""}.fa-bullseye:before{content:""}.fa-ellipsis-h:before{content:""}.fa-ellipsis-v:before{content:""}.fa-rss-square:before{content:""}.fa-play-circle:before{content:""}.fa-ticket:before{content:""}.fa-minus-square:before{content:""}.fa-minus-square-o:before,.wy-menu-vertical li.current>a button.toctree-expand:before,.wy-menu-vertical li.on a button.toctree-expand:before{content:""}.fa-level-up:before{content:""}.fa-level-down:before{content:""}.fa-check-square:before{content:""}.fa-pencil-square:before{content:""}.fa-external-link-square:before{content:""}.fa-share-square:before{content:""}.fa-compass:before{content:""}.fa-caret-square-o-down:before,.fa-toggle-down:before{content:""}.fa-caret-square-o-up:before,.fa-toggle-up:before{content:""}.fa-caret-square-o-right:before,.fa-toggle-right:before{content:""}.fa-eur:before,.fa-euro:before{content:""}.fa-gbp:before{content:""}.fa-dollar:before,.fa-usd:before{content:""}.fa-inr:before,.fa-rupee:before{content:""}.fa-cny:before,.fa-jpy:before,.fa-rmb:before,.fa-yen:before{content:""}.fa-rouble:before,.fa-rub:before,.fa-ruble:before{content:""}.fa-krw:before,.fa-won:before{content:""}.fa-bitcoin:before,.fa-btc:before{content:""}.fa-file:before{content:""}.fa-file-text:before{content:""}.fa-sort-alpha-asc:before{content:""}.fa-sort-alpha-desc:before{content:""}.fa-sort-amount-asc:before{content:""}.fa-sort-amount-desc:before{content:""}.fa-sort-numeric-asc:before{content:""}.fa-sort-numeric-desc:before{content:""}.fa-thumbs-up:before{content:""}.fa-thumbs-down:before{content:""}.fa-youtube-square:before{content:""}.fa-youtube:before{content:""}.fa-xing:before{content:""}.fa-xing-square:before{content:""}.fa-youtube-play:before{content:""}.fa-dropbox:before{content:""}.fa-stack-overflow:before{content:""}.fa-instagram:before{content:""}.fa-flickr:before{content:""}.fa-adn:before{content:""}.fa-bitbucket:before,.icon-bitbucket:before{content:""}.fa-bitbucket-square:before{content:""}.fa-tumblr:before{content:""}.fa-tumblr-square:before{content:""}.fa-long-arrow-down:before{content:""}.fa-long-arrow-up:before{content:""}.fa-long-arrow-left:before{content:""}.fa-long-arrow-right:before{content:""}.fa-apple:before{content:""}.fa-windows:before{content:""}.fa-android:before{content:""}.fa-linux:before{content:""}.fa-dribbble:before{content:""}.fa-skype:before{content:""}.fa-foursquare:before{content:""}.fa-trello:before{content:""}.fa-female:before{content:""}.fa-male:before{content:""}.fa-gittip:before,.fa-gratipay:before{content:""}.fa-sun-o:before{content:""}.fa-moon-o:before{content:""}.fa-archive:before{content:""}.fa-bug:before{content:""}.fa-vk:before{content:""}.fa-weibo:before{content:""}.fa-renren:before{content:""}.fa-pagelines:before{content:""}.fa-stack-exchange:before{content:""}.fa-arrow-circle-o-right:before{content:""}.fa-arrow-circle-o-left:before{content:""}.fa-caret-square-o-left:before,.fa-toggle-left:before{content:""}.fa-dot-circle-o:before{content:""}.fa-wheelchair:before{content:""}.fa-vimeo-square:before{content:""}.fa-try:before,.fa-turkish-lira:before{content:""}.fa-plus-square-o:before,.wy-menu-vertical li button.toctree-expand:before{content:""}.fa-space-shuttle:before{content:""}.fa-slack:before{content:""}.fa-envelope-square:before{content:""}.fa-wordpress:before{content:""}.fa-openid:before{content:""}.fa-bank:before,.fa-institution:before,.fa-university:before{content:""}.fa-graduation-cap:before,.fa-mortar-board:before{content:""}.fa-yahoo:before{content:""}.fa-google:before{content:""}.fa-reddit:before{content:""}.fa-reddit-square:before{content:""}.fa-stumbleupon-circle:before{content:""}.fa-stumbleupon:before{content:""}.fa-delicious:before{content:""}.fa-digg:before{content:""}.fa-pied-piper-pp:before{content:""}.fa-pied-piper-alt:before{content:""}.fa-drupal:before{content:""}.fa-joomla:before{content:""}.fa-language:before{content:""}.fa-fax:before{content:""}.fa-building:before{content:""}.fa-child:before{content:""}.fa-paw:before{content:""}.fa-spoon:before{content:""}.fa-cube:before{content:""}.fa-cubes:before{content:""}.fa-behance:before{content:""}.fa-behance-square:before{content:""}.fa-steam:before{content:""}.fa-steam-square:before{content:""}.fa-recycle:before{content:""}.fa-automobile:before,.fa-car:before{content:""}.fa-cab:before,.fa-taxi:before{content:""}.fa-tree:before{content:""}.fa-spotify:before{content:""}.fa-deviantart:before{content:""}.fa-soundcloud:before{content:""}.fa-database:before{content:""}.fa-file-pdf-o:before{content:""}.fa-file-word-o:before{content:""}.fa-file-excel-o:before{content:""}.fa-file-powerpoint-o:before{content:""}.fa-file-image-o:before,.fa-file-photo-o:before,.fa-file-picture-o:before{content:""}.fa-file-archive-o:before,.fa-file-zip-o:before{content:""}.fa-file-audio-o:before,.fa-file-sound-o:before{content:""}.fa-file-movie-o:before,.fa-file-video-o:before{content:""}.fa-file-code-o:before{content:""}.fa-vine:before{content:""}.fa-codepen:before{content:""}.fa-jsfiddle:before{content:""}.fa-life-bouy:before,.fa-life-buoy:before,.fa-life-ring:before,.fa-life-saver:before,.fa-support:before{content:""}.fa-circle-o-notch:before{content:""}.fa-ra:before,.fa-rebel:before,.fa-resistance:before{content:""}.fa-empire:before,.fa-ge:before{content:""}.fa-git-square:before{content:""}.fa-git:before{content:""}.fa-hacker-news:before,.fa-y-combinator-square:before,.fa-yc-square:before{content:""}.fa-tencent-weibo:before{content:""}.fa-qq:before{content:""}.fa-wechat:before,.fa-weixin:before{content:""}.fa-paper-plane:before,.fa-send:before{content:""}.fa-paper-plane-o:before,.fa-send-o:before{content:""}.fa-history:before{content:""}.fa-circle-thin:before{content:""}.fa-header:before{content:""}.fa-paragraph:before{content:""}.fa-sliders:before{content:""}.fa-share-alt:before{content:""}.fa-share-alt-square:before{content:""}.fa-bomb:before{content:""}.fa-futbol-o:before,.fa-soccer-ball-o:before{content:""}.fa-tty:before{content:""}.fa-binoculars:before{content:""}.fa-plug:before{content:""}.fa-slideshare:before{content:""}.fa-twitch:before{content:""}.fa-yelp:before{content:""}.fa-newspaper-o:before{content:""}.fa-wifi:before{content:""}.fa-calculator:before{content:""}.fa-paypal:before{content:""}.fa-google-wallet:before{content:""}.fa-cc-visa:before{content:""}.fa-cc-mastercard:before{content:""}.fa-cc-discover:before{content:""}.fa-cc-amex:before{content:""}.fa-cc-paypal:before{content:""}.fa-cc-stripe:before{content:""}.fa-bell-slash:before{content:""}.fa-bell-slash-o:before{content:""}.fa-trash:before{content:""}.fa-copyright:before{content:""}.fa-at:before{content:""}.fa-eyedropper:before{content:""}.fa-paint-brush:before{content:""}.fa-birthday-cake:before{content:""}.fa-area-chart:before{content:""}.fa-pie-chart:before{content:""}.fa-line-chart:before{content:""}.fa-lastfm:before{content:""}.fa-lastfm-square:before{content:""}.fa-toggle-off:before{content:""}.fa-toggle-on:before{content:""}.fa-bicycle:before{content:""}.fa-bus:before{content:""}.fa-ioxhost:before{content:""}.fa-angellist:before{content:""}.fa-cc:before{content:""}.fa-ils:before,.fa-shekel:before,.fa-sheqel:before{content:""}.fa-meanpath:before{content:""}.fa-buysellads:before{content:""}.fa-connectdevelop:before{content:""}.fa-dashcube:before{content:""}.fa-forumbee:before{content:""}.fa-leanpub:before{content:""}.fa-sellsy:before{content:""}.fa-shirtsinbulk:before{content:""}.fa-simplybuilt:before{content:""}.fa-skyatlas:before{content:""}.fa-cart-plus:before{content:""}.fa-cart-arrow-down:before{content:""}.fa-diamond:before{content:""}.fa-ship:before{content:""}.fa-user-secret:before{content:""}.fa-motorcycle:before{content:""}.fa-street-view:before{content:""}.fa-heartbeat:before{content:""}.fa-venus:before{content:""}.fa-mars:before{content:""}.fa-mercury:before{content:""}.fa-intersex:before,.fa-transgender:before{content:""}.fa-transgender-alt:before{content:""}.fa-venus-double:before{content:""}.fa-mars-double:before{content:""}.fa-venus-mars:before{content:""}.fa-mars-stroke:before{content:""}.fa-mars-stroke-v:before{content:""}.fa-mars-stroke-h:before{content:""}.fa-neuter:before{content:""}.fa-genderless:before{content:""}.fa-facebook-official:before{content:""}.fa-pinterest-p:before{content:""}.fa-whatsapp:before{content:""}.fa-server:before{content:""}.fa-user-plus:before{content:""}.fa-user-times:before{content:""}.fa-bed:before,.fa-hotel:before{content:""}.fa-viacoin:before{content:""}.fa-train:before{content:""}.fa-subway:before{content:""}.fa-medium:before{content:""}.fa-y-combinator:before,.fa-yc:before{content:""}.fa-optin-monster:before{content:""}.fa-opencart:before{content:""}.fa-expeditedssl:before{content:""}.fa-battery-4:before,.fa-battery-full:before,.fa-battery:before{content:""}.fa-battery-3:before,.fa-battery-three-quarters:before{content:""}.fa-battery-2:before,.fa-battery-half:before{content:""}.fa-battery-1:before,.fa-battery-quarter:before{content:""}.fa-battery-0:before,.fa-battery-empty:before{content:""}.fa-mouse-pointer:before{content:""}.fa-i-cursor:before{content:""}.fa-object-group:before{content:""}.fa-object-ungroup:before{content:""}.fa-sticky-note:before{content:""}.fa-sticky-note-o:before{content:""}.fa-cc-jcb:before{content:""}.fa-cc-diners-club:before{content:""}.fa-clone:before{content:""}.fa-balance-scale:before{content:""}.fa-hourglass-o:before{content:""}.fa-hourglass-1:before,.fa-hourglass-start:before{content:""}.fa-hourglass-2:before,.fa-hourglass-half:before{content:""}.fa-hourglass-3:before,.fa-hourglass-end:before{content:""}.fa-hourglass:before{content:""}.fa-hand-grab-o:before,.fa-hand-rock-o:before{content:""}.fa-hand-paper-o:before,.fa-hand-stop-o:before{content:""}.fa-hand-scissors-o:before{content:""}.fa-hand-lizard-o:before{content:""}.fa-hand-spock-o:before{content:""}.fa-hand-pointer-o:before{content:""}.fa-hand-peace-o:before{content:""}.fa-trademark:before{content:""}.fa-registered:before{content:""}.fa-creative-commons:before{content:""}.fa-gg:before{content:""}.fa-gg-circle:before{content:""}.fa-tripadvisor:before{content:""}.fa-odnoklassniki:before{content:""}.fa-odnoklassniki-square:before{content:""}.fa-get-pocket:before{content:""}.fa-wikipedia-w:before{content:""}.fa-safari:before{content:""}.fa-chrome:before{content:""}.fa-firefox:before{content:""}.fa-opera:before{content:""}.fa-internet-explorer:before{content:""}.fa-television:before,.fa-tv:before{content:""}.fa-contao:before{content:""}.fa-500px:before{content:""}.fa-amazon:before{content:""}.fa-calendar-plus-o:before{content:""}.fa-calendar-minus-o:before{content:""}.fa-calendar-times-o:before{content:""}.fa-calendar-check-o:before{content:""}.fa-industry:before{content:""}.fa-map-pin:before{content:""}.fa-map-signs:before{content:""}.fa-map-o:before{content:""}.fa-map:before{content:""}.fa-commenting:before{content:""}.fa-commenting-o:before{content:""}.fa-houzz:before{content:""}.fa-vimeo:before{content:""}.fa-black-tie:before{content:""}.fa-fonticons:before{content:""}.fa-reddit-alien:before{content:""}.fa-edge:before{content:""}.fa-credit-card-alt:before{content:""}.fa-codiepie:before{content:""}.fa-modx:before{content:""}.fa-fort-awesome:before{content:""}.fa-usb:before{content:""}.fa-product-hunt:before{content:""}.fa-mixcloud:before{content:""}.fa-scribd:before{content:""}.fa-pause-circle:before{content:""}.fa-pause-circle-o:before{content:""}.fa-stop-circle:before{content:""}.fa-stop-circle-o:before{content:""}.fa-shopping-bag:before{content:""}.fa-shopping-basket:before{content:""}.fa-hashtag:before{content:""}.fa-bluetooth:before{content:""}.fa-bluetooth-b:before{content:""}.fa-percent:before{content:""}.fa-gitlab:before,.icon-gitlab:before{content:""}.fa-wpbeginner:before{content:""}.fa-wpforms:before{content:""}.fa-envira:before{content:""}.fa-universal-access:before{content:""}.fa-wheelchair-alt:before{content:""}.fa-question-circle-o:before{content:""}.fa-blind:before{content:""}.fa-audio-description:before{content:""}.fa-volume-control-phone:before{content:""}.fa-braille:before{content:""}.fa-assistive-listening-systems:before{content:""}.fa-american-sign-language-interpreting:before,.fa-asl-interpreting:before{content:""}.fa-deaf:before,.fa-deafness:before,.fa-hard-of-hearing:before{content:""}.fa-glide:before{content:""}.fa-glide-g:before{content:""}.fa-sign-language:before,.fa-signing:before{content:""}.fa-low-vision:before{content:""}.fa-viadeo:before{content:""}.fa-viadeo-square:before{content:""}.fa-snapchat:before{content:""}.fa-snapchat-ghost:before{content:""}.fa-snapchat-square:before{content:""}.fa-pied-piper:before{content:""}.fa-first-order:before{content:""}.fa-yoast:before{content:""}.fa-themeisle:before{content:""}.fa-google-plus-circle:before,.fa-google-plus-official:before{content:""}.fa-fa:before,.fa-font-awesome:before{content:""}.fa-handshake-o:before{content:""}.fa-envelope-open:before{content:""}.fa-envelope-open-o:before{content:""}.fa-linode:before{content:""}.fa-address-book:before{content:""}.fa-address-book-o:before{content:""}.fa-address-card:before,.fa-vcard:before{content:""}.fa-address-card-o:before,.fa-vcard-o:before{content:""}.fa-user-circle:before{content:""}.fa-user-circle-o:before{content:""}.fa-user-o:before{content:""}.fa-id-badge:before{content:""}.fa-drivers-license:before,.fa-id-card:before{content:""}.fa-drivers-license-o:before,.fa-id-card-o:before{content:""}.fa-quora:before{content:""}.fa-free-code-camp:before{content:""}.fa-telegram:before{content:""}.fa-thermometer-4:before,.fa-thermometer-full:before,.fa-thermometer:before{content:""}.fa-thermometer-3:before,.fa-thermometer-three-quarters:before{content:""}.fa-thermometer-2:before,.fa-thermometer-half:before{content:""}.fa-thermometer-1:before,.fa-thermometer-quarter:before{content:""}.fa-thermometer-0:before,.fa-thermometer-empty:before{content:""}.fa-shower:before{content:""}.fa-bath:before,.fa-bathtub:before,.fa-s15:before{content:""}.fa-podcast:before{content:""}.fa-window-maximize:before{content:""}.fa-window-minimize:before{content:""}.fa-window-restore:before{content:""}.fa-times-rectangle:before,.fa-window-close:before{content:""}.fa-times-rectangle-o:before,.fa-window-close-o:before{content:""}.fa-bandcamp:before{content:""}.fa-grav:before{content:""}.fa-etsy:before{content:""}.fa-imdb:before{content:""}.fa-ravelry:before{content:""}.fa-eercast:before{content:""}.fa-microchip:before{content:""}.fa-snowflake-o:before{content:""}.fa-superpowers:before{content:""}.fa-wpexplorer:before{content:""}.fa-meetup:before{content:""}.sr-only{position:absolute;width:1px;height:1px;padding:0;margin:-1px;overflow:hidden;clip:rect(0,0,0,0);border:0}.sr-only-focusable:active,.sr-only-focusable:focus{position:static;width:auto;height:auto;margin:0;overflow:visible;clip:auto}.fa,.icon,.rst-content .admonition-title,.rst-content .code-block-caption .headerlink,.rst-content .eqno .headerlink,.rst-content code.download span:first-child,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content p .headerlink,.rst-content table>caption .headerlink,.rst-content tt.download span:first-child,.wy-dropdown .caret,.wy-inline-validate.wy-inline-validate-danger .wy-input-context,.wy-inline-validate.wy-inline-validate-info .wy-input-context,.wy-inline-validate.wy-inline-validate-success .wy-input-context,.wy-inline-validate.wy-inline-validate-warning .wy-input-context,.wy-menu-vertical li.current>a button.toctree-expand,.wy-menu-vertical li.on a button.toctree-expand,.wy-menu-vertical li button.toctree-expand{font-family:inherit}.fa:before,.icon:before,.rst-content .admonition-title:before,.rst-content .code-block-caption .headerlink:before,.rst-content .eqno .headerlink:before,.rst-content code.download span:first-child:before,.rst-content dl dt .headerlink:before,.rst-content h1 .headerlink:before,.rst-content h2 .headerlink:before,.rst-content h3 .headerlink:before,.rst-content h4 .headerlink:before,.rst-content h5 .headerlink:before,.rst-content h6 .headerlink:before,.rst-content p.caption .headerlink:before,.rst-content p .headerlink:before,.rst-content table>caption .headerlink:before,.rst-content tt.download span:first-child:before,.wy-dropdown .caret:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before,.wy-menu-vertical li.current>a button.toctree-expand:before,.wy-menu-vertical li.on a button.toctree-expand:before,.wy-menu-vertical li button.toctree-expand:before{font-family:FontAwesome;display:inline-block;font-style:normal;font-weight:400;line-height:1;text-decoration:inherit}.rst-content .code-block-caption a .headerlink,.rst-content .eqno a .headerlink,.rst-content a .admonition-title,.rst-content code.download a span:first-child,.rst-content dl dt a .headerlink,.rst-content h1 a .headerlink,.rst-content h2 a .headerlink,.rst-content h3 a .headerlink,.rst-content h4 a .headerlink,.rst-content h5 a .headerlink,.rst-content h6 a .headerlink,.rst-content p.caption a .headerlink,.rst-content p a .headerlink,.rst-content table>caption a .headerlink,.rst-content tt.download a span:first-child,.wy-menu-vertical li.current>a button.toctree-expand,.wy-menu-vertical li.on a button.toctree-expand,.wy-menu-vertical li a button.toctree-expand,a .fa,a .icon,a .rst-content .admonition-title,a .rst-content .code-block-caption .headerlink,a .rst-content .eqno .headerlink,a .rst-content code.download span:first-child,a .rst-content dl dt .headerlink,a .rst-content h1 .headerlink,a .rst-content h2 .headerlink,a .rst-content h3 .headerlink,a .rst-content h4 .headerlink,a .rst-content h5 .headerlink,a .rst-content h6 .headerlink,a .rst-content p.caption .headerlink,a .rst-content p .headerlink,a .rst-content table>caption .headerlink,a .rst-content tt.download span:first-child,a .wy-menu-vertical li button.toctree-expand{display:inline-block;text-decoration:inherit}.btn .fa,.btn .icon,.btn .rst-content .admonition-title,.btn .rst-content .code-block-caption .headerlink,.btn .rst-content .eqno .headerlink,.btn .rst-content code.download span:first-child,.btn .rst-content dl dt .headerlink,.btn .rst-content h1 .headerlink,.btn .rst-content h2 .headerlink,.btn .rst-content h3 .headerlink,.btn .rst-content h4 .headerlink,.btn .rst-content h5 .headerlink,.btn .rst-content h6 .headerlink,.btn .rst-content p .headerlink,.btn .rst-content table>caption .headerlink,.btn .rst-content tt.download span:first-child,.btn .wy-menu-vertical li.current>a button.toctree-expand,.btn .wy-menu-vertical li.on a button.toctree-expand,.btn .wy-menu-vertical li button.toctree-expand,.nav .fa,.nav .icon,.nav .rst-content .admonition-title,.nav .rst-content .code-block-caption .headerlink,.nav .rst-content .eqno .headerlink,.nav .rst-content code.download span:first-child,.nav .rst-content dl dt .headerlink,.nav .rst-content h1 .headerlink,.nav .rst-content h2 .headerlink,.nav .rst-content h3 .headerlink,.nav .rst-content h4 .headerlink,.nav .rst-content h5 .headerlink,.nav .rst-content h6 .headerlink,.nav .rst-content p .headerlink,.nav .rst-content table>caption .headerlink,.nav .rst-content tt.download span:first-child,.nav .wy-menu-vertical li.current>a button.toctree-expand,.nav .wy-menu-vertical li.on a button.toctree-expand,.nav .wy-menu-vertical li button.toctree-expand,.rst-content .btn .admonition-title,.rst-content .code-block-caption .btn .headerlink,.rst-content .code-block-caption .nav .headerlink,.rst-content .eqno .btn .headerlink,.rst-content .eqno .nav .headerlink,.rst-content .nav .admonition-title,.rst-content code.download .btn span:first-child,.rst-content code.download .nav span:first-child,.rst-content dl dt .btn .headerlink,.rst-content dl dt .nav .headerlink,.rst-content h1 .btn .headerlink,.rst-content h1 .nav .headerlink,.rst-content h2 .btn .headerlink,.rst-content h2 .nav .headerlink,.rst-content h3 .btn .headerlink,.rst-content h3 .nav .headerlink,.rst-content h4 .btn .headerlink,.rst-content h4 .nav .headerlink,.rst-content h5 .btn .headerlink,.rst-content h5 .nav .headerlink,.rst-content h6 .btn .headerlink,.rst-content h6 .nav .headerlink,.rst-content p .btn .headerlink,.rst-content p .nav .headerlink,.rst-content table>caption .btn .headerlink,.rst-content table>caption .nav .headerlink,.rst-content tt.download .btn span:first-child,.rst-content tt.download .nav span:first-child,.wy-menu-vertical li .btn button.toctree-expand,.wy-menu-vertical li.current>a .btn button.toctree-expand,.wy-menu-vertical li.current>a .nav button.toctree-expand,.wy-menu-vertical li .nav button.toctree-expand,.wy-menu-vertical li.on a .btn button.toctree-expand,.wy-menu-vertical li.on a .nav button.toctree-expand{display:inline}.btn .fa-large.icon,.btn .fa.fa-large,.btn .rst-content .code-block-caption .fa-large.headerlink,.btn .rst-content .eqno .fa-large.headerlink,.btn .rst-content .fa-large.admonition-title,.btn .rst-content code.download span.fa-large:first-child,.btn .rst-content dl dt .fa-large.headerlink,.btn .rst-content h1 .fa-large.headerlink,.btn .rst-content h2 .fa-large.headerlink,.btn .rst-content h3 .fa-large.headerlink,.btn .rst-content h4 .fa-large.headerlink,.btn .rst-content h5 .fa-large.headerlink,.btn .rst-content h6 .fa-large.headerlink,.btn .rst-content p .fa-large.headerlink,.btn .rst-content table>caption .fa-large.headerlink,.btn .rst-content tt.download span.fa-large:first-child,.btn .wy-menu-vertical li button.fa-large.toctree-expand,.nav .fa-large.icon,.nav .fa.fa-large,.nav .rst-content .code-block-caption .fa-large.headerlink,.nav .rst-content .eqno .fa-large.headerlink,.nav .rst-content .fa-large.admonition-title,.nav .rst-content code.download span.fa-large:first-child,.nav .rst-content dl dt .fa-large.headerlink,.nav .rst-content h1 .fa-large.headerlink,.nav .rst-content h2 .fa-large.headerlink,.nav .rst-content h3 .fa-large.headerlink,.nav .rst-content h4 .fa-large.headerlink,.nav .rst-content h5 .fa-large.headerlink,.nav .rst-content h6 .fa-large.headerlink,.nav .rst-content p .fa-large.headerlink,.nav .rst-content table>caption .fa-large.headerlink,.nav .rst-content tt.download span.fa-large:first-child,.nav .wy-menu-vertical li button.fa-large.toctree-expand,.rst-content .btn .fa-large.admonition-title,.rst-content .code-block-caption .btn .fa-large.headerlink,.rst-content .code-block-caption .nav .fa-large.headerlink,.rst-content .eqno .btn .fa-large.headerlink,.rst-content .eqno .nav .fa-large.headerlink,.rst-content .nav .fa-large.admonition-title,.rst-content code.download .btn span.fa-large:first-child,.rst-content code.download .nav span.fa-large:first-child,.rst-content dl dt .btn .fa-large.headerlink,.rst-content dl dt .nav .fa-large.headerlink,.rst-content h1 .btn .fa-large.headerlink,.rst-content h1 .nav .fa-large.headerlink,.rst-content h2 .btn .fa-large.headerlink,.rst-content h2 .nav .fa-large.headerlink,.rst-content h3 .btn .fa-large.headerlink,.rst-content h3 .nav .fa-large.headerlink,.rst-content h4 .btn .fa-large.headerlink,.rst-content h4 .nav .fa-large.headerlink,.rst-content h5 .btn .fa-large.headerlink,.rst-content h5 .nav .fa-large.headerlink,.rst-content h6 .btn .fa-large.headerlink,.rst-content h6 .nav .fa-large.headerlink,.rst-content p .btn .fa-large.headerlink,.rst-content p .nav .fa-large.headerlink,.rst-content table>caption .btn .fa-large.headerlink,.rst-content table>caption .nav .fa-large.headerlink,.rst-content tt.download .btn span.fa-large:first-child,.rst-content tt.download .nav span.fa-large:first-child,.wy-menu-vertical li .btn button.fa-large.toctree-expand,.wy-menu-vertical li .nav button.fa-large.toctree-expand{line-height:.9em}.btn .fa-spin.icon,.btn .fa.fa-spin,.btn .rst-content .code-block-caption .fa-spin.headerlink,.btn .rst-content .eqno .fa-spin.headerlink,.btn .rst-content .fa-spin.admonition-title,.btn .rst-content code.download span.fa-spin:first-child,.btn .rst-content dl dt .fa-spin.headerlink,.btn .rst-content h1 .fa-spin.headerlink,.btn .rst-content h2 .fa-spin.headerlink,.btn .rst-content h3 .fa-spin.headerlink,.btn .rst-content h4 .fa-spin.headerlink,.btn .rst-content h5 .fa-spin.headerlink,.btn .rst-content h6 .fa-spin.headerlink,.btn .rst-content p .fa-spin.headerlink,.btn .rst-content table>caption .fa-spin.headerlink,.btn .rst-content tt.download span.fa-spin:first-child,.btn .wy-menu-vertical li button.fa-spin.toctree-expand,.nav .fa-spin.icon,.nav .fa.fa-spin,.nav .rst-content .code-block-caption .fa-spin.headerlink,.nav .rst-content .eqno .fa-spin.headerlink,.nav .rst-content .fa-spin.admonition-title,.nav .rst-content code.download span.fa-spin:first-child,.nav .rst-content dl dt .fa-spin.headerlink,.nav .rst-content h1 .fa-spin.headerlink,.nav .rst-content h2 .fa-spin.headerlink,.nav .rst-content h3 .fa-spin.headerlink,.nav .rst-content h4 .fa-spin.headerlink,.nav .rst-content h5 .fa-spin.headerlink,.nav .rst-content h6 .fa-spin.headerlink,.nav .rst-content p .fa-spin.headerlink,.nav .rst-content table>caption .fa-spin.headerlink,.nav .rst-content tt.download span.fa-spin:first-child,.nav .wy-menu-vertical li button.fa-spin.toctree-expand,.rst-content .btn .fa-spin.admonition-title,.rst-content .code-block-caption .btn .fa-spin.headerlink,.rst-content .code-block-caption .nav .fa-spin.headerlink,.rst-content .eqno .btn .fa-spin.headerlink,.rst-content .eqno .nav .fa-spin.headerlink,.rst-content .nav .fa-spin.admonition-title,.rst-content code.download .btn span.fa-spin:first-child,.rst-content code.download .nav span.fa-spin:first-child,.rst-content dl dt .btn .fa-spin.headerlink,.rst-content dl dt .nav .fa-spin.headerlink,.rst-content h1 .btn .fa-spin.headerlink,.rst-content h1 .nav .fa-spin.headerlink,.rst-content h2 .btn .fa-spin.headerlink,.rst-content h2 .nav .fa-spin.headerlink,.rst-content h3 .btn .fa-spin.headerlink,.rst-content h3 .nav .fa-spin.headerlink,.rst-content h4 .btn .fa-spin.headerlink,.rst-content h4 .nav .fa-spin.headerlink,.rst-content h5 .btn .fa-spin.headerlink,.rst-content h5 .nav .fa-spin.headerlink,.rst-content h6 .btn .fa-spin.headerlink,.rst-content h6 .nav .fa-spin.headerlink,.rst-content p .btn .fa-spin.headerlink,.rst-content p .nav .fa-spin.headerlink,.rst-content table>caption .btn .fa-spin.headerlink,.rst-content table>caption .nav .fa-spin.headerlink,.rst-content tt.download .btn span.fa-spin:first-child,.rst-content tt.download .nav span.fa-spin:first-child,.wy-menu-vertical li .btn button.fa-spin.toctree-expand,.wy-menu-vertical li .nav button.fa-spin.toctree-expand{display:inline-block}.btn.fa:before,.btn.icon:before,.rst-content .btn.admonition-title:before,.rst-content .code-block-caption .btn.headerlink:before,.rst-content .eqno .btn.headerlink:before,.rst-content code.download span.btn:first-child:before,.rst-content dl dt .btn.headerlink:before,.rst-content h1 .btn.headerlink:before,.rst-content h2 .btn.headerlink:before,.rst-content h3 .btn.headerlink:before,.rst-content h4 .btn.headerlink:before,.rst-content h5 .btn.headerlink:before,.rst-content h6 .btn.headerlink:before,.rst-content p .btn.headerlink:before,.rst-content table>caption .btn.headerlink:before,.rst-content tt.download span.btn:first-child:before,.wy-menu-vertical li button.btn.toctree-expand:before{opacity:.5;-webkit-transition:opacity .05s ease-in;-moz-transition:opacity .05s ease-in;transition:opacity .05s ease-in}.btn.fa:hover:before,.btn.icon:hover:before,.rst-content .btn.admonition-title:hover:before,.rst-content .code-block-caption .btn.headerlink:hover:before,.rst-content .eqno .btn.headerlink:hover:before,.rst-content code.download span.btn:first-child:hover:before,.rst-content dl dt .btn.headerlink:hover:before,.rst-content h1 .btn.headerlink:hover:before,.rst-content h2 .btn.headerlink:hover:before,.rst-content h3 .btn.headerlink:hover:before,.rst-content h4 .btn.headerlink:hover:before,.rst-content h5 .btn.headerlink:hover:before,.rst-content h6 .btn.headerlink:hover:before,.rst-content p .btn.headerlink:hover:before,.rst-content table>caption .btn.headerlink:hover:before,.rst-content tt.download span.btn:first-child:hover:before,.wy-menu-vertical li button.btn.toctree-expand:hover:before{opacity:1}.btn-mini .fa:before,.btn-mini .icon:before,.btn-mini .rst-content .admonition-title:before,.btn-mini .rst-content .code-block-caption .headerlink:before,.btn-mini .rst-content .eqno .headerlink:before,.btn-mini .rst-content code.download span:first-child:before,.btn-mini .rst-content dl dt .headerlink:before,.btn-mini .rst-content h1 .headerlink:before,.btn-mini .rst-content h2 .headerlink:before,.btn-mini .rst-content h3 .headerlink:before,.btn-mini .rst-content h4 .headerlink:before,.btn-mini .rst-content h5 .headerlink:before,.btn-mini .rst-content h6 .headerlink:before,.btn-mini .rst-content p .headerlink:before,.btn-mini .rst-content table>caption .headerlink:before,.btn-mini .rst-content tt.download span:first-child:before,.btn-mini .wy-menu-vertical li button.toctree-expand:before,.rst-content .btn-mini .admonition-title:before,.rst-content .code-block-caption .btn-mini .headerlink:before,.rst-content .eqno .btn-mini .headerlink:before,.rst-content code.download .btn-mini span:first-child:before,.rst-content dl dt .btn-mini .headerlink:before,.rst-content h1 .btn-mini .headerlink:before,.rst-content h2 .btn-mini .headerlink:before,.rst-content h3 .btn-mini .headerlink:before,.rst-content h4 .btn-mini .headerlink:before,.rst-content h5 .btn-mini .headerlink:before,.rst-content h6 .btn-mini .headerlink:before,.rst-content p .btn-mini .headerlink:before,.rst-content table>caption .btn-mini .headerlink:before,.rst-content tt.download .btn-mini span:first-child:before,.wy-menu-vertical li .btn-mini button.toctree-expand:before{font-size:14px;vertical-align:-15%}.rst-content .admonition,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning,.wy-alert{padding:12px;line-height:24px;margin-bottom:24px;background:#e7f2fa}.rst-content .admonition-title,.wy-alert-title{font-weight:700;display:block;color:#fff;background:#6ab0de;padding:6px 12px;margin:-12px -12px 12px}.rst-content .danger,.rst-content .error,.rst-content .wy-alert-danger.admonition,.rst-content .wy-alert-danger.admonition-todo,.rst-content .wy-alert-danger.attention,.rst-content .wy-alert-danger.caution,.rst-content .wy-alert-danger.hint,.rst-content .wy-alert-danger.important,.rst-content .wy-alert-danger.note,.rst-content .wy-alert-danger.seealso,.rst-content .wy-alert-danger.tip,.rst-content .wy-alert-danger.warning,.wy-alert.wy-alert-danger{background:#fdf3f2}.rst-content .danger .admonition-title,.rst-content .danger .wy-alert-title,.rst-content .error .admonition-title,.rst-content .error .wy-alert-title,.rst-content .wy-alert-danger.admonition-todo .admonition-title,.rst-content .wy-alert-danger.admonition-todo .wy-alert-title,.rst-content .wy-alert-danger.admonition .admonition-title,.rst-content .wy-alert-danger.admonition .wy-alert-title,.rst-content .wy-alert-danger.attention .admonition-title,.rst-content .wy-alert-danger.attention .wy-alert-title,.rst-content .wy-alert-danger.caution .admonition-title,.rst-content .wy-alert-danger.caution .wy-alert-title,.rst-content .wy-alert-danger.hint .admonition-title,.rst-content .wy-alert-danger.hint .wy-alert-title,.rst-content .wy-alert-danger.important .admonition-title,.rst-content .wy-alert-danger.important .wy-alert-title,.rst-content .wy-alert-danger.note .admonition-title,.rst-content .wy-alert-danger.note .wy-alert-title,.rst-content .wy-alert-danger.seealso .admonition-title,.rst-content .wy-alert-danger.seealso .wy-alert-title,.rst-content .wy-alert-danger.tip .admonition-title,.rst-content .wy-alert-danger.tip .wy-alert-title,.rst-content .wy-alert-danger.warning .admonition-title,.rst-content .wy-alert-danger.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-danger .admonition-title,.wy-alert.wy-alert-danger .rst-content .admonition-title,.wy-alert.wy-alert-danger .wy-alert-title{background:#f29f97}.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .warning,.rst-content .wy-alert-warning.admonition,.rst-content .wy-alert-warning.danger,.rst-content .wy-alert-warning.error,.rst-content .wy-alert-warning.hint,.rst-content .wy-alert-warning.important,.rst-content .wy-alert-warning.note,.rst-content .wy-alert-warning.seealso,.rst-content .wy-alert-warning.tip,.wy-alert.wy-alert-warning{background:#ffedcc}.rst-content .admonition-todo .admonition-title,.rst-content .admonition-todo .wy-alert-title,.rst-content .attention .admonition-title,.rst-content .attention .wy-alert-title,.rst-content .caution .admonition-title,.rst-content .caution .wy-alert-title,.rst-content .warning .admonition-title,.rst-content .warning .wy-alert-title,.rst-content .wy-alert-warning.admonition .admonition-title,.rst-content .wy-alert-warning.admonition .wy-alert-title,.rst-content .wy-alert-warning.danger .admonition-title,.rst-content .wy-alert-warning.danger .wy-alert-title,.rst-content .wy-alert-warning.error .admonition-title,.rst-content .wy-alert-warning.error .wy-alert-title,.rst-content .wy-alert-warning.hint .admonition-title,.rst-content .wy-alert-warning.hint .wy-alert-title,.rst-content .wy-alert-warning.important .admonition-title,.rst-content .wy-alert-warning.important .wy-alert-title,.rst-content .wy-alert-warning.note .admonition-title,.rst-content .wy-alert-warning.note .wy-alert-title,.rst-content .wy-alert-warning.seealso .admonition-title,.rst-content .wy-alert-warning.seealso .wy-alert-title,.rst-content .wy-alert-warning.tip .admonition-title,.rst-content .wy-alert-warning.tip .wy-alert-title,.rst-content .wy-alert.wy-alert-warning .admonition-title,.wy-alert.wy-alert-warning .rst-content .admonition-title,.wy-alert.wy-alert-warning .wy-alert-title{background:#f0b37e}.rst-content .note,.rst-content .seealso,.rst-content .wy-alert-info.admonition,.rst-content .wy-alert-info.admonition-todo,.rst-content .wy-alert-info.attention,.rst-content .wy-alert-info.caution,.rst-content .wy-alert-info.danger,.rst-content .wy-alert-info.error,.rst-content .wy-alert-info.hint,.rst-content .wy-alert-info.important,.rst-content .wy-alert-info.tip,.rst-content .wy-alert-info.warning,.wy-alert.wy-alert-info{background:#e7f2fa}.rst-content .note .admonition-title,.rst-content .note .wy-alert-title,.rst-content .seealso .admonition-title,.rst-content .seealso .wy-alert-title,.rst-content .wy-alert-info.admonition-todo .admonition-title,.rst-content .wy-alert-info.admonition-todo .wy-alert-title,.rst-content .wy-alert-info.admonition .admonition-title,.rst-content .wy-alert-info.admonition .wy-alert-title,.rst-content .wy-alert-info.attention .admonition-title,.rst-content .wy-alert-info.attention .wy-alert-title,.rst-content .wy-alert-info.caution .admonition-title,.rst-content .wy-alert-info.caution .wy-alert-title,.rst-content .wy-alert-info.danger .admonition-title,.rst-content .wy-alert-info.danger .wy-alert-title,.rst-content .wy-alert-info.error .admonition-title,.rst-content .wy-alert-info.error .wy-alert-title,.rst-content .wy-alert-info.hint .admonition-title,.rst-content .wy-alert-info.hint .wy-alert-title,.rst-content .wy-alert-info.important .admonition-title,.rst-content .wy-alert-info.important .wy-alert-title,.rst-content .wy-alert-info.tip .admonition-title,.rst-content .wy-alert-info.tip .wy-alert-title,.rst-content .wy-alert-info.warning .admonition-title,.rst-content .wy-alert-info.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-info .admonition-title,.wy-alert.wy-alert-info .rst-content .admonition-title,.wy-alert.wy-alert-info .wy-alert-title{background:#6ab0de}.rst-content .hint,.rst-content .important,.rst-content .tip,.rst-content .wy-alert-success.admonition,.rst-content .wy-alert-success.admonition-todo,.rst-content .wy-alert-success.attention,.rst-content .wy-alert-success.caution,.rst-content .wy-alert-success.danger,.rst-content .wy-alert-success.error,.rst-content .wy-alert-success.note,.rst-content .wy-alert-success.seealso,.rst-content .wy-alert-success.warning,.wy-alert.wy-alert-success{background:#dbfaf4}.rst-content .hint .admonition-title,.rst-content .hint .wy-alert-title,.rst-content .important .admonition-title,.rst-content .important .wy-alert-title,.rst-content .tip .admonition-title,.rst-content .tip .wy-alert-title,.rst-content .wy-alert-success.admonition-todo .admonition-title,.rst-content .wy-alert-success.admonition-todo .wy-alert-title,.rst-content .wy-alert-success.admonition .admonition-title,.rst-content .wy-alert-success.admonition .wy-alert-title,.rst-content .wy-alert-success.attention .admonition-title,.rst-content .wy-alert-success.attention .wy-alert-title,.rst-content .wy-alert-success.caution .admonition-title,.rst-content .wy-alert-success.caution .wy-alert-title,.rst-content .wy-alert-success.danger .admonition-title,.rst-content .wy-alert-success.danger .wy-alert-title,.rst-content .wy-alert-success.error .admonition-title,.rst-content .wy-alert-success.error .wy-alert-title,.rst-content .wy-alert-success.note .admonition-title,.rst-content .wy-alert-success.note .wy-alert-title,.rst-content .wy-alert-success.seealso .admonition-title,.rst-content .wy-alert-success.seealso .wy-alert-title,.rst-content .wy-alert-success.warning .admonition-title,.rst-content .wy-alert-success.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-success .admonition-title,.wy-alert.wy-alert-success .rst-content .admonition-title,.wy-alert.wy-alert-success .wy-alert-title{background:#1abc9c}.rst-content .wy-alert-neutral.admonition,.rst-content .wy-alert-neutral.admonition-todo,.rst-content .wy-alert-neutral.attention,.rst-content .wy-alert-neutral.caution,.rst-content .wy-alert-neutral.danger,.rst-content .wy-alert-neutral.error,.rst-content .wy-alert-neutral.hint,.rst-content .wy-alert-neutral.important,.rst-content .wy-alert-neutral.note,.rst-content .wy-alert-neutral.seealso,.rst-content .wy-alert-neutral.tip,.rst-content .wy-alert-neutral.warning,.wy-alert.wy-alert-neutral{background:#f3f6f6}.rst-content .wy-alert-neutral.admonition-todo .admonition-title,.rst-content .wy-alert-neutral.admonition-todo .wy-alert-title,.rst-content .wy-alert-neutral.admonition .admonition-title,.rst-content .wy-alert-neutral.admonition .wy-alert-title,.rst-content .wy-alert-neutral.attention .admonition-title,.rst-content .wy-alert-neutral.attention .wy-alert-title,.rst-content .wy-alert-neutral.caution .admonition-title,.rst-content .wy-alert-neutral.caution .wy-alert-title,.rst-content .wy-alert-neutral.danger .admonition-title,.rst-content .wy-alert-neutral.danger .wy-alert-title,.rst-content .wy-alert-neutral.error .admonition-title,.rst-content .wy-alert-neutral.error .wy-alert-title,.rst-content .wy-alert-neutral.hint .admonition-title,.rst-content .wy-alert-neutral.hint .wy-alert-title,.rst-content .wy-alert-neutral.important .admonition-title,.rst-content .wy-alert-neutral.important .wy-alert-title,.rst-content .wy-alert-neutral.note .admonition-title,.rst-content .wy-alert-neutral.note .wy-alert-title,.rst-content .wy-alert-neutral.seealso .admonition-title,.rst-content .wy-alert-neutral.seealso .wy-alert-title,.rst-content .wy-alert-neutral.tip .admonition-title,.rst-content .wy-alert-neutral.tip .wy-alert-title,.rst-content .wy-alert-neutral.warning .admonition-title,.rst-content .wy-alert-neutral.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-neutral .admonition-title,.wy-alert.wy-alert-neutral .rst-content .admonition-title,.wy-alert.wy-alert-neutral .wy-alert-title{color:#404040;background:#e1e4e5}.rst-content .wy-alert-neutral.admonition-todo a,.rst-content .wy-alert-neutral.admonition a,.rst-content .wy-alert-neutral.attention a,.rst-content .wy-alert-neutral.caution a,.rst-content .wy-alert-neutral.danger a,.rst-content .wy-alert-neutral.error a,.rst-content .wy-alert-neutral.hint a,.rst-content .wy-alert-neutral.important a,.rst-content .wy-alert-neutral.note a,.rst-content .wy-alert-neutral.seealso a,.rst-content .wy-alert-neutral.tip a,.rst-content .wy-alert-neutral.warning a,.wy-alert.wy-alert-neutral a{color:#2980b9}.rst-content .admonition-todo p:last-child,.rst-content .admonition p:last-child,.rst-content .attention p:last-child,.rst-content .caution p:last-child,.rst-content .danger p:last-child,.rst-content .error p:last-child,.rst-content .hint p:last-child,.rst-content .important p:last-child,.rst-content .note p:last-child,.rst-content .seealso p:last-child,.rst-content .tip p:last-child,.rst-content .warning p:last-child,.wy-alert p:last-child{margin-bottom:0}.wy-tray-container{position:fixed;bottom:0;left:0;z-index:600}.wy-tray-container li{display:block;width:300px;background:transparent;color:#fff;text-align:center;box-shadow:0 5px 5px 0 rgba(0,0,0,.1);padding:0 24px;min-width:20%;opacity:0;height:0;line-height:56px;overflow:hidden;-webkit-transition:all .3s ease-in;-moz-transition:all .3s ease-in;transition:all .3s ease-in}.wy-tray-container li.wy-tray-item-success{background:#27ae60}.wy-tray-container li.wy-tray-item-info{background:#2980b9}.wy-tray-container li.wy-tray-item-warning{background:#e67e22}.wy-tray-container li.wy-tray-item-danger{background:#e74c3c}.wy-tray-container li.on{opacity:1;height:56px}@media screen and (max-width:768px){.wy-tray-container{bottom:auto;top:0;width:100%}.wy-tray-container li{width:100%}}button{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle;cursor:pointer;line-height:normal;-webkit-appearance:button;*overflow:visible}button::-moz-focus-inner,input::-moz-focus-inner{border:0;padding:0}button[disabled]{cursor:default}.btn{display:inline-block;border-radius:2px;line-height:normal;white-space:nowrap;text-align:center;cursor:pointer;font-size:100%;padding:6px 12px 8px;color:#fff;border:1px solid rgba(0,0,0,.1);background-color:#27ae60;text-decoration:none;font-weight:400;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;box-shadow:inset 0 1px 2px -1px hsla(0,0%,100%,.5),inset 0 -2px 0 0 rgba(0,0,0,.1);outline-none:false;vertical-align:middle;*display:inline;zoom:1;-webkit-user-drag:none;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;-webkit-transition:all .1s linear;-moz-transition:all .1s linear;transition:all .1s linear}.btn-hover{background:#2e8ece;color:#fff}.btn:hover{background:#2cc36b;color:#fff}.btn:focus{background:#2cc36b;outline:0}.btn:active{box-shadow:inset 0 -1px 0 0 rgba(0,0,0,.05),inset 0 2px 0 0 rgba(0,0,0,.1);padding:8px 12px 6px}.btn:visited{color:#fff}.btn-disabled,.btn-disabled:active,.btn-disabled:focus,.btn-disabled:hover,.btn:disabled{background-image:none;filter:progid:DXImageTransform.Microsoft.gradient(enabled = false);filter:alpha(opacity=40);opacity:.4;cursor:not-allowed;box-shadow:none}.btn::-moz-focus-inner{padding:0;border:0}.btn-small{font-size:80%}.btn-info{background-color:#2980b9!important}.btn-info:hover{background-color:#2e8ece!important}.btn-neutral{background-color:#f3f6f6!important;color:#404040!important}.btn-neutral:hover{background-color:#e5ebeb!important;color:#404040}.btn-neutral:visited{color:#404040!important}.btn-success{background-color:#27ae60!important}.btn-success:hover{background-color:#295!important}.btn-danger{background-color:#e74c3c!important}.btn-danger:hover{background-color:#ea6153!important}.btn-warning{background-color:#e67e22!important}.btn-warning:hover{background-color:#e98b39!important}.btn-invert{background-color:#222}.btn-invert:hover{background-color:#2f2f2f!important}.btn-link{background-color:transparent!important;color:#2980b9;box-shadow:none;border-color:transparent!important}.btn-link:active,.btn-link:hover{background-color:transparent!important;color:#409ad5!important;box-shadow:none}.btn-link:visited{color:#9b59b6}.wy-btn-group .btn,.wy-control .btn{vertical-align:middle}.wy-btn-group{margin-bottom:24px;*zoom:1}.wy-btn-group:after,.wy-btn-group:before{display:table;content:""}.wy-btn-group:after{clear:both}.wy-dropdown{position:relative;display:inline-block}.wy-dropdown-active .wy-dropdown-menu{display:block}.wy-dropdown-menu{position:absolute;left:0;display:none;float:left;top:100%;min-width:100%;background:#fcfcfc;z-index:100;border:1px solid #cfd7dd;box-shadow:0 2px 2px 0 rgba(0,0,0,.1);padding:12px}.wy-dropdown-menu>dd>a{display:block;clear:both;color:#404040;white-space:nowrap;font-size:90%;padding:0 12px;cursor:pointer}.wy-dropdown-menu>dd>a:hover{background:#2980b9;color:#fff}.wy-dropdown-menu>dd.divider{border-top:1px solid #cfd7dd;margin:6px 0}.wy-dropdown-menu>dd.search{padding-bottom:12px}.wy-dropdown-menu>dd.search input[type=search]{width:100%}.wy-dropdown-menu>dd.call-to-action{background:#e3e3e3;text-transform:uppercase;font-weight:500;font-size:80%}.wy-dropdown-menu>dd.call-to-action:hover{background:#e3e3e3}.wy-dropdown-menu>dd.call-to-action .btn{color:#fff}.wy-dropdown.wy-dropdown-up .wy-dropdown-menu{bottom:100%;top:auto;left:auto;right:0}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu{background:#fcfcfc;margin-top:2px}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu a{padding:6px 12px}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu a:hover{background:#2980b9;color:#fff}.wy-dropdown.wy-dropdown-left .wy-dropdown-menu{right:0;left:auto;text-align:right}.wy-dropdown-arrow:before{content:" ";border-bottom:5px solid #f5f5f5;border-left:5px solid transparent;border-right:5px solid transparent;position:absolute;display:block;top:-4px;left:50%;margin-left:-3px}.wy-dropdown-arrow.wy-dropdown-arrow-left:before{left:11px}.wy-form-stacked select{display:block}.wy-form-aligned .wy-help-inline,.wy-form-aligned input,.wy-form-aligned label,.wy-form-aligned select,.wy-form-aligned textarea{display:inline-block;*display:inline;*zoom:1;vertical-align:middle}.wy-form-aligned .wy-control-group>label{display:inline-block;vertical-align:middle;width:10em;margin:6px 12px 0 0;float:left}.wy-form-aligned .wy-control{float:left}.wy-form-aligned .wy-control label{display:block}.wy-form-aligned .wy-control select{margin-top:6px}fieldset{margin:0}fieldset,legend{border:0;padding:0}legend{width:100%;white-space:normal;margin-bottom:24px;font-size:150%;*margin-left:-7px}label,legend{display:block}label{margin:0 0 .3125em;color:#333;font-size:90%}input,select,textarea{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle}.wy-control-group{margin-bottom:24px;max-width:1200px;margin-left:auto;margin-right:auto;*zoom:1}.wy-control-group:after,.wy-control-group:before{display:table;content:""}.wy-control-group:after{clear:both}.wy-control-group.wy-control-group-required>label:after{content:" *";color:#e74c3c}.wy-control-group .wy-form-full,.wy-control-group .wy-form-halves,.wy-control-group .wy-form-thirds{padding-bottom:12px}.wy-control-group .wy-form-full input[type=color],.wy-control-group .wy-form-full input[type=date],.wy-control-group .wy-form-full input[type=datetime-local],.wy-control-group .wy-form-full input[type=datetime],.wy-control-group .wy-form-full input[type=email],.wy-control-group .wy-form-full input[type=month],.wy-control-group .wy-form-full input[type=number],.wy-control-group .wy-form-full input[type=password],.wy-control-group .wy-form-full input[type=search],.wy-control-group .wy-form-full input[type=tel],.wy-control-group .wy-form-full input[type=text],.wy-control-group .wy-form-full input[type=time],.wy-control-group .wy-form-full input[type=url],.wy-control-group .wy-form-full input[type=week],.wy-control-group .wy-form-full select,.wy-control-group .wy-form-halves input[type=color],.wy-control-group .wy-form-halves input[type=date],.wy-control-group .wy-form-halves input[type=datetime-local],.wy-control-group .wy-form-halves input[type=datetime],.wy-control-group .wy-form-halves input[type=email],.wy-control-group .wy-form-halves input[type=month],.wy-control-group .wy-form-halves input[type=number],.wy-control-group .wy-form-halves input[type=password],.wy-control-group .wy-form-halves input[type=search],.wy-control-group .wy-form-halves input[type=tel],.wy-control-group .wy-form-halves input[type=text],.wy-control-group .wy-form-halves input[type=time],.wy-control-group .wy-form-halves input[type=url],.wy-control-group .wy-form-halves input[type=week],.wy-control-group .wy-form-halves select,.wy-control-group .wy-form-thirds input[type=color],.wy-control-group .wy-form-thirds input[type=date],.wy-control-group .wy-form-thirds input[type=datetime-local],.wy-control-group .wy-form-thirds input[type=datetime],.wy-control-group .wy-form-thirds input[type=email],.wy-control-group .wy-form-thirds input[type=month],.wy-control-group .wy-form-thirds input[type=number],.wy-control-group .wy-form-thirds input[type=password],.wy-control-group .wy-form-thirds input[type=search],.wy-control-group .wy-form-thirds input[type=tel],.wy-control-group .wy-form-thirds input[type=text],.wy-control-group .wy-form-thirds input[type=time],.wy-control-group .wy-form-thirds input[type=url],.wy-control-group .wy-form-thirds input[type=week],.wy-control-group .wy-form-thirds select{width:100%}.wy-control-group .wy-form-full{float:left;display:block;width:100%;margin-right:0}.wy-control-group .wy-form-full:last-child{margin-right:0}.wy-control-group .wy-form-halves{float:left;display:block;margin-right:2.35765%;width:48.82117%}.wy-control-group .wy-form-halves:last-child,.wy-control-group .wy-form-halves:nth-of-type(2n){margin-right:0}.wy-control-group .wy-form-halves:nth-of-type(odd){clear:left}.wy-control-group .wy-form-thirds{float:left;display:block;margin-right:2.35765%;width:31.76157%}.wy-control-group .wy-form-thirds:last-child,.wy-control-group .wy-form-thirds:nth-of-type(3n){margin-right:0}.wy-control-group .wy-form-thirds:nth-of-type(3n+1){clear:left}.wy-control-group.wy-control-group-no-input .wy-control,.wy-control-no-input{margin:6px 0 0;font-size:90%}.wy-control-no-input{display:inline-block}.wy-control-group.fluid-input input[type=color],.wy-control-group.fluid-input input[type=date],.wy-control-group.fluid-input input[type=datetime-local],.wy-control-group.fluid-input input[type=datetime],.wy-control-group.fluid-input input[type=email],.wy-control-group.fluid-input input[type=month],.wy-control-group.fluid-input input[type=number],.wy-control-group.fluid-input input[type=password],.wy-control-group.fluid-input input[type=search],.wy-control-group.fluid-input input[type=tel],.wy-control-group.fluid-input input[type=text],.wy-control-group.fluid-input input[type=time],.wy-control-group.fluid-input input[type=url],.wy-control-group.fluid-input input[type=week]{width:100%}.wy-form-message-inline{padding-left:.3em;color:#666;font-size:90%}.wy-form-message{display:block;color:#999;font-size:70%;margin-top:.3125em;font-style:italic}.wy-form-message p{font-size:inherit;font-style:italic;margin-bottom:6px}.wy-form-message p:last-child{margin-bottom:0}input{line-height:normal}input[type=button],input[type=reset],input[type=submit]{-webkit-appearance:button;cursor:pointer;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;*overflow:visible}input[type=color],input[type=date],input[type=datetime-local],input[type=datetime],input[type=email],input[type=month],input[type=number],input[type=password],input[type=search],input[type=tel],input[type=text],input[type=time],input[type=url],input[type=week]{-webkit-appearance:none;padding:6px;display:inline-block;border:1px solid #ccc;font-size:80%;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;box-shadow:inset 0 1px 3px #ddd;border-radius:0;-webkit-transition:border .3s linear;-moz-transition:border .3s linear;transition:border .3s linear}input[type=datetime-local]{padding:.34375em .625em}input[disabled]{cursor:default}input[type=checkbox],input[type=radio]{padding:0;margin-right:.3125em;*height:13px;*width:13px}input[type=checkbox],input[type=radio],input[type=search]{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}input[type=search]::-webkit-search-cancel-button,input[type=search]::-webkit-search-decoration{-webkit-appearance:none}input[type=color]:focus,input[type=date]:focus,input[type=datetime-local]:focus,input[type=datetime]:focus,input[type=email]:focus,input[type=month]:focus,input[type=number]:focus,input[type=password]:focus,input[type=search]:focus,input[type=tel]:focus,input[type=text]:focus,input[type=time]:focus,input[type=url]:focus,input[type=week]:focus{outline:0;outline:thin dotted\9;border-color:#333}input.no-focus:focus{border-color:#ccc!important}input[type=checkbox]:focus,input[type=file]:focus,input[type=radio]:focus{outline:thin dotted #333;outline:1px auto #129fea}input[type=color][disabled],input[type=date][disabled],input[type=datetime-local][disabled],input[type=datetime][disabled],input[type=email][disabled],input[type=month][disabled],input[type=number][disabled],input[type=password][disabled],input[type=search][disabled],input[type=tel][disabled],input[type=text][disabled],input[type=time][disabled],input[type=url][disabled],input[type=week][disabled]{cursor:not-allowed;background-color:#fafafa}input:focus:invalid,select:focus:invalid,textarea:focus:invalid{color:#e74c3c;border:1px solid #e74c3c}input:focus:invalid:focus,select:focus:invalid:focus,textarea:focus:invalid:focus{border-color:#e74c3c}input[type=checkbox]:focus:invalid:focus,input[type=file]:focus:invalid:focus,input[type=radio]:focus:invalid:focus{outline-color:#e74c3c}input.wy-input-large{padding:12px;font-size:100%}textarea{overflow:auto;vertical-align:top;width:100%;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif}select,textarea{padding:.5em .625em;display:inline-block;border:1px solid #ccc;font-size:80%;box-shadow:inset 0 1px 3px #ddd;-webkit-transition:border .3s linear;-moz-transition:border .3s linear;transition:border .3s linear}select{border:1px solid #ccc;background-color:#fff}select[multiple]{height:auto}select:focus,textarea:focus{outline:0}input[readonly],select[disabled],select[readonly],textarea[disabled],textarea[readonly]{cursor:not-allowed;background-color:#fafafa}input[type=checkbox][disabled],input[type=radio][disabled]{cursor:not-allowed}.wy-checkbox,.wy-radio{margin:6px 0;color:#404040;display:block}.wy-checkbox input,.wy-radio input{vertical-align:baseline}.wy-form-message-inline{display:inline-block;*display:inline;*zoom:1;vertical-align:middle}.wy-input-prefix,.wy-input-suffix{white-space:nowrap;padding:6px}.wy-input-prefix .wy-input-context,.wy-input-suffix .wy-input-context{line-height:27px;padding:0 8px;display:inline-block;font-size:80%;background-color:#f3f6f6;border:1px solid #ccc;color:#999}.wy-input-suffix .wy-input-context{border-left:0}.wy-input-prefix .wy-input-context{border-right:0}.wy-switch{position:relative;display:block;height:24px;margin-top:12px;cursor:pointer}.wy-switch:before{left:0;top:0;width:36px;height:12px;background:#ccc}.wy-switch:after,.wy-switch:before{position:absolute;content:"";display:block;border-radius:4px;-webkit-transition:all .2s ease-in-out;-moz-transition:all .2s ease-in-out;transition:all .2s ease-in-out}.wy-switch:after{width:18px;height:18px;background:#999;left:-3px;top:-3px}.wy-switch span{position:absolute;left:48px;display:block;font-size:12px;color:#ccc;line-height:1}.wy-switch.active:before{background:#1e8449}.wy-switch.active:after{left:24px;background:#27ae60}.wy-switch.disabled{cursor:not-allowed;opacity:.8}.wy-control-group.wy-control-group-error .wy-form-message,.wy-control-group.wy-control-group-error>label{color:#e74c3c}.wy-control-group.wy-control-group-error input[type=color],.wy-control-group.wy-control-group-error input[type=date],.wy-control-group.wy-control-group-error input[type=datetime-local],.wy-control-group.wy-control-group-error input[type=datetime],.wy-control-group.wy-control-group-error input[type=email],.wy-control-group.wy-control-group-error input[type=month],.wy-control-group.wy-control-group-error input[type=number],.wy-control-group.wy-control-group-error input[type=password],.wy-control-group.wy-control-group-error input[type=search],.wy-control-group.wy-control-group-error input[type=tel],.wy-control-group.wy-control-group-error input[type=text],.wy-control-group.wy-control-group-error input[type=time],.wy-control-group.wy-control-group-error input[type=url],.wy-control-group.wy-control-group-error input[type=week],.wy-control-group.wy-control-group-error textarea{border:1px solid #e74c3c}.wy-inline-validate{white-space:nowrap}.wy-inline-validate .wy-input-context{padding:.5em .625em;display:inline-block;font-size:80%}.wy-inline-validate.wy-inline-validate-success .wy-input-context{color:#27ae60}.wy-inline-validate.wy-inline-validate-danger .wy-input-context{color:#e74c3c}.wy-inline-validate.wy-inline-validate-warning .wy-input-context{color:#e67e22}.wy-inline-validate.wy-inline-validate-info .wy-input-context{color:#2980b9}.rotate-90{-webkit-transform:rotate(90deg);-moz-transform:rotate(90deg);-ms-transform:rotate(90deg);-o-transform:rotate(90deg);transform:rotate(90deg)}.rotate-180{-webkit-transform:rotate(180deg);-moz-transform:rotate(180deg);-ms-transform:rotate(180deg);-o-transform:rotate(180deg);transform:rotate(180deg)}.rotate-270{-webkit-transform:rotate(270deg);-moz-transform:rotate(270deg);-ms-transform:rotate(270deg);-o-transform:rotate(270deg);transform:rotate(270deg)}.mirror{-webkit-transform:scaleX(-1);-moz-transform:scaleX(-1);-ms-transform:scaleX(-1);-o-transform:scaleX(-1);transform:scaleX(-1)}.mirror.rotate-90{-webkit-transform:scaleX(-1) rotate(90deg);-moz-transform:scaleX(-1) rotate(90deg);-ms-transform:scaleX(-1) rotate(90deg);-o-transform:scaleX(-1) rotate(90deg);transform:scaleX(-1) rotate(90deg)}.mirror.rotate-180{-webkit-transform:scaleX(-1) rotate(180deg);-moz-transform:scaleX(-1) rotate(180deg);-ms-transform:scaleX(-1) rotate(180deg);-o-transform:scaleX(-1) rotate(180deg);transform:scaleX(-1) rotate(180deg)}.mirror.rotate-270{-webkit-transform:scaleX(-1) rotate(270deg);-moz-transform:scaleX(-1) rotate(270deg);-ms-transform:scaleX(-1) rotate(270deg);-o-transform:scaleX(-1) rotate(270deg);transform:scaleX(-1) rotate(270deg)}@media only screen and (max-width:480px){.wy-form button[type=submit]{margin:.7em 0 0}.wy-form input[type=color],.wy-form input[type=date],.wy-form input[type=datetime-local],.wy-form input[type=datetime],.wy-form input[type=email],.wy-form input[type=month],.wy-form input[type=number],.wy-form input[type=password],.wy-form input[type=search],.wy-form input[type=tel],.wy-form input[type=text],.wy-form input[type=time],.wy-form input[type=url],.wy-form input[type=week],.wy-form label{margin-bottom:.3em;display:block}.wy-form input[type=color],.wy-form input[type=date],.wy-form input[type=datetime-local],.wy-form input[type=datetime],.wy-form input[type=email],.wy-form input[type=month],.wy-form input[type=number],.wy-form input[type=password],.wy-form input[type=search],.wy-form input[type=tel],.wy-form input[type=time],.wy-form input[type=url],.wy-form input[type=week]{margin-bottom:0}.wy-form-aligned .wy-control-group label{margin-bottom:.3em;text-align:left;display:block;width:100%}.wy-form-aligned .wy-control{margin:1.5em 0 0}.wy-form-message,.wy-form-message-inline,.wy-form .wy-help-inline{display:block;font-size:80%;padding:6px 0}}@media screen and (max-width:768px){.tablet-hide{display:none}}@media screen and (max-width:480px){.mobile-hide{display:none}}.float-left{float:left}.float-right{float:right}.full-width{width:100%}.rst-content table.docutils,.rst-content table.field-list,.wy-table{border-collapse:collapse;border-spacing:0;empty-cells:show;margin-bottom:24px}.rst-content table.docutils caption,.rst-content table.field-list caption,.wy-table caption{color:#000;font:italic 85%/1 arial,sans-serif;padding:1em 0;text-align:center}.rst-content table.docutils td,.rst-content table.docutils th,.rst-content table.field-list td,.rst-content table.field-list th,.wy-table td,.wy-table th{font-size:90%;margin:0;overflow:visible;padding:8px 16px}.rst-content table.docutils td:first-child,.rst-content table.docutils th:first-child,.rst-content table.field-list td:first-child,.rst-content table.field-list th:first-child,.wy-table td:first-child,.wy-table th:first-child{border-left-width:0}.rst-content table.docutils thead,.rst-content table.field-list thead,.wy-table thead{color:#000;text-align:left;vertical-align:bottom;white-space:nowrap}.rst-content table.docutils thead th,.rst-content table.field-list thead th,.wy-table thead th{font-weight:700;border-bottom:2px solid #e1e4e5}.rst-content table.docutils td,.rst-content table.field-list td,.wy-table td{background-color:transparent;vertical-align:middle}.rst-content table.docutils td p,.rst-content table.field-list td p,.wy-table td p{line-height:18px}.rst-content table.docutils td p:last-child,.rst-content table.field-list td p:last-child,.wy-table td p:last-child{margin-bottom:0}.rst-content table.docutils .wy-table-cell-min,.rst-content table.field-list .wy-table-cell-min,.wy-table .wy-table-cell-min{width:1%;padding-right:0}.rst-content table.docutils .wy-table-cell-min input[type=checkbox],.rst-content table.field-list .wy-table-cell-min input[type=checkbox],.wy-table .wy-table-cell-min input[type=checkbox]{margin:0}.wy-table-secondary{color:grey;font-size:90%}.wy-table-tertiary{color:grey;font-size:80%}.rst-content table.docutils:not(.field-list) tr:nth-child(2n-1) td,.wy-table-backed,.wy-table-odd td,.wy-table-striped tr:nth-child(2n-1) td{background-color:#f3f6f6}.rst-content table.docutils,.wy-table-bordered-all{border:1px solid #e1e4e5}.rst-content table.docutils td,.wy-table-bordered-all td{border-bottom:1px solid #e1e4e5;border-left:1px solid #e1e4e5}.rst-content table.docutils tbody>tr:last-child td,.wy-table-bordered-all tbody>tr:last-child td{border-bottom-width:0}.wy-table-bordered{border:1px solid #e1e4e5}.wy-table-bordered-rows td{border-bottom:1px solid #e1e4e5}.wy-table-bordered-rows tbody>tr:last-child td{border-bottom-width:0}.wy-table-horizontal td,.wy-table-horizontal th{border-width:0 0 1px;border-bottom:1px solid #e1e4e5}.wy-table-horizontal tbody>tr:last-child td{border-bottom-width:0}.wy-table-responsive{margin-bottom:24px;max-width:100%;overflow:auto}.wy-table-responsive table{margin-bottom:0!important}.wy-table-responsive table td,.wy-table-responsive table th{white-space:nowrap}a{color:#2980b9;text-decoration:none;cursor:pointer}a:hover{color:#3091d1}a:visited{color:#9b59b6}html{height:100%}body,html{overflow-x:hidden}body{font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;font-weight:400;color:#404040;min-height:100%;background:#edf0f2}.wy-text-left{text-align:left}.wy-text-center{text-align:center}.wy-text-right{text-align:right}.wy-text-large{font-size:120%}.wy-text-normal{font-size:100%}.wy-text-small,small{font-size:80%}.wy-text-strike{text-decoration:line-through}.wy-text-warning{color:#e67e22!important}a.wy-text-warning:hover{color:#eb9950!important}.wy-text-info{color:#2980b9!important}a.wy-text-info:hover{color:#409ad5!important}.wy-text-success{color:#27ae60!important}a.wy-text-success:hover{color:#36d278!important}.wy-text-danger{color:#e74c3c!important}a.wy-text-danger:hover{color:#ed7669!important}.wy-text-neutral{color:#404040!important}a.wy-text-neutral:hover{color:#595959!important}.rst-content .toctree-wrapper>p.caption,h1,h2,h3,h4,h5,h6,legend{margin-top:0;font-weight:700;font-family:Roboto Slab,ff-tisa-web-pro,Georgia,Arial,sans-serif}p{line-height:24px;font-size:16px;margin:0 0 24px}h1{font-size:175%}.rst-content .toctree-wrapper>p.caption,h2{font-size:150%}h3{font-size:125%}h4{font-size:115%}h5{font-size:110%}h6{font-size:100%}hr{display:block;height:1px;border:0;border-top:1px solid #e1e4e5;margin:24px 0;padding:0}.rst-content code,.rst-content tt,code{white-space:nowrap;max-width:100%;background:#fff;border:1px solid #e1e4e5;font-size:75%;padding:0 5px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;color:#e74c3c;overflow-x:auto}.rst-content tt.code-large,code.code-large{font-size:90%}.rst-content .section ul,.rst-content .toctree-wrapper ul,.rst-content section ul,.wy-plain-list-disc,article ul{list-style:disc;line-height:24px;margin-bottom:24px}.rst-content .section ul li,.rst-content .toctree-wrapper ul li,.rst-content section ul li,.wy-plain-list-disc li,article ul li{list-style:disc;margin-left:24px}.rst-content .section ul li p:last-child,.rst-content .section ul li ul,.rst-content .toctree-wrapper ul li p:last-child,.rst-content .toctree-wrapper ul li ul,.rst-content section ul li p:last-child,.rst-content section ul li ul,.wy-plain-list-disc li p:last-child,.wy-plain-list-disc li ul,article ul li p:last-child,article ul li ul{margin-bottom:0}.rst-content .section ul li li,.rst-content .toctree-wrapper ul li li,.rst-content section ul li li,.wy-plain-list-disc li li,article ul li li{list-style:circle}.rst-content .section ul li li li,.rst-content .toctree-wrapper ul li li li,.rst-content section ul li li li,.wy-plain-list-disc li li li,article ul li li li{list-style:square}.rst-content .section ul li ol li,.rst-content .toctree-wrapper ul li ol li,.rst-content section ul li ol li,.wy-plain-list-disc li ol li,article ul li ol li{list-style:decimal}.rst-content .section ol,.rst-content .section ol.arabic,.rst-content .toctree-wrapper ol,.rst-content .toctree-wrapper ol.arabic,.rst-content section ol,.rst-content section ol.arabic,.wy-plain-list-decimal,article ol{list-style:decimal;line-height:24px;margin-bottom:24px}.rst-content .section ol.arabic li,.rst-content .section ol li,.rst-content .toctree-wrapper ol.arabic li,.rst-content .toctree-wrapper ol li,.rst-content section ol.arabic li,.rst-content section ol li,.wy-plain-list-decimal li,article ol li{list-style:decimal;margin-left:24px}.rst-content .section ol.arabic li ul,.rst-content .section ol li p:last-child,.rst-content .section ol li ul,.rst-content .toctree-wrapper ol.arabic li ul,.rst-content .toctree-wrapper ol li p:last-child,.rst-content .toctree-wrapper ol li ul,.rst-content section ol.arabic li ul,.rst-content section ol li p:last-child,.rst-content section ol li ul,.wy-plain-list-decimal li p:last-child,.wy-plain-list-decimal li ul,article ol li p:last-child,article ol li ul{margin-bottom:0}.rst-content .section ol.arabic li ul li,.rst-content .section ol li ul li,.rst-content .toctree-wrapper ol.arabic li ul li,.rst-content .toctree-wrapper ol li ul li,.rst-content section ol.arabic li ul li,.rst-content section ol li ul li,.wy-plain-list-decimal li ul li,article ol li ul li{list-style:disc}.wy-breadcrumbs{*zoom:1}.wy-breadcrumbs:after,.wy-breadcrumbs:before{display:table;content:""}.wy-breadcrumbs:after{clear:both}.wy-breadcrumbs>li{display:inline-block;padding-top:5px}.wy-breadcrumbs>li.wy-breadcrumbs-aside{float:right}.rst-content .wy-breadcrumbs>li code,.rst-content .wy-breadcrumbs>li tt,.wy-breadcrumbs>li .rst-content tt,.wy-breadcrumbs>li code{all:inherit;color:inherit}.breadcrumb-item:before{content:"/";color:#bbb;font-size:13px;padding:0 6px 0 3px}.wy-breadcrumbs-extra{margin-bottom:0;color:#b3b3b3;font-size:80%;display:inline-block}@media screen and (max-width:480px){.wy-breadcrumbs-extra,.wy-breadcrumbs li.wy-breadcrumbs-aside{display:none}}@media print{.wy-breadcrumbs li.wy-breadcrumbs-aside{display:none}}html{font-size:16px}.wy-affix{position:fixed;top:1.618em}.wy-menu a:hover{text-decoration:none}.wy-menu-horiz{*zoom:1}.wy-menu-horiz:after,.wy-menu-horiz:before{display:table;content:""}.wy-menu-horiz:after{clear:both}.wy-menu-horiz li,.wy-menu-horiz ul{display:inline-block}.wy-menu-horiz li:hover{background:hsla(0,0%,100%,.1)}.wy-menu-horiz li.divide-left{border-left:1px solid #404040}.wy-menu-horiz li.divide-right{border-right:1px solid #404040}.wy-menu-horiz a{height:32px;display:inline-block;line-height:32px;padding:0 16px}.wy-menu-vertical{width:300px}.wy-menu-vertical header,.wy-menu-vertical p.caption{color:#55a5d9;height:32px;line-height:32px;padding:0 1.618em;margin:12px 0 0;display:block;font-weight:700;text-transform:uppercase;font-size:85%;white-space:nowrap}.wy-menu-vertical ul{margin-bottom:0}.wy-menu-vertical li.divide-top{border-top:1px solid #404040}.wy-menu-vertical li.divide-bottom{border-bottom:1px solid #404040}.wy-menu-vertical li.current{background:#e3e3e3}.wy-menu-vertical li.current a{color:grey;border-right:1px solid #c9c9c9;padding:.4045em 2.427em}.wy-menu-vertical li.current a:hover{background:#d6d6d6}.rst-content .wy-menu-vertical li tt,.wy-menu-vertical li .rst-content tt,.wy-menu-vertical li code{border:none;background:inherit;color:inherit;padding-left:0;padding-right:0}.wy-menu-vertical li button.toctree-expand{display:block;float:left;margin-left:-1.2em;line-height:18px;color:#4d4d4d;border:none;background:none;padding:0}.wy-menu-vertical li.current>a,.wy-menu-vertical li.on a{color:#404040;font-weight:700;position:relative;background:#fcfcfc;border:none;padding:.4045em 1.618em}.wy-menu-vertical li.current>a:hover,.wy-menu-vertical li.on a:hover{background:#fcfcfc}.wy-menu-vertical li.current>a:hover button.toctree-expand,.wy-menu-vertical li.on a:hover button.toctree-expand{color:grey}.wy-menu-vertical li.current>a button.toctree-expand,.wy-menu-vertical li.on a button.toctree-expand{display:block;line-height:18px;color:#333}.wy-menu-vertical li.toctree-l1.current>a{border-bottom:1px solid #c9c9c9;border-top:1px solid #c9c9c9}.wy-menu-vertical .toctree-l1.current .toctree-l2>ul,.wy-menu-vertical .toctree-l2.current .toctree-l3>ul,.wy-menu-vertical .toctree-l3.current .toctree-l4>ul,.wy-menu-vertical .toctree-l4.current .toctree-l5>ul,.wy-menu-vertical .toctree-l5.current .toctree-l6>ul,.wy-menu-vertical .toctree-l6.current .toctree-l7>ul,.wy-menu-vertical .toctree-l7.current .toctree-l8>ul,.wy-menu-vertical .toctree-l8.current .toctree-l9>ul,.wy-menu-vertical .toctree-l9.current .toctree-l10>ul,.wy-menu-vertical .toctree-l10.current .toctree-l11>ul{display:none}.wy-menu-vertical .toctree-l1.current .current.toctree-l2>ul,.wy-menu-vertical .toctree-l2.current .current.toctree-l3>ul,.wy-menu-vertical .toctree-l3.current .current.toctree-l4>ul,.wy-menu-vertical .toctree-l4.current .current.toctree-l5>ul,.wy-menu-vertical .toctree-l5.current .current.toctree-l6>ul,.wy-menu-vertical .toctree-l6.current .current.toctree-l7>ul,.wy-menu-vertical .toctree-l7.current .current.toctree-l8>ul,.wy-menu-vertical .toctree-l8.current .current.toctree-l9>ul,.wy-menu-vertical .toctree-l9.current .current.toctree-l10>ul,.wy-menu-vertical .toctree-l10.current .current.toctree-l11>ul{display:block}.wy-menu-vertical li.toctree-l3,.wy-menu-vertical li.toctree-l4{font-size:.9em}.wy-menu-vertical li.toctree-l2 a,.wy-menu-vertical li.toctree-l3 a,.wy-menu-vertical li.toctree-l4 a,.wy-menu-vertical li.toctree-l5 a,.wy-menu-vertical li.toctree-l6 a,.wy-menu-vertical li.toctree-l7 a,.wy-menu-vertical li.toctree-l8 a,.wy-menu-vertical li.toctree-l9 a,.wy-menu-vertical li.toctree-l10 a{color:#404040}.wy-menu-vertical li.toctree-l2 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l3 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l4 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l5 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l6 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l7 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l8 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l9 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l10 a:hover button.toctree-expand{color:grey}.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a,.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a,.wy-menu-vertical li.toctree-l4.current li.toctree-l5>a,.wy-menu-vertical li.toctree-l5.current li.toctree-l6>a,.wy-menu-vertical li.toctree-l6.current li.toctree-l7>a,.wy-menu-vertical li.toctree-l7.current li.toctree-l8>a,.wy-menu-vertical li.toctree-l8.current li.toctree-l9>a,.wy-menu-vertical li.toctree-l9.current li.toctree-l10>a,.wy-menu-vertical li.toctree-l10.current li.toctree-l11>a{display:block}.wy-menu-vertical li.toctree-l2.current>a{padding:.4045em 2.427em}.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a{padding:.4045em 1.618em .4045em 4.045em}.wy-menu-vertical li.toctree-l3.current>a{padding:.4045em 4.045em}.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a{padding:.4045em 1.618em .4045em 5.663em}.wy-menu-vertical li.toctree-l4.current>a{padding:.4045em 5.663em}.wy-menu-vertical li.toctree-l4.current li.toctree-l5>a{padding:.4045em 1.618em .4045em 7.281em}.wy-menu-vertical li.toctree-l5.current>a{padding:.4045em 7.281em}.wy-menu-vertical li.toctree-l5.current li.toctree-l6>a{padding:.4045em 1.618em .4045em 8.899em}.wy-menu-vertical li.toctree-l6.current>a{padding:.4045em 8.899em}.wy-menu-vertical li.toctree-l6.current li.toctree-l7>a{padding:.4045em 1.618em .4045em 10.517em}.wy-menu-vertical li.toctree-l7.current>a{padding:.4045em 10.517em}.wy-menu-vertical li.toctree-l7.current li.toctree-l8>a{padding:.4045em 1.618em .4045em 12.135em}.wy-menu-vertical li.toctree-l8.current>a{padding:.4045em 12.135em}.wy-menu-vertical li.toctree-l8.current li.toctree-l9>a{padding:.4045em 1.618em .4045em 13.753em}.wy-menu-vertical li.toctree-l9.current>a{padding:.4045em 13.753em}.wy-menu-vertical li.toctree-l9.current li.toctree-l10>a{padding:.4045em 1.618em .4045em 15.371em}.wy-menu-vertical li.toctree-l10.current>a{padding:.4045em 15.371em}.wy-menu-vertical li.toctree-l10.current li.toctree-l11>a{padding:.4045em 1.618em .4045em 16.989em}.wy-menu-vertical li.toctree-l2.current>a,.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a{background:#c9c9c9}.wy-menu-vertical li.toctree-l2 button.toctree-expand{color:#a3a3a3}.wy-menu-vertical li.toctree-l3.current>a,.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a{background:#bdbdbd}.wy-menu-vertical li.toctree-l3 button.toctree-expand{color:#969696}.wy-menu-vertical li.current ul{display:block}.wy-menu-vertical li ul{margin-bottom:0;display:none}.wy-menu-vertical li ul li a{margin-bottom:0;color:#d9d9d9;font-weight:400}.wy-menu-vertical a{line-height:18px;padding:.4045em 1.618em;display:block;position:relative;font-size:90%;color:#d9d9d9}.wy-menu-vertical a:hover{background-color:#4e4a4a;cursor:pointer}.wy-menu-vertical a:hover button.toctree-expand{color:#d9d9d9}.wy-menu-vertical a:active{background-color:#2980b9;cursor:pointer;color:#fff}.wy-menu-vertical a:active button.toctree-expand{color:#fff}.wy-side-nav-search{display:block;width:300px;padding:.809em;margin-bottom:.809em;z-index:200;background-color:#2980b9;text-align:center;color:#fcfcfc}.wy-side-nav-search input[type=text]{width:100%;border-radius:50px;padding:6px 12px;border-color:#2472a4}.wy-side-nav-search img{display:block;margin:auto auto .809em;height:45px;width:45px;background-color:#2980b9;padding:5px;border-radius:100%}.wy-side-nav-search .wy-dropdown>a,.wy-side-nav-search>a{color:#fcfcfc;font-size:100%;font-weight:700;display:inline-block;padding:4px 6px;margin-bottom:.809em;max-width:100%}.wy-side-nav-search .wy-dropdown>a:hover,.wy-side-nav-search>a:hover{background:hsla(0,0%,100%,.1)}.wy-side-nav-search .wy-dropdown>a img.logo,.wy-side-nav-search>a img.logo{display:block;margin:0 auto;height:auto;width:auto;border-radius:0;max-width:100%;background:transparent}.wy-side-nav-search .wy-dropdown>a.icon img.logo,.wy-side-nav-search>a.icon img.logo{margin-top:.85em}.wy-side-nav-search>div.version{margin-top:-.4045em;margin-bottom:.809em;font-weight:400;color:hsla(0,0%,100%,.3)}.wy-nav .wy-menu-vertical header{color:#2980b9}.wy-nav .wy-menu-vertical a{color:#b3b3b3}.wy-nav .wy-menu-vertical a:hover{background-color:#2980b9;color:#fff}[data-menu-wrap]{-webkit-transition:all .2s ease-in;-moz-transition:all .2s ease-in;transition:all .2s ease-in;position:absolute;opacity:1;width:100%;opacity:0}[data-menu-wrap].move-center{left:0;right:auto;opacity:1}[data-menu-wrap].move-left{right:auto;left:-100%;opacity:0}[data-menu-wrap].move-right{right:-100%;left:auto;opacity:0}.wy-body-for-nav{background:#fcfcfc}.wy-grid-for-nav{position:absolute;width:100%;height:100%}.wy-nav-side{position:fixed;top:0;bottom:0;left:0;padding-bottom:2em;width:300px;overflow-x:hidden;overflow-y:hidden;min-height:100%;color:#9b9b9b;background:#343131;z-index:200}.wy-side-scroll{width:320px;position:relative;overflow-x:hidden;overflow-y:scroll;height:100%}.wy-nav-top{display:none;background:#2980b9;color:#fff;padding:.4045em .809em;position:relative;line-height:50px;text-align:center;font-size:100%;*zoom:1}.wy-nav-top:after,.wy-nav-top:before{display:table;content:""}.wy-nav-top:after{clear:both}.wy-nav-top a{color:#fff;font-weight:700}.wy-nav-top img{margin-right:12px;height:45px;width:45px;background-color:#2980b9;padding:5px;border-radius:100%}.wy-nav-top i{font-size:30px;float:left;cursor:pointer;padding-top:inherit}.wy-nav-content-wrap{margin-left:300px;background:#fcfcfc;min-height:100%}.wy-nav-content{padding:1.618em 3.236em;height:100%;max-width:800px;margin:auto}.wy-body-mask{position:fixed;width:100%;height:100%;background:rgba(0,0,0,.2);display:none;z-index:499}.wy-body-mask.on{display:block}footer{color:grey}footer p{margin-bottom:12px}.rst-content footer span.commit tt,footer span.commit .rst-content tt,footer span.commit code{padding:0;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;font-size:1em;background:none;border:none;color:grey}.rst-footer-buttons{*zoom:1}.rst-footer-buttons:after,.rst-footer-buttons:before{width:100%;display:table;content:""}.rst-footer-buttons:after{clear:both}.rst-breadcrumbs-buttons{margin-top:12px;*zoom:1}.rst-breadcrumbs-buttons:after,.rst-breadcrumbs-buttons:before{display:table;content:""}.rst-breadcrumbs-buttons:after{clear:both}#search-results .search li{margin-bottom:24px;border-bottom:1px solid #e1e4e5;padding-bottom:24px}#search-results .search li:first-child{border-top:1px solid #e1e4e5;padding-top:24px}#search-results .search li a{font-size:120%;margin-bottom:12px;display:inline-block}#search-results .context{color:grey;font-size:90%}.genindextable li>ul{margin-left:24px}@media screen and (max-width:768px){.wy-body-for-nav{background:#fcfcfc}.wy-nav-top{display:block}.wy-nav-side{left:-300px}.wy-nav-side.shift{width:85%;left:0}.wy-menu.wy-menu-vertical,.wy-side-nav-search,.wy-side-scroll{width:auto}.wy-nav-content-wrap{margin-left:0}.wy-nav-content-wrap .wy-nav-content{padding:1.618em}.wy-nav-content-wrap.shift{position:fixed;min-width:100%;left:85%;top:0;height:100%;overflow:hidden}}@media screen and (min-width:1100px){.wy-nav-content-wrap{background:rgba(0,0,0,.05)}.wy-nav-content{margin:0;background:#fcfcfc}}@media print{.rst-versions,.wy-nav-side,footer{display:none}.wy-nav-content-wrap{margin-left:0}}.rst-versions{position:fixed;bottom:0;left:0;width:300px;color:#fcfcfc;background:#1f1d1d;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;z-index:400}.rst-versions a{color:#2980b9;text-decoration:none}.rst-versions .rst-badge-small{display:none}.rst-versions .rst-current-version{padding:12px;background-color:#272525;display:block;text-align:right;font-size:90%;cursor:pointer;color:#27ae60;*zoom:1}.rst-versions .rst-current-version:after,.rst-versions .rst-current-version:before{display:table;content:""}.rst-versions .rst-current-version:after{clear:both}.rst-content .code-block-caption .rst-versions .rst-current-version .headerlink,.rst-content .eqno .rst-versions .rst-current-version .headerlink,.rst-content .rst-versions .rst-current-version .admonition-title,.rst-content code.download .rst-versions .rst-current-version span:first-child,.rst-content dl dt .rst-versions .rst-current-version .headerlink,.rst-content h1 .rst-versions .rst-current-version .headerlink,.rst-content h2 .rst-versions .rst-current-version .headerlink,.rst-content h3 .rst-versions .rst-current-version .headerlink,.rst-content h4 .rst-versions .rst-current-version .headerlink,.rst-content h5 .rst-versions .rst-current-version .headerlink,.rst-content h6 .rst-versions .rst-current-version .headerlink,.rst-content p .rst-versions .rst-current-version .headerlink,.rst-content table>caption .rst-versions .rst-current-version .headerlink,.rst-content tt.download .rst-versions .rst-current-version span:first-child,.rst-versions .rst-current-version .fa,.rst-versions .rst-current-version .icon,.rst-versions .rst-current-version .rst-content .admonition-title,.rst-versions .rst-current-version .rst-content .code-block-caption .headerlink,.rst-versions .rst-current-version .rst-content .eqno .headerlink,.rst-versions .rst-current-version .rst-content code.download span:first-child,.rst-versions .rst-current-version .rst-content dl dt .headerlink,.rst-versions .rst-current-version .rst-content h1 .headerlink,.rst-versions .rst-current-version .rst-content h2 .headerlink,.rst-versions .rst-current-version .rst-content h3 .headerlink,.rst-versions .rst-current-version .rst-content h4 .headerlink,.rst-versions .rst-current-version .rst-content h5 .headerlink,.rst-versions .rst-current-version .rst-content h6 .headerlink,.rst-versions .rst-current-version .rst-content p .headerlink,.rst-versions .rst-current-version .rst-content table>caption .headerlink,.rst-versions .rst-current-version .rst-content tt.download span:first-child,.rst-versions .rst-current-version .wy-menu-vertical li button.toctree-expand,.wy-menu-vertical li .rst-versions .rst-current-version button.toctree-expand{color:#fcfcfc}.rst-versions .rst-current-version .fa-book,.rst-versions .rst-current-version .icon-book{float:left}.rst-versions .rst-current-version.rst-out-of-date{background-color:#e74c3c;color:#fff}.rst-versions .rst-current-version.rst-active-old-version{background-color:#f1c40f;color:#000}.rst-versions.shift-up{height:auto;max-height:100%;overflow-y:scroll}.rst-versions.shift-up .rst-other-versions{display:block}.rst-versions .rst-other-versions{font-size:90%;padding:12px;color:grey;display:none}.rst-versions .rst-other-versions hr{display:block;height:1px;border:0;margin:20px 0;padding:0;border-top:1px solid #413d3d}.rst-versions .rst-other-versions dd{display:inline-block;margin:0}.rst-versions .rst-other-versions dd a{display:inline-block;padding:6px;color:#fcfcfc}.rst-versions.rst-badge{width:auto;bottom:20px;right:20px;left:auto;border:none;max-width:300px;max-height:90%}.rst-versions.rst-badge .fa-book,.rst-versions.rst-badge .icon-book{float:none;line-height:30px}.rst-versions.rst-badge.shift-up .rst-current-version{text-align:right}.rst-versions.rst-badge.shift-up .rst-current-version .fa-book,.rst-versions.rst-badge.shift-up .rst-current-version .icon-book{float:left}.rst-versions.rst-badge>.rst-current-version{width:auto;height:30px;line-height:30px;padding:0 6px;display:block;text-align:center}@media screen and (max-width:768px){.rst-versions{width:85%;display:none}.rst-versions.shift{display:block}}.rst-content .toctree-wrapper>p.caption,.rst-content h1,.rst-content h2,.rst-content h3,.rst-content h4,.rst-content h5,.rst-content h6{margin-bottom:24px}.rst-content img{max-width:100%;height:auto}.rst-content div.figure,.rst-content figure{margin-bottom:24px}.rst-content div.figure .caption-text,.rst-content figure .caption-text{font-style:italic}.rst-content div.figure p:last-child.caption,.rst-content figure p:last-child.caption{margin-bottom:0}.rst-content div.figure.align-center,.rst-content figure.align-center{text-align:center}.rst-content .section>a>img,.rst-content .section>img,.rst-content section>a>img,.rst-content section>img{margin-bottom:24px}.rst-content abbr[title]{text-decoration:none}.rst-content.style-external-links a.reference.external:after{font-family:FontAwesome;content:"\f08e";color:#b3b3b3;vertical-align:super;font-size:60%;margin:0 .2em}.rst-content blockquote{margin-left:24px;line-height:24px;margin-bottom:24px}.rst-content pre.literal-block{white-space:pre;margin:0;padding:12px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;display:block;overflow:auto}.rst-content div[class^=highlight],.rst-content pre.literal-block{border:1px solid #e1e4e5;overflow-x:auto;margin:1px 0 24px}.rst-content div[class^=highlight] div[class^=highlight],.rst-content pre.literal-block div[class^=highlight]{padding:0;border:none;margin:0}.rst-content div[class^=highlight] td.code{width:100%}.rst-content .linenodiv pre{border-right:1px solid #e6e9ea;margin:0;padding:12px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;user-select:none;pointer-events:none}.rst-content div[class^=highlight] pre{white-space:pre;margin:0;padding:12px;display:block;overflow:auto}.rst-content div[class^=highlight] pre .hll{display:block;margin:0 -12px;padding:0 12px}.rst-content .linenodiv pre,.rst-content div[class^=highlight] pre,.rst-content pre.literal-block{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;font-size:12px;line-height:1.4}.rst-content div.highlight .gp,.rst-content div.highlight span.linenos{user-select:none;pointer-events:none}.rst-content div.highlight span.linenos{display:inline-block;padding-left:0;padding-right:12px;margin-right:12px;border-right:1px solid #e6e9ea}.rst-content .code-block-caption{font-style:italic;font-size:85%;line-height:1;padding:1em 0;text-align:center}@media print{.rst-content .codeblock,.rst-content div[class^=highlight],.rst-content div[class^=highlight] pre{white-space:pre-wrap}}.rst-content .admonition,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning{clear:both}.rst-content .admonition-todo .last,.rst-content .admonition-todo>:last-child,.rst-content .admonition .last,.rst-content .admonition>:last-child,.rst-content .attention .last,.rst-content .attention>:last-child,.rst-content .caution .last,.rst-content .caution>:last-child,.rst-content .danger .last,.rst-content .danger>:last-child,.rst-content .error .last,.rst-content .error>:last-child,.rst-content .hint .last,.rst-content .hint>:last-child,.rst-content .important .last,.rst-content .important>:last-child,.rst-content .note .last,.rst-content .note>:last-child,.rst-content .seealso .last,.rst-content .seealso>:last-child,.rst-content .tip .last,.rst-content .tip>:last-child,.rst-content .warning .last,.rst-content .warning>:last-child{margin-bottom:0}.rst-content .admonition-title:before{margin-right:4px}.rst-content .admonition table{border-color:rgba(0,0,0,.1)}.rst-content .admonition table td,.rst-content .admonition table th{background:transparent!important;border-color:rgba(0,0,0,.1)!important}.rst-content .section ol.loweralpha,.rst-content .section ol.loweralpha>li,.rst-content .toctree-wrapper ol.loweralpha,.rst-content .toctree-wrapper ol.loweralpha>li,.rst-content section ol.loweralpha,.rst-content section ol.loweralpha>li{list-style:lower-alpha}.rst-content .section ol.upperalpha,.rst-content .section ol.upperalpha>li,.rst-content .toctree-wrapper ol.upperalpha,.rst-content .toctree-wrapper ol.upperalpha>li,.rst-content section ol.upperalpha,.rst-content section ol.upperalpha>li{list-style:upper-alpha}.rst-content .section ol li>*,.rst-content .section ul li>*,.rst-content .toctree-wrapper ol li>*,.rst-content .toctree-wrapper ul li>*,.rst-content section ol li>*,.rst-content section ul li>*{margin-top:12px;margin-bottom:12px}.rst-content .section ol li>:first-child,.rst-content .section ul li>:first-child,.rst-content .toctree-wrapper ol li>:first-child,.rst-content .toctree-wrapper ul li>:first-child,.rst-content section ol li>:first-child,.rst-content section ul li>:first-child{margin-top:0}.rst-content .section ol li>p,.rst-content .section ol li>p:last-child,.rst-content .section ul li>p,.rst-content .section ul li>p:last-child,.rst-content .toctree-wrapper ol li>p,.rst-content .toctree-wrapper ol li>p:last-child,.rst-content .toctree-wrapper ul li>p,.rst-content .toctree-wrapper ul li>p:last-child,.rst-content section ol li>p,.rst-content section ol li>p:last-child,.rst-content section ul li>p,.rst-content section ul li>p:last-child{margin-bottom:12px}.rst-content .section ol li>p:only-child,.rst-content .section ol li>p:only-child:last-child,.rst-content .section ul li>p:only-child,.rst-content .section ul li>p:only-child:last-child,.rst-content .toctree-wrapper ol li>p:only-child,.rst-content .toctree-wrapper ol li>p:only-child:last-child,.rst-content .toctree-wrapper ul li>p:only-child,.rst-content .toctree-wrapper ul li>p:only-child:last-child,.rst-content section ol li>p:only-child,.rst-content section ol li>p:only-child:last-child,.rst-content section ul li>p:only-child,.rst-content section ul li>p:only-child:last-child{margin-bottom:0}.rst-content .section ol li>ol,.rst-content .section ol li>ul,.rst-content .section ul li>ol,.rst-content .section ul li>ul,.rst-content .toctree-wrapper ol li>ol,.rst-content .toctree-wrapper ol li>ul,.rst-content .toctree-wrapper ul li>ol,.rst-content .toctree-wrapper ul li>ul,.rst-content section ol li>ol,.rst-content section ol li>ul,.rst-content section ul li>ol,.rst-content section ul li>ul{margin-bottom:12px}.rst-content .section ol.simple li>*,.rst-content .section ol.simple li ol,.rst-content .section ol.simple li ul,.rst-content .section ul.simple li>*,.rst-content .section ul.simple li ol,.rst-content .section ul.simple li ul,.rst-content .toctree-wrapper ol.simple li>*,.rst-content .toctree-wrapper ol.simple li ol,.rst-content .toctree-wrapper ol.simple li ul,.rst-content .toctree-wrapper ul.simple li>*,.rst-content .toctree-wrapper ul.simple li ol,.rst-content .toctree-wrapper ul.simple li ul,.rst-content section ol.simple li>*,.rst-content section ol.simple li ol,.rst-content section ol.simple li ul,.rst-content section ul.simple li>*,.rst-content section ul.simple li ol,.rst-content section ul.simple li ul{margin-top:0;margin-bottom:0}.rst-content .line-block{margin-left:0;margin-bottom:24px;line-height:24px}.rst-content .line-block .line-block{margin-left:24px;margin-bottom:0}.rst-content .topic-title{font-weight:700;margin-bottom:12px}.rst-content .toc-backref{color:#404040}.rst-content .align-right{float:right;margin:0 0 24px 24px}.rst-content .align-left{float:left;margin:0 24px 24px 0}.rst-content .align-center{margin:auto}.rst-content .align-center:not(table){display:block}.rst-content .code-block-caption .headerlink,.rst-content .eqno .headerlink,.rst-content .toctree-wrapper>p.caption .headerlink,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content p .headerlink,.rst-content table>caption .headerlink{opacity:0;font-size:14px;font-family:FontAwesome;margin-left:.5em}.rst-content .code-block-caption .headerlink:focus,.rst-content .code-block-caption:hover .headerlink,.rst-content .eqno .headerlink:focus,.rst-content .eqno:hover .headerlink,.rst-content .toctree-wrapper>p.caption .headerlink:focus,.rst-content .toctree-wrapper>p.caption:hover .headerlink,.rst-content dl dt .headerlink:focus,.rst-content dl dt:hover .headerlink,.rst-content h1 .headerlink:focus,.rst-content h1:hover .headerlink,.rst-content h2 .headerlink:focus,.rst-content h2:hover .headerlink,.rst-content h3 .headerlink:focus,.rst-content h3:hover .headerlink,.rst-content h4 .headerlink:focus,.rst-content h4:hover .headerlink,.rst-content h5 .headerlink:focus,.rst-content h5:hover .headerlink,.rst-content h6 .headerlink:focus,.rst-content h6:hover .headerlink,.rst-content p.caption .headerlink:focus,.rst-content p.caption:hover .headerlink,.rst-content p .headerlink:focus,.rst-content p:hover .headerlink,.rst-content table>caption .headerlink:focus,.rst-content table>caption:hover .headerlink{opacity:1}.rst-content p a{overflow-wrap:anywhere}.rst-content .wy-table td p,.rst-content .wy-table td ul,.rst-content .wy-table th p,.rst-content .wy-table th ul,.rst-content table.docutils td p,.rst-content table.docutils td ul,.rst-content table.docutils th p,.rst-content table.docutils th ul,.rst-content table.field-list td p,.rst-content table.field-list td ul,.rst-content table.field-list th p,.rst-content table.field-list th ul{font-size:inherit}.rst-content .btn:focus{outline:2px solid}.rst-content table>caption .headerlink:after{font-size:12px}.rst-content .centered{text-align:center}.rst-content .sidebar{float:right;width:40%;display:block;margin:0 0 24px 24px;padding:24px;background:#f3f6f6;border:1px solid #e1e4e5}.rst-content .sidebar dl,.rst-content .sidebar p,.rst-content .sidebar ul{font-size:90%}.rst-content .sidebar .last,.rst-content .sidebar>:last-child{margin-bottom:0}.rst-content .sidebar .sidebar-title{display:block;font-family:Roboto Slab,ff-tisa-web-pro,Georgia,Arial,sans-serif;font-weight:700;background:#e1e4e5;padding:6px 12px;margin:-24px -24px 24px;font-size:100%}.rst-content .highlighted{background:#f1c40f;box-shadow:0 0 0 2px #f1c40f;display:inline;font-weight:700}.rst-content .citation-reference,.rst-content .footnote-reference{vertical-align:baseline;position:relative;top:-.4em;line-height:0;font-size:90%}.rst-content .citation-reference>span.fn-bracket,.rst-content .footnote-reference>span.fn-bracket{display:none}.rst-content .hlist{width:100%}.rst-content dl dt span.classifier:before{content:" : "}.rst-content dl dt span.classifier-delimiter{display:none!important}html.writer-html4 .rst-content table.docutils.citation,html.writer-html4 .rst-content table.docutils.footnote{background:none;border:none}html.writer-html4 .rst-content table.docutils.citation td,html.writer-html4 .rst-content table.docutils.citation tr,html.writer-html4 .rst-content table.docutils.footnote td,html.writer-html4 .rst-content table.docutils.footnote tr{border:none;background-color:transparent!important;white-space:normal}html.writer-html4 .rst-content table.docutils.citation td.label,html.writer-html4 .rst-content table.docutils.footnote td.label{padding-left:0;padding-right:0;vertical-align:top}html.writer-html5 .rst-content dl.citation,html.writer-html5 .rst-content dl.field-list,html.writer-html5 .rst-content dl.footnote{display:grid;grid-template-columns:auto minmax(80%,95%)}html.writer-html5 .rst-content dl.citation>dt,html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dt{display:inline-grid;grid-template-columns:max-content auto}html.writer-html5 .rst-content aside.citation,html.writer-html5 .rst-content aside.footnote,html.writer-html5 .rst-content div.citation{display:grid;grid-template-columns:auto auto minmax(.65rem,auto) minmax(40%,95%)}html.writer-html5 .rst-content aside.citation>span.label,html.writer-html5 .rst-content aside.footnote>span.label,html.writer-html5 .rst-content div.citation>span.label{grid-column-start:1;grid-column-end:2}html.writer-html5 .rst-content aside.citation>span.backrefs,html.writer-html5 .rst-content aside.footnote>span.backrefs,html.writer-html5 .rst-content div.citation>span.backrefs{grid-column-start:2;grid-column-end:3;grid-row-start:1;grid-row-end:3}html.writer-html5 .rst-content aside.citation>p,html.writer-html5 .rst-content aside.footnote>p,html.writer-html5 .rst-content div.citation>p{grid-column-start:4;grid-column-end:5}html.writer-html5 .rst-content dl.citation,html.writer-html5 .rst-content dl.field-list,html.writer-html5 .rst-content dl.footnote{margin-bottom:24px}html.writer-html5 .rst-content dl.citation>dt,html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dt{padding-left:1rem}html.writer-html5 .rst-content dl.citation>dd,html.writer-html5 .rst-content dl.citation>dt,html.writer-html5 .rst-content dl.field-list>dd,html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dd,html.writer-html5 .rst-content dl.footnote>dt{margin-bottom:0}html.writer-html5 .rst-content dl.citation,html.writer-html5 .rst-content dl.footnote{font-size:.9rem}html.writer-html5 .rst-content dl.citation>dt,html.writer-html5 .rst-content dl.footnote>dt{margin:0 .5rem .5rem 0;line-height:1.2rem;word-break:break-all;font-weight:400}html.writer-html5 .rst-content dl.citation>dt>span.brackets:before,html.writer-html5 .rst-content dl.footnote>dt>span.brackets:before{content:"["}html.writer-html5 .rst-content dl.citation>dt>span.brackets:after,html.writer-html5 .rst-content dl.footnote>dt>span.brackets:after{content:"]"}html.writer-html5 .rst-content dl.citation>dt>span.fn-backref,html.writer-html5 .rst-content dl.footnote>dt>span.fn-backref{text-align:left;font-style:italic;margin-left:.65rem;word-break:break-word;word-spacing:-.1rem;max-width:5rem}html.writer-html5 .rst-content dl.citation>dt>span.fn-backref>a,html.writer-html5 .rst-content dl.footnote>dt>span.fn-backref>a{word-break:keep-all}html.writer-html5 .rst-content dl.citation>dt>span.fn-backref>a:not(:first-child):before,html.writer-html5 .rst-content dl.footnote>dt>span.fn-backref>a:not(:first-child):before{content:" "}html.writer-html5 .rst-content dl.citation>dd,html.writer-html5 .rst-content dl.footnote>dd{margin:0 0 .5rem;line-height:1.2rem}html.writer-html5 .rst-content dl.citation>dd p,html.writer-html5 .rst-content dl.footnote>dd p{font-size:.9rem}html.writer-html5 .rst-content aside.citation,html.writer-html5 .rst-content aside.footnote,html.writer-html5 .rst-content div.citation{padding-left:1rem;padding-right:1rem;font-size:.9rem;line-height:1.2rem}html.writer-html5 .rst-content aside.citation p,html.writer-html5 .rst-content aside.footnote p,html.writer-html5 .rst-content div.citation p{font-size:.9rem;line-height:1.2rem;margin-bottom:12px}html.writer-html5 .rst-content aside.citation span.backrefs,html.writer-html5 .rst-content aside.footnote span.backrefs,html.writer-html5 .rst-content div.citation span.backrefs{text-align:left;font-style:italic;margin-left:.65rem;word-break:break-word;word-spacing:-.1rem;max-width:5rem}html.writer-html5 .rst-content aside.citation span.backrefs>a,html.writer-html5 .rst-content aside.footnote span.backrefs>a,html.writer-html5 .rst-content div.citation span.backrefs>a{word-break:keep-all}html.writer-html5 .rst-content aside.citation span.backrefs>a:not(:first-child):before,html.writer-html5 .rst-content aside.footnote span.backrefs>a:not(:first-child):before,html.writer-html5 .rst-content div.citation span.backrefs>a:not(:first-child):before{content:" "}html.writer-html5 .rst-content aside.citation span.label,html.writer-html5 .rst-content aside.footnote span.label,html.writer-html5 .rst-content div.citation span.label{line-height:1.2rem}html.writer-html5 .rst-content aside.citation-list,html.writer-html5 .rst-content aside.footnote-list,html.writer-html5 .rst-content div.citation-list{margin-bottom:24px}html.writer-html5 .rst-content dl.option-list kbd{font-size:.9rem}.rst-content table.docutils.footnote,html.writer-html4 .rst-content table.docutils.citation,html.writer-html5 .rst-content aside.footnote,html.writer-html5 .rst-content aside.footnote-list aside.footnote,html.writer-html5 .rst-content div.citation-list>div.citation,html.writer-html5 .rst-content dl.citation,html.writer-html5 .rst-content dl.footnote{color:grey}.rst-content table.docutils.footnote code,.rst-content table.docutils.footnote tt,html.writer-html4 .rst-content table.docutils.citation code,html.writer-html4 .rst-content table.docutils.citation tt,html.writer-html5 .rst-content aside.footnote-list aside.footnote code,html.writer-html5 .rst-content aside.footnote-list aside.footnote tt,html.writer-html5 .rst-content aside.footnote code,html.writer-html5 .rst-content aside.footnote tt,html.writer-html5 .rst-content div.citation-list>div.citation code,html.writer-html5 .rst-content div.citation-list>div.citation tt,html.writer-html5 .rst-content dl.citation code,html.writer-html5 .rst-content dl.citation tt,html.writer-html5 .rst-content dl.footnote code,html.writer-html5 .rst-content dl.footnote tt{color:#555}.rst-content .wy-table-responsive.citation,.rst-content .wy-table-responsive.footnote{margin-bottom:0}.rst-content .wy-table-responsive.citation+:not(.citation),.rst-content .wy-table-responsive.footnote+:not(.footnote){margin-top:24px}.rst-content .wy-table-responsive.citation:last-child,.rst-content .wy-table-responsive.footnote:last-child{margin-bottom:24px}.rst-content table.docutils th{border-color:#e1e4e5}html.writer-html5 .rst-content table.docutils th{border:1px solid #e1e4e5}html.writer-html5 .rst-content table.docutils td>p,html.writer-html5 .rst-content table.docutils th>p{line-height:1rem;margin-bottom:0;font-size:.9rem}.rst-content table.docutils td .last,.rst-content table.docutils td .last>:last-child{margin-bottom:0}.rst-content table.field-list,.rst-content table.field-list td{border:none}.rst-content table.field-list td p{line-height:inherit}.rst-content table.field-list td>strong{display:inline-block}.rst-content table.field-list .field-name{padding-right:10px;text-align:left;white-space:nowrap}.rst-content table.field-list .field-body{text-align:left}.rst-content code,.rst-content tt{color:#000;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;padding:2px 5px}.rst-content code big,.rst-content code em,.rst-content tt big,.rst-content tt em{font-size:100%!important;line-height:normal}.rst-content code.literal,.rst-content tt.literal{color:#e74c3c;white-space:normal}.rst-content code.xref,.rst-content tt.xref,a .rst-content code,a .rst-content tt{font-weight:700;color:#404040;overflow-wrap:normal}.rst-content kbd,.rst-content pre,.rst-content samp{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace}.rst-content a code,.rst-content a tt{color:#2980b9}.rst-content dl{margin-bottom:24px}.rst-content dl dt{font-weight:700;margin-bottom:12px}.rst-content dl ol,.rst-content dl p,.rst-content dl table,.rst-content dl ul{margin-bottom:12px}.rst-content dl dd{margin:0 0 12px 24px;line-height:24px}.rst-content dl dd>ol:last-child,.rst-content dl dd>p:last-child,.rst-content dl dd>table:last-child,.rst-content dl dd>ul:last-child{margin-bottom:0}html.writer-html4 .rst-content dl:not(.docutils),html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple){margin-bottom:24px}html.writer-html4 .rst-content dl:not(.docutils)>dt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt{display:table;margin:6px 0;font-size:90%;line-height:normal;background:#e7f2fa;color:#2980b9;border-top:3px solid #6ab0de;padding:6px;position:relative}html.writer-html4 .rst-content dl:not(.docutils)>dt:before,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt:before{color:#6ab0de}html.writer-html4 .rst-content dl:not(.docutils)>dt .headerlink,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt .headerlink{color:#404040;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils) dl:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) dl:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt{margin-bottom:6px;border:none;border-left:3px solid #ccc;background:#f0f0f0;color:#555}html.writer-html4 .rst-content dl:not(.docutils) dl:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt .headerlink,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) dl:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt .headerlink{color:#404040;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils)>dt:first-child,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt:first-child{margin-top:0}html.writer-html4 .rst-content dl:not(.docutils) code.descclassname,html.writer-html4 .rst-content dl:not(.docutils) code.descname,html.writer-html4 .rst-content dl:not(.docutils) tt.descclassname,html.writer-html4 .rst-content dl:not(.docutils) tt.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) code.descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) code.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) tt.descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) tt.descname{background-color:transparent;border:none;padding:0;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils) code.descname,html.writer-html4 .rst-content dl:not(.docutils) tt.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) code.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) tt.descname{font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) .optional,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .optional{display:inline-block;padding:0 4px;color:#000;font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) .property,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .property{display:inline-block;padding-right:8px;max-width:100%}html.writer-html4 .rst-content dl:not(.docutils) .k,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .k{font-style:italic}html.writer-html4 .rst-content dl:not(.docutils) .descclassname,html.writer-html4 .rst-content dl:not(.docutils) .descname,html.writer-html4 .rst-content dl:not(.docutils) .sig-name,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .sig-name{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;color:#000}.rst-content .viewcode-back,.rst-content .viewcode-link{display:inline-block;color:#27ae60;font-size:80%;padding-left:24px}.rst-content .viewcode-back{display:block;float:right}.rst-content p.rubric{margin-bottom:12px;font-weight:700}.rst-content code.download,.rst-content tt.download{background:inherit;padding:inherit;font-weight:400;font-family:inherit;font-size:inherit;color:inherit;border:inherit;white-space:inherit}.rst-content code.download span:first-child,.rst-content tt.download span:first-child{-webkit-font-smoothing:subpixel-antialiased}.rst-content code.download span:first-child:before,.rst-content tt.download span:first-child:before{margin-right:4px}.rst-content .guilabel,.rst-content .menuselection{font-size:80%;font-weight:700;border-radius:4px;padding:2.4px 6px;margin:auto 2px}.rst-content .guilabel,.rst-content .menuselection{border:1px solid #7fbbe3;background:#e7f2fa}.rst-content :not(dl.option-list)>:not(dt):not(kbd):not(.kbd)>.kbd,.rst-content :not(dl.option-list)>:not(dt):not(kbd):not(.kbd)>kbd{color:inherit;font-size:80%;background-color:#fff;border:1px solid #a6a6a6;border-radius:4px;box-shadow:0 2px grey;padding:2.4px 6px;margin:auto 0}.rst-content .versionmodified{font-style:italic}@media screen and (max-width:480px){.rst-content .sidebar{width:100%}}span[id*=MathJax-Span]{color:#404040}.math{text-align:center}@font-face{font-family:Lato;src:url(fonts/lato-normal.woff2?bd03a2cc277bbbc338d464e679fe9942) format("woff2"),url(fonts/lato-normal.woff?27bd77b9162d388cb8d4c4217c7c5e2a) format("woff");font-weight:400;font-style:normal;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-bold.woff2?cccb897485813c7c256901dbca54ecf2) format("woff2"),url(fonts/lato-bold.woff?d878b6c29b10beca227e9eef4246111b) format("woff");font-weight:700;font-style:normal;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-bold-italic.woff2?0b6bb6725576b072c5d0b02ecdd1900d) format("woff2"),url(fonts/lato-bold-italic.woff?9c7e4e9eb485b4a121c760e61bc3707c) format("woff");font-weight:700;font-style:italic;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-normal-italic.woff2?4eb103b4d12be57cb1d040ed5e162e9d) format("woff2"),url(fonts/lato-normal-italic.woff?f28f2d6482446544ef1ea1ccc6dd5892) format("woff");font-weight:400;font-style:italic;font-display:block}@font-face{font-family:Roboto Slab;font-style:normal;font-weight:400;src:url(fonts/Roboto-Slab-Regular.woff2?7abf5b8d04d26a2cafea937019bca958) format("woff2"),url(fonts/Roboto-Slab-Regular.woff?c1be9284088d487c5e3ff0a10a92e58c) format("woff");font-display:block}@font-face{font-family:Roboto Slab;font-style:normal;font-weight:700;src:url(fonts/Roboto-Slab-Bold.woff2?9984f4a9bda09be08e83f2506954adbe) format("woff2"),url(fonts/Roboto-Slab-Bold.woff?bed5564a116b05148e3b3bea6fb1162a) format("woff");font-display:block}
\ No newline at end of file
diff --git a/_static/doctools.js b/_static/doctools.js
index 8cbf1b161a..4d67807d17 100644
--- a/_static/doctools.js
+++ b/_static/doctools.js
@@ -2,322 +2,155 @@
  * doctools.js
  * ~~~~~~~~~~~
  *
- * Sphinx JavaScript utilities for all documentation.
+ * Base JavaScript utilities for all Sphinx HTML documentation.
  *
- * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2024 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
-
-/**
- * select a different prefix for underscore
- */
-$u = _.noConflict();
-
-/**
- * make the code below compatible with browsers without
- * an installed firebug like debugger
-if (!window.console || !console.firebug) {
-  var names = ["log", "debug", "info", "warn", "error", "assert", "dir",
-    "dirxml", "group", "groupEnd", "time", "timeEnd", "count", "trace",
-    "profile", "profileEnd"];
-  window.console = {};
-  for (var i = 0; i < names.length; ++i)
-    window.console[names[i]] = function() {};
-}
- */
-
-/**
- * small helper function to urldecode strings
- *
- * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/decodeURIComponent#Decoding_query_parameters_from_a_URL
- */
-jQuery.urldecode = function(x) {
-  if (!x) {
-    return x
-  }
-  return decodeURIComponent(x.replace(/\+/g, ' '));
-};
-
-/**
- * small helper function to urlencode strings
- */
-jQuery.urlencode = encodeURIComponent;
-
-/**
- * This function returns the parsed url parameters of the
- * current request. Multiple values per key are supported,
- * it will always return arrays of strings for the value parts.
- */
-jQuery.getQueryParameters = function(s) {
-  if (typeof s === 'undefined')
-    s = document.location.search;
-  var parts = s.substr(s.indexOf('?') + 1).split('&');
-  var result = {};
-  for (var i = 0; i < parts.length; i++) {
-    var tmp = parts[i].split('=', 2);
-    var key = jQuery.urldecode(tmp[0]);
-    var value = jQuery.urldecode(tmp[1]);
-    if (key in result)
-      result[key].push(value);
-    else
-      result[key] = [value];
+"use strict";
+
+const BLACKLISTED_KEY_CONTROL_ELEMENTS = new Set([
+  "TEXTAREA",
+  "INPUT",
+  "SELECT",
+  "BUTTON",
+]);
+
+const _ready = (callback) => {
+  if (document.readyState !== "loading") {
+    callback();
+  } else {
+    document.addEventListener("DOMContentLoaded", callback);
   }
-  return result;
 };
 
-/**
- * highlight a given string on a jquery object by wrapping it in
- * span elements with the given class name.
- */
-jQuery.fn.highlightText = function(text, className) {
-  function highlight(node, addItems) {
-    if (node.nodeType === 3) {
-      var val = node.nodeValue;
-      var pos = val.toLowerCase().indexOf(text);
-      if (pos >= 0 &&
-          !jQuery(node.parentNode).hasClass(className) &&
-          !jQuery(node.parentNode).hasClass("nohighlight")) {
-        var span;
-        var isInSVG = jQuery(node).closest("body, svg, foreignObject").is("svg");
-        if (isInSVG) {
-          span = document.createElementNS("http://www.w3.org/2000/svg", "tspan");
-        } else {
-          span = document.createElement("span");
-          span.className = className;
-        }
-        span.appendChild(document.createTextNode(val.substr(pos, text.length)));
-        node.parentNode.insertBefore(span, node.parentNode.insertBefore(
-          document.createTextNode(val.substr(pos + text.length)),
-          node.nextSibling));
-        node.nodeValue = val.substr(0, pos);
-        if (isInSVG) {
-          var rect = document.createElementNS("http://www.w3.org/2000/svg", "rect");
-          var bbox = node.parentElement.getBBox();
-          rect.x.baseVal.value = bbox.x;
-          rect.y.baseVal.value = bbox.y;
-          rect.width.baseVal.value = bbox.width;
-          rect.height.baseVal.value = bbox.height;
-          rect.setAttribute('class', className);
-          addItems.push({
-              "parent": node.parentNode,
-              "target": rect});
-        }
-      }
-    }
-    else if (!jQuery(node).is("button, select, textarea")) {
-      jQuery.each(node.childNodes, function() {
-        highlight(this, addItems);
-      });
-    }
-  }
-  var addItems = [];
-  var result = this.each(function() {
-    highlight(this, addItems);
-  });
-  for (var i = 0; i < addItems.length; ++i) {
-    jQuery(addItems[i].parent).before(addItems[i].target);
-  }
-  return result;
-};
-
-/*
- * backward compatibility for jQuery.browser
- * This will be supported until firefox bug is fixed.
- */
-if (!jQuery.browser) {
-  jQuery.uaMatch = function(ua) {
-    ua = ua.toLowerCase();
-
-    var match = /(chrome)[ \/]([\w.]+)/.exec(ua) ||
-      /(webkit)[ \/]([\w.]+)/.exec(ua) ||
-      /(opera)(?:.*version|)[ \/]([\w.]+)/.exec(ua) ||
-      /(msie) ([\w.]+)/.exec(ua) ||
-      ua.indexOf("compatible") < 0 && /(mozilla)(?:.*? rv:([\w.]+)|)/.exec(ua) ||
-      [];
-
-    return {
-      browser: match[ 1 ] || "",
-      version: match[ 2 ] || "0"
-    };
-  };
-  jQuery.browser = {};
-  jQuery.browser[jQuery.uaMatch(navigator.userAgent).browser] = true;
-}
-
 /**
  * Small JavaScript module for the documentation.
  */
-var Documentation = {
-
-  init : function() {
-    this.fixFirefoxAnchorBug();
-    this.highlightSearchWords();
-    this.initIndexTable();
-    if (DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) {
-      this.initOnKeyListeners();
-    }
+const Documentation = {
+  init: () => {
+    Documentation.initDomainIndexTable();
+    Documentation.initOnKeyListeners();
   },
 
   /**
    * i18n support
    */
-  TRANSLATIONS : {},
-  PLURAL_EXPR : function(n) { return n === 1 ? 0 : 1; },
-  LOCALE : 'unknown',
+  TRANSLATIONS: {},
+  PLURAL_EXPR: (n) => (n === 1 ? 0 : 1),
+  LOCALE: "unknown",
 
   // gettext and ngettext don't access this so that the functions
   // can safely bound to a different name (_ = Documentation.gettext)
-  gettext : function(string) {
-    var translated = Documentation.TRANSLATIONS[string];
-    if (typeof translated === 'undefined')
-      return string;
-    return (typeof translated === 'string') ? translated : translated[0];
+  gettext: (string) => {
+    const translated = Documentation.TRANSLATIONS[string];
+    switch (typeof translated) {
+      case "undefined":
+        return string; // no translation
+      case "string":
+        return translated; // translation exists
+      default:
+        return translated[0]; // (singular, plural) translation tuple exists
+    }
   },
 
-  ngettext : function(singular, plural, n) {
-    var translated = Documentation.TRANSLATIONS[singular];
-    if (typeof translated === 'undefined')
-      return (n == 1) ? singular : plural;
-    return translated[Documentation.PLURALEXPR(n)];
+  ngettext: (singular, plural, n) => {
+    const translated = Documentation.TRANSLATIONS[singular];
+    if (typeof translated !== "undefined")
+      return translated[Documentation.PLURAL_EXPR(n)];
+    return n === 1 ? singular : plural;
   },
 
-  addTranslations : function(catalog) {
-    for (var key in catalog.messages)
-      this.TRANSLATIONS[key] = catalog.messages[key];
-    this.PLURAL_EXPR = new Function('n', 'return +(' + catalog.plural_expr + ')');
-    this.LOCALE = catalog.locale;
+  addTranslations: (catalog) => {
+    Object.assign(Documentation.TRANSLATIONS, catalog.messages);
+    Documentation.PLURAL_EXPR = new Function(
+      "n",
+      `return (${catalog.plural_expr})`
+    );
+    Documentation.LOCALE = catalog.locale;
   },
 
   /**
-   * add context elements like header anchor links
+   * helper function to focus on search bar
    */
-  addContextElements : function() {
-    $('div[id] > :header:first').each(function() {
-      $('<a class="headerlink">\u00B6</a>').
-      attr('href', '#' + this.id).
-      attr('title', _('Permalink to this headline')).
-      appendTo(this);
-    });
-    $('dt[id]').each(function() {
-      $('<a class="headerlink">\u00B6</a>').
-      attr('href', '#' + this.id).
-      attr('title', _('Permalink to this definition')).
-      appendTo(this);
-    });
+  focusSearchBar: () => {
+    document.querySelectorAll("input[name=q]")[0]?.focus();
   },
 
   /**
-   * workaround a firefox stupidity
-   * see: https://bugzilla.mozilla.org/show_bug.cgi?id=645075
+   * Initialise the domain index toggle buttons
    */
-  fixFirefoxAnchorBug : function() {
-    if (document.location.hash && $.browser.mozilla)
-      window.setTimeout(function() {
-        document.location.href += '';
-      }, 10);
-  },
-
-  /**
-   * highlight the search words provided in the url in the text
-   */
-  highlightSearchWords : function() {
-    var params = $.getQueryParameters();
-    var terms = (params.highlight) ? params.highlight[0].split(/\s+/) : [];
-    if (terms.length) {
-      var body = $('div.body');
-      if (!body.length) {
-        body = $('body');
+  initDomainIndexTable: () => {
+    const toggler = (el) => {
+      const idNumber = el.id.substr(7);
+      const toggledRows = document.querySelectorAll(`tr.cg-${idNumber}`);
+      if (el.src.substr(-9) === "minus.png") {
+        el.src = `${el.src.substr(0, el.src.length - 9)}plus.png`;
+        toggledRows.forEach((el) => (el.style.display = "none"));
+      } else {
+        el.src = `${el.src.substr(0, el.src.length - 8)}minus.png`;
+        toggledRows.forEach((el) => (el.style.display = ""));
       }
-      window.setTimeout(function() {
-        $.each(terms, function() {
-          body.highlightText(this.toLowerCase(), 'highlighted');
-        });
-      }, 10);
-      $('<p class="highlight-link"><a href="javascript:Documentation.' +
-        'hideSearchWords()">' + _('Hide Search Matches') + '</a></p>')
-          .appendTo($('#searchbox'));
-    }
-  },
-
-  /**
-   * init the domain index toggle buttons
-   */
-  initIndexTable : function() {
-    var togglers = $('img.toggler').click(function() {
-      var src = $(this).attr('src');
-      var idnum = $(this).attr('id').substr(7);
-      $('tr.cg-' + idnum).toggle();
-      if (src.substr(-9) === 'minus.png')
-        $(this).attr('src', src.substr(0, src.length-9) + 'plus.png');
-      else
-        $(this).attr('src', src.substr(0, src.length-8) + 'minus.png');
-    }).css('display', '');
-    if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) {
-        togglers.click();
-    }
-  },
+    };
 
-  /**
-   * helper function to hide the search marks again
-   */
-  hideSearchWords : function() {
-    $('#searchbox .highlight-link').fadeOut(300);
-    $('span.highlighted').removeClass('highlighted');
+    const togglerElements = document.querySelectorAll("img.toggler");
+    togglerElements.forEach((el) =>
+      el.addEventListener("click", (event) => toggler(event.currentTarget))
+    );
+    togglerElements.forEach((el) => (el.style.display = ""));
+    if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) togglerElements.forEach(toggler);
   },
 
-  /**
-   * make the url absolute
-   */
-  makeURL : function(relativeURL) {
-    return DOCUMENTATION_OPTIONS.URL_ROOT + '/' + relativeURL;
-  },
-
-  /**
-   * get the current relative url
-   */
-  getCurrentURL : function() {
-    var path = document.location.pathname;
-    var parts = path.split(/\//);
-    $.each(DOCUMENTATION_OPTIONS.URL_ROOT.split(/\//), function() {
-      if (this === '..')
-        parts.pop();
-    });
-    var url = parts.join('/');
-    return path.substring(url.lastIndexOf('/') + 1, path.length - 1);
-  },
-
-  initOnKeyListeners: function() {
-    $(document).keydown(function(event) {
-      var activeElementType = document.activeElement.tagName;
-      // don't navigate when in search box, textarea, dropdown or button
-      if (activeElementType !== 'TEXTAREA' && activeElementType !== 'INPUT' && activeElementType !== 'SELECT'
-          && activeElementType !== 'BUTTON' && !event.altKey && !event.ctrlKey && !event.metaKey
-          && !event.shiftKey) {
-        switch (event.keyCode) {
-          case 37: // left
-            var prevHref = $('link[rel="prev"]').prop('href');
-            if (prevHref) {
-              window.location.href = prevHref;
-              return false;
+  initOnKeyListeners: () => {
+    // only install a listener if it is really needed
+    if (
+      !DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS &&
+      !DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS
+    )
+      return;
+
+    document.addEventListener("keydown", (event) => {
+      // bail for input elements
+      if (BLACKLISTED_KEY_CONTROL_ELEMENTS.has(document.activeElement.tagName)) return;
+      // bail with special keys
+      if (event.altKey || event.ctrlKey || event.metaKey) return;
+
+      if (!event.shiftKey) {
+        switch (event.key) {
+          case "ArrowLeft":
+            if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break;
+
+            const prevLink = document.querySelector('link[rel="prev"]');
+            if (prevLink && prevLink.href) {
+              window.location.href = prevLink.href;
+              event.preventDefault();
             }
             break;
-          case 39: // right
-            var nextHref = $('link[rel="next"]').prop('href');
-            if (nextHref) {
-              window.location.href = nextHref;
-              return false;
+          case "ArrowRight":
+            if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break;
+
+            const nextLink = document.querySelector('link[rel="next"]');
+            if (nextLink && nextLink.href) {
+              window.location.href = nextLink.href;
+              event.preventDefault();
             }
             break;
         }
       }
+
+      // some keyboard layouts may need Shift to get /
+      switch (event.key) {
+        case "/":
+          if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) break;
+          Documentation.focusSearchBar();
+          event.preventDefault();
+      }
     });
-  }
+  },
 };
 
 // quick alias for translations
-_ = Documentation.gettext;
+const _ = Documentation.gettext;
 
-$(document).ready(function() {
-  Documentation.init();
-});
+_ready(Documentation.init);
diff --git a/_static/documentation_options.js b/_static/documentation_options.js
index 16442b3a64..1df48e1a21 100644
--- a/_static/documentation_options.js
+++ b/_static/documentation_options.js
@@ -1,12 +1,13 @@
-var DOCUMENTATION_OPTIONS = {
-    URL_ROOT: document.getElementById("documentation_options").getAttribute('data-url_root'),
+const DOCUMENTATION_OPTIONS = {
     VERSION: '0.9.1',
-    LANGUAGE: 'None',
+    LANGUAGE: 'en',
     COLLAPSE_INDEX: false,
     BUILDER: 'html',
     FILE_SUFFIX: '.html',
     LINK_SUFFIX: '.html',
     HAS_SOURCE: true,
     SOURCELINK_SUFFIX: '.txt',
-    NAVIGATION_WITH_KEYS: false
+    NAVIGATION_WITH_KEYS: false,
+    SHOW_SEARCH_SUMMARY: true,
+    ENABLE_SEARCH_SHORTCUTS: true,
 };
\ No newline at end of file
diff --git a/_static/invalid/AbstractRefinementMap.scala b/_static/invalid/AbstractRefinementMap.scala
index d11db628b1..45bae7c9b2 100644
--- a/_static/invalid/AbstractRefinementMap.scala
+++ b/_static/invalid/AbstractRefinementMap.scala
@@ -12,7 +12,7 @@ object AbstractRefinementMap {
     def apply(x: A): B = {
       require(f.pre(x))
       f(x)
-    } ensuring(ens)
+   }.ensuring(ens)
   }
 
   def map[A, B](l: List[A], f: A ~> B): List[B] = {
@@ -21,6 +21,6 @@ object AbstractRefinementMap {
       case Cons(x, xs) => Cons[B](f(x), map(xs, f))
       case Nil() => Nil[B]()
     }
-  } ensuring { res => forall((x: B) => res.contains(x) ==> f.ens(x)) }
+ }.ensuring { res => forall((x: B) => res.contains(x) ==> f.ens(x)) }
 }
 
diff --git a/_static/invalid/BadConcRope.scala b/_static/invalid/BadConcRope.scala
index dfff26ec5b..e050ac93bc 100644
--- a/_static/invalid/BadConcRope.scala
+++ b/_static/invalid/BadConcRope.scala
@@ -84,7 +84,7 @@ object BadConcRope {
         case Append(l, r) =>
           1 + max(l.level, r.level)
       }): BigInt
-    } ensuring (_ >= 0)
+   }.ensuring(_ >= 0)
 
     val size: BigInt = {
       (this match {
@@ -95,7 +95,7 @@ object BadConcRope {
         case Append(l, r) =>
           l.size + r.size
       }): BigInt
-    } ensuring (_ >= 0)
+   }.ensuring(_ >= 0)
 
     def toList: List[T] = {
       this match {
@@ -106,7 +106,7 @@ object BadConcRope {
         case Append(l, r) =>
           l.toList ++ r.toList
       }
-    } ensuring (res => res.size == this.size)
+   }.ensuring(res => res.size == this.size)
   }
 
   case class Empty[T]() extends Conc[T]
@@ -125,7 +125,7 @@ object BadConcRope {
         if (i < l.size) lookup(l, i)
         else lookup(r, i - l.size)
     }
-  } ensuring (res =>  instAppendIndexAxiom(xs, i) &&  // an auxiliary axiom instantiation that required for the proof
+ }.ensuring(res =>  instAppendIndexAxiom(xs, i) &&  // an auxiliary axiom instantiation that required for the proof
     res == xs.toList(i)) // correctness
 
 
@@ -150,7 +150,7 @@ object BadConcRope {
       case Append(l, r) =>
         Append(update(l, i, y), r)
     }
-  } ensuring (res => instAppendUpdateAxiom(xs, i, y) && // an auxiliary axiom instantiation
+ }.ensuring(res => instAppendUpdateAxiom(xs, i, y) && // an auxiliary axiom instantiation
     res.level == xs.level && // heights of the input and output trees are equal
     res.valid && // tree invariants are preserved
     res.toList == xs.toList.updated(i, y) && // correctness
@@ -188,7 +188,7 @@ object BadConcRope {
       case _ =>
         concatNonEmpty(xs, ys)
     }
-  } ensuring (res => res.valid && // tree invariants
+ }.ensuring(res => res.valid && // tree invariants
     res.level <= max(xs.level, ys.level) + 1 && // height invariants
     res.level >= max(xs.level, ys.level) &&
     (res.toList == xs.toList ++ ys.toList) && // correctness
@@ -239,7 +239,7 @@ object BadConcRope {
           }
       }
     }
-  } ensuring (res =>
+ }.ensuring(res =>
     appendAssocInst(xs, ys) && // instantiation of an axiom
     res.level <= max(xs.level, ys.level) + 1 && // height invariants
     res.level >= max(xs.level, ys.level) &&
@@ -291,7 +291,7 @@ object BadConcRope {
       case CC(l, r) =>
        concatNonEmpty(l, insert(r, i - l.size, y))
     }
-  } ensuring (res => insertAppendAxiomInst(xs, i, y) && // instantiation of an axiom
+ }.ensuring(res => insertAppendAxiomInst(xs, i, y) && // instantiation of an axiom
     res.valid && res.isNormalized && // tree invariants
     res.level - xs.level <= 1 && res.level >= xs.level && // height of the output tree is at most 1 greater than that of the input tree
     res.toList == insertAtIndex(xs.toList, i, y) // correctness
@@ -356,7 +356,7 @@ object BadConcRope {
           (l, r)
         }
     }
-  } ensuring (res  => instSplitAxiom(xs, n) && // instantiation of an axiom
+ }.ensuring(res  => instSplitAxiom(xs, n) && // instantiation of an axiom
     res._1.valid && res._2.valid && // tree invariants are preserved
     res._1.isNormalized && res._2.isNormalized &&
     xs.level >= res._1.level && xs.level >= res._2.level && // height bounds of the resulting tree
@@ -382,7 +382,7 @@ object BadConcRope {
       case Empty() => ys
       case Single(_) => CC(xs, ys)
     }
-  } ensuring (res => res.valid && //conctree invariants
+ }.ensuring(res => res.valid && //conctree invariants
     res.toList == xs.toList ++ Cons(x, Nil[T]()) && //correctness
     res.level <= xs.level + 1
   )
@@ -408,7 +408,7 @@ object BadConcRope {
           Append(l, zs)
       }
     }
-  } ensuring (res => appendAssocInst2(xs, ys) &&
+ }.ensuring(res => appendAssocInst2(xs, ys) &&
     res.valid && //conc tree invariants
     res.toList == xs.toList ++ ys.toList && //correctness invariants
     res.level <= xs.level + 1 )
@@ -428,7 +428,7 @@ object BadConcRope {
       case Append(l, r) => numTrees(l) + 1
       case _ => BigInt(1)
     }
-  } ensuring (res => res >= 0)
+ }.ensuring(res => res >= 0)
 
   def normalize[T](t: Conc[T]): Conc[T] = {
     require(t.valid)
@@ -439,7 +439,7 @@ object BadConcRope {
         concatNormalized(l, r)
       case _ => t
     }
-  } ensuring (res => res.valid &&
+ }.ensuring(res => res.valid &&
     res.isNormalized &&
     res.toList == t.toList && //correctness
     res.size == t.size && res.level <= t.level //normalize preserves level and size
@@ -454,7 +454,7 @@ object BadConcRope {
       case l =>
         concatNormalized(l, nr)
     }
-  } ensuring (res =>
+ }.ensuring(res =>
     appendAssocInst2(xs, ys) && //some lemma instantiations
     res.valid &&
     res.isNormalized &&
diff --git a/_static/invalid/BraunTree.scala b/_static/invalid/BraunTree.scala
index 7733dcd0ec..a2986c5d42 100644
--- a/_static/invalid/BraunTree.scala
+++ b/_static/invalid/BraunTree.scala
@@ -14,7 +14,7 @@ object BraunTree {
         Node(value, insert(left, x), right)
       case Leaf() => Node(x, Leaf(), Leaf())
     }
-  } ensuring { res => isBraun(res) }
+ }.ensuring { res => isBraun(res) }
 
   def height(tree: Tree): Int = {
     tree match {
diff --git a/_static/invalid/Choose.scala b/_static/invalid/Choose.scala
index 7508725001..8bb0bb0726 100644
--- a/_static/invalid/Choose.scala
+++ b/_static/invalid/Choose.scala
@@ -11,7 +11,7 @@ object Choose1 {
     def size(l: List) : BigInt = (l match {
         case Nil() => BigInt(0)
         case Cons(_, t) => 1 + size(t)
-    }) ensuring(res => res >= 0)
+    }).ensuring(res => res >= 0)
 
     def content(l: List) : Set[Int] = l match {
       case Nil() => Set.empty[Int]
@@ -26,7 +26,7 @@ object Choose1 {
       } else {
         choose[List] { (res: List) => size(res) == i-1 }
       }
-    } ensuring ( size(_) == i )
+   }.ensuring( size(_) == i )
 
 
     def listOfSize2(i: BigInt): List = {
@@ -37,5 +37,5 @@ object Choose1 {
       } else {
         Nil()
       }
-    } ensuring ( size(_) == i )
+   }.ensuring( size(_) == i )
 }
diff --git a/_static/invalid/InsertionSort.scala b/_static/invalid/InsertionSort.scala
index 98aa2325d1..d54d68943e 100644
--- a/_static/invalid/InsertionSort.scala
+++ b/_static/invalid/InsertionSort.scala
@@ -15,7 +15,7 @@ object InsertionSort {
   def size(l : List) : BigInt = (l match {
     case Nil() => BigInt(0)
     case Cons(_, xs) => 1 + size(xs)
-  }) ensuring(_ >= 0)
+  }).ensuring(_ >= 0)
 
   def contents(l: List): Set[Int] = l match {
     case Nil() => Set.empty
@@ -36,7 +36,7 @@ object InsertionSort {
       case Nil() => Cons(e,Nil())
       case Cons(x,xs) => if (x <= e) Cons(x,buggySortedIns(e, xs)) else Cons(e, l)
     } 
-  } ensuring(res => contents(res) == contents(l) ++ Set(e) 
+ }.ensuring(res => contents(res) == contents(l) ++ Set(e) 
                     && isSorted(res)
                     && size(res) == size(l) + 1
             )
diff --git a/_static/invalid/ListOperations.scala b/_static/invalid/ListOperations.scala
index 7ba835b52d..76a1601293 100644
--- a/_static/invalid/ListOperations.scala
+++ b/_static/invalid/ListOperations.scala
@@ -18,12 +18,12 @@ object ListOperations {
     def size(l: List) : BigInt = (l match {
         case Nil() => BigInt(0)
         case Cons(_, t) => 1 + size(t)
-    }) ensuring(res => res >= 0)
+    }).ensuring(res => res >= 0)
 
     def iplSize(l: IntPairList) : BigInt = (l match {
       case IPNil() => BigInt(0)
       case IPCons(_, xs) => 1 + iplSize(xs)
-    }) ensuring(_ >= 0)
+    }).ensuring(_ >= 0)
 
     def zip(l1: List, l2: List) : IntPairList = {
       // try to uncomment this and see how pattern-matching becomes exhaustive
@@ -35,7 +35,7 @@ object ListOperations {
           case Cons(y, ys) => IPCons(IP(x, y), zip(xs, ys))
         }
       }
-    } ensuring(iplSize(_) == size(l1))
+   }.ensuring(iplSize(_) == size(l1))
 
     def sizeTailRec(l: List) : BigInt = sizeTailRecAcc(l, 0)
     def sizeTailRecAcc(l: List, acc: BigInt) : BigInt = {
@@ -44,7 +44,7 @@ object ListOperations {
        case Nil() => acc
        case Cons(_, xs) => sizeTailRecAcc(xs, acc+1)
      }
-    } ensuring(res => res == size(l) + acc)
+   }.ensuring(res => res == size(l) + acc)
 
     def sizesAreEquiv(l: List) : Boolean = {
       size(l) == sizeTailRec(l)
@@ -62,18 +62,18 @@ object ListOperations {
     def drunk(l : List) : List = (l match {
       case Nil() => Nil()
       case Cons(x,l1) => Cons(x,Cons(x,drunk(l1)))
-    }) ensuring (size(_) == 2 * size(l))
+    }).ensuring (size(_) == 2 * size(l))
 
-    def reverse(l: List) : List = reverse0(l, Nil()) ensuring(content(_) == content(l))
+    def reverse(l: List) : List = reverse0(l, Nil()).ensuring(content(_) == content(l))
     def reverse0(l1: List, l2: List) : List = (l1 match {
       case Nil() => l2
       case Cons(x, xs) => reverse0(xs, Cons(x, l2))
-    }) ensuring(content(_) == content(l1) ++ content(l2))
+    }).ensuring(content(_) == content(l1) ++ content(l2))
 
     def append(l1 : List, l2 : List) : List = (l1 match {
       case Nil() => l2
       case Cons(x,xs) => Cons(x, append(xs, l2))
-    }) ensuring(content(_) == content(l1) ++ content(l2))
+    }).ensuring(content(_) == content(l1) ++ content(l2))
 
     @induct
     def nilAppend(l : List) : Boolean = (append(l, Nil()) == l).holds
@@ -92,7 +92,7 @@ object ListOperations {
 
     @induct
     def concat(l1: List, l2: List) : List =
-      concat0(l1, l2, Nil()) ensuring(content(_) == content(l1) ++ content(l2))
+      concat0(l1, l2, Nil()).ensuring(content(_) == content(l1) ++ content(l2))
 
     @induct
     def concat0(l1: List, l2: List, l3: List) : List = (l1 match {
@@ -103,5 +103,5 @@ object ListOperations {
         }
       }
       case Cons(x, xs) => concat0(xs, l2, Cons(x, l3))
-    }) ensuring(content(_) == content(l1) ++ content(l2) ++ content(l3))
+    }).ensuring(content(_) == content(l1) ++ content(l2) ++ content(l3))
 }
diff --git a/_static/invalid/Mean.scala b/_static/invalid/Mean.scala
index c79ad49794..282386cbe4 100644
--- a/_static/invalid/Mean.scala
+++ b/_static/invalid/Mean.scala
@@ -8,6 +8,6 @@ object Mean {
   def meanOverflow(x: Int, y: Int): Int = {
     require(x <= y && x >= 0 && y >= 0)
     (x + y)/2
-  } ensuring(m => m >= x && m <= y)
+ }.ensuring(m => m >= x && m <= y)
 
 }
diff --git a/_static/invalid/PropositionalLogic.scala b/_static/invalid/PropositionalLogic.scala
index 654a28d303..450778ee85 100644
--- a/_static/invalid/PropositionalLogic.scala
+++ b/_static/invalid/PropositionalLogic.scala
@@ -15,7 +15,7 @@ object PropositionalLogic {
   def simplify(f: Formula): Formula = (f match {
     case Implies(lhs, rhs) => Or(Not(simplify(lhs)), simplify(rhs))
     case _ => f
-  }) ensuring(isSimplified(_))
+  }).ensuring(isSimplified(_))
 
   def isSimplified(f: Formula): Boolean = f match {
     case And(lhs, rhs) => isSimplified(lhs) && isSimplified(rhs)
diff --git a/_static/invalid/RedBlackTree2.scala b/_static/invalid/RedBlackTree2.scala
index 6fc4b6cf74..0afb0fc766 100644
--- a/_static/invalid/RedBlackTree2.scala
+++ b/_static/invalid/RedBlackTree2.scala
@@ -24,7 +24,7 @@ object RedBlackTree2 {
   def size(t: Tree) : BigInt = (t match {
     case Empty() => BigInt(0)
     case Node(_, l, v, r) => size(l) + 1 + size(r)
-  }) ensuring(_ >= 0)
+  }).ensuring(_ >= 0)
 
   def isBlack(t: Tree) : Boolean = t match {
     case Empty() => true
@@ -63,7 +63,7 @@ object RedBlackTree2 {
         else if (x == y) Node(c,a,y,b)
         else             balance(c,a,y,ins(x, b))
     }
-  } ensuring (res => content(res) == content(t) ++ Set(x) 
+ }.ensuring(res => content(res) == content(t) ++ Set(x) 
                    && size(t) <= size(res) && size(res) <= size(t) + 1
                    && redDescHaveBlackChildren(res)
                    && blackBalanced(res))
@@ -80,10 +80,10 @@ object RedBlackTree2 {
         Node(Red(),Node(Black(),a,xV,b),yV,Node(Black(),c,zV,d))
       case Node(c,a,xV,b) => Node(c,a,xV,b)
     }
-  } ensuring (res => content(res) == content(Node(c,a,x,b)))// && redDescHaveBlackChildren(res))
+ }.ensuring(res => content(res) == content(Node(c,a,x,b)))// && redDescHaveBlackChildren(res))
 
   def buggyAdd(x: Int, t: Tree): Tree = {
     require(redNodesHaveBlackChildren(t))
     ins(x, t)
-  } ensuring (res => content(res) == content(t) ++ Set(x) && redNodesHaveBlackChildren(res))
+ }.ensuring(res => content(res) == content(t) ++ Set(x) && redNodesHaveBlackChildren(res))
 }
diff --git a/_static/invalid/SpecWithExtern.scala b/_static/invalid/SpecWithExtern.scala
index 4480b715f1..f5884cf7f4 100644
--- a/_static/invalid/SpecWithExtern.scala
+++ b/_static/invalid/SpecWithExtern.scala
@@ -11,12 +11,12 @@ object SpecWithExtern {
   def randomBetween(l: Int, h: Int): Int = {
     require(l <= h)
     l
-  } ensuring(res => (res >= l && res <= h))
+ }.ensuring(res => (res >= l && res <= h))
 
   //postcondition is wrong, but if stainless considers 
   //actual body of randomBetween it would be correct
   def wrongProp(): Int = {
     randomBetween(0, 10)
-  } ensuring(res => res >= 0 && res < 10)
+ }.ensuring(res => res >= 0 && res < 10)
 
 }
diff --git a/_static/js/html5shiv-printshiv.min.js b/_static/js/html5shiv-printshiv.min.js
new file mode 100644
index 0000000000..2b43bd062e
--- /dev/null
+++ b/_static/js/html5shiv-printshiv.min.js
@@ -0,0 +1,4 @@
+/**
+* @preserve HTML5 Shiv 3.7.3-pre | @afarkas @jdalton @jon_neal @rem | MIT/GPL2 Licensed
+*/
+!function(a,b){function c(a,b){var c=a.createElement("p"),d=a.getElementsByTagName("head")[0]||a.documentElement;return c.innerHTML="x<style>"+b+"</style>",d.insertBefore(c.lastChild,d.firstChild)}function d(){var a=y.elements;return"string"==typeof a?a.split(" "):a}function e(a,b){var c=y.elements;"string"!=typeof c&&(c=c.join(" ")),"string"!=typeof a&&(a=a.join(" ")),y.elements=c+" "+a,j(b)}function f(a){var b=x[a[v]];return b||(b={},w++,a[v]=w,x[w]=b),b}function g(a,c,d){if(c||(c=b),q)return c.createElement(a);d||(d=f(c));var e;return e=d.cache[a]?d.cache[a].cloneNode():u.test(a)?(d.cache[a]=d.createElem(a)).cloneNode():d.createElem(a),!e.canHaveChildren||t.test(a)||e.tagUrn?e:d.frag.appendChild(e)}function h(a,c){if(a||(a=b),q)return a.createDocumentFragment();c=c||f(a);for(var e=c.frag.cloneNode(),g=0,h=d(),i=h.length;i>g;g++)e.createElement(h[g]);return e}function i(a,b){b.cache||(b.cache={},b.createElem=a.createElement,b.createFrag=a.createDocumentFragment,b.frag=b.createFrag()),a.createElement=function(c){return y.shivMethods?g(c,a,b):b.createElem(c)},a.createDocumentFragment=Function("h,f","return function(){var n=f.cloneNode(),c=n.createElement;h.shivMethods&&("+d().join().replace(/[\w\-:]+/g,function(a){return b.createElem(a),b.frag.createElement(a),'c("'+a+'")'})+");return n}")(y,b.frag)}function j(a){a||(a=b);var d=f(a);return!y.shivCSS||p||d.hasCSS||(d.hasCSS=!!c(a,"article,aside,dialog,figcaption,figure,footer,header,hgroup,main,nav,section{display:block}mark{background:#FF0;color:#000}template{display:none}")),q||i(a,d),a}function k(a){for(var b,c=a.getElementsByTagName("*"),e=c.length,f=RegExp("^(?:"+d().join("|")+")$","i"),g=[];e--;)b=c[e],f.test(b.nodeName)&&g.push(b.applyElement(l(b)));return g}function l(a){for(var b,c=a.attributes,d=c.length,e=a.ownerDocument.createElement(A+":"+a.nodeName);d--;)b=c[d],b.specified&&e.setAttribute(b.nodeName,b.nodeValue);return e.style.cssText=a.style.cssText,e}function m(a){for(var b,c=a.split("{"),e=c.length,f=RegExp("(^|[\\s,>+~])("+d().join("|")+")(?=[[\\s,>+~#.:]|$)","gi"),g="$1"+A+"\\:$2";e--;)b=c[e]=c[e].split("}"),b[b.length-1]=b[b.length-1].replace(f,g),c[e]=b.join("}");return c.join("{")}function n(a){for(var b=a.length;b--;)a[b].removeNode()}function o(a){function b(){clearTimeout(g._removeSheetTimer),d&&d.removeNode(!0),d=null}var d,e,g=f(a),h=a.namespaces,i=a.parentWindow;return!B||a.printShived?a:("undefined"==typeof h[A]&&h.add(A),i.attachEvent("onbeforeprint",function(){b();for(var f,g,h,i=a.styleSheets,j=[],l=i.length,n=Array(l);l--;)n[l]=i[l];for(;h=n.pop();)if(!h.disabled&&z.test(h.media)){try{f=h.imports,g=f.length}catch(o){g=0}for(l=0;g>l;l++)n.push(f[l]);try{j.push(h.cssText)}catch(o){}}j=m(j.reverse().join("")),e=k(a),d=c(a,j)}),i.attachEvent("onafterprint",function(){n(e),clearTimeout(g._removeSheetTimer),g._removeSheetTimer=setTimeout(b,500)}),a.printShived=!0,a)}var p,q,r="3.7.3",s=a.html5||{},t=/^<|^(?:button|map|select|textarea|object|iframe|option|optgroup)$/i,u=/^(?:a|b|code|div|fieldset|h1|h2|h3|h4|h5|h6|i|label|li|ol|p|q|span|strong|style|table|tbody|td|th|tr|ul)$/i,v="_html5shiv",w=0,x={};!function(){try{var a=b.createElement("a");a.innerHTML="<xyz></xyz>",p="hidden"in a,q=1==a.childNodes.length||function(){b.createElement("a");var a=b.createDocumentFragment();return"undefined"==typeof a.cloneNode||"undefined"==typeof a.createDocumentFragment||"undefined"==typeof a.createElement}()}catch(c){p=!0,q=!0}}();var y={elements:s.elements||"abbr article aside audio bdi canvas data datalist details dialog figcaption figure footer header hgroup main mark meter nav output picture progress section summary template time video",version:r,shivCSS:s.shivCSS!==!1,supportsUnknownElements:q,shivMethods:s.shivMethods!==!1,type:"default",shivDocument:j,createElement:g,createDocumentFragment:h,addElements:e};a.html5=y,j(b);var z=/^$|\b(?:all|print)\b/,A="html5shiv",B=!q&&function(){var c=b.documentElement;return!("undefined"==typeof b.namespaces||"undefined"==typeof b.parentWindow||"undefined"==typeof c.applyElement||"undefined"==typeof c.removeNode||"undefined"==typeof a.attachEvent)}();y.type+=" print",y.shivPrint=o,o(b),"object"==typeof module&&module.exports&&(module.exports=y)}("undefined"!=typeof window?window:this,document);
\ No newline at end of file
diff --git a/_static/js/html5shiv.min.js b/_static/js/html5shiv.min.js
new file mode 100644
index 0000000000..cd1c674f5e
--- /dev/null
+++ b/_static/js/html5shiv.min.js
@@ -0,0 +1,4 @@
+/**
+* @preserve HTML5 Shiv 3.7.3 | @afarkas @jdalton @jon_neal @rem | MIT/GPL2 Licensed
+*/
+!function(a,b){function c(a,b){var c=a.createElement("p"),d=a.getElementsByTagName("head")[0]||a.documentElement;return c.innerHTML="x<style>"+b+"</style>",d.insertBefore(c.lastChild,d.firstChild)}function d(){var a=t.elements;return"string"==typeof a?a.split(" "):a}function e(a,b){var c=t.elements;"string"!=typeof c&&(c=c.join(" ")),"string"!=typeof a&&(a=a.join(" ")),t.elements=c+" "+a,j(b)}function f(a){var b=s[a[q]];return b||(b={},r++,a[q]=r,s[r]=b),b}function g(a,c,d){if(c||(c=b),l)return c.createElement(a);d||(d=f(c));var e;return e=d.cache[a]?d.cache[a].cloneNode():p.test(a)?(d.cache[a]=d.createElem(a)).cloneNode():d.createElem(a),!e.canHaveChildren||o.test(a)||e.tagUrn?e:d.frag.appendChild(e)}function h(a,c){if(a||(a=b),l)return a.createDocumentFragment();c=c||f(a);for(var e=c.frag.cloneNode(),g=0,h=d(),i=h.length;i>g;g++)e.createElement(h[g]);return e}function i(a,b){b.cache||(b.cache={},b.createElem=a.createElement,b.createFrag=a.createDocumentFragment,b.frag=b.createFrag()),a.createElement=function(c){return t.shivMethods?g(c,a,b):b.createElem(c)},a.createDocumentFragment=Function("h,f","return function(){var n=f.cloneNode(),c=n.createElement;h.shivMethods&&("+d().join().replace(/[\w\-:]+/g,function(a){return b.createElem(a),b.frag.createElement(a),'c("'+a+'")'})+");return n}")(t,b.frag)}function j(a){a||(a=b);var d=f(a);return!t.shivCSS||k||d.hasCSS||(d.hasCSS=!!c(a,"article,aside,dialog,figcaption,figure,footer,header,hgroup,main,nav,section{display:block}mark{background:#FF0;color:#000}template{display:none}")),l||i(a,d),a}var k,l,m="3.7.3-pre",n=a.html5||{},o=/^<|^(?:button|map|select|textarea|object|iframe|option|optgroup)$/i,p=/^(?:a|b|code|div|fieldset|h1|h2|h3|h4|h5|h6|i|label|li|ol|p|q|span|strong|style|table|tbody|td|th|tr|ul)$/i,q="_html5shiv",r=0,s={};!function(){try{var a=b.createElement("a");a.innerHTML="<xyz></xyz>",k="hidden"in a,l=1==a.childNodes.length||function(){b.createElement("a");var a=b.createDocumentFragment();return"undefined"==typeof a.cloneNode||"undefined"==typeof a.createDocumentFragment||"undefined"==typeof a.createElement}()}catch(c){k=!0,l=!0}}();var t={elements:n.elements||"abbr article aside audio bdi canvas data datalist details dialog figcaption figure footer header hgroup main mark meter nav output picture progress section summary template time video",version:m,shivCSS:n.shivCSS!==!1,supportsUnknownElements:l,shivMethods:n.shivMethods!==!1,type:"default",shivDocument:j,createElement:g,createDocumentFragment:h,addElements:e};a.html5=t,j(b),"object"==typeof module&&module.exports&&(module.exports=t)}("undefined"!=typeof window?window:this,document);
\ No newline at end of file
diff --git a/_static/js/theme.js b/_static/js/theme.js
index 8afbd5a250..1fddb6ee4a 100644
--- a/_static/js/theme.js
+++ b/_static/js/theme.js
@@ -1 +1 @@
-!function(n){var e={};function t(i){if(e[i])return e[i].exports;var o=e[i]={i:i,l:!1,exports:{}};return n[i].call(o.exports,o,o.exports,t),o.l=!0,o.exports}t.m=n,t.c=e,t.d=function(n,e,i){t.o(n,e)||Object.defineProperty(n,e,{enumerable:!0,get:i})},t.r=function(n){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(n,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(n,"__esModule",{value:!0})},t.t=function(n,e){if(1&e&&(n=t(n)),8&e)return n;if(4&e&&"object"==typeof n&&n&&n.__esModule)return n;var i=Object.create(null);if(t.r(i),Object.defineProperty(i,"default",{enumerable:!0,value:n}),2&e&&"string"!=typeof n)for(var o in n)t.d(i,o,function(e){return n[e]}.bind(null,o));return i},t.n=function(n){var e=n&&n.__esModule?function(){return n.default}:function(){return n};return t.d(e,"a",e),e},t.o=function(n,e){return Object.prototype.hasOwnProperty.call(n,e)},t.p="",t(t.s=0)}([function(n,e,t){t(1),n.exports=t(3)},function(n,e,t){(function(){var e="undefined"!=typeof window?window.jQuery:t(2);n.exports.ThemeNav={navBar:null,win:null,winScroll:!1,winResize:!1,linkScroll:!1,winPosition:0,winHeight:null,docHeight:null,isRunning:!1,enable:function(n){var t=this;void 0===n&&(n=!0),t.isRunning||(t.isRunning=!0,e((function(e){t.init(e),t.reset(),t.win.on("hashchange",t.reset),n&&t.win.on("scroll",(function(){t.linkScroll||t.winScroll||(t.winScroll=!0,requestAnimationFrame((function(){t.onScroll()})))})),t.win.on("resize",(function(){t.winResize||(t.winResize=!0,requestAnimationFrame((function(){t.onResize()})))})),t.onResize()})))},enableSticky:function(){this.enable(!0)},init:function(n){n(document);var e=this;this.navBar=n("div.wy-side-scroll:first"),this.win=n(window),n(document).on("click","[data-toggle='wy-nav-top']",(function(){n("[data-toggle='wy-nav-shift']").toggleClass("shift"),n("[data-toggle='rst-versions']").toggleClass("shift")})).on("click",".wy-menu-vertical .current ul li a",(function(){var t=n(this);n("[data-toggle='wy-nav-shift']").removeClass("shift"),n("[data-toggle='rst-versions']").toggleClass("shift"),e.toggleCurrent(t),e.hashChange()})).on("click","[data-toggle='rst-current-version']",(function(){n("[data-toggle='rst-versions']").toggleClass("shift-up")})),n("table.docutils:not(.field-list,.footnote,.citation)").wrap("<div class='wy-table-responsive'></div>"),n("table.docutils.footnote").wrap("<div class='wy-table-responsive footnote'></div>"),n("table.docutils.citation").wrap("<div class='wy-table-responsive citation'></div>"),n(".wy-menu-vertical ul").not(".simple").siblings("a").each((function(){var t=n(this);expand=n('<span class="toctree-expand"></span>'),expand.on("click",(function(n){return e.toggleCurrent(t),n.stopPropagation(),!1})),t.prepend(expand)}))},reset:function(){var n=encodeURI(window.location.hash)||"#";try{var e=$(".wy-menu-vertical"),t=e.find('[href="'+n+'"]');if(0===t.length){var i=$('.document [id="'+n.substring(1)+'"]').closest("div.section");0===(t=e.find('[href="#'+i.attr("id")+'"]')).length&&(t=e.find('[href="#"]'))}t.length>0&&($(".wy-menu-vertical .current").removeClass("current"),t.addClass("current"),t.closest("li.toctree-l1").addClass("current"),t.closest("li.toctree-l1").parent().addClass("current"),t.closest("li.toctree-l1").addClass("current"),t.closest("li.toctree-l2").addClass("current"),t.closest("li.toctree-l3").addClass("current"),t.closest("li.toctree-l4").addClass("current"),t.closest("li.toctree-l5").addClass("current"),t[0].scrollIntoView())}catch(n){console.log("Error expanding nav for anchor",n)}},onScroll:function(){this.winScroll=!1;var n=this.win.scrollTop(),e=n+this.winHeight,t=this.navBar.scrollTop()+(n-this.winPosition);n<0||e>this.docHeight||(this.navBar.scrollTop(t),this.winPosition=n)},onResize:function(){this.winResize=!1,this.winHeight=this.win.height(),this.docHeight=$(document).height()},hashChange:function(){this.linkScroll=!0,this.win.one("hashchange",(function(){this.linkScroll=!1}))},toggleCurrent:function(n){var e=n.closest("li");e.siblings("li.current").removeClass("current"),e.siblings().find("li.current").removeClass("current");var t=e.find("> ul li");t.length&&(t.removeClass("current"),e.toggleClass("current"))}},"undefined"!=typeof window&&(window.SphinxRtdTheme={Navigation:n.exports.ThemeNav,StickyNav:n.exports.ThemeNav}),function(){for(var n=0,e=["ms","moz","webkit","o"],t=0;t<e.length&&!window.requestAnimationFrame;++t)window.requestAnimationFrame=window[e[t]+"RequestAnimationFrame"],window.cancelAnimationFrame=window[e[t]+"CancelAnimationFrame"]||window[e[t]+"CancelRequestAnimationFrame"];window.requestAnimationFrame||(window.requestAnimationFrame=function(e,t){var i=(new Date).getTime(),o=Math.max(0,16-(i-n)),r=window.setTimeout((function(){e(i+o)}),o);return n=i+o,r}),window.cancelAnimationFrame||(window.cancelAnimationFrame=function(n){clearTimeout(n)})}()}).call(window)},function(n,e){n.exports=jQuery},function(n,e,t){}]);
\ No newline at end of file
+!function(n){var e={};function t(i){if(e[i])return e[i].exports;var o=e[i]={i:i,l:!1,exports:{}};return n[i].call(o.exports,o,o.exports,t),o.l=!0,o.exports}t.m=n,t.c=e,t.d=function(n,e,i){t.o(n,e)||Object.defineProperty(n,e,{enumerable:!0,get:i})},t.r=function(n){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(n,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(n,"__esModule",{value:!0})},t.t=function(n,e){if(1&e&&(n=t(n)),8&e)return n;if(4&e&&"object"==typeof n&&n&&n.__esModule)return n;var i=Object.create(null);if(t.r(i),Object.defineProperty(i,"default",{enumerable:!0,value:n}),2&e&&"string"!=typeof n)for(var o in n)t.d(i,o,function(e){return n[e]}.bind(null,o));return i},t.n=function(n){var e=n&&n.__esModule?function(){return n.default}:function(){return n};return t.d(e,"a",e),e},t.o=function(n,e){return Object.prototype.hasOwnProperty.call(n,e)},t.p="",t(t.s=0)}([function(n,e,t){t(1),n.exports=t(3)},function(n,e,t){(function(){var e="undefined"!=typeof window?window.jQuery:t(2);n.exports.ThemeNav={navBar:null,win:null,winScroll:!1,winResize:!1,linkScroll:!1,winPosition:0,winHeight:null,docHeight:null,isRunning:!1,enable:function(n){var t=this;void 0===n&&(n=!0),t.isRunning||(t.isRunning=!0,e((function(e){t.init(e),t.reset(),t.win.on("hashchange",t.reset),n&&t.win.on("scroll",(function(){t.linkScroll||t.winScroll||(t.winScroll=!0,requestAnimationFrame((function(){t.onScroll()})))})),t.win.on("resize",(function(){t.winResize||(t.winResize=!0,requestAnimationFrame((function(){t.onResize()})))})),t.onResize()})))},enableSticky:function(){this.enable(!0)},init:function(n){n(document);var e=this;this.navBar=n("div.wy-side-scroll:first"),this.win=n(window),n(document).on("click","[data-toggle='wy-nav-top']",(function(){n("[data-toggle='wy-nav-shift']").toggleClass("shift"),n("[data-toggle='rst-versions']").toggleClass("shift")})).on("click",".wy-menu-vertical .current ul li a",(function(){var t=n(this);n("[data-toggle='wy-nav-shift']").removeClass("shift"),n("[data-toggle='rst-versions']").toggleClass("shift"),e.toggleCurrent(t),e.hashChange()})).on("click","[data-toggle='rst-current-version']",(function(){n("[data-toggle='rst-versions']").toggleClass("shift-up")})),n("table.docutils:not(.field-list,.footnote,.citation)").wrap("<div class='wy-table-responsive'></div>"),n("table.docutils.footnote").wrap("<div class='wy-table-responsive footnote'></div>"),n("table.docutils.citation").wrap("<div class='wy-table-responsive citation'></div>"),n(".wy-menu-vertical ul").not(".simple").siblings("a").each((function(){var t=n(this);expand=n('<button class="toctree-expand" title="Open/close menu"></button>'),expand.on("click",(function(n){return e.toggleCurrent(t),n.stopPropagation(),!1})),t.prepend(expand)}))},reset:function(){var n=encodeURI(window.location.hash)||"#";try{var e=$(".wy-menu-vertical"),t=e.find('[href="'+n+'"]');if(0===t.length){var i=$('.document [id="'+n.substring(1)+'"]').closest("div.section");0===(t=e.find('[href="#'+i.attr("id")+'"]')).length&&(t=e.find('[href="#"]'))}if(t.length>0){$(".wy-menu-vertical .current").removeClass("current").attr("aria-expanded","false"),t.addClass("current").attr("aria-expanded","true"),t.closest("li.toctree-l1").parent().addClass("current").attr("aria-expanded","true");for(let n=1;n<=10;n++)t.closest("li.toctree-l"+n).addClass("current").attr("aria-expanded","true");t[0].scrollIntoView()}}catch(n){console.log("Error expanding nav for anchor",n)}},onScroll:function(){this.winScroll=!1;var n=this.win.scrollTop(),e=n+this.winHeight,t=this.navBar.scrollTop()+(n-this.winPosition);n<0||e>this.docHeight||(this.navBar.scrollTop(t),this.winPosition=n)},onResize:function(){this.winResize=!1,this.winHeight=this.win.height(),this.docHeight=$(document).height()},hashChange:function(){this.linkScroll=!0,this.win.one("hashchange",(function(){this.linkScroll=!1}))},toggleCurrent:function(n){var e=n.closest("li");e.siblings("li.current").removeClass("current").attr("aria-expanded","false"),e.siblings().find("li.current").removeClass("current").attr("aria-expanded","false");var t=e.find("> ul li");t.length&&(t.removeClass("current").attr("aria-expanded","false"),e.toggleClass("current").attr("aria-expanded",(function(n,e){return"true"==e?"false":"true"})))}},"undefined"!=typeof window&&(window.SphinxRtdTheme={Navigation:n.exports.ThemeNav,StickyNav:n.exports.ThemeNav}),function(){for(var n=0,e=["ms","moz","webkit","o"],t=0;t<e.length&&!window.requestAnimationFrame;++t)window.requestAnimationFrame=window[e[t]+"RequestAnimationFrame"],window.cancelAnimationFrame=window[e[t]+"CancelAnimationFrame"]||window[e[t]+"CancelRequestAnimationFrame"];window.requestAnimationFrame||(window.requestAnimationFrame=function(e,t){var i=(new Date).getTime(),o=Math.max(0,16-(i-n)),r=window.setTimeout((function(){e(i+o)}),o);return n=i+o,r}),window.cancelAnimationFrame||(window.cancelAnimationFrame=function(n){clearTimeout(n)})}()}).call(window)},function(n,e){n.exports=jQuery},function(n,e,t){}]);
\ No newline at end of file
diff --git a/_static/language_data.js b/_static/language_data.js
index 863704b310..367b8ed81b 100644
--- a/_static/language_data.js
+++ b/_static/language_data.js
@@ -5,15 +5,15 @@
  * This script contains the language-specific data used by searchtools.js,
  * namely the list of stopwords, stemmer, scorer and splitter.
  *
- * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2024 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
 
-var stopwords = ["a","and","are","as","at","be","but","by","for","if","in","into","is","it","near","no","not","of","on","or","such","that","the","their","then","there","these","they","this","to","was","will","with"];
+var stopwords = ["a", "and", "are", "as", "at", "be", "but", "by", "for", "if", "in", "into", "is", "it", "near", "no", "not", "of", "on", "or", "such", "that", "the", "their", "then", "there", "these", "they", "this", "to", "was", "will", "with"];
 
 
-/* Non-minified version is copied as a separate JS file, is available */
+/* Non-minified version is copied as a separate JS file, if available */
 
 /**
  * Porter Stemmer
@@ -197,101 +197,3 @@ var Stemmer = function() {
   }
 }
 
-
-
-
-var splitChars = (function() {
-    var result = {};
-    var singles = [96, 180, 187, 191, 215, 247, 749, 885, 903, 907, 909, 930, 1014, 1648,
-         1748, 1809, 2416, 2473, 2481, 2526, 2601, 2609, 2612, 2615, 2653, 2702,
-         2706, 2729, 2737, 2740, 2857, 2865, 2868, 2910, 2928, 2948, 2961, 2971,
-         2973, 3085, 3089, 3113, 3124, 3213, 3217, 3241, 3252, 3295, 3341, 3345,
-         3369, 3506, 3516, 3633, 3715, 3721, 3736, 3744, 3748, 3750, 3756, 3761,
-         3781, 3912, 4239, 4347, 4681, 4695, 4697, 4745, 4785, 4799, 4801, 4823,
-         4881, 5760, 5901, 5997, 6313, 7405, 8024, 8026, 8028, 8030, 8117, 8125,
-         8133, 8181, 8468, 8485, 8487, 8489, 8494, 8527, 11311, 11359, 11687, 11695,
-         11703, 11711, 11719, 11727, 11735, 12448, 12539, 43010, 43014, 43019, 43587,
-         43696, 43713, 64286, 64297, 64311, 64317, 64319, 64322, 64325, 65141];
-    var i, j, start, end;
-    for (i = 0; i < singles.length; i++) {
-        result[singles[i]] = true;
-    }
-    var ranges = [[0, 47], [58, 64], [91, 94], [123, 169], [171, 177], [182, 184], [706, 709],
-         [722, 735], [741, 747], [751, 879], [888, 889], [894, 901], [1154, 1161],
-         [1318, 1328], [1367, 1368], [1370, 1376], [1416, 1487], [1515, 1519], [1523, 1568],
-         [1611, 1631], [1642, 1645], [1750, 1764], [1767, 1773], [1789, 1790], [1792, 1807],
-         [1840, 1868], [1958, 1968], [1970, 1983], [2027, 2035], [2038, 2041], [2043, 2047],
-         [2070, 2073], [2075, 2083], [2085, 2087], [2089, 2307], [2362, 2364], [2366, 2383],
-         [2385, 2391], [2402, 2405], [2419, 2424], [2432, 2436], [2445, 2446], [2449, 2450],
-         [2483, 2485], [2490, 2492], [2494, 2509], [2511, 2523], [2530, 2533], [2546, 2547],
-         [2554, 2564], [2571, 2574], [2577, 2578], [2618, 2648], [2655, 2661], [2672, 2673],
-         [2677, 2692], [2746, 2748], [2750, 2767], [2769, 2783], [2786, 2789], [2800, 2820],
-         [2829, 2830], [2833, 2834], [2874, 2876], [2878, 2907], [2914, 2917], [2930, 2946],
-         [2955, 2957], [2966, 2968], [2976, 2978], [2981, 2983], [2987, 2989], [3002, 3023],
-         [3025, 3045], [3059, 3076], [3130, 3132], [3134, 3159], [3162, 3167], [3170, 3173],
-         [3184, 3191], [3199, 3204], [3258, 3260], [3262, 3293], [3298, 3301], [3312, 3332],
-         [3386, 3388], [3390, 3423], [3426, 3429], [3446, 3449], [3456, 3460], [3479, 3481],
-         [3518, 3519], [3527, 3584], [3636, 3647], [3655, 3663], [3674, 3712], [3717, 3718],
-         [3723, 3724], [3726, 3731], [3752, 3753], [3764, 3772], [3774, 3775], [3783, 3791],
-         [3802, 3803], [3806, 3839], [3841, 3871], [3892, 3903], [3949, 3975], [3980, 4095],
-         [4139, 4158], [4170, 4175], [4182, 4185], [4190, 4192], [4194, 4196], [4199, 4205],
-         [4209, 4212], [4226, 4237], [4250, 4255], [4294, 4303], [4349, 4351], [4686, 4687],
-         [4702, 4703], [4750, 4751], [4790, 4791], [4806, 4807], [4886, 4887], [4955, 4968],
-         [4989, 4991], [5008, 5023], [5109, 5120], [5741, 5742], [5787, 5791], [5867, 5869],
-         [5873, 5887], [5906, 5919], [5938, 5951], [5970, 5983], [6001, 6015], [6068, 6102],
-         [6104, 6107], [6109, 6111], [6122, 6127], [6138, 6159], [6170, 6175], [6264, 6271],
-         [6315, 6319], [6390, 6399], [6429, 6469], [6510, 6511], [6517, 6527], [6572, 6592],
-         [6600, 6607], [6619, 6655], [6679, 6687], [6741, 6783], [6794, 6799], [6810, 6822],
-         [6824, 6916], [6964, 6980], [6988, 6991], [7002, 7042], [7073, 7085], [7098, 7167],
-         [7204, 7231], [7242, 7244], [7294, 7400], [7410, 7423], [7616, 7679], [7958, 7959],
-         [7966, 7967], [8006, 8007], [8014, 8015], [8062, 8063], [8127, 8129], [8141, 8143],
-         [8148, 8149], [8156, 8159], [8173, 8177], [8189, 8303], [8306, 8307], [8314, 8318],
-         [8330, 8335], [8341, 8449], [8451, 8454], [8456, 8457], [8470, 8472], [8478, 8483],
-         [8506, 8507], [8512, 8516], [8522, 8525], [8586, 9311], [9372, 9449], [9472, 10101],
-         [10132, 11263], [11493, 11498], [11503, 11516], [11518, 11519], [11558, 11567],
-         [11622, 11630], [11632, 11647], [11671, 11679], [11743, 11822], [11824, 12292],
-         [12296, 12320], [12330, 12336], [12342, 12343], [12349, 12352], [12439, 12444],
-         [12544, 12548], [12590, 12592], [12687, 12689], [12694, 12703], [12728, 12783],
-         [12800, 12831], [12842, 12880], [12896, 12927], [12938, 12976], [12992, 13311],
-         [19894, 19967], [40908, 40959], [42125, 42191], [42238, 42239], [42509, 42511],
-         [42540, 42559], [42592, 42593], [42607, 42622], [42648, 42655], [42736, 42774],
-         [42784, 42785], [42889, 42890], [42893, 43002], [43043, 43055], [43062, 43071],
-         [43124, 43137], [43188, 43215], [43226, 43249], [43256, 43258], [43260, 43263],
-         [43302, 43311], [43335, 43359], [43389, 43395], [43443, 43470], [43482, 43519],
-         [43561, 43583], [43596, 43599], [43610, 43615], [43639, 43641], [43643, 43647],
-         [43698, 43700], [43703, 43704], [43710, 43711], [43715, 43738], [43742, 43967],
-         [44003, 44015], [44026, 44031], [55204, 55215], [55239, 55242], [55292, 55295],
-         [57344, 63743], [64046, 64047], [64110, 64111], [64218, 64255], [64263, 64274],
-         [64280, 64284], [64434, 64466], [64830, 64847], [64912, 64913], [64968, 65007],
-         [65020, 65135], [65277, 65295], [65306, 65312], [65339, 65344], [65371, 65381],
-         [65471, 65473], [65480, 65481], [65488, 65489], [65496, 65497]];
-    for (i = 0; i < ranges.length; i++) {
-        start = ranges[i][0];
-        end = ranges[i][1];
-        for (j = start; j <= end; j++) {
-            result[j] = true;
-        }
-    }
-    return result;
-})();
-
-function splitQuery(query) {
-    var result = [];
-    var start = -1;
-    for (var i = 0; i < query.length; i++) {
-        if (splitChars[query.charCodeAt(i)]) {
-            if (start !== -1) {
-                result.push(query.slice(start, i));
-                start = -1;
-            }
-        } else if (start === -1) {
-            start = i;
-        }
-    }
-    if (start !== -1) {
-        result.push(query.slice(start));
-    }
-    return result;
-}
-
-
diff --git a/_static/pygments.css b/_static/pygments.css
index 08bec689d3..84ab3030a9 100644
--- a/_static/pygments.css
+++ b/_static/pygments.css
@@ -17,6 +17,7 @@ span.linenos.special { color: #000000; background-color: #ffffc0; padding-left:
 .highlight .cs { color: #3D7B7B; font-style: italic } /* Comment.Special */
 .highlight .gd { color: #A00000 } /* Generic.Deleted */
 .highlight .ge { font-style: italic } /* Generic.Emph */
+.highlight .ges { font-weight: bold; font-style: italic } /* Generic.EmphStrong */
 .highlight .gr { color: #E40000 } /* Generic.Error */
 .highlight .gh { color: #000080; font-weight: bold } /* Generic.Heading */
 .highlight .gi { color: #008400 } /* Generic.Inserted */
diff --git a/_static/searchtools.js b/_static/searchtools.js
index 7dbc787d38..b08d58c9b9 100644
--- a/_static/searchtools.js
+++ b/_static/searchtools.js
@@ -4,22 +4,24 @@
  *
  * Sphinx JavaScript utilities for the full-text search.
  *
- * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2024 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
+"use strict";
 
-if (!Scorer) {
-  /**
-   * Simple result scoring code.
-   */
+/**
+ * Simple result scoring code.
+ */
+if (typeof Scorer === "undefined") {
   var Scorer = {
     // Implement the following function to further tweak the score for each result
-    // The function takes a result array [filename, title, anchor, descr, score]
+    // The function takes a result array [docname, title, anchor, descr, score, filename]
     // and returns the new score.
     /*
-    score: function(result) {
-      return result[4];
+    score: result => {
+      const [docname, title, anchor, descr, score, filename] = result
+      return score
     },
     */
 
@@ -28,9 +30,11 @@ if (!Scorer) {
     // or matches in the last dotted part of the object name
     objPartialMatch: 6,
     // Additive scores depending on the priority of the object
-    objPrio: {0:  15,   // used to be importantResults
-              1:  5,   // used to be objectResults
-              2: -5},  // used to be unimportantResults
+    objPrio: {
+      0: 15, // used to be importantResults
+      1: 5, // used to be objectResults
+      2: -5, // used to be unimportantResults
+    },
     //  Used when the priority is not in the mapping.
     objPrioDefault: 0,
 
@@ -39,459 +43,549 @@ if (!Scorer) {
     partialTitle: 7,
     // query found in terms
     term: 5,
-    partialTerm: 2
+    partialTerm: 2,
   };
 }
 
-if (!splitQuery) {
-  function splitQuery(query) {
-    return query.split(/\s+/);
+const _removeChildren = (element) => {
+  while (element && element.lastChild) element.removeChild(element.lastChild);
+};
+
+/**
+ * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions#escaping
+ */
+const _escapeRegExp = (string) =>
+  string.replace(/[.*+\-?^${}()|[\]\\]/g, "\\$&"); // $& means the whole matched string
+
+const _displayItem = (item, searchTerms, highlightTerms) => {
+  const docBuilder = DOCUMENTATION_OPTIONS.BUILDER;
+  const docFileSuffix = DOCUMENTATION_OPTIONS.FILE_SUFFIX;
+  const docLinkSuffix = DOCUMENTATION_OPTIONS.LINK_SUFFIX;
+  const showSearchSummary = DOCUMENTATION_OPTIONS.SHOW_SEARCH_SUMMARY;
+  const contentRoot = document.documentElement.dataset.content_root;
+
+  const [docName, title, anchor, descr, score, _filename] = item;
+
+  let listItem = document.createElement("li");
+  let requestUrl;
+  let linkUrl;
+  if (docBuilder === "dirhtml") {
+    // dirhtml builder
+    let dirname = docName + "/";
+    if (dirname.match(/\/index\/$/))
+      dirname = dirname.substring(0, dirname.length - 6);
+    else if (dirname === "index/") dirname = "";
+    requestUrl = contentRoot + dirname;
+    linkUrl = requestUrl;
+  } else {
+    // normal html builders
+    requestUrl = contentRoot + docName + docFileSuffix;
+    linkUrl = docName + docLinkSuffix;
+  }
+  let linkEl = listItem.appendChild(document.createElement("a"));
+  linkEl.href = linkUrl + anchor;
+  linkEl.dataset.score = score;
+  linkEl.innerHTML = title;
+  if (descr) {
+    listItem.appendChild(document.createElement("span")).innerHTML =
+      " (" + descr + ")";
+    // highlight search terms in the description
+    if (SPHINX_HIGHLIGHT_ENABLED)  // set in sphinx_highlight.js
+      highlightTerms.forEach((term) => _highlightText(listItem, term, "highlighted"));
   }
+  else if (showSearchSummary)
+    fetch(requestUrl)
+      .then((responseData) => responseData.text())
+      .then((data) => {
+        if (data)
+          listItem.appendChild(
+            Search.makeSearchSummary(data, searchTerms, anchor)
+          );
+        // highlight search terms in the summary
+        if (SPHINX_HIGHLIGHT_ENABLED)  // set in sphinx_highlight.js
+          highlightTerms.forEach((term) => _highlightText(listItem, term, "highlighted"));
+      });
+  Search.output.appendChild(listItem);
+};
+const _finishSearch = (resultCount) => {
+  Search.stopPulse();
+  Search.title.innerText = _("Search Results");
+  if (!resultCount)
+    Search.status.innerText = Documentation.gettext(
+      "Your search did not match any documents. Please make sure that all words are spelled correctly and that you've selected enough categories."
+    );
+  else
+    Search.status.innerText = _(
+      "Search finished, found ${resultCount} page(s) matching the search query."
+    ).replace('${resultCount}', resultCount);
+};
+const _displayNextItem = (
+  results,
+  resultCount,
+  searchTerms,
+  highlightTerms,
+) => {
+  // results left, load the summary and display it
+  // this is intended to be dynamic (don't sub resultsCount)
+  if (results.length) {
+    _displayItem(results.pop(), searchTerms, highlightTerms);
+    setTimeout(
+      () => _displayNextItem(results, resultCount, searchTerms, highlightTerms),
+      5
+    );
+  }
+  // search finished, update title and status message
+  else _finishSearch(resultCount);
+};
+// Helper function used by query() to order search results.
+// Each input is an array of [docname, title, anchor, descr, score, filename].
+// Order the results by score (in opposite order of appearance, since the
+// `_displayNextItem` function uses pop() to retrieve items) and then alphabetically.
+const _orderResultsByScoreThenName = (a, b) => {
+  const leftScore = a[4];
+  const rightScore = b[4];
+  if (leftScore === rightScore) {
+    // same score: sort alphabetically
+    const leftTitle = a[1].toLowerCase();
+    const rightTitle = b[1].toLowerCase();
+    if (leftTitle === rightTitle) return 0;
+    return leftTitle > rightTitle ? -1 : 1; // inverted is intentional
+  }
+  return leftScore > rightScore ? 1 : -1;
+};
+
+/**
+ * Default splitQuery function. Can be overridden in ``sphinx.search`` with a
+ * custom function per language.
+ *
+ * The regular expression works by splitting the string on consecutive characters
+ * that are not Unicode letters, numbers, underscores, or emoji characters.
+ * This is the same as ``\W+`` in Python, preserving the surrogate pair area.
+ */
+if (typeof splitQuery === "undefined") {
+  var splitQuery = (query) => query
+      .split(/[^\p{Letter}\p{Number}_\p{Emoji_Presentation}]+/gu)
+      .filter(term => term)  // remove remaining empty strings
 }
 
 /**
  * Search Module
  */
-var Search = {
-
-  _index : null,
-  _queued_query : null,
-  _pulse_status : -1,
-
-  htmlToText : function(htmlString) {
-      var virtualDocument = document.implementation.createHTMLDocument('virtual');
-      var htmlElement = $(htmlString, virtualDocument);
-      htmlElement.find('.headerlink').remove();
-      docContent = htmlElement.find('[role=main]')[0];
-      if(docContent === undefined) {
-          console.warn("Content block not found. Sphinx search tries to obtain it " +
-                       "via '[role=main]'. Could you check your theme or template.");
-          return "";
-      }
-      return docContent.textContent || docContent.innerText;
-  },
+const Search = {
+  _index: null,
+  _queued_query: null,
+  _pulse_status: -1,
+
+  htmlToText: (htmlString, anchor) => {
+    const htmlElement = new DOMParser().parseFromString(htmlString, 'text/html');
+    for (const removalQuery of [".headerlink", "script", "style"]) {
+      htmlElement.querySelectorAll(removalQuery).forEach((el) => { el.remove() });
+    }
+    if (anchor) {
+      const anchorContent = htmlElement.querySelector(`[role="main"] ${anchor}`);
+      if (anchorContent) return anchorContent.textContent;
 
-  init : function() {
-      var params = $.getQueryParameters();
-      if (params.q) {
-          var query = params.q[0];
-          $('input[name="q"]')[0].value = query;
-          this.performSearch(query);
-      }
+      console.warn(
+        `Anchored content block not found. Sphinx search tries to obtain it via DOM query '[role=main] ${anchor}'. Check your theme or template.`
+      );
+    }
+
+    // if anchor not specified or not found, fall back to main content
+    const docContent = htmlElement.querySelector('[role="main"]');
+    if (docContent) return docContent.textContent;
+
+    console.warn(
+      "Content block not found. Sphinx search tries to obtain it via DOM query '[role=main]'. Check your theme or template."
+    );
+    return "";
   },
 
-  loadIndex : function(url) {
-    $.ajax({type: "GET", url: url, data: null,
-            dataType: "script", cache: true,
-            complete: function(jqxhr, textstatus) {
-              if (textstatus != "success") {
-                document.getElementById("searchindexloader").src = url;
-              }
-            }});
+  init: () => {
+    const query = new URLSearchParams(window.location.search).get("q");
+    document
+      .querySelectorAll('input[name="q"]')
+      .forEach((el) => (el.value = query));
+    if (query) Search.performSearch(query);
   },
 
-  setIndex : function(index) {
-    var q;
-    this._index = index;
-    if ((q = this._queued_query) !== null) {
-      this._queued_query = null;
-      Search.query(q);
+  loadIndex: (url) =>
+    (document.body.appendChild(document.createElement("script")).src = url),
+
+  setIndex: (index) => {
+    Search._index = index;
+    if (Search._queued_query !== null) {
+      const query = Search._queued_query;
+      Search._queued_query = null;
+      Search.query(query);
     }
   },
 
-  hasIndex : function() {
-      return this._index !== null;
-  },
+  hasIndex: () => Search._index !== null,
 
-  deferQuery : function(query) {
-      this._queued_query = query;
-  },
+  deferQuery: (query) => (Search._queued_query = query),
 
-  stopPulse : function() {
-      this._pulse_status = 0;
-  },
+  stopPulse: () => (Search._pulse_status = -1),
 
-  startPulse : function() {
-    if (this._pulse_status >= 0)
-        return;
-    function pulse() {
-      var i;
+  startPulse: () => {
+    if (Search._pulse_status >= 0) return;
+
+    const pulse = () => {
       Search._pulse_status = (Search._pulse_status + 1) % 4;
-      var dotString = '';
-      for (i = 0; i < Search._pulse_status; i++)
-        dotString += '.';
-      Search.dots.text(dotString);
-      if (Search._pulse_status > -1)
-        window.setTimeout(pulse, 500);
-    }
+      Search.dots.innerText = ".".repeat(Search._pulse_status);
+      if (Search._pulse_status >= 0) window.setTimeout(pulse, 500);
+    };
     pulse();
   },
 
   /**
    * perform a search for something (or wait until index is loaded)
    */
-  performSearch : function(query) {
+  performSearch: (query) => {
     // create the required interface elements
-    this.out = $('#search-results');
-    this.title = $('<h2>' + _('Searching') + '</h2>').appendTo(this.out);
-    this.dots = $('<span></span>').appendTo(this.title);
-    this.status = $('<p class="search-summary">&nbsp;</p>').appendTo(this.out);
-    this.output = $('<ul class="search"/>').appendTo(this.out);
-
-    $('#search-progress').text(_('Preparing search...'));
-    this.startPulse();
+    const searchText = document.createElement("h2");
+    searchText.textContent = _("Searching");
+    const searchSummary = document.createElement("p");
+    searchSummary.classList.add("search-summary");
+    searchSummary.innerText = "";
+    const searchList = document.createElement("ul");
+    searchList.classList.add("search");
+
+    const out = document.getElementById("search-results");
+    Search.title = out.appendChild(searchText);
+    Search.dots = Search.title.appendChild(document.createElement("span"));
+    Search.status = out.appendChild(searchSummary);
+    Search.output = out.appendChild(searchList);
+
+    const searchProgress = document.getElementById("search-progress");
+    // Some themes don't use the search progress node
+    if (searchProgress) {
+      searchProgress.innerText = _("Preparing search...");
+    }
+    Search.startPulse();
 
     // index already loaded, the browser was quick!
-    if (this.hasIndex())
-      this.query(query);
-    else
-      this.deferQuery(query);
+    if (Search.hasIndex()) Search.query(query);
+    else Search.deferQuery(query);
   },
 
-  /**
-   * execute search (requires search index to be loaded)
-   */
-  query : function(query) {
-    var i;
-
-    // stem the searchterms and add them to the correct list
-    var stemmer = new Stemmer();
-    var searchterms = [];
-    var excluded = [];
-    var hlterms = [];
-    var tmp = splitQuery(query);
-    var objectterms = [];
-    for (i = 0; i < tmp.length; i++) {
-      if (tmp[i] !== "") {
-          objectterms.push(tmp[i].toLowerCase());
-      }
+  _parseQuery: (query) => {
+    // stem the search terms and add them to the correct list
+    const stemmer = new Stemmer();
+    const searchTerms = new Set();
+    const excludedTerms = new Set();
+    const highlightTerms = new Set();
+    const objectTerms = new Set(splitQuery(query.toLowerCase().trim()));
+    splitQuery(query.trim()).forEach((queryTerm) => {
+      const queryTermLower = queryTerm.toLowerCase();
+
+      // maybe skip this "word"
+      // stopwords array is from language_data.js
+      if (
+        stopwords.indexOf(queryTermLower) !== -1 ||
+        queryTerm.match(/^\d+$/)
+      )
+        return;
 
-      if ($u.indexOf(stopwords, tmp[i].toLowerCase()) != -1 || tmp[i] === "") {
-        // skip this "word"
-        continue;
-      }
       // stem the word
-      var word = stemmer.stemWord(tmp[i].toLowerCase());
-      // prevent stemmer from cutting word smaller than two chars
-      if(word.length < 3 && tmp[i].length >= 3) {
-        word = tmp[i];
-      }
-      var toAppend;
+      let word = stemmer.stemWord(queryTermLower);
       // select the correct list
-      if (word[0] == '-') {
-        toAppend = excluded;
-        word = word.substr(1);
-      }
+      if (word[0] === "-") excludedTerms.add(word.substr(1));
       else {
-        toAppend = searchterms;
-        hlterms.push(tmp[i].toLowerCase());
+        searchTerms.add(word);
+        highlightTerms.add(queryTermLower);
       }
-      // only add if not already in the list
-      if (!$u.contains(toAppend, word))
-        toAppend.push(word);
+    });
+
+    if (SPHINX_HIGHLIGHT_ENABLED) {  // set in sphinx_highlight.js
+      localStorage.setItem("sphinx_highlight_terms", [...highlightTerms].join(" "))
     }
-    var highlightstring = '?highlight=' + $.urlencode(hlterms.join(" "));
 
-    // console.debug('SEARCH: searching for:');
-    // console.info('required: ', searchterms);
-    // console.info('excluded: ', excluded);
+    // console.debug("SEARCH: searching for:");
+    // console.info("required: ", [...searchTerms]);
+    // console.info("excluded: ", [...excludedTerms]);
 
-    // prepare search
-    var terms = this._index.terms;
-    var titleterms = this._index.titleterms;
+    return [query, searchTerms, excludedTerms, highlightTerms, objectTerms];
+  },
 
-    // array of [filename, title, anchor, descr, score]
-    var results = [];
-    $('#search-progress').empty();
+  /**
+   * execute search (requires search index to be loaded)
+   */
+  _performSearch: (query, searchTerms, excludedTerms, highlightTerms, objectTerms) => {
+    const filenames = Search._index.filenames;
+    const docNames = Search._index.docnames;
+    const titles = Search._index.titles;
+    const allTitles = Search._index.alltitles;
+    const indexEntries = Search._index.indexentries;
+
+    // Collect multiple result groups to be sorted separately and then ordered.
+    // Each is an array of [docname, title, anchor, descr, score, filename].
+    const normalResults = [];
+    const nonMainIndexResults = [];
+
+    _removeChildren(document.getElementById("search-progress"));
+
+    const queryLower = query.toLowerCase().trim();
+    for (const [title, foundTitles] of Object.entries(allTitles)) {
+      if (title.toLowerCase().trim().includes(queryLower) && (queryLower.length >= title.length/2)) {
+        for (const [file, id] of foundTitles) {
+          const score = Math.round(Scorer.title * queryLower.length / title.length);
+          const boost = titles[file] === title ? 1 : 0;  // add a boost for document titles
+          normalResults.push([
+            docNames[file],
+            titles[file] !== title ? `${titles[file]} > ${title}` : title,
+            id !== null ? "#" + id : "",
+            null,
+            score + boost,
+            filenames[file],
+          ]);
+        }
+      }
+    }
 
-    // lookup as object
-    for (i = 0; i < objectterms.length; i++) {
-      var others = [].concat(objectterms.slice(0, i),
-                             objectterms.slice(i+1, objectterms.length));
-      results = results.concat(this.performObjectSearch(objectterms[i], others));
+    // search for explicit entries in index directives
+    for (const [entry, foundEntries] of Object.entries(indexEntries)) {
+      if (entry.includes(queryLower) && (queryLower.length >= entry.length/2)) {
+        for (const [file, id, isMain] of foundEntries) {
+          const score = Math.round(100 * queryLower.length / entry.length);
+          const result = [
+            docNames[file],
+            titles[file],
+            id ? "#" + id : "",
+            null,
+            score,
+            filenames[file],
+          ];
+          if (isMain) {
+            normalResults.push(result);
+          } else {
+            nonMainIndexResults.push(result);
+          }
+        }
+      }
     }
 
+    // lookup as object
+    objectTerms.forEach((term) =>
+      normalResults.push(...Search.performObjectSearch(term, objectTerms))
+    );
+
     // lookup as search terms in fulltext
-    results = results.concat(this.performTermsSearch(searchterms, excluded, terms, titleterms));
+    normalResults.push(...Search.performTermsSearch(searchTerms, excludedTerms));
 
     // let the scorer override scores with a custom scoring function
     if (Scorer.score) {
-      for (i = 0; i < results.length; i++)
-        results[i][4] = Scorer.score(results[i]);
+      normalResults.forEach((item) => (item[4] = Scorer.score(item)));
+      nonMainIndexResults.forEach((item) => (item[4] = Scorer.score(item)));
     }
 
-    // now sort the results by score (in opposite order of appearance, since the
-    // display function below uses pop() to retrieve items) and then
-    // alphabetically
-    results.sort(function(a, b) {
-      var left = a[4];
-      var right = b[4];
-      if (left > right) {
-        return 1;
-      } else if (left < right) {
-        return -1;
-      } else {
-        // same score: sort alphabetically
-        left = a[1].toLowerCase();
-        right = b[1].toLowerCase();
-        return (left > right) ? -1 : ((left < right) ? 1 : 0);
+    // Sort each group of results by score and then alphabetically by name.
+    normalResults.sort(_orderResultsByScoreThenName);
+    nonMainIndexResults.sort(_orderResultsByScoreThenName);
+
+    // Combine the result groups in (reverse) order.
+    // Non-main index entries are typically arbitrary cross-references,
+    // so display them after other results.
+    let results = [...nonMainIndexResults, ...normalResults];
+
+    // remove duplicate search results
+    // note the reversing of results, so that in the case of duplicates, the highest-scoring entry is kept
+    let seen = new Set();
+    results = results.reverse().reduce((acc, result) => {
+      let resultStr = result.slice(0, 4).concat([result[5]]).map(v => String(v)).join(',');
+      if (!seen.has(resultStr)) {
+        acc.push(result);
+        seen.add(resultStr);
       }
-    });
+      return acc;
+    }, []);
+
+    return results.reverse();
+  },
+
+  query: (query) => {
+    const [searchQuery, searchTerms, excludedTerms, highlightTerms, objectTerms] = Search._parseQuery(query);
+    const results = Search._performSearch(searchQuery, searchTerms, excludedTerms, highlightTerms, objectTerms);
 
     // for debugging
     //Search.lastresults = results.slice();  // a copy
-    //console.info('search results:', Search.lastresults);
+    // console.info("search results:", Search.lastresults);
 
     // print the results
-    var resultCount = results.length;
-    function displayNextItem() {
-      // results left, load the summary and display it
-      if (results.length) {
-        var item = results.pop();
-        var listItem = $('<li></li>');
-        var requestUrl = "";
-        var linkUrl = "";
-        if (DOCUMENTATION_OPTIONS.BUILDER === 'dirhtml') {
-          // dirhtml builder
-          var dirname = item[0] + '/';
-          if (dirname.match(/\/index\/$/)) {
-            dirname = dirname.substring(0, dirname.length-6);
-          } else if (dirname == 'index/') {
-            dirname = '';
-          }
-          requestUrl = DOCUMENTATION_OPTIONS.URL_ROOT + dirname;
-          linkUrl = requestUrl;
-
-        } else {
-          // normal html builders
-          requestUrl = DOCUMENTATION_OPTIONS.URL_ROOT + item[0] + DOCUMENTATION_OPTIONS.FILE_SUFFIX;
-          linkUrl = item[0] + DOCUMENTATION_OPTIONS.LINK_SUFFIX;
-        }
-        listItem.append($('<a/>').attr('href',
-            linkUrl +
-            highlightstring + item[2]).html(item[1]));
-        if (item[3]) {
-          listItem.append($('<span> (' + item[3] + ')</span>'));
-          Search.output.append(listItem);
-          setTimeout(function() {
-            displayNextItem();
-          }, 5);
-        } else if (DOCUMENTATION_OPTIONS.HAS_SOURCE) {
-          $.ajax({url: requestUrl,
-                  dataType: "text",
-                  complete: function(jqxhr, textstatus) {
-                    var data = jqxhr.responseText;
-                    if (data !== '' && data !== undefined) {
-                      var summary = Search.makeSearchSummary(data, searchterms, hlterms);
-                      if (summary) {
-                        listItem.append(summary);
-                      }
-                    }
-                    Search.output.append(listItem);
-                    setTimeout(function() {
-                      displayNextItem();
-                    }, 5);
-                  }});
-        } else {
-          // no source available, just display title
-          Search.output.append(listItem);
-          setTimeout(function() {
-            displayNextItem();
-          }, 5);
-        }
-      }
-      // search finished, update title and status message
-      else {
-        Search.stopPulse();
-        Search.title.text(_('Search Results'));
-        if (!resultCount)
-          Search.status.text(_('Your search did not match any documents. Please make sure that all words are spelled correctly and that you\'ve selected enough categories.'));
-        else
-            Search.status.text(_('Search finished, found %s page(s) matching the search query.').replace('%s', resultCount));
-        Search.status.fadeIn(500);
-      }
-    }
-    displayNextItem();
+    _displayNextItem(results, results.length, searchTerms, highlightTerms);
   },
 
   /**
    * search for object names
    */
-  performObjectSearch : function(object, otherterms) {
-    var filenames = this._index.filenames;
-    var docnames = this._index.docnames;
-    var objects = this._index.objects;
-    var objnames = this._index.objnames;
-    var titles = this._index.titles;
-
-    var i;
-    var results = [];
-
-    for (var prefix in objects) {
-      if (!(objects[prefix] instanceof Array)) {
-        objects[prefix] = Object.entries(objects[prefix]).map(([name, match]) => [...match, name]);
-      }
-      for (var iMatch = 0; iMatch != objects[prefix].length; ++iMatch) {
-        var match = objects[prefix][iMatch];
-        var name = match[4];
-        var fullname = (prefix ? prefix + '.' : '') + name;
-        var fullnameLower = fullname.toLowerCase()
-        if (fullnameLower.indexOf(object) > -1) {
-          var score = 0;
-          var parts = fullnameLower.split('.');
-          // check for different match types: exact matches of full name or
-          // "last name" (i.e. last dotted part)
-          if (fullnameLower == object || parts[parts.length - 1] == object) {
-            score += Scorer.objNameMatch;
-          // matches in last name
-          } else if (parts[parts.length - 1].indexOf(object) > -1) {
-            score += Scorer.objPartialMatch;
-          }
-          var objname = objnames[match[1]][2];
-          var title = titles[match[0]];
-          // If more than one term searched for, we require other words to be
-          // found in the name/title/description
-          if (otherterms.length > 0) {
-            var haystack = (prefix + ' ' + name + ' ' +
-                            objname + ' ' + title).toLowerCase();
-            var allfound = true;
-            for (i = 0; i < otherterms.length; i++) {
-              if (haystack.indexOf(otherterms[i]) == -1) {
-                allfound = false;
-                break;
-              }
-            }
-            if (!allfound) {
-              continue;
-            }
-          }
-          var descr = objname + _(', in ') + title;
-
-          var anchor = match[3];
-          if (anchor === '')
-            anchor = fullname;
-          else if (anchor == '-')
-            anchor = objnames[match[1]][1] + '-' + fullname;
-          // add custom score for some objects according to scorer
-          if (Scorer.objPrio.hasOwnProperty(match[2])) {
-            score += Scorer.objPrio[match[2]];
-          } else {
-            score += Scorer.objPrioDefault;
-          }
-          results.push([docnames[match[0]], fullname, '#'+anchor, descr, score, filenames[match[0]]]);
-        }
+  performObjectSearch: (object, objectTerms) => {
+    const filenames = Search._index.filenames;
+    const docNames = Search._index.docnames;
+    const objects = Search._index.objects;
+    const objNames = Search._index.objnames;
+    const titles = Search._index.titles;
+
+    const results = [];
+
+    const objectSearchCallback = (prefix, match) => {
+      const name = match[4]
+      const fullname = (prefix ? prefix + "." : "") + name;
+      const fullnameLower = fullname.toLowerCase();
+      if (fullnameLower.indexOf(object) < 0) return;
+
+      let score = 0;
+      const parts = fullnameLower.split(".");
+
+      // check for different match types: exact matches of full name or
+      // "last name" (i.e. last dotted part)
+      if (fullnameLower === object || parts.slice(-1)[0] === object)
+        score += Scorer.objNameMatch;
+      else if (parts.slice(-1)[0].indexOf(object) > -1)
+        score += Scorer.objPartialMatch; // matches in last name
+
+      const objName = objNames[match[1]][2];
+      const title = titles[match[0]];
+
+      // If more than one term searched for, we require other words to be
+      // found in the name/title/description
+      const otherTerms = new Set(objectTerms);
+      otherTerms.delete(object);
+      if (otherTerms.size > 0) {
+        const haystack = `${prefix} ${name} ${objName} ${title}`.toLowerCase();
+        if (
+          [...otherTerms].some((otherTerm) => haystack.indexOf(otherTerm) < 0)
+        )
+          return;
       }
-    }
 
+      let anchor = match[3];
+      if (anchor === "") anchor = fullname;
+      else if (anchor === "-") anchor = objNames[match[1]][1] + "-" + fullname;
+
+      const descr = objName + _(", in ") + title;
+
+      // add custom score for some objects according to scorer
+      if (Scorer.objPrio.hasOwnProperty(match[2]))
+        score += Scorer.objPrio[match[2]];
+      else score += Scorer.objPrioDefault;
+
+      results.push([
+        docNames[match[0]],
+        fullname,
+        "#" + anchor,
+        descr,
+        score,
+        filenames[match[0]],
+      ]);
+    };
+    Object.keys(objects).forEach((prefix) =>
+      objects[prefix].forEach((array) =>
+        objectSearchCallback(prefix, array)
+      )
+    );
     return results;
   },
 
-  /**
-   * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions
-   */
-  escapeRegExp : function(string) {
-    return string.replace(/[.*+\-?^${}()|[\]\\]/g, '\\$&'); // $& means the whole matched string
-  },
-
   /**
    * search for full-text terms in the index
    */
-  performTermsSearch : function(searchterms, excluded, terms, titleterms) {
-    var docnames = this._index.docnames;
-    var filenames = this._index.filenames;
-    var titles = this._index.titles;
+  performTermsSearch: (searchTerms, excludedTerms) => {
+    // prepare search
+    const terms = Search._index.terms;
+    const titleTerms = Search._index.titleterms;
+    const filenames = Search._index.filenames;
+    const docNames = Search._index.docnames;
+    const titles = Search._index.titles;
 
-    var i, j, file;
-    var fileMap = {};
-    var scoreMap = {};
-    var results = [];
+    const scoreMap = new Map();
+    const fileMap = new Map();
 
     // perform the search on the required terms
-    for (i = 0; i < searchterms.length; i++) {
-      var word = searchterms[i];
-      var files = [];
-      var _o = [
-        {files: terms[word], score: Scorer.term},
-        {files: titleterms[word], score: Scorer.title}
+    searchTerms.forEach((word) => {
+      const files = [];
+      const arr = [
+        { files: terms[word], score: Scorer.term },
+        { files: titleTerms[word], score: Scorer.title },
       ];
       // add support for partial matches
       if (word.length > 2) {
-        var word_regex = this.escapeRegExp(word);
-        for (var w in terms) {
-          if (w.match(word_regex) && !terms[word]) {
-            _o.push({files: terms[w], score: Scorer.partialTerm})
-          }
+        const escapedWord = _escapeRegExp(word);
+        if (!terms.hasOwnProperty(word)) {
+          Object.keys(terms).forEach((term) => {
+            if (term.match(escapedWord))
+              arr.push({ files: terms[term], score: Scorer.partialTerm });
+          });
         }
-        for (var w in titleterms) {
-          if (w.match(word_regex) && !titleterms[word]) {
-              _o.push({files: titleterms[w], score: Scorer.partialTitle})
-          }
+        if (!titleTerms.hasOwnProperty(word)) {
+          Object.keys(titleTerms).forEach((term) => {
+            if (term.match(escapedWord))
+              arr.push({ files: titleTerms[term], score: Scorer.partialTitle });
+          });
         }
       }
 
       // no match but word was a required one
-      if ($u.every(_o, function(o){return o.files === undefined;})) {
-        break;
-      }
+      if (arr.every((record) => record.files === undefined)) return;
+
       // found search word in contents
-      $u.each(_o, function(o) {
-        var _files = o.files;
-        if (_files === undefined)
-          return
-
-        if (_files.length === undefined)
-          _files = [_files];
-        files = files.concat(_files);
-
-        // set score for the word in each file to Scorer.term
-        for (j = 0; j < _files.length; j++) {
-          file = _files[j];
-          if (!(file in scoreMap))
-            scoreMap[file] = {};
-          scoreMap[file][word] = o.score;
-        }
+      arr.forEach((record) => {
+        if (record.files === undefined) return;
+
+        let recordFiles = record.files;
+        if (recordFiles.length === undefined) recordFiles = [recordFiles];
+        files.push(...recordFiles);
+
+        // set score for the word in each file
+        recordFiles.forEach((file) => {
+          if (!scoreMap.has(file)) scoreMap.set(file, {});
+          scoreMap.get(file)[word] = record.score;
+        });
       });
 
       // create the mapping
-      for (j = 0; j < files.length; j++) {
-        file = files[j];
-        if (file in fileMap && fileMap[file].indexOf(word) === -1)
-          fileMap[file].push(word);
-        else
-          fileMap[file] = [word];
-      }
-    }
+      files.forEach((file) => {
+        if (!fileMap.has(file)) fileMap.set(file, [word]);
+        else if (fileMap.get(file).indexOf(word) === -1) fileMap.get(file).push(word);
+      });
+    });
 
     // now check if the files don't contain excluded terms
-    for (file in fileMap) {
-      var valid = true;
-
+    const results = [];
+    for (const [file, wordList] of fileMap) {
       // check if all requirements are matched
-      var filteredTermCount = // as search terms with length < 3 are discarded: ignore
-        searchterms.filter(function(term){return term.length > 2}).length
+
+      // as search terms with length < 3 are discarded
+      const filteredTermCount = [...searchTerms].filter(
+        (term) => term.length > 2
+      ).length;
       if (
-        fileMap[file].length != searchterms.length &&
-        fileMap[file].length != filteredTermCount
-      ) continue;
+        wordList.length !== searchTerms.size &&
+        wordList.length !== filteredTermCount
+      )
+        continue;
 
       // ensure that none of the excluded terms is in the search result
-      for (i = 0; i < excluded.length; i++) {
-        if (terms[excluded[i]] == file ||
-            titleterms[excluded[i]] == file ||
-            $u.contains(terms[excluded[i]] || [], file) ||
-            $u.contains(titleterms[excluded[i]] || [], file)) {
-          valid = false;
-          break;
-        }
-      }
+      if (
+        [...excludedTerms].some(
+          (term) =>
+            terms[term] === file ||
+            titleTerms[term] === file ||
+            (terms[term] || []).includes(file) ||
+            (titleTerms[term] || []).includes(file)
+        )
+      )
+        break;
 
-      // if we have still a valid result we can add it to the result list
-      if (valid) {
-        // select one (max) score for the file.
-        // for better ranking, we should calculate ranking by using words statistics like basic tf-idf...
-        var score = $u.max($u.map(fileMap[file], function(w){return scoreMap[file][w]}));
-        results.push([docnames[file], titles[file], '', null, score, filenames[file]]);
-      }
+      // select one (max) score for the file.
+      const score = Math.max(...wordList.map((w) => scoreMap.get(file)[w]));
+      // add result to the result list
+      results.push([
+        docNames[file],
+        titles[file],
+        "",
+        null,
+        score,
+        filenames[file],
+      ]);
     }
     return results;
   },
@@ -499,34 +593,28 @@ var Search = {
   /**
    * helper function to return a node containing the
    * search summary for a given text. keywords is a list
-   * of stemmed words, hlwords is the list of normal, unstemmed
-   * words. the first one is used to find the occurrence, the
-   * latter for highlighting it.
+   * of stemmed words.
    */
-  makeSearchSummary : function(htmlText, keywords, hlwords) {
-    var text = Search.htmlToText(htmlText);
-    if (text == "") {
-      return null;
-    }
-    var textLower = text.toLowerCase();
-    var start = 0;
-    $.each(keywords, function() {
-      var i = textLower.indexOf(this.toLowerCase());
-      if (i > -1)
-        start = i;
-    });
-    start = Math.max(start - 120, 0);
-    var excerpt = ((start > 0) ? '...' : '') +
-      $.trim(text.substr(start, 240)) +
-      ((start + 240 - text.length) ? '...' : '');
-    var rv = $('<p class="context"></p>').text(excerpt);
-    $.each(hlwords, function() {
-      rv = rv.highlightText(this, 'highlighted');
-    });
-    return rv;
-  }
+  makeSearchSummary: (htmlText, keywords, anchor) => {
+    const text = Search.htmlToText(htmlText, anchor);
+    if (text === "") return null;
+
+    const textLower = text.toLowerCase();
+    const actualStartPosition = [...keywords]
+      .map((k) => textLower.indexOf(k.toLowerCase()))
+      .filter((i) => i > -1)
+      .slice(-1)[0];
+    const startWithContext = Math.max(actualStartPosition - 120, 0);
+
+    const top = startWithContext === 0 ? "" : "...";
+    const tail = startWithContext + 240 < text.length ? "..." : "";
+
+    let summary = document.createElement("p");
+    summary.classList.add("context");
+    summary.textContent = top + text.substr(startWithContext, 240).trim() + tail;
+
+    return summary;
+  },
 };
 
-$(document).ready(function() {
-  Search.init();
-});
+_ready(Search.init);
diff --git a/_static/sphinx_highlight.js b/_static/sphinx_highlight.js
new file mode 100644
index 0000000000..8a96c69a19
--- /dev/null
+++ b/_static/sphinx_highlight.js
@@ -0,0 +1,154 @@
+/* Highlighting utilities for Sphinx HTML documentation. */
+"use strict";
+
+const SPHINX_HIGHLIGHT_ENABLED = true
+
+/**
+ * highlight a given string on a node by wrapping it in
+ * span elements with the given class name.
+ */
+const _highlight = (node, addItems, text, className) => {
+  if (node.nodeType === Node.TEXT_NODE) {
+    const val = node.nodeValue;
+    const parent = node.parentNode;
+    const pos = val.toLowerCase().indexOf(text);
+    if (
+      pos >= 0 &&
+      !parent.classList.contains(className) &&
+      !parent.classList.contains("nohighlight")
+    ) {
+      let span;
+
+      const closestNode = parent.closest("body, svg, foreignObject");
+      const isInSVG = closestNode && closestNode.matches("svg");
+      if (isInSVG) {
+        span = document.createElementNS("http://www.w3.org/2000/svg", "tspan");
+      } else {
+        span = document.createElement("span");
+        span.classList.add(className);
+      }
+
+      span.appendChild(document.createTextNode(val.substr(pos, text.length)));
+      const rest = document.createTextNode(val.substr(pos + text.length));
+      parent.insertBefore(
+        span,
+        parent.insertBefore(
+          rest,
+          node.nextSibling
+        )
+      );
+      node.nodeValue = val.substr(0, pos);
+      /* There may be more occurrences of search term in this node. So call this
+       * function recursively on the remaining fragment.
+       */
+      _highlight(rest, addItems, text, className);
+
+      if (isInSVG) {
+        const rect = document.createElementNS(
+          "http://www.w3.org/2000/svg",
+          "rect"
+        );
+        const bbox = parent.getBBox();
+        rect.x.baseVal.value = bbox.x;
+        rect.y.baseVal.value = bbox.y;
+        rect.width.baseVal.value = bbox.width;
+        rect.height.baseVal.value = bbox.height;
+        rect.setAttribute("class", className);
+        addItems.push({ parent: parent, target: rect });
+      }
+    }
+  } else if (node.matches && !node.matches("button, select, textarea")) {
+    node.childNodes.forEach((el) => _highlight(el, addItems, text, className));
+  }
+};
+const _highlightText = (thisNode, text, className) => {
+  let addItems = [];
+  _highlight(thisNode, addItems, text, className);
+  addItems.forEach((obj) =>
+    obj.parent.insertAdjacentElement("beforebegin", obj.target)
+  );
+};
+
+/**
+ * Small JavaScript module for the documentation.
+ */
+const SphinxHighlight = {
+
+  /**
+   * highlight the search words provided in localstorage in the text
+   */
+  highlightSearchWords: () => {
+    if (!SPHINX_HIGHLIGHT_ENABLED) return;  // bail if no highlight
+
+    // get and clear terms from localstorage
+    const url = new URL(window.location);
+    const highlight =
+        localStorage.getItem("sphinx_highlight_terms")
+        || url.searchParams.get("highlight")
+        || "";
+    localStorage.removeItem("sphinx_highlight_terms")
+    url.searchParams.delete("highlight");
+    window.history.replaceState({}, "", url);
+
+    // get individual terms from highlight string
+    const terms = highlight.toLowerCase().split(/\s+/).filter(x => x);
+    if (terms.length === 0) return; // nothing to do
+
+    // There should never be more than one element matching "div.body"
+    const divBody = document.querySelectorAll("div.body");
+    const body = divBody.length ? divBody[0] : document.querySelector("body");
+    window.setTimeout(() => {
+      terms.forEach((term) => _highlightText(body, term, "highlighted"));
+    }, 10);
+
+    const searchBox = document.getElementById("searchbox");
+    if (searchBox === null) return;
+    searchBox.appendChild(
+      document
+        .createRange()
+        .createContextualFragment(
+          '<p class="highlight-link">' +
+            '<a href="javascript:SphinxHighlight.hideSearchWords()">' +
+            _("Hide Search Matches") +
+            "</a></p>"
+        )
+    );
+  },
+
+  /**
+   * helper function to hide the search marks again
+   */
+  hideSearchWords: () => {
+    document
+      .querySelectorAll("#searchbox .highlight-link")
+      .forEach((el) => el.remove());
+    document
+      .querySelectorAll("span.highlighted")
+      .forEach((el) => el.classList.remove("highlighted"));
+    localStorage.removeItem("sphinx_highlight_terms")
+  },
+
+  initEscapeListener: () => {
+    // only install a listener if it is really needed
+    if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) return;
+
+    document.addEventListener("keydown", (event) => {
+      // bail for input elements
+      if (BLACKLISTED_KEY_CONTROL_ELEMENTS.has(document.activeElement.tagName)) return;
+      // bail with special keys
+      if (event.shiftKey || event.altKey || event.ctrlKey || event.metaKey) return;
+      if (DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS && (event.key === "Escape")) {
+        SphinxHighlight.hideSearchWords();
+        event.preventDefault();
+      }
+    });
+  },
+};
+
+_ready(() => {
+  /* Do not call highlightSearchWords() when we are on the search page.
+   * It will highlight words from the *previous* search query.
+   */
+  if (typeof Search === "undefined") SphinxHighlight.highlightSearchWords();
+  SphinxHighlight.initEscapeListener();
+});
diff --git a/_static/valid/AbstractRefinementMap.scala b/_static/valid/AbstractRefinementMap.scala
index 48cb2ec848..3299b699e9 100644
--- a/_static/valid/AbstractRefinementMap.scala
+++ b/_static/valid/AbstractRefinementMap.scala
@@ -12,7 +12,7 @@ object AbstractRefinementMap {
     def apply(x: A): B = {
       require(f.pre(x))
       f(x)
-    } ensuring(ens)
+   }.ensuring(ens)
   }
 
   def map[A, B](l: List[A], f: A ~> B): List[B] = {
@@ -21,6 +21,6 @@ object AbstractRefinementMap {
       case Cons(x, xs) => Cons[B](f(x), map(xs, f))
       case Nil() => Nil[B]()
     }
-  } ensuring { res => forall((x: B) => res.contains(x) ==> f.ens(x)) }
+ }.ensuring { res => forall((x: B) => res.contains(x) ==> f.ens(x)) }
 }
 
diff --git a/_static/valid/AddingPositiveNumbers.scala b/_static/valid/AddingPositiveNumbers.scala
index 84fca5dc63..5452a5811b 100644
--- a/_static/valid/AddingPositiveNumbers.scala
+++ b/_static/valid/AddingPositiveNumbers.scala
@@ -6,6 +6,6 @@ object AddingPositiveNumbers {
   def additionSound(x: BigInt, y: BigInt): BigInt = {
     require(x >= 0 && y >= 0)
     x + y
-  } ensuring(_ >= 0)
+ }.ensuring(_ >= 0)
 
 }
diff --git a/_static/valid/AssociativeList.scala b/_static/valid/AssociativeList.scala
index 45ac711a12..0ac55c0d90 100644
--- a/_static/valid/AssociativeList.scala
+++ b/_static/valid/AssociativeList.scala
@@ -33,14 +33,14 @@ object AssociativeList {
   def updateAll(l1: List, l2: List): List = (l2 match {
     case Nil() => l1
     case Cons(x, xs) => updateAll(updateElem(l1, x), xs)
-  }) ensuring(domain(_) == domain(l1) ++ domain(l2))
+  }).ensuring(domain(_) == domain(l1) ++ domain(l2))
 
   def updateElem(l: List, e: KeyValuePairAbs): List = (l match {
     case Nil() => Cons(e, Nil())
     case Cons(KeyValuePair(k, v), xs) => e match {
       case KeyValuePair(ek, ev) => if (ek == k) Cons(KeyValuePair(ek, ev), xs) else Cons(KeyValuePair(k, v), updateElem(xs, e))
     }
-  }) ensuring(res => e match {
+  }).ensuring(res => e match {
     case KeyValuePair(k, v) => domain(res) == domain(l) ++ Set[Int](k)
   })
 
diff --git a/_static/valid/BinarySearchTreeQuant.scala b/_static/valid/BinarySearchTreeQuant.scala
index 36f80d7d8b..638b3652cd 100644
--- a/_static/valid/BinarySearchTreeQuant.scala
+++ b/_static/valid/BinarySearchTreeQuant.scala
@@ -36,9 +36,9 @@ object BSTSimpler {
         Node(l, v, r)
       })
     }
-  } ensuring(res => isBST(res) && content(res) == content(tree) ++ Set(value))
+ }.ensuring(res => isBST(res) && content(res) == content(tree) ++ Set(value))
 
   def createRoot(v: BigInt): Node = {
     Node(Leaf(), v, Leaf())
-  } ensuring (content(_) == Set(v))
+ }.ensuring(content(_) == Set(v))
 }
diff --git a/_static/valid/ChooseWithWitness.scala b/_static/valid/ChooseWithWitness.scala
index 3d6c1c1d31..57df8db6bd 100644
--- a/_static/valid/ChooseWithWitness.scala
+++ b/_static/valid/ChooseWithWitness.scala
@@ -11,7 +11,7 @@ object ChooseWithWitness {
     def size(l: List) : BigInt = (l match {
         case Nil() => BigInt(0)
         case Cons(_, t) => 1 + size(t)
-    }) ensuring(res => res >= 0)
+    }).ensuring(res => res >= 0)
 
     def content(l: List) : Set[Int] = l match {
       case Nil() => Set.empty[Int]
@@ -26,7 +26,7 @@ object ChooseWithWitness {
       } else {
         Cons(0, createListOfSize(i - 1))
       }
-    } ensuring ( size(_) == i )
+   }.ensuring( size(_) == i )
 
     def listOfSize(i: BigInt): List = {
       require(i >= 0)
@@ -37,7 +37,7 @@ object ChooseWithWitness {
         assert(size(createListOfSize(i)) == i) // provides choose quantification with a matcher
         choose[List] { (res: List) => size(res) == i }
       }
-    } ensuring ( size(_) == i )
+   }.ensuring( size(_) == i )
 
     def listOfSize2(i: BigInt): List = {
       require(i >= 0)
@@ -47,5 +47,5 @@ object ChooseWithWitness {
       } else {
         Nil()
       }
-    } ensuring ( size(_) == i )
+   }.ensuring( size(_) == i )
 }
diff --git a/_static/valid/ConcRope.scala b/_static/valid/ConcRope.scala
index 932bd11494..79606df433 100644
--- a/_static/valid/ConcRope.scala
+++ b/_static/valid/ConcRope.scala
@@ -84,7 +84,7 @@ object ConcRope {
         case Append(l, r) =>
           1 + max(l.level, r.level)
       }): BigInt
-    } ensuring (_ >= 0)
+   }.ensuring(_ >= 0)
 
     val size: BigInt = {
       (this match {
@@ -95,7 +95,7 @@ object ConcRope {
         case Append(l, r) =>
           l.size + r.size
       }): BigInt
-    } ensuring (_ >= 0)
+   }.ensuring(_ >= 0)
 
     def toList: List[T] = {
       this match {
@@ -106,7 +106,7 @@ object ConcRope {
         case Append(l, r) =>
           l.toList ++ r.toList
       }
-    } ensuring (res => res.size == this.size)
+   }.ensuring(res => res.size == this.size)
   }
 
   case class Empty[T]() extends Conc[T]
@@ -125,7 +125,7 @@ object ConcRope {
         if (i < l.size) lookup(l, i)
         else lookup(r, i - l.size)          
     }
-  } ensuring (res =>  instAppendIndexAxiom(xs, i) &&  // an auxiliary axiom instantiation that required for the proof
+ }.ensuring(res =>  instAppendIndexAxiom(xs, i) &&  // an auxiliary axiom instantiation that required for the proof
     res == xs.toList(i)) // correctness
     
 
@@ -153,7 +153,7 @@ object ConcRope {
         } else         
           Append(l, update(r, i - l.size, y))
     }
-  } ensuring (res => instAppendUpdateAxiom(xs, i, y) && // an auxiliary axiom instantiation
+ }.ensuring(res => instAppendUpdateAxiom(xs, i, y) && // an auxiliary axiom instantiation
     res.level == xs.level && // heights of the input and output trees are equal
     res.valid && // tree invariants are preserved    
     res.toList == xs.toList.updated(i, y) && // correctness
@@ -191,7 +191,7 @@ object ConcRope {
       case _ =>
         concatNonEmpty(xs, ys)
     }
-  } ensuring (res => res.valid && // tree invariants
+ }.ensuring(res => res.valid && // tree invariants
     res.level <= max(xs.level, ys.level) + 1 && // height invariants
     res.level >= max(xs.level, ys.level) &&
     (res.toList == xs.toList ++ ys.toList) && // correctness
@@ -242,7 +242,7 @@ object ConcRope {
           }
       }
     }
-  } ensuring (res =>  
+ }.ensuring(res =>  
     appendAssocInst(xs, ys) && // instantiation of an axiom
     res.level <= max(xs.level, ys.level) + 1 && // height invariants
     res.level >= max(xs.level, ys.level) &&
@@ -294,7 +294,7 @@ object ConcRope {
       case CC(l, r) =>
        concatNonEmpty(l, insert(r, i - l.size, y))      
     }
-  } ensuring (res => insertAppendAxiomInst(xs, i, y) && // instantiation of an axiom 
+ }.ensuring(res => insertAppendAxiomInst(xs, i, y) && // instantiation of an axiom 
     res.valid && res.isNormalized && // tree invariants            
     res.level - xs.level <= 1 && res.level >= xs.level && // height of the output tree is at most 1 greater than that of the input tree    
     res.toList == insertAtIndex(xs.toList, i, y) // correctness    
@@ -359,7 +359,7 @@ object ConcRope {
           (l, r)
         }
     }
-  } ensuring (res  => instSplitAxiom(xs, n) && // instantiation of an axiom     
+ }.ensuring(res  => instSplitAxiom(xs, n) && // instantiation of an axiom     
     res._1.valid && res._2.valid && // tree invariants are preserved
     res._1.isNormalized && res._2.isNormalized &&
     xs.level >= res._1.level && xs.level >= res._2.level && // height bounds of the resulting tree
@@ -385,7 +385,7 @@ object ConcRope {
       case Empty() => ys
       case Single(_) => CC(xs, ys)
     }
-  } ensuring (res => res.valid && //conctree invariants
+ }.ensuring(res => res.valid && //conctree invariants
     res.toList == xs.toList ++ Cons(x, Nil[T]()) && //correctness
     res.level <= xs.level + 1 
   )
@@ -411,7 +411,7 @@ object ConcRope {
           Append(l, zs)
       }
     }
-  } ensuring (res => appendAssocInst2(xs, ys) && 
+ }.ensuring(res => appendAssocInst2(xs, ys) && 
     res.valid && //conc tree invariants
     res.toList == xs.toList ++ ys.toList && //correctness invariants
     res.level <= xs.level + 1 )
@@ -431,7 +431,7 @@ object ConcRope {
       case Append(l, r) => numTrees(l) + 1
       case _ => BigInt(1)
     }
-  } ensuring (res => res >= 0)
+ }.ensuring(res => res >= 0)
 
   def normalize[T](t: Conc[T]): Conc[T] = {
     require(t.valid)
@@ -442,7 +442,7 @@ object ConcRope {
         concatNormalized(l, r)
       case _ => t
     }
-  } ensuring (res => res.valid &&
+ }.ensuring(res => res.valid &&
     res.isNormalized &&
     res.toList == t.toList && //correctness
     res.size == t.size && res.level <= t.level //normalize preserves level and size  
@@ -457,7 +457,7 @@ object ConcRope {
       case l =>
         concatNormalized(l, nr)        
     }
-  } ensuring (res => 
+ }.ensuring(res => 
     appendAssocInst2(xs, ys) && //some lemma instantiations   
     res.valid &&
     res.isNormalized &&
diff --git a/_static/valid/Formulas.scala b/_static/valid/Formulas.scala
index a5a350d827..4c011e4373 100644
--- a/_static/valid/Formulas.scala
+++ b/_static/valid/Formulas.scala
@@ -45,7 +45,7 @@ object Formulas {
       case Not(e) => Not(desugar(e))
       case e => e
     }
-  } ensuring { out =>
+ }.ensuring { out =>
     !existsImplies(out) &&
     !exists(out, f => f.isInstanceOf[Implies])
   }
diff --git a/_static/valid/FunctionCaching.scala b/_static/valid/FunctionCaching.scala
index 5e0984b3aa..3d089e4599 100644
--- a/_static/valid/FunctionCaching.scala
+++ b/_static/valid/FunctionCaching.scala
@@ -14,7 +14,7 @@ object FunctionCaching {
       case Some(cached) =>
         cached
     }
-  } ensuring(res => old(funCache).cached.get(x) match {
+ }.ensuring(res => old(funCache).cached.get(x) match {
     case None() => true
     case Some(v) => v == res
   })
@@ -35,6 +35,6 @@ object FunctionCaching {
         fun(y)
         multipleCalls(ys, x)
     }
-  } ensuring(_ => funCache.cached.get(x).forall(_ == 2*x + 42))
+ }.ensuring(_ => funCache.cached.get(x).forall(_ == 2*x + 42))
 
 }
diff --git a/_static/valid/Heaps.scala b/_static/valid/Heaps.scala
index b16418adb3..5f65056b88 100644
--- a/_static/valid/Heaps.scala
+++ b/_static/valid/Heaps.scala
@@ -36,7 +36,7 @@ object Heaps {
   private def reverse0(h : Heap, acc : Heap) : Heap = (h match {
     case Empty => acc
     case Nodes(n, ns) => reverse0(ns, Nodes(n, acc))
-  }) ensuring(res => heapContent(res) == heapContent(h) ++ heapContent(acc))
+  }).ensuring(res => heapContent(res) == heapContent(h) ++ heapContent(acc))
   
   private def link(t1 : Node, t2 : Node) = (t1, t2) match {
     case (Node(r, e1, ns1), Node(_, e2, ns2)) =>
@@ -55,7 +55,7 @@ object Heaps {
       } else {
         insertNode(link(t, t2), h2)
       }
-  }) ensuring(res => heapContent(res) == nodeContent(t) ++ heapContent(h))
+  }).ensuring(res => heapContent(res) == nodeContent(t) ++ heapContent(h))
   
   private def getMin(h : Heap) : (Node, Heap) = {
     require(h != Empty)
@@ -69,7 +69,7 @@ object Heaps {
           (t0, Nodes(t, ts0))
         }
     }
-  } ensuring(_ match {
+ }.ensuring(_ match {
     case (n,h2) => nodeContent(n) ++ heapContent(h2) == heapContent(h)
   })
   
@@ -78,15 +78,15 @@ object Heaps {
   /*~~~~~~~~~~~~~~~~*/
   def empty() : Heap = {
     Empty
-  } ensuring(res => heapContent(res) == Set.empty[Int])
+ }.ensuring(res => heapContent(res) == Set.empty[Int])
   
   def isEmpty(h : Heap) : Boolean = {
     (h == Empty)
-  } ensuring(res => res == (heapContent(h) == Set.empty[Int]))
+ }.ensuring(res => res == (heapContent(h) == Set.empty[Int]))
   
   def insert(e : Int, h : Heap) : Heap = {
     insertNode(Node(0, e, Empty), h)
-  } ensuring(res => heapContent(res) == heapContent(h) ++ Set(e))
+ }.ensuring(res => heapContent(res) == heapContent(h) ++ Set(e))
   
   def merge(h1 : Heap, h2 : Heap) : Heap = ((h1,h2) match {
     case (_, Empty) => h1
@@ -99,7 +99,7 @@ object Heaps {
       } else {
         insertNode(link(t1, t2), merge(ts1, ts2))
       }
-  }) ensuring(res => heapContent(res) == heapContent(h1) ++ heapContent(h2))
+  }).ensuring(res => heapContent(res) == heapContent(h1) ++ heapContent(h2))
   
   def findMin(h : Heap) : OptInt = (h match {
     case Empty => None
@@ -108,7 +108,7 @@ object Heaps {
         case None => Some(e)
         case Some(e2) => Some(if(e < e2) e else e2)
       }
-  }) ensuring(_ match {
+  }).ensuring(_ match {
     case None => isEmpty(h)
     case Some(v) => heapContent(h).contains(v)
   })
@@ -118,7 +118,7 @@ object Heaps {
     case ts : Nodes =>
       val (Node(_, e, ns1), ns2) = getMin(ts)
       merge(reverse(ns1), ns2)
-  }) ensuring(res => heapContent(res).subsetOf(heapContent(h)))
+  }).ensuring(res => heapContent(res).subsetOf(heapContent(h)))
   
   def sanity0() : Boolean = {
     val h0 : Heap = Empty
diff --git a/_static/valid/InsertionSort.scala b/_static/valid/InsertionSort.scala
index 0acab72588..bed8b1d5fa 100644
--- a/_static/valid/InsertionSort.scala
+++ b/_static/valid/InsertionSort.scala
@@ -15,7 +15,7 @@ object InsertionSort {
   def size(l : List) : BigInt = (l match {
     case Nil() => BigInt(0)
     case Cons(_, xs) => 1 + size(xs)
-  }) ensuring(_ >= 0)
+  }).ensuring(_ >= 0)
 
   def contents(l: List): Set[Int] = l match {
     case Nil() => Set.empty
@@ -44,7 +44,7 @@ object InsertionSort {
       case Nil() => Cons(e,Nil())
       case Cons(x,xs) => if (x <= e) Cons(x,sortedIns(e, xs)) else Cons(e, l)
     }
-  } ensuring(res => contents(res) == contents(l) ++ Set(e)
+ }.ensuring(res => contents(res) == contents(l) ++ Set(e)
                     && isSorted(res)
                     && size(res) == size(l) + 1
             )
@@ -54,7 +54,7 @@ object InsertionSort {
   def sort(l: List): List = (l match {
     case Nil() => Nil()
     case Cons(x,xs) => sortedIns(x, sort(xs))
-  }) ensuring(res => contents(res) == contents(l)
+  }).ensuring(res => contents(res) == contents(l)
                      && isSorted(res)
                      && size(res) == size(l)
              )
diff --git a/_static/valid/ListOperations.scala b/_static/valid/ListOperations.scala
index 3a4383cc9b..aafe68ea7e 100644
--- a/_static/valid/ListOperations.scala
+++ b/_static/valid/ListOperations.scala
@@ -18,12 +18,12 @@ object ListOperations {
     def size(l: List) : BigInt = (l match {
         case Nil() => BigInt(0)
         case Cons(_, t) => 1 + size(t)
-    }) ensuring(res => res >= 0)
+    }).ensuring(res => res >= 0)
 
     def iplSize(l: IntPairList) : BigInt = (l match {
       case IPNil() => BigInt(0)
       case IPCons(_, xs) => 1 + iplSize(xs)
-    }) ensuring(_ >= 0)
+    }).ensuring(_ >= 0)
 
     def zip(l1: List, l2: List) : IntPairList = {
       // try to comment this and see how pattern-matching becomes
@@ -36,7 +36,7 @@ object ListOperations {
           case Cons(y, ys) => IPCons(IP(x, y), zip(xs, ys))
         }
       }
-    } ensuring(iplSize(_) == size(l1))
+   }.ensuring(iplSize(_) == size(l1))
 
     def sizeTailRec(l: List) : BigInt = sizeTailRecAcc(l, 0)
     def sizeTailRecAcc(l: List, acc: BigInt) : BigInt = {
@@ -45,7 +45,7 @@ object ListOperations {
        case Nil() => acc
        case Cons(_, xs) => sizeTailRecAcc(xs, acc+1)
      }
-    } ensuring(res => res == size(l) + acc)
+   }.ensuring(res => res == size(l) + acc)
 
     def sizesAreEquiv(l: List) : Boolean = {
       size(l) == sizeTailRec(l)
@@ -63,18 +63,18 @@ object ListOperations {
     def drunk(l : List) : List = (l match {
       case Nil() => Nil()
       case Cons(x,l1) => Cons(x,Cons(x,drunk(l1)))
-    }) ensuring (size(_) == 2 * size(l))
+    }).ensuring (size(_) == 2 * size(l))
 
-    def reverse(l: List) : List = reverse0(l, Nil()) ensuring(content(_) == content(l))
+    def reverse(l: List) : List = reverse0(l, Nil()).ensuring(content(_) == content(l))
     def reverse0(l1: List, l2: List) : List = (l1 match {
       case Nil() => l2
       case Cons(x, xs) => reverse0(xs, Cons(x, l2))
-    }) ensuring(content(_) == content(l1) ++ content(l2))
+    }).ensuring(content(_) == content(l1) ++ content(l2))
 
     def append(l1 : List, l2 : List) : List = (l1 match {
       case Nil() => l2
       case Cons(x,xs) => Cons(x, append(xs, l2))
-    }) ensuring(content(_) == content(l1) ++ content(l2))
+    }).ensuring(content(_) == content(l1) ++ content(l2))
 
     @induct
     def nilAppend(l : List) : Boolean = (append(l, Nil()) == l).holds
@@ -89,7 +89,7 @@ object ListOperations {
 
     @induct
     def concat(l1: List, l2: List) : List = 
-      concat0(l1, l2, Nil()) ensuring(content(_) == content(l1) ++ content(l2))
+      concat0(l1, l2, Nil()).ensuring(content(_) == content(l1) ++ content(l2))
 
     @induct
     def concat0(l1: List, l2: List, l3: List) : List = (l1 match {
@@ -100,5 +100,5 @@ object ListOperations {
         }
       }
       case Cons(x, xs) => concat0(xs, l2, Cons(x, l3))
-    }) ensuring(content(_) == content(l1) ++ content(l2) ++ content(l3))
+    }).ensuring(content(_) == content(l1) ++ content(l2) ++ content(l3))
 }
diff --git a/_static/valid/Mean.scala b/_static/valid/Mean.scala
index ec1108f4e5..85b229498c 100644
--- a/_static/valid/Mean.scala
+++ b/_static/valid/Mean.scala
@@ -8,6 +8,6 @@ object Mean {
   def mean(x: Int, y: Int): Int = {
     require(x <= y && x >= 0 && y >= 0)
     x + (y - x)/2
-  } ensuring(m => m >= x && m <= y)
+ }.ensuring(m => m >= x && m <= y)
 
 }
diff --git a/_static/valid/MergeSort.scala b/_static/valid/MergeSort.scala
index b4cd205689..dbcdf93a91 100644
--- a/_static/valid/MergeSort.scala
+++ b/_static/valid/MergeSort.scala
@@ -26,7 +26,7 @@ object MergeSort {
   def size(list : List) : BigInt = (list match {
     case Nil() => BigInt(0)
     case Cons(_, xs) => 1 + size(xs)
-  }) ensuring(_ >= 0)
+  }).ensuring(_ >= 0)
 
   def isSorted(list : List) : Boolean = list match {
     case Nil() => true
@@ -42,7 +42,7 @@ object MergeSort {
 
   def abs(i : BigInt) : BigInt = {
     if(i < 0) -i else i
-  } ensuring(_ >= 0)
+ }.ensuring(_ >= 0)
 
   def mergeSpec(list1 : List, list2 : List, res : List) : Boolean = {
     isSorted(res) && content(res) == content(list1) ++ content(list2)
@@ -61,7 +61,7 @@ object MergeSort {
           Cons(y, mergeFast(list1, ys))
         }
     }
-  } ensuring(res => mergeSpec(list1, list2, res))
+ }.ensuring(res => mergeSpec(list1, list2, res))
 
   def splitSpec(list : List, res : (List,List)) : Boolean = {
     val s1 = size(res._1)
@@ -76,7 +76,7 @@ object MergeSort {
     case Cons(x1, Cons(x2, xs)) =>
       val (s1,s2) = split(xs)
       (Cons(x1, s1), Cons(x2, s2))
-  }) ensuring(res => splitSpec(list, res))
+  }).ensuring(res => splitSpec(list, res))
 
   def sortSpec(in : List, out : List) : Boolean = {
     content(out) == content(in) && isSorted(out)
@@ -94,12 +94,12 @@ object MergeSort {
         val (s1,s2) = split(in)
         mergeFast(weirdSort(size(s1), s1), weirdSort(size(s2), s2))
     }
-  } ensuring(res => sortSpec(in, res))
+ }.ensuring(res => sortSpec(in, res))
 
   def toLList(list : List) : LList = (list match {
     case Nil() => LNil()
     case Cons(x, xs) => LCons(Cons(x, Nil()), toLList(xs))
-  }) ensuring(res => lContent(res) == content(list) && lIsSorted(res))
+  }).ensuring(res => lContent(res) == content(list) && lIsSorted(res))
 
   def mergeMap(llist : LList) : LList = {
     require(lIsSorted(llist))
@@ -109,7 +109,7 @@ object MergeSort {
       case o @ LCons(x, LNil()) => o
       case LCons(x, LCons(y, ys)) => LCons(mergeFast(x, y), mergeMap(ys))
     }
-  } ensuring(res => lContent(res) == lContent(llist) && lIsSorted(res))
+ }.ensuring(res => lContent(res) == lContent(llist) && lIsSorted(res))
 
   def mergeReduce(llist : LList) : List = {
     require(lIsSorted(llist))
@@ -119,9 +119,9 @@ object MergeSort {
       case LCons(x, LNil()) => x
       case _ => mergeReduce(mergeMap(llist))
     }
-  } ensuring(res => content(res) == lContent(llist) && isSorted(res))
+ }.ensuring(res => content(res) == lContent(llist) && isSorted(res))
 
   def mergeSort(in : List) : List = {
     mergeReduce(toLList(in))
-  } ensuring(res => sortSpec(in, res))
+ }.ensuring(res => sortSpec(in, res))
 }
diff --git a/_static/valid/PropositionalLogic.scala b/_static/valid/PropositionalLogic.scala
index d1a4a4a460..aab240a9b0 100644
--- a/_static/valid/PropositionalLogic.scala
+++ b/_static/valid/PropositionalLogic.scala
@@ -18,7 +18,7 @@ object PropositionalLogic {
     case Implies(lhs, rhs) => Or(Not(simplify(lhs)), simplify(rhs))
     case Not(f) => Not(simplify(f))
     case Literal(_) => f
-  }) ensuring(isSimplified(_))
+  }).ensuring(isSimplified(_))
 
   def isSimplified(f: Formula): Boolean = f match {
     case And(lhs, rhs) => isSimplified(lhs) && isSimplified(rhs)
@@ -38,7 +38,7 @@ object PropositionalLogic {
     case Not(Not(f)) => nnf(f)
     case Not(Literal(_)) => formula
     case Literal(_) => formula
-  }) ensuring(isNNF(_))
+  }).ensuring(isNNF(_))
 
   def isNNF(f: Formula): Boolean = f match {
     case And(lhs, rhs) => isNNF(lhs) && isNNF(rhs)
diff --git a/_static/valid/QuickSort.scala b/_static/valid/QuickSort.scala
index 9cd49876e8..46bfd9f4a6 100644
--- a/_static/valid/QuickSort.scala
+++ b/_static/valid/QuickSort.scala
@@ -17,7 +17,7 @@ object QuickSort {
       case Nil() => l2
       case Cons(x, xs) => Cons(x, appendSorted(xs, l2))
     }
-  } ensuring { res =>
+ }.ensuring { res =>
     isSorted(res) &&
     res.content == l1.content ++ l2.content
   }
@@ -28,7 +28,7 @@ object QuickSort {
       case Nil() => Nil[BigInt]()
       case Cons(x, xs) => par(x, Nil(), Nil(), xs)
     }
-  } ensuring { res =>
+ }.ensuring { res =>
     isSorted(res) &&
     res.content == list.content
   }
@@ -44,7 +44,7 @@ object QuickSort {
       case Nil() => appendSorted(quickSort(l), Cons(x, quickSort(r)))
       case Cons(x2, xs2) => if (x2 <= x) par(x, Cons(x2, l), r, xs2) else par(x, l, Cons(x2, r), xs2)
     }
-  } ensuring { res =>
+ }.ensuring { res =>
     isSorted(res) &&
     res.content == l.content ++ r.content ++ ls.content + x
   }
diff --git a/_static/valid/RedBlackTree.scala b/_static/valid/RedBlackTree.scala
index 94577704d6..4b7fab2dc6 100644
--- a/_static/valid/RedBlackTree.scala
+++ b/_static/valid/RedBlackTree.scala
@@ -24,7 +24,7 @@ object RedBlackTree {
   def size(t: Tree) : BigInt = (t match {
     case Empty() => BigInt(0)
     case Node(_, l, v, r) => size(l) + 1 + size(r)
-  }) ensuring(_ >= 0)
+  }).ensuring(_ >= 0)
 
   /* We consider leaves to be black by definition */
   def isBlack(t: Tree) : Boolean = t match {
@@ -65,7 +65,7 @@ object RedBlackTree {
         else if (x == y) Node(c,a,y,b)
         else             balance(c,a,y,ins(x, b))
     }
-  } ensuring (res => content(res) == content(t) ++ Set(x) 
+ }.ensuring(res => content(res) == content(t) ++ Set(x) 
                    && size(t) <= size(res) && size(res) <= size(t) + 1
                    && redDescHaveBlackChildren(res)
                    && blackBalanced(res))
@@ -76,12 +76,12 @@ object RedBlackTree {
       case Node(Red(),l,v,r) => Node(Black(),l,v,r)
       case _ => n
     }
-  } ensuring(res => redNodesHaveBlackChildren(res) && blackBalanced(res))
+ }.ensuring(res => redNodesHaveBlackChildren(res) && blackBalanced(res))
 
   def add(x: BigInt, t: Tree): Tree = {
     require(redNodesHaveBlackChildren(t) && blackBalanced(t))
     makeBlack(ins(x, t))
-  } ensuring (res => content(res) == content(t) ++ Set(x) && redNodesHaveBlackChildren(res) && blackBalanced(res))
+ }.ensuring(res => content(res) == content(t) ++ Set(x) && redNodesHaveBlackChildren(res) && blackBalanced(res))
 
   def balance(c: Color, a: Tree, x: BigInt, b: Tree): Tree = {
     Node(c,a,x,b) match {
@@ -95,5 +95,5 @@ object RedBlackTree {
         Node(Red(),Node(Black(),a,xV,b),yV,Node(Black(),c,zV,d))
       case Node(c,a,xV,b) => Node(c,a,xV,b)
     }
-  } ensuring (res => content(res) == content(Node(c,a,x,b)))// && redDescHaveBlackChildren(res))
+ }.ensuring(res => content(res) == content(Node(c,a,x,b)))// && redDescHaveBlackChildren(res))
 }
diff --git a/_static/valid/StableSorter.scala b/_static/valid/StableSorter.scala
index 699b853cf3..1f07d89860 100644
--- a/_static/valid/StableSorter.scala
+++ b/_static/valid/StableSorter.scala
@@ -12,7 +12,7 @@ object StableSorter {
       case Cons(hd, tl) if key(t) <= key(hd) => t :: l
       case Cons(hd, tl) => hd :: insert(t, tl, key)
     }
-  } ensuring { res => res.content == Set(t) ++ l.content && res.length == 1 + l.length }
+ }.ensuring { res => res.content == Set(t) ++ l.content && res.length == 1 + l.length }
 
   // Sorting a list preserves the content and preserves the length
   def sort[T](l: List[T], key: T => BigInt): List[T] = { l match {
@@ -21,7 +21,7 @@ object StableSorter {
       val tlSorted = sort(tl, key)
       insert(hd, tlSorted, key)
     }
-  }} ensuring { res => res.content == l.content && res.length == l.length }
+  }}.ensuring { res => res.content == l.content && res.length == l.length }
 
   // To define stability, we first annotate the input list with the initial indices...
   def annotateList[T](l: List[T], n: BigInt): List[(T, BigInt)] = {
@@ -32,7 +32,7 @@ object StableSorter {
         hint((hd, n) :: tlAnn, trivProp2(annotateList(tl, n + 1), n))
       }
     }
-  } ensuring { res => l2AtLeast(res, n) }
+ }.ensuring { res => l2AtLeast(res, n) }
 
   // ... where:
   def l2AtLeast[T](l: List[(T, BigInt)], n: BigInt): Boolean = l match {
diff --git a/casestudies.html b/casestudies.html
index 0eccdae54c..469dc11e6c 100644
--- a/casestudies.html
+++ b/casestudies.html
@@ -1,24 +1,23 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Case Studies &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
         <script async="async" src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Translation from Stainless to Coq" href="coq.html" />
@@ -30,20 +29,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -92,20 +94,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Case Studies</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Case Studies</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/casestudies.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -116,11 +115,11 @@
            <div itemprop="articleBody">
              
   <section id="case-studies">
-<span id="casestudies"></span><h1>Case Studies<a class="headerlink" href="#case-studies" title="Permalink to this headline">¶</a></h1>
+<span id="casestudies"></span><h1>Case Studies<a class="headerlink" href="#case-studies" title="Link to this heading">¶</a></h1>
 <section id="case-study-1-proving-invariants-of-actor-systems">
-<h2>Case Study #1: Proving invariants of actor systems<a class="headerlink" href="#case-study-1-proving-invariants-of-actor-systems" title="Permalink to this headline">¶</a></h2>
+<h2>Case Study #1: Proving invariants of actor systems<a class="headerlink" href="#case-study-1-proving-invariants-of-actor-systems" title="Link to this heading">¶</a></h2>
 <section id="actor-system-model">
-<h3>Actor system model<a class="headerlink" href="#actor-system-model" title="Permalink to this headline">¶</a></h3>
+<h3>Actor system model<a class="headerlink" href="#actor-system-model" title="Link to this heading">¶</a></h3>
 <p>Our model is loosely based on the modern definition of object-based actor systems,
 and attempts to provide an idiomatic Scala API in the style of the Akka actor library.</p>
 <p>In this framework, each actor is addressed by a reference, through which other actors
@@ -145,250 +144,250 @@ <h3>Actor system model<a class="headerlink" href="#actor-system-model" title="Pe
 and update the destination actor’s behavior with the behavior returned by the message handler.</p>
 </section>
 <section id="actor-system-implementation">
-<h3>Actor system implementation<a class="headerlink" href="#actor-system-implementation" title="Permalink to this headline">¶</a></h3>
+<h3>Actor system implementation<a class="headerlink" href="#actor-system-implementation" title="Link to this heading">¶</a></h3>
 <section id="imports">
-<h4>Imports<a class="headerlink" href="#imports" title="Permalink to this headline">¶</a></h4>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
+<h4>Imports<a class="headerlink" href="#imports" title="Link to this heading">¶</a></h4>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
 </pre></div>
 </div>
 </section>
 <section id="message">
-<h4>Message<a class="headerlink" href="#message" title="Permalink to this headline">¶</a></h4>
+<h4>Message<a class="headerlink" href="#message" title="Link to this heading">¶</a></h4>
 <p>In our framework, messages are modeled as constructors of the abstract class <code class="docutils literal notranslate"><span class="pre">Msg</span></code>.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">Msg</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Msg</span>
 </pre></div>
 </div>
 </section>
 <section id="actor-reference">
-<h4>Actor reference<a class="headerlink" href="#actor-reference" title="Permalink to this headline">¶</a></h4>
+<h4>Actor reference<a class="headerlink" href="#actor-reference" title="Link to this heading">¶</a></h4>
 <p>Each actor is associated with a persistent reference, modeled as instances of the case class <code class="docutils literal notranslate"><span class="pre">ActorRef</span></code>.
 Each reference has a name, and an underlying Akka <code class="docutils literal notranslate"><span class="pre">akka.actor.ActorRef</span></code>, marked as extern and pure (see Section <a class="reference internal" href="wrap.html"><span class="doc">Working With Existing Code</span></a> for more information about extern fields).</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">ActorRef</span><span class="p">(</span>
-  <span class="n">name</span><span class="p">:</span> <span class="nc">String</span><span class="p">,</span>
-  <span class="nd">@extern</span> <span class="nd">@pure</span>
-  <span class="n">underlying</span><span class="p">:</span> <span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">ActorRef</span>
-<span class="p">)</span> <span class="p">{</span>
-
-  <span class="nd">@inline</span>
-  <span class="k">def</span> <span class="nf">!</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span> <span class="nc">Msg</span><span class="p">)(</span><span class="k">implicit</span> <span class="n">ctx</span><span class="p">:</span> <span class="nc">ActorContext</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">ctx</span><span class="p">.</span><span class="n">send</span><span class="p">(</span><span class="bp">this</span><span class="p">,</span> <span class="n">msg</span><span class="p">)</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">(</span>
+<span class="w">  </span><span class="n">name</span><span class="p">:</span><span class="w"> </span><span class="nc">String</span><span class="p">,</span>
+<span class="w">  </span><span class="nd">@extern</span><span class="w"> </span><span class="nd">@pure</span>
+<span class="w">  </span><span class="n">underlying</span><span class="p">:</span><span class="w"> </span><span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">ActorRef</span>
+<span class="p">)</span><span class="w"> </span><span class="p">{</span>
+
+<span class="w">  </span><span class="nd">@inline</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">!</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span><span class="w"> </span><span class="nc">Msg</span><span class="p">)(</span><span class="k">implicit</span><span class="w"> </span><span class="n">ctx</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorContext</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">ctx</span><span class="p">.</span><span class="n">send</span><span class="p">(</span><span class="bp">this</span><span class="p">,</span><span class="w"> </span><span class="n">msg</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="actor-context">
-<h4>Actor Context<a class="headerlink" href="#actor-context" title="Permalink to this headline">¶</a></h4>
+<h4>Actor Context<a class="headerlink" href="#actor-context" title="Link to this heading">¶</a></h4>
 <p>When a message is delivered to an actor, the latter is provided with a context, which holds a reference to itself, and a mutable list of messages to send. We mark this list as ghost to avoid having to persist in memory the list of all messages sent through the context.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">ActorContext</span><span class="p">(</span>
-  <span class="n">self</span><span class="p">:</span> <span class="nc">ActorRef</span><span class="p">,</span>
-  <span class="nd">@ghost</span>
-  <span class="kd">var</span> <span class="n">toSend</span><span class="p">:</span> <span class="nc">List</span><span class="p">[(</span><span class="nc">ActorRef</span><span class="p">,</span> <span class="nc">Msg</span><span class="p">)]</span> <span class="o">=</span> <span class="nc">Nil</span><span class="p">()</span>
-<span class="p">)</span> <span class="p">{</span>
-
-  <span class="k">def</span> <span class="nf">send</span><span class="p">(</span><span class="n">to</span><span class="p">:</span> <span class="nc">ActorRef</span><span class="p">,</span> <span class="n">msg</span><span class="p">:</span> <span class="nc">Msg</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">toSend</span> <span class="o">=</span> <span class="p">(</span><span class="n">to</span><span class="p">,</span> <span class="n">msg</span><span class="p">)</span> <span class="o">::</span> <span class="n">toSend</span>
-
-    <span class="n">sendUnderlying</span><span class="p">(</span><span class="n">to</span><span class="p">,</span> <span class="n">msg</span><span class="p">)</span>
-  <span class="p">}</span>
-
-  <span class="nd">@extern</span> <span class="nd">@pure</span>
-  <span class="k">private</span> <span class="k">def</span> <span class="nf">sendUnderlying</span><span class="p">(</span><span class="n">to</span><span class="p">:</span> <span class="nc">ActorRef</span><span class="p">,</span> <span class="n">msg</span><span class="p">:</span> <span class="nc">Msg</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">to</span><span class="p">.</span><span class="n">underlying</span> <span class="o">!</span> <span class="n">msg</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">ActorContext</span><span class="p">(</span>
+<span class="w">  </span><span class="n">self</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">,</span>
+<span class="w">  </span><span class="nd">@ghost</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">toSend</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[(</span><span class="nc">ActorRef</span><span class="p">,</span><span class="w"> </span><span class="nc">Msg</span><span class="p">)]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span>
+<span class="p">)</span><span class="w"> </span><span class="p">{</span>
+
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">send</span><span class="p">(</span><span class="n">to</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">,</span><span class="w"> </span><span class="n">msg</span><span class="p">:</span><span class="w"> </span><span class="nc">Msg</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">toSend</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">to</span><span class="p">,</span><span class="w"> </span><span class="n">msg</span><span class="p">)</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">toSend</span>
+
+<span class="w">    </span><span class="n">sendUnderlying</span><span class="p">(</span><span class="n">to</span><span class="p">,</span><span class="w"> </span><span class="n">msg</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="nd">@extern</span><span class="w"> </span><span class="nd">@pure</span>
+<span class="w">  </span><span class="k">private</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">sendUnderlying</span><span class="p">(</span><span class="n">to</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">,</span><span class="w"> </span><span class="n">msg</span><span class="p">:</span><span class="w"> </span><span class="nc">Msg</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">to</span><span class="p">.</span><span class="n">underlying</span><span class="w"> </span><span class="o">!</span><span class="w"> </span><span class="n">msg</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="behavior">
-<h4>Behavior<a class="headerlink" href="#behavior" title="Permalink to this headline">¶</a></h4>
+<h4>Behavior<a class="headerlink" href="#behavior" title="Link to this heading">¶</a></h4>
 <p>A behavior specifies both the current state of an actor, and how this one should process the next incoming message. In our framework, these are modeled as a subclass of the abstract class <code class="docutils literal notranslate"><span class="pre">Behavior</span></code>, which defines a single abstract method <code class="docutils literal notranslate"><span class="pre">processMsg</span></code>, to be overridden for each defined behavior.</p>
 <p>Using the provided <code class="docutils literal notranslate"><span class="pre">ActorContext</span></code>, the implementation of the <code class="docutils literal notranslate"><span class="pre">processMsg</span></code> method can both access its own reference, and send messages. It is also required to return a new <code class="docutils literal notranslate"><span class="pre">Behavior</span></code> for handling subsequent messages.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">Behavior</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">processMsg</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span> <span class="nc">Msg</span><span class="p">)(</span><span class="k">implicit</span> <span class="n">ctx</span><span class="p">:</span> <span class="nc">ActorContext</span><span class="p">):</span> <span class="nc">Behavior</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Behavior</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">processMsg</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span><span class="w"> </span><span class="nc">Msg</span><span class="p">)(</span><span class="k">implicit</span><span class="w"> </span><span class="n">ctx</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorContext</span><span class="p">):</span><span class="w"> </span><span class="nc">Behavior</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="actor-system">
-<h4>Actor System<a class="headerlink" href="#actor-system" title="Permalink to this headline">¶</a></h4>
+<h4>Actor System<a class="headerlink" href="#actor-system" title="Link to this heading">¶</a></h4>
 <p>The state of the actor system at a given point in time is modeled as a case class, holding the behavior associated with each actor reference, and the list of in-flight messages between any two actors.</p>
 <p>It provides a <code class="docutils literal notranslate"><span class="pre">step</span></code> method which, whengiven two <code class="docutils literal notranslate"><span class="pre">ActorRef</span></code>, will deliver the next message (if any) in the corresponding channel.</p>
 <p>Because the <code class="docutils literal notranslate"><span class="pre">ActorSystem</span></code> class is only used to model and prove properties about the underlying actor system, we mark the whole class as ghost in order to drop it from the resulting program.</p>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@ghost</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">ActorSystem</span><span class="p">(</span>
-  <span class="n">behaviors</span><span class="p">:</span> <span class="nc">CMap</span><span class="p">[</span><span class="nc">ActorRef</span><span class="p">,</span> <span class="nc">Behavior</span><span class="p">],</span>
-  <span class="n">inboxes</span><span class="p">:</span> <span class="nc">CMap</span><span class="p">[(</span><span class="nc">ActorRef</span><span class="p">,</span> <span class="nc">ActorRef</span><span class="p">),</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Msg</span><span class="p">]]</span>
-<span class="p">)</span> <span class="p">{</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">ActorSystem</span><span class="p">(</span>
+<span class="w">  </span><span class="n">behaviors</span><span class="p">:</span><span class="w"> </span><span class="nc">CMap</span><span class="p">[</span><span class="nc">ActorRef</span><span class="p">,</span><span class="w"> </span><span class="nc">Behavior</span><span class="p">],</span>
+<span class="w">  </span><span class="n">inboxes</span><span class="p">:</span><span class="w"> </span><span class="nc">CMap</span><span class="p">[(</span><span class="nc">ActorRef</span><span class="p">,</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">),</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Msg</span><span class="p">]]</span>
+<span class="p">)</span><span class="w"> </span><span class="p">{</span>
 
-  <span class="k">def</span> <span class="nf">step</span><span class="p">(</span><span class="n">from</span><span class="p">:</span> <span class="nc">ActorRef</span><span class="p">,</span> <span class="n">to</span><span class="p">:</span> <span class="nc">ActorRef</span><span class="p">):</span> <span class="nc">ActorSystem</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">inboxes</span><span class="p">(</span><span class="n">from</span> <span class="o">-&gt;</span> <span class="n">to</span><span class="p">)</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">=&gt;</span>
-        <span class="bp">this</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">step</span><span class="p">(</span><span class="n">from</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">,</span><span class="w"> </span><span class="n">to</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">):</span><span class="w"> </span><span class="nc">ActorSystem</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">inboxes</span><span class="p">(</span><span class="n">from</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">to</span><span class="p">)</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">        </span><span class="bp">this</span>
 
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">msg</span><span class="p">,</span> <span class="n">msgs</span><span class="p">)</span> <span class="o">=&gt;</span>
-        <span class="kd">val</span> <span class="p">(</span><span class="n">newBehavior</span><span class="p">,</span> <span class="n">toSend</span><span class="p">)</span> <span class="o">=</span> <span class="n">deliverMessage</span><span class="p">(</span><span class="n">to</span><span class="p">,</span> <span class="n">msg</span><span class="p">)</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">msg</span><span class="p">,</span><span class="w"> </span><span class="n">msgs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">        </span><span class="kd">val</span><span class="w"> </span><span class="p">(</span><span class="n">newBehavior</span><span class="p">,</span><span class="w"> </span><span class="n">toSend</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">deliverMessage</span><span class="p">(</span><span class="n">to</span><span class="p">,</span><span class="w"> </span><span class="n">msg</span><span class="p">)</span>
 
-        <span class="kd">val</span> <span class="n">newBehaviors</span> <span class="o">=</span> <span class="n">behaviors</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="n">to</span><span class="p">,</span> <span class="n">newBehavior</span><span class="p">)</span>
-        <span class="kd">val</span> <span class="n">newInboxes</span> <span class="o">=</span> <span class="n">toSend</span><span class="p">.</span><span class="n">foldLeft</span><span class="p">(</span><span class="n">inboxes</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="n">from</span> <span class="o">-&gt;</span> <span class="n">to</span><span class="p">,</span> <span class="n">msgs</span><span class="p">))</span> <span class="p">{</span>
-          <span class="k">case</span> <span class="p">(</span><span class="n">acc</span><span class="p">,</span> <span class="p">(</span><span class="n">dest</span><span class="p">,</span> <span class="n">m</span><span class="p">))</span> <span class="o">=&gt;</span> <span class="n">acc</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="n">to</span> <span class="o">-&gt;</span> <span class="n">dest</span><span class="p">,</span> <span class="n">m</span> <span class="o">::</span> <span class="n">acc</span><span class="p">(</span><span class="n">to</span> <span class="o">-&gt;</span> <span class="n">dest</span><span class="p">))</span>
-        <span class="p">}</span>
+<span class="w">        </span><span class="kd">val</span><span class="w"> </span><span class="n">newBehaviors</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">behaviors</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="n">to</span><span class="p">,</span><span class="w"> </span><span class="n">newBehavior</span><span class="p">)</span>
+<span class="w">        </span><span class="kd">val</span><span class="w"> </span><span class="n">newInboxes</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">toSend</span><span class="p">.</span><span class="n">foldLeft</span><span class="p">(</span><span class="n">inboxes</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="n">from</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">to</span><span class="p">,</span><span class="w"> </span><span class="n">msgs</span><span class="p">))</span><span class="w"> </span><span class="p">{</span>
+<span class="w">          </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">acc</span><span class="p">,</span><span class="w"> </span><span class="p">(</span><span class="n">dest</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">))</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">acc</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="n">to</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">dest</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">acc</span><span class="p">(</span><span class="n">to</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">dest</span><span class="p">))</span>
+<span class="w">        </span><span class="p">}</span>
 
-        <span class="nc">ActorSystem</span><span class="p">(</span><span class="n">newBehaviors</span><span class="p">,</span> <span class="n">newInboxes</span><span class="p">)</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<span class="w">        </span><span class="nc">ActorSystem</span><span class="p">(</span><span class="n">newBehaviors</span><span class="p">,</span><span class="w"> </span><span class="n">newInboxes</span><span class="p">)</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="k">private</span> <span class="k">def</span> <span class="nf">deliverMessage</span><span class="p">(</span><span class="n">actor</span><span class="p">:</span> <span class="nc">ActorRef</span><span class="p">,</span> <span class="n">msg</span><span class="p">:</span> <span class="nc">Msg</span><span class="p">):</span> <span class="p">(</span><span class="nc">Behavior</span><span class="p">,</span> <span class="nc">List</span><span class="p">[(</span><span class="nc">ActorRef</span><span class="p">,</span> <span class="nc">Msg</span><span class="p">)])</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="kd">val</span> <span class="n">behavior</span> <span class="o">=</span> <span class="n">behaviors</span><span class="p">(</span><span class="n">actor</span><span class="p">)</span>
+<span class="w">  </span><span class="k">private</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">deliverMessage</span><span class="p">(</span><span class="n">actor</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">,</span><span class="w"> </span><span class="n">msg</span><span class="p">:</span><span class="w"> </span><span class="nc">Msg</span><span class="p">):</span><span class="w"> </span><span class="p">(</span><span class="nc">Behavior</span><span class="p">,</span><span class="w"> </span><span class="nc">List</span><span class="p">[(</span><span class="nc">ActorRef</span><span class="p">,</span><span class="w"> </span><span class="nc">Msg</span><span class="p">)])</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">behavior</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">behaviors</span><span class="p">(</span><span class="n">actor</span><span class="p">)</span>
 
-    <span class="kd">val</span> <span class="n">ctx</span> <span class="o">=</span> <span class="nc">ActorContext</span><span class="p">(</span><span class="n">actor</span><span class="p">,</span> <span class="nc">Nil</span><span class="p">())</span>
-    <span class="kd">val</span> <span class="n">nextBehavior</span> <span class="o">=</span> <span class="n">behavior</span><span class="p">.</span><span class="n">processMsg</span><span class="p">(</span><span class="n">msg</span><span class="p">)(</span><span class="n">ctx</span><span class="p">)</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">ctx</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">ActorContext</span><span class="p">(</span><span class="n">actor</span><span class="p">,</span><span class="w"> </span><span class="nc">Nil</span><span class="p">())</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">nextBehavior</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">behavior</span><span class="p">.</span><span class="n">processMsg</span><span class="p">(</span><span class="n">msg</span><span class="p">)(</span><span class="n">ctx</span><span class="p">)</span>
 
-    <span class="p">(</span><span class="n">nextBehavior</span><span class="p">,</span> <span class="n">ctx</span><span class="p">.</span><span class="n">toSend</span><span class="p">)</span>
-  <span class="p">}</span>
+<span class="w">    </span><span class="p">(</span><span class="n">nextBehavior</span><span class="p">,</span><span class="w"> </span><span class="n">ctx</span><span class="p">.</span><span class="n">toSend</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 </section>
 <section id="building-a-replicated-counter">
-<h3>Building a replicated counter<a class="headerlink" href="#building-a-replicated-counter" title="Permalink to this headline">¶</a></h3>
+<h3>Building a replicated counter<a class="headerlink" href="#building-a-replicated-counter" title="Link to this heading">¶</a></h3>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@extern</span>
-<span class="k">def</span> <span class="nf">noSender</span> <span class="o">=</span> <span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">ActorRef</span><span class="p">.</span><span class="n">noSender</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">noSender</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">ActorRef</span><span class="p">.</span><span class="n">noSender</span>
 
-<span class="kd">val</span> <span class="nc">Primary</span> <span class="o">=</span> <span class="nc">ActorRef</span><span class="p">(</span><span class="s">&quot;primary&quot;</span><span class="p">,</span> <span class="n">noSender</span><span class="p">)</span>
-<span class="kd">val</span> <span class="nc">Backup</span>  <span class="o">=</span> <span class="nc">ActorRef</span><span class="p">(</span><span class="s">&quot;backup&quot;</span><span class="p">,</span> <span class="n">noSender</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="nc">Primary</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">(</span><span class="s">&quot;primary&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">noSender</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="nc">Backup</span><span class="w">  </span><span class="o">=</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">(</span><span class="s">&quot;backup&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">noSender</span><span class="p">)</span>
 
-<span class="k">case</span> <span class="k">object</span> <span class="nc">Inc</span> <span class="k">extends</span> <span class="nc">Msg</span>
+<span class="k">case</span><span class="w"> </span><span class="k">object</span><span class="w"> </span><span class="nc">Inc</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Msg</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Counter</span><span class="p">(</span><span class="n">value</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">value</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Counter</span><span class="p">(</span><span class="n">value</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">value</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
 
-  <span class="k">def</span> <span class="nf">increment</span><span class="p">:</span> <span class="nc">Counter</span> <span class="o">=</span> <span class="nc">Counter</span><span class="p">(</span><span class="n">value</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">increment</span><span class="p">:</span><span class="w"> </span><span class="nc">Counter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Counter</span><span class="p">(</span><span class="n">value</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
 
-  <span class="k">def</span> <span class="nf">&lt;=</span><span class="p">(</span><span class="n">that</span><span class="p">:</span> <span class="nc">Counter</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="bp">this</span><span class="p">.</span><span class="n">value</span> <span class="o">&lt;=</span> <span class="n">that</span><span class="p">.</span><span class="n">value</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">&lt;=</span><span class="p">(</span><span class="n">that</span><span class="p">:</span><span class="w"> </span><span class="nc">Counter</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">value</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">that</span><span class="p">.</span><span class="n">value</span>
 <span class="p">}</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">PrimBehav</span><span class="p">(</span><span class="n">backup</span><span class="p">:</span> <span class="nc">ActorRef</span><span class="p">,</span> <span class="n">counter</span><span class="p">:</span> <span class="nc">Counter</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">Behavior</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">backup</span><span class="p">.</span><span class="n">name</span> <span class="o">==</span> <span class="s">&quot;backup&quot;</span><span class="p">)</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">PrimBehav</span><span class="p">(</span><span class="n">backup</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">,</span><span class="w"> </span><span class="n">counter</span><span class="p">:</span><span class="w"> </span><span class="nc">Counter</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Behavior</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">backup</span><span class="p">.</span><span class="n">name</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="s">&quot;backup&quot;</span><span class="p">)</span>
 
-  <span class="k">override</span>
-  <span class="k">def</span> <span class="nf">processMsg</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span> <span class="nc">Msg</span><span class="p">)(</span><span class="k">implicit</span> <span class="n">ctx</span><span class="p">:</span> <span class="nc">ActorContext</span><span class="p">):</span> <span class="nc">Behavior</span> <span class="o">=</span> <span class="n">msg</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Inc</span> <span class="o">=&gt;</span>
-      <span class="n">backup</span> <span class="o">!</span> <span class="nc">Inc</span>
-      <span class="nc">PrimBehav</span><span class="p">(</span><span class="n">backup</span><span class="p">,</span> <span class="n">counter</span><span class="p">.</span><span class="n">increment</span><span class="p">)</span>
+<span class="w">  </span><span class="k">override</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">processMsg</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span><span class="w"> </span><span class="nc">Msg</span><span class="p">)(</span><span class="k">implicit</span><span class="w"> </span><span class="n">ctx</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorContext</span><span class="p">):</span><span class="w"> </span><span class="nc">Behavior</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">msg</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Inc</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">      </span><span class="n">backup</span><span class="w"> </span><span class="o">!</span><span class="w"> </span><span class="nc">Inc</span>
+<span class="w">      </span><span class="nc">PrimBehav</span><span class="p">(</span><span class="n">backup</span><span class="p">,</span><span class="w"> </span><span class="n">counter</span><span class="p">.</span><span class="n">increment</span><span class="p">)</span>
 
-    <span class="k">case</span> <span class="n">_</span> <span class="o">=&gt;</span> <span class="bp">this</span>
-  <span class="p">}</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="n">_</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="bp">this</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">BackBehav</span><span class="p">(</span><span class="n">counter</span><span class="p">:</span> <span class="nc">Counter</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">Behavior</span> <span class="p">{</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">BackBehav</span><span class="p">(</span><span class="n">counter</span><span class="p">:</span><span class="w"> </span><span class="nc">Counter</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Behavior</span><span class="w"> </span><span class="p">{</span>
 
-  <span class="k">override</span>
-  <span class="k">def</span> <span class="nf">processMsg</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span> <span class="nc">Msg</span><span class="p">)(</span><span class="k">implicit</span> <span class="n">ctx</span><span class="p">:</span> <span class="nc">ActorContext</span><span class="p">):</span> <span class="nc">Behavior</span> <span class="o">=</span> <span class="n">msg</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Inc</span> <span class="o">=&gt;</span>
-      <span class="nc">BackBehav</span><span class="p">(</span><span class="n">counter</span><span class="p">.</span><span class="n">increment</span><span class="p">)</span>
+<span class="w">  </span><span class="k">override</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">processMsg</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span><span class="w"> </span><span class="nc">Msg</span><span class="p">)(</span><span class="k">implicit</span><span class="w"> </span><span class="n">ctx</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorContext</span><span class="p">):</span><span class="w"> </span><span class="nc">Behavior</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">msg</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Inc</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">      </span><span class="nc">BackBehav</span><span class="p">(</span><span class="n">counter</span><span class="p">.</span><span class="n">increment</span><span class="p">)</span>
 
-    <span class="k">case</span> <span class="n">_</span> <span class="o">=&gt;</span> <span class="bp">this</span>
-  <span class="p">}</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="n">_</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="bp">this</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <section id="proving-preservation-of-an-invariant">
-<h4>Proving preservation of an invariant<a class="headerlink" href="#proving-preservation-of-an-invariant" title="Permalink to this headline">¶</a></h4>
+<h4>Proving preservation of an invariant<a class="headerlink" href="#proving-preservation-of-an-invariant" title="Link to this heading">¶</a></h4>
 <p>After having defined an actor system with our framework, one might want to verify that this system preserves some invariant between each step of its execution. That is to say, given an invariant <code class="docutils literal notranslate"><span class="pre">inv:</span> <span class="pre">ActorSystem</span> <span class="pre">→</span> <span class="pre">Boolean</span></code>, for any <code class="docutils literal notranslate"><span class="pre">ActorSystem</span></code> <cite>s</cite> and any two <code class="docutils literal notranslate"><span class="pre">ActorRef</span></code> <cite>n</cite> and <cite>m</cite>, if <code class="docutils literal notranslate"><span class="pre">inv(s)</span></code> holds, then <code class="docutils literal notranslate"><span class="pre">inv(s.step(n,</span> <span class="pre">m))</span></code> should hold as well. In other words:</p>
 <p><span class="math notranslate nohighlight">\(\forall s: \texttt{ActorSystem}, n, m: \texttt{ActorRef}. \texttt{inv}(s) \implies \texttt{inv}(s.\texttt{step}(n, m))\)</span></p>
 <p>We note that, because we are essentially doing a proof by induction over execution steps here, one needs also to ensure the invariant holds for some initial system. We show these two properties below:</p>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@ghost</span>
-<span class="k">def</span> <span class="nf">invariant</span><span class="p">(</span><span class="n">s</span><span class="p">:</span> <span class="nc">ActorSystem</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">s</span><span class="p">.</span><span class="n">inboxes</span><span class="p">(</span><span class="nc">Primary</span> <span class="o">-&gt;</span> <span class="nc">Primary</span><span class="p">).</span><span class="n">isEmpty</span> <span class="o">&amp;&amp;</span>
-  <span class="n">s</span><span class="p">.</span><span class="n">inboxes</span><span class="p">(</span><span class="nc">Backup</span> <span class="o">-&gt;</span> <span class="nc">Primary</span><span class="p">).</span><span class="n">isEmpty</span> <span class="o">&amp;&amp;</span>
-  <span class="n">s</span><span class="p">.</span><span class="n">inboxes</span><span class="p">(</span><span class="nc">Backup</span> <span class="o">-&gt;</span> <span class="nc">Backup</span><span class="p">).</span><span class="n">isEmpty</span> <span class="o">&amp;&amp;</span>
-  <span class="n">s</span><span class="p">.</span><span class="n">inboxes</span><span class="p">(</span><span class="nc">Primary</span> <span class="o">-&gt;</span> <span class="nc">Backup</span><span class="p">).</span><span class="n">forall</span><span class="p">(</span><span class="n">_</span> <span class="o">==</span> <span class="nc">Inc</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="p">{</span>
-    <span class="p">(</span><span class="n">s</span><span class="p">.</span><span class="n">behaviors</span><span class="p">(</span><span class="nc">Primary</span><span class="p">),</span> <span class="n">s</span><span class="p">.</span><span class="n">behaviors</span><span class="p">(</span><span class="nc">Backup</span><span class="p">))</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="p">(</span><span class="nc">PrimBehav</span><span class="p">(</span><span class="n">_</span><span class="p">,</span> <span class="n">p</span><span class="p">),</span> <span class="nc">BackBehav</span><span class="p">(</span><span class="n">b</span><span class="p">))</span> <span class="o">=&gt;</span>
-        <span class="n">p</span><span class="p">.</span><span class="n">value</span> <span class="o">==</span> <span class="n">b</span><span class="p">.</span><span class="n">value</span> <span class="o">+</span> <span class="n">s</span><span class="p">.</span><span class="n">inboxes</span><span class="p">(</span><span class="nc">Primary</span> <span class="o">-&gt;</span> <span class="nc">Backup</span><span class="p">).</span><span class="n">length</span>
-
-      <span class="k">case</span> <span class="n">_</span> <span class="o">=&gt;</span> <span class="kc">false</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">invariant</span><span class="p">(</span><span class="n">s</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorSystem</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">s</span><span class="p">.</span><span class="n">inboxes</span><span class="p">(</span><span class="nc">Primary</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="nc">Primary</span><span class="p">).</span><span class="n">isEmpty</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">  </span><span class="n">s</span><span class="p">.</span><span class="n">inboxes</span><span class="p">(</span><span class="nc">Backup</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="nc">Primary</span><span class="p">).</span><span class="n">isEmpty</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">  </span><span class="n">s</span><span class="p">.</span><span class="n">inboxes</span><span class="p">(</span><span class="nc">Backup</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="nc">Backup</span><span class="p">).</span><span class="n">isEmpty</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">  </span><span class="n">s</span><span class="p">.</span><span class="n">inboxes</span><span class="p">(</span><span class="nc">Primary</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="nc">Backup</span><span class="p">).</span><span class="n">forall</span><span class="p">(</span><span class="n">_</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="nc">Inc</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="p">(</span><span class="n">s</span><span class="p">.</span><span class="n">behaviors</span><span class="p">(</span><span class="nc">Primary</span><span class="p">),</span><span class="w"> </span><span class="n">s</span><span class="p">.</span><span class="n">behaviors</span><span class="p">(</span><span class="nc">Backup</span><span class="p">))</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="nc">PrimBehav</span><span class="p">(</span><span class="n">_</span><span class="p">,</span><span class="w"> </span><span class="n">p</span><span class="p">),</span><span class="w"> </span><span class="nc">BackBehav</span><span class="p">(</span><span class="n">b</span><span class="p">))</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">        </span><span class="n">p</span><span class="p">.</span><span class="n">value</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">b</span><span class="p">.</span><span class="n">value</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">s</span><span class="p">.</span><span class="n">inboxes</span><span class="p">(</span><span class="nc">Primary</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="nc">Backup</span><span class="p">).</span><span class="n">length</span>
+
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="n">_</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">false</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
 <span class="nd">@ghost</span>
-<span class="k">def</span> <span class="nf">initialSystem</span> <span class="o">=</span> <span class="nc">ActorSystem</span><span class="p">(</span>
-  <span class="n">behaviors</span> <span class="o">=</span> <span class="nc">CMap</span><span class="p">({</span>
-    <span class="k">case</span> <span class="n">`Primary`</span> <span class="o">=&gt;</span> <span class="nc">PrimBehav</span><span class="p">(</span><span class="nc">Counter</span><span class="p">(</span><span class="mi">0</span><span class="p">))</span>
-    <span class="k">case</span> <span class="n">`Backup`</span>  <span class="o">=&gt;</span> <span class="nc">BackBehav</span><span class="p">(</span><span class="nc">Counter</span><span class="p">(</span><span class="mi">0</span><span class="p">))</span>
-  <span class="p">}),</span>
-  <span class="n">inboxes</span> <span class="o">=</span> <span class="nc">CMap</span><span class="p">(</span><span class="n">_</span> <span class="o">=&gt;</span> <span class="nc">List</span><span class="p">())</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">initialSystem</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">ActorSystem</span><span class="p">(</span>
+<span class="w">  </span><span class="n">behaviors</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">CMap</span><span class="p">({</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="n">`Primary`</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">PrimBehav</span><span class="p">(</span><span class="nc">Counter</span><span class="p">(</span><span class="mi">0</span><span class="p">))</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="n">`Backup`</span><span class="w">  </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">BackBehav</span><span class="p">(</span><span class="nc">Counter</span><span class="p">(</span><span class="mi">0</span><span class="p">))</span>
+<span class="w">  </span><span class="p">}),</span>
+<span class="w">  </span><span class="n">inboxes</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">CMap</span><span class="p">(</span><span class="n">_</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">List</span><span class="p">())</span>
 <span class="p">)</span>
 
 <span class="nd">@ghost</span>
-<span class="k">def</span> <span class="nf">initialInv</span> <span class="o">=</span> <span class="n">invariant</span><span class="p">(</span><span class="n">initialSystem</span><span class="p">).</span><span class="n">holds</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">initialInv</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">invariant</span><span class="p">(</span><span class="n">initialSystem</span><span class="p">).</span><span class="n">holds</span>
 
 <span class="nd">@ghost</span>
-<span class="k">def</span> <span class="nf">validRef</span><span class="p">(</span><span class="n">ref</span><span class="p">:</span> <span class="nc">ActorRef</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="n">ref</span> <span class="o">==</span> <span class="nc">Primary</span> <span class="o">||</span> <span class="n">ref</span> <span class="o">==</span> <span class="nc">Backup</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">validRef</span><span class="p">(</span><span class="n">ref</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">ref</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="nc">Primary</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="n">ref</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="nc">Backup</span>
 
 <span class="nd">@ghost</span>
-<span class="k">def</span> <span class="nf">theorem</span><span class="p">(</span><span class="n">s</span><span class="p">:</span> <span class="nc">ActorSystem</span><span class="p">,</span> <span class="n">from</span><span class="p">:</span> <span class="nc">ActorRef</span><span class="p">,</span> <span class="n">to</span><span class="p">:</span> <span class="nc">ActorRef</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">invariant</span><span class="p">(</span><span class="n">s</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">validRef</span><span class="p">(</span><span class="n">from</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">validRef</span><span class="p">(</span><span class="n">to</span><span class="p">))</span>
-  <span class="kd">val</span> <span class="n">newSystem</span> <span class="o">=</span> <span class="n">s</span><span class="p">.</span><span class="n">step</span><span class="p">(</span><span class="n">from</span><span class="p">,</span> <span class="n">to</span><span class="p">)</span>
-  <span class="n">invariant</span><span class="p">(</span><span class="n">newSystem</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">theorem</span><span class="p">(</span><span class="n">s</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorSystem</span><span class="p">,</span><span class="w"> </span><span class="n">from</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">,</span><span class="w"> </span><span class="n">to</span><span class="p">:</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">invariant</span><span class="p">(</span><span class="n">s</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">validRef</span><span class="p">(</span><span class="n">from</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">validRef</span><span class="p">(</span><span class="n">to</span><span class="p">))</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">newSystem</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">s</span><span class="p">.</span><span class="n">step</span><span class="p">(</span><span class="n">from</span><span class="p">,</span><span class="w"> </span><span class="n">to</span><span class="p">)</span>
+<span class="w">  </span><span class="n">invariant</span><span class="p">(</span><span class="n">newSystem</span><span class="p">)</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
 </section>
 </section>
 <section id="running-the-system-with-akka">
-<h3>Running the system with Akka<a class="headerlink" href="#running-the-system-with-akka" title="Permalink to this headline">¶</a></h3>
+<h3>Running the system with Akka<a class="headerlink" href="#running-the-system-with-akka" title="Link to this heading">¶</a></h3>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@ignore</span>
-<span class="k">class</span> <span class="nc">ActorWrapper</span><span class="p">(</span><span class="n">initialBehavior</span><span class="p">:</span> <span class="nc">Behavior</span><span class="p">)</span> <span class="k">extends</span> <span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">Actor</span> <span class="k">with</span> <span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">ActorLogging</span> <span class="p">{</span>
+<span class="k">class</span><span class="w"> </span><span class="nc">ActorWrapper</span><span class="p">(</span><span class="n">initialBehavior</span><span class="p">:</span><span class="w"> </span><span class="nc">Behavior</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">Actor</span><span class="w"> </span><span class="k">with</span><span class="w"> </span><span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">ActorLogging</span><span class="w"> </span><span class="p">{</span>
 
-  <span class="k">private</span> <span class="k">def</span> <span class="nf">handler</span><span class="p">(</span><span class="n">behavior</span><span class="p">:</span> <span class="nc">Behavior</span><span class="p">):</span> <span class="nc">PartialFunction</span><span class="p">[</span><span class="nc">Any</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="n">msg</span><span class="p">:</span> <span class="nc">Msg</span> <span class="o">=&gt;</span>
-      <span class="kd">val</span> <span class="n">me</span> <span class="o">=</span> <span class="nc">ActorRef</span><span class="p">(</span><span class="n">context</span><span class="p">.</span><span class="n">self</span><span class="p">.</span><span class="n">path</span><span class="p">.</span><span class="n">name</span><span class="p">,</span> <span class="n">context</span><span class="p">.</span><span class="n">self</span><span class="p">)</span>
-      <span class="kd">val</span> <span class="n">ctx</span> <span class="o">=</span> <span class="nc">ActorContext</span><span class="p">(</span><span class="n">me</span><span class="p">,</span> <span class="nc">Nil</span><span class="p">())</span>
-      <span class="kd">val</span> <span class="n">newBehavior</span> <span class="o">=</span> <span class="n">behavior</span><span class="p">.</span><span class="n">processMsg</span><span class="p">(</span><span class="n">msg</span><span class="p">)(</span><span class="n">ctx</span><span class="p">)</span>
+<span class="w">  </span><span class="k">private</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">handler</span><span class="p">(</span><span class="n">behavior</span><span class="p">:</span><span class="w"> </span><span class="nc">Behavior</span><span class="p">):</span><span class="w"> </span><span class="nc">PartialFunction</span><span class="p">[</span><span class="nc">Any</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="n">msg</span><span class="p">:</span><span class="w"> </span><span class="nc">Msg</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">      </span><span class="kd">val</span><span class="w"> </span><span class="n">me</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">(</span><span class="n">context</span><span class="p">.</span><span class="n">self</span><span class="p">.</span><span class="n">path</span><span class="p">.</span><span class="n">name</span><span class="p">,</span><span class="w"> </span><span class="n">context</span><span class="p">.</span><span class="n">self</span><span class="p">)</span>
+<span class="w">      </span><span class="kd">val</span><span class="w"> </span><span class="n">ctx</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">ActorContext</span><span class="p">(</span><span class="n">me</span><span class="p">,</span><span class="w"> </span><span class="nc">Nil</span><span class="p">())</span>
+<span class="w">      </span><span class="kd">val</span><span class="w"> </span><span class="n">newBehavior</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">behavior</span><span class="p">.</span><span class="n">processMsg</span><span class="p">(</span><span class="n">msg</span><span class="p">)(</span><span class="n">ctx</span><span class="p">)</span>
 
-      <span class="n">log</span><span class="p">.</span><span class="n">info</span><span class="p">(</span><span class="s">s&quot;Received: </span><span class="si">$</span><span class="n">msg</span><span class="s">, becoming </span><span class="si">$</span><span class="n">newBehavior</span><span class="s">&quot;</span><span class="p">)</span>
-      <span class="n">context</span><span class="p">.</span><span class="n">become</span><span class="p">(</span><span class="n">handler</span><span class="p">(</span><span class="n">newBehavior</span><span class="p">),</span> <span class="n">discardOld</span> <span class="o">=</span> <span class="kc">true</span><span class="p">)</span>
-  <span class="p">}</span>
+<span class="w">      </span><span class="n">log</span><span class="p">.</span><span class="n">info</span><span class="p">(</span><span class="s">s&quot;Received: </span><span class="si">$</span><span class="n">msg</span><span class="s">, becoming </span><span class="si">$</span><span class="n">newBehavior</span><span class="s">&quot;</span><span class="p">)</span>
+<span class="w">      </span><span class="n">context</span><span class="p">.</span><span class="n">become</span><span class="p">(</span><span class="n">handler</span><span class="p">(</span><span class="n">newBehavior</span><span class="p">),</span><span class="w"> </span><span class="n">discardOld</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">true</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="k">def</span> <span class="nf">receive</span> <span class="o">=</span> <span class="n">handler</span><span class="p">(</span><span class="n">initialBehavior</span><span class="p">)</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">receive</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">handler</span><span class="p">(</span><span class="n">initialBehavior</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@ignore</span>
-<span class="k">def</span> <span class="nf">main</span><span class="p">(</span><span class="n">args</span><span class="p">:</span> <span class="nc">Array</span><span class="p">[</span><span class="nc">String</span><span class="p">]):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">initCounter</span> <span class="o">=</span> <span class="nc">Counter</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
-
-  <span class="kd">val</span> <span class="n">system</span> <span class="o">=</span> <span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">ActorSystem</span><span class="p">(</span><span class="s">&quot;Counter&quot;</span><span class="p">)</span>
-
-  <span class="kd">val</span> <span class="n">backupRef</span> <span class="o">=</span> <span class="nc">ActorRef</span><span class="p">(</span>
-    <span class="s">&quot;backup&quot;</span><span class="p">,</span>
-    <span class="n">system</span><span class="p">.</span><span class="n">actorOf</span><span class="p">(</span>
-      <span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">Props</span><span class="p">(</span><span class="k">new</span> <span class="nc">ActorWrapper</span><span class="p">(</span><span class="nc">BackBehav</span><span class="p">(</span><span class="n">initCounter</span><span class="p">))),</span>
-      <span class="n">name</span> <span class="o">=</span> <span class="s">&quot;backup&quot;</span>
-    <span class="p">)</span>
-  <span class="p">)</span>
-
-  <span class="kd">val</span> <span class="n">primaryRef</span> <span class="o">=</span> <span class="nc">ActorRef</span><span class="p">(</span>
-    <span class="s">&quot;primary&quot;</span><span class="p">,</span>
-    <span class="n">system</span><span class="p">.</span><span class="n">actorOf</span><span class="p">(</span>
-      <span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">Props</span><span class="p">(</span><span class="k">new</span> <span class="nc">ActorWrapper</span><span class="p">(</span><span class="nc">PrimBehav</span><span class="p">(</span><span class="n">backupRef</span><span class="p">,</span> <span class="n">initCounter</span><span class="p">))),</span>
-      <span class="n">name</span> <span class="o">=</span> <span class="s">&quot;primary&quot;</span>
-    <span class="p">)</span>
-  <span class="p">)</span>
-
-  <span class="k">implicit</span> <span class="kd">val</span> <span class="n">ctx</span> <span class="o">=</span> <span class="nc">ActorContext</span><span class="p">(</span><span class="n">primaryRef</span><span class="p">,</span> <span class="nc">Nil</span><span class="p">())</span>
-
-  <span class="k">import</span> <span class="nn">system</span><span class="p">.</span><span class="n">dispatcher</span>
-  <span class="k">import</span> <span class="nn">scala</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nn">duration</span><span class="p">.</span><span class="n">_</span>
-  <span class="n">system</span><span class="p">.</span><span class="n">scheduler</span><span class="p">.</span><span class="n">schedule</span><span class="p">(</span><span class="mi">500</span><span class="p">.</span><span class="n">millis</span><span class="p">,</span> <span class="mi">1000</span><span class="p">.</span><span class="n">millis</span><span class="p">)</span> <span class="p">{</span>
-    <span class="n">primaryRef</span> <span class="o">!</span> <span class="nc">Inc</span>
-  <span class="p">}</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">main</span><span class="p">(</span><span class="n">args</span><span class="p">:</span><span class="w"> </span><span class="nc">Array</span><span class="p">[</span><span class="nc">String</span><span class="p">]):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">initCounter</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Counter</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
+
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">system</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">ActorSystem</span><span class="p">(</span><span class="s">&quot;Counter&quot;</span><span class="p">)</span>
+
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">backupRef</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">(</span>
+<span class="w">    </span><span class="s">&quot;backup&quot;</span><span class="p">,</span>
+<span class="w">    </span><span class="n">system</span><span class="p">.</span><span class="n">actorOf</span><span class="p">(</span>
+<span class="w">      </span><span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">Props</span><span class="p">(</span><span class="k">new</span><span class="w"> </span><span class="nc">ActorWrapper</span><span class="p">(</span><span class="nc">BackBehav</span><span class="p">(</span><span class="n">initCounter</span><span class="p">))),</span>
+<span class="w">      </span><span class="n">name</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="s">&quot;backup&quot;</span>
+<span class="w">    </span><span class="p">)</span>
+<span class="w">  </span><span class="p">)</span>
+
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">primaryRef</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">ActorRef</span><span class="p">(</span>
+<span class="w">    </span><span class="s">&quot;primary&quot;</span><span class="p">,</span>
+<span class="w">    </span><span class="n">system</span><span class="p">.</span><span class="n">actorOf</span><span class="p">(</span>
+<span class="w">      </span><span class="n">akka</span><span class="p">.</span><span class="n">actor</span><span class="p">.</span><span class="nc">Props</span><span class="p">(</span><span class="k">new</span><span class="w"> </span><span class="nc">ActorWrapper</span><span class="p">(</span><span class="nc">PrimBehav</span><span class="p">(</span><span class="n">backupRef</span><span class="p">,</span><span class="w"> </span><span class="n">initCounter</span><span class="p">))),</span>
+<span class="w">      </span><span class="n">name</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="s">&quot;primary&quot;</span>
+<span class="w">    </span><span class="p">)</span>
+<span class="w">  </span><span class="p">)</span>
+
+<span class="w">  </span><span class="k">implicit</span><span class="w"> </span><span class="kd">val</span><span class="w"> </span><span class="n">ctx</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">ActorContext</span><span class="p">(</span><span class="n">primaryRef</span><span class="p">,</span><span class="w"> </span><span class="nc">Nil</span><span class="p">())</span>
+
+<span class="w">  </span><span class="k">import</span><span class="w"> </span><span class="nn">system</span><span class="p">.</span><span class="n">dispatcher</span>
+<span class="w">  </span><span class="k">import</span><span class="w"> </span><span class="nn">scala</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nn">duration</span><span class="p">.</span><span class="n">_</span>
+<span class="w">  </span><span class="n">system</span><span class="p">.</span><span class="n">scheduler</span><span class="p">.</span><span class="n">schedule</span><span class="p">(</span><span class="mi">500</span><span class="p">.</span><span class="n">millis</span><span class="p">,</span><span class="w"> </span><span class="mi">1000</span><span class="p">.</span><span class="n">millis</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">primaryRef</span><span class="w"> </span><span class="o">!</span><span class="w"> </span><span class="nc">Inc</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -399,8 +398,7 @@ <h3>Running the system with Akka<a class="headerlink" href="#running-the-system-
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="limitations.html" class="btn btn-neutral float-left" title="Limitations of Verification" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="coq.html" class="btn btn-neutral float-right" title="Translation from Stainless to Coq" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -409,7 +407,7 @@ <h3>Running the system with Akka<a class="headerlink" href="#running-the-system-
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -420,7 +418,7 @@ <h3>Running the system with Akka<a class="headerlink" href="#running-the-system-
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/coq.html b/coq.html
index ded14e3445..8ce04d9654 100644
--- a/coq.html
+++ b/coq.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Translation from Stainless to Coq &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="FAQ: (Frequently) Asked Questions" href="faq.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -75,20 +77,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Translation from Stainless to Coq</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Translation from Stainless to Coq</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/coq.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -99,7 +98,7 @@
            <div itemprop="articleBody">
              
   <section id="translation-from-stainless-to-coq">
-<span id="coq"></span><h1>Translation from Stainless to Coq<a class="headerlink" href="#translation-from-stainless-to-coq" title="Permalink to this headline">¶</a></h1>
+<span id="coq"></span><h1>Translation from Stainless to Coq<a class="headerlink" href="#translation-from-stainless-to-coq" title="Link to this heading">¶</a></h1>
 <p>Initially based on a project done by <a class="reference external" href="https://github.com/czipobence">Bence Czipó</a>, this translation is an early experimental
 stage.</p>
 <p>The <cite>–coq</cite> option of Stainless replaces the standard verification checker
@@ -107,7 +106,7 @@
 is translated to a Coq file, and obligations corresponding to assertions,
 preconditions, and postconditions are solved using predefined tactics in Coq.</p>
 <section id="requirements">
-<span id="coq-requirements"></span><h2>Requirements<a class="headerlink" href="#requirements" title="Permalink to this headline">¶</a></h2>
+<span id="coq-requirements"></span><h2>Requirements<a class="headerlink" href="#requirements" title="Link to this heading">¶</a></h2>
 <ul class="simple">
 <li><p>Coq 8.11.2</p></li>
 <li><p>Coq Equations 1.2.2+8.11</p></li>
@@ -116,27 +115,27 @@
 README.md</a>.</p>
 </section>
 <section id="usage-of-the-coq-option">
-<span id="coq-option"></span><h2>Usage of the Coq option<a class="headerlink" href="#usage-of-the-coq-option" title="Permalink to this headline">¶</a></h2>
+<span id="coq-option"></span><h2>Usage of the Coq option<a class="headerlink" href="#usage-of-the-coq-option" title="Link to this heading">¶</a></h2>
 <p>First, clone the <a class="reference external" href="https://github.com/epfl-lara/stainless">Stainless repository</a>. In the <cite>slc-lib</cite> directory, run
 <cite>./configure</cite> and <cite>make</cite>.</p>
 <p>Then, assuming the Stainless binary <code class="docutils literal notranslate"><span class="pre">stainless-scalac</span></code> is in your path, run:
 <code class="docutils literal notranslate"><span class="pre">stainless-scalac</span> <span class="pre">--coq</span> <span class="pre">File.scala</span></code> on the file of your choice. As an example,
 consider the <code class="docutils literal notranslate"><span class="pre">test</span></code> function from the <a class="reference external" href="https://github.com/epfl-lara/stainless/blob/master/frontends/benchmarks/coq/Arith.scala">Arith.scala</a>
 file:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">test</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">b</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">c</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">a</span> <span class="o">&gt;</span> <span class="n">b</span> <span class="o">&amp;&amp;</span> <span class="n">c</span> <span class="o">&gt;</span> <span class="nc">BigInt</span><span class="p">(</span><span class="mi">0</span><span class="p">))</span>
-  <span class="n">c</span> <span class="o">+</span> <span class="n">a</span>
-<span class="p">}</span> <span class="n">ensuring</span><span class="p">(</span> <span class="n">_</span> <span class="o">&gt;</span> <span class="n">c</span> <span class="o">+</span> <span class="n">b</span> <span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">test</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">c</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">(</span><span class="mi">0</span><span class="p">))</span>
+<span class="w">   </span><span class="n">c</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">a</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="w"> </span><span class="n">_</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">c</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="p">)</span>
 </pre></div>
 </div>
 <p>Running <code class="docutils literal notranslate"><span class="pre">stainless-scalac</span> <span class="pre">--coq</span> <span class="pre">frontends/benchmarks/coq/Arith.scala</span></code>
 generates the file <code class="docutils literal notranslate"><span class="pre">tmp/test.v</span></code> which contains the following Coq definition.</p>
-<div class="highlight-coq notranslate"><div class="highlight"><pre><span></span><span class="kn">Definition</span> <span class="n">test</span> <span class="o">(</span><span class="n">a</span><span class="o">:</span> <span class="n">Z</span><span class="o">)</span> <span class="o">(</span><span class="n">b</span><span class="o">:</span> <span class="n">Z</span><span class="o">)</span> <span class="o">(</span><span class="n">c</span><span class="o">:</span> <span class="n">Z</span><span class="o">)</span> <span class="o">(</span><span class="n">contractHyp4</span><span class="o">:</span> <span class="o">(</span><span class="n">ifthenelse</span> <span class="o">(</span><span class="n">Z</span><span class="o">.</span><span class="n">gtb</span> <span class="n">a</span> <span class="n">b</span><span class="o">)</span> <span class="n">bool</span>
-        <span class="o">(</span><span class="k">fun</span> <span class="o">_</span> <span class="o">=&gt;</span> <span class="n">Z</span><span class="o">.</span><span class="n">gtb</span> <span class="n">c</span> <span class="o">(</span><span class="mi">0</span><span class="o">)%</span><span class="n">Z</span> <span class="o">)</span>
-        <span class="o">(</span><span class="k">fun</span> <span class="o">_</span> <span class="o">=&gt;</span> <span class="bp">false</span> <span class="o">)</span> <span class="o">=</span> <span class="bp">true</span><span class="o">))</span> <span class="o">:</span> <span class="o">{</span><span class="n">x___1</span><span class="o">:</span> <span class="n">Z</span> <span class="o">|</span> <span class="o">(</span><span class="n">Z</span><span class="o">.</span><span class="n">gtb</span> <span class="n">x___1</span> <span class="o">(</span><span class="n">Z</span><span class="o">.</span><span class="n">add</span> <span class="n">c</span> <span class="n">b</span><span class="o">)</span> <span class="o">=</span> <span class="bp">true</span><span class="o">)}</span> <span class="o">:=</span>
-<span class="n">Z</span><span class="o">.</span><span class="n">add</span> <span class="n">c</span> <span class="n">a</span><span class="o">.</span>
+<div class="highlight-coq notranslate"><div class="highlight"><pre><span></span><span class="kn">Definition</span> <span class="n">test</span> <span class="o">(</span><span class="n">a</span><span class="o">:</span> <span class="n">Z</span><span class="o">)</span> <span class="o">(</span><span class="n">b</span><span class="o">:</span> <span class="n">Z</span><span class="o">)</span> <span class="o">(</span><span class="n">c</span><span class="o">:</span> <span class="n">Z</span><span class="o">)</span> <span class="o">(</span><span class="n">contractHyp4</span><span class="o">:</span> <span class="o">(</span><span class="n">ifthenelse</span> <span class="o">(</span><span class="n">Z.gtb</span> <span class="n">a</span> <span class="n">b</span><span class="o">)</span> <span class="n">bool</span>
+        <span class="o">(</span><span class="k">fun</span> <span class="o">_</span> <span class="o">=&gt;</span> <span class="n">Z.gtb</span> <span class="n">c</span> <span class="o">(</span><span class="mi">0</span><span class="o">)%</span><span class="n">Z</span> <span class="o">)</span>
+        <span class="o">(</span><span class="k">fun</span> <span class="o">_</span> <span class="o">=&gt;</span> <span class="bp">false</span> <span class="o">)</span> <span class="o">=</span> <span class="bp">true</span><span class="o">))</span> <span class="o">:</span> <span class="o">{</span><span class="n">x___1</span><span class="o">:</span> <span class="n">Z</span> <span class="o">|</span> <span class="o">(</span><span class="n">Z.gtb</span> <span class="n">x___1</span> <span class="o">(</span><span class="n">Z.add</span> <span class="n">c</span> <span class="n">b</span><span class="o">)</span> <span class="o">=</span> <span class="bp">true</span><span class="o">)}</span> <span class="o">:=</span>
+<span class="n">Z.add</span> <span class="n">c</span> <span class="n">a</span><span class="o">.</span>
 
-<span class="n">Fail</span> <span class="n">Next</span> <span class="n">Obligation</span><span class="o">.</span>
+<span class="kn">Fail</span> <span class="kn">Next Obligation</span><span class="o">.</span>
 </pre></div>
 </div>
 <p>The <code class="docutils literal notranslate"><span class="pre">coqc</span></code> executable in run on the file, and the status is reported by
@@ -154,8 +153,7 @@
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="casestudies.html" class="btn btn-neutral float-left" title="Case Studies" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="faq.html" class="btn btn-neutral float-right" title="FAQ: (Frequently) Asked Questions" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -164,7 +162,7 @@
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -175,7 +173,7 @@
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/equivalence.html b/equivalence.html
index c1850ba091..2c4cb2feee 100644
--- a/equivalence.html
+++ b/equivalence.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Equivalence Checking &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Ghost Context" href="ghost.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -74,20 +76,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Equivalence Checking</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Equivalence Checking</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/equivalence.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -98,53 +97,53 @@
            <div itemprop="articleBody">
              
   <section id="equivalence-checking">
-<h1>Equivalence Checking<a class="headerlink" href="#equivalence-checking" title="Permalink to this headline">¶</a></h1>
+<h1>Equivalence Checking<a class="headerlink" href="#equivalence-checking" title="Link to this heading">¶</a></h1>
 <p>Stainless can prove equivalence of recursive programs using automated functional induction. Additionaly, it can treat many programs at once, reusing the information obtained throughout the process, to reason about subsequent programs. <a class="reference external" href="https://infoscience.epfl.ch/record/290689?&amp;ln=en">This paper</a> explains the underlying algorithms.</p>
 <p>To run the equivalence checker, use the <code class="docutils literal notranslate"><span class="pre">--equivchk</span></code> option of Stainless. The option <code class="docutils literal notranslate"><span class="pre">--comparefuns</span></code> specifies the names of candidate functions. The option <code class="docutils literal notranslate"><span class="pre">--models</span></code> specifies the names of reference functions.</p>
 <section id="example-run">
-<h2>Example run<a class="headerlink" href="#example-run" title="Permalink to this headline">¶</a></h2>
+<h2>Example run<a class="headerlink" href="#example-run" title="Link to this heading">¶</a></h2>
 <p>Consider the following three functions <code class="docutils literal notranslate"><span class="pre">isSortedA</span></code> (incorrect), <code class="docutils literal notranslate"><span class="pre">isSortedB</span></code> and <code class="docutils literal notranslate"><span class="pre">isSortedC</span></code> (both correct), that implement a check whether a given input list is sorted in a non-decreasing order:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">isSortedA</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">leq</span><span class="p">(</span><span class="n">cur</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">next</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="n">cur</span> <span class="o">&lt;</span> <span class="n">next</span>
-  <span class="k">def</span> <span class="nf">iter</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span>
-    <span class="k">if</span> <span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span> <span class="kc">true</span>
-    <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span> <span class="kc">true</span>
-    <span class="k">else</span> <span class="n">leq</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">head</span><span class="p">,</span> <span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">.</span><span class="n">head</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">iter</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">)</span>
-  <span class="k">if</span> <span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">size</span> <span class="o">&lt;</span> <span class="mi">2</span><span class="p">)</span> <span class="kc">true</span>
-  <span class="k">else</span> <span class="n">l</span><span class="p">.</span><span class="n">head</span> <span class="o">&lt;=</span> <span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">.</span><span class="n">head</span> <span class="o">&amp;&amp;</span> <span class="n">iter</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">isSortedA</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">leq</span><span class="p">(</span><span class="n">cur</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">next</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">cur</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">next</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">iter</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span>
+<span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="n">leq</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">head</span><span class="p">,</span><span class="w"> </span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">.</span><span class="n">head</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">iter</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">)</span>
+<span class="w">  </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">size</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">  </span><span class="k">else</span><span class="w"> </span><span class="n">l</span><span class="p">.</span><span class="n">head</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">.</span><span class="n">head</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">iter</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">isSortedB</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="k">if</span> <span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span>
-    <span class="kc">true</span>
-  <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">.</span><span class="n">isEmpty</span> <span class="o">&amp;&amp;</span> <span class="n">l</span><span class="p">.</span><span class="n">head</span> <span class="o">&gt;</span> <span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">.</span><span class="n">head</span><span class="p">)</span>
-    <span class="kc">false</span>
-  <span class="k">else</span>
-    <span class="n">isSortedB</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">isSortedB</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span>
+<span class="w">    </span><span class="kc">true</span>
+<span class="w">  </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="o">!</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">.</span><span class="n">isEmpty</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">l</span><span class="p">.</span><span class="n">head</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">.</span><span class="n">head</span><span class="p">)</span>
+<span class="w">    </span><span class="kc">false</span>
+<span class="w">  </span><span class="k">else</span>
+<span class="w">    </span><span class="n">isSortedB</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">isSortedC</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">chk</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">],</span> <span class="n">p</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">a</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="k">if</span> <span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span> <span class="n">a</span>
-    <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">head</span> <span class="o">&lt;</span> <span class="n">p</span><span class="p">)</span> <span class="kc">false</span>
-    <span class="k">else</span> <span class="n">chk</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">,</span> <span class="n">l</span><span class="p">.</span><span class="n">head</span><span class="p">,</span> <span class="n">a</span><span class="p">)</span>
-  <span class="p">}</span>
-  <span class="k">if</span> <span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span> <span class="kc">true</span>
-  <span class="k">else</span> <span class="n">chk</span><span class="p">(</span><span class="n">l</span><span class="p">,</span> <span class="n">l</span><span class="p">.</span><span class="n">head</span><span class="p">,</span> <span class="kc">true</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">isSortedC</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">chk</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">],</span><span class="w"> </span><span class="n">p</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span><span class="w"> </span><span class="n">a</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">head</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">p</span><span class="p">)</span><span class="w"> </span><span class="kc">false</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="n">chk</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">,</span><span class="w"> </span><span class="n">l</span><span class="p">.</span><span class="n">head</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
+<span class="w">  </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">  </span><span class="k">else</span><span class="w"> </span><span class="n">chk</span><span class="p">(</span><span class="n">l</span><span class="p">,</span><span class="w"> </span><span class="n">l</span><span class="p">.</span><span class="n">head</span><span class="p">,</span><span class="w"> </span><span class="kc">true</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>And the following reference function <code class="docutils literal notranslate"><span class="pre">isSortedR</span></code>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">isSortedR</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">loop</span><span class="p">(</span><span class="n">p</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">=&gt;</span> <span class="kc">true</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="k">if</span> <span class="p">(</span><span class="n">p</span> <span class="o">&lt;=</span> <span class="n">x</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">loop</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span>
-    <span class="k">case</span> <span class="n">_</span> <span class="o">=&gt;</span> <span class="kc">false</span>
-  <span class="p">}</span>
-  <span class="k">if</span> <span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span> <span class="kc">true</span>
-  <span class="k">else</span> <span class="n">loop</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">head</span><span class="p">,</span> <span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">isSortedR</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">loop</span><span class="p">(</span><span class="n">p</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">p</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">loop</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="n">_</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">false</span>
+<span class="w">  </span><span class="p">}</span>
+<span class="w">  </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">  </span><span class="k">else</span><span class="w"> </span><span class="n">loop</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">head</span><span class="p">,</span><span class="w"> </span><span class="n">l</span><span class="p">.</span><span class="n">tail</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -180,8 +179,7 @@ <h2>Example run<a class="headerlink" href="#example-run" title="Permalink to thi
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="imperative.html" class="btn btn-neutral float-left" title="Imperative" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="ghost.html" class="btn btn-neutral float-right" title="Ghost Context" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -190,7 +188,7 @@ <h2>Example run<a class="headerlink" href="#example-run" title="Permalink to thi
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -201,7 +199,7 @@ <h2>Example run<a class="headerlink" href="#example-run" title="Permalink to thi
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/faq.html b/faq.html
index b8cd915db1..0fc2f813ef 100644
--- a/faq.html
+++ b/faq.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>FAQ: (Frequently) Asked Questions &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="References" href="references.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -81,20 +83,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>FAQ: (Frequently) Asked Questions</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">FAQ: (Frequently) Asked Questions</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/faq.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -105,14 +104,14 @@
            <div itemprop="articleBody">
              
   <section id="faq-frequently-asked-questions">
-<span id="faq"></span><h1>FAQ: (Frequently) Asked Questions<a class="headerlink" href="#faq-frequently-asked-questions" title="Permalink to this headline">¶</a></h1>
+<span id="faq"></span><h1>FAQ: (Frequently) Asked Questions<a class="headerlink" href="#faq-frequently-asked-questions" title="Link to this heading">¶</a></h1>
 <p>If you have a question, you may also post it at <a class="reference external" href="http://stackoverflow.com">http://stackoverflow.com</a>
 (try <a class="reference external" href="http://stackoverflow.com/questions/tagged/leon?sort=newest">searching for the leon tag</a>
 or <a class="reference external" href="http://stackoverflow.com/questions/tagged/stainless?sort=newest">the stainless tag</a>)
 or contact one of the authors of this documentation.</p>
 <p>Below we collect answers to some questions that came up.</p>
 <section id="how-does-stainless-compare-to-other-verification-tools">
-<h2>How does Stainless compare to other verification tools?<a class="headerlink" href="#how-does-stainless-compare-to-other-verification-tools" title="Permalink to this headline">¶</a></h2>
+<h2>How does Stainless compare to other verification tools?<a class="headerlink" href="#how-does-stainless-compare-to-other-verification-tools" title="Link to this heading">¶</a></h2>
 <p>One can compare Stainless to proof assistants such as
 <a class="reference external" href="https://isabelle.in.tum.de/">Isabelle/HOL</a>,
 <a class="reference external" href="https://coq.inria.fr/">Coq</a>,
@@ -133,37 +132,37 @@ <h2>How does Stainless compare to other verification tools?<a class="headerlink"
 On the other hand, proof assistants are much better at formalizing mathematics than Stainless, especially when it comes to libraries of formalized mathematics knowledge.</p>
 </section>
 <section id="how-does-stainless-compare-to-fuzzing-tools">
-<h2>How does Stainless compare to fuzzing tools?<a class="headerlink" href="#how-does-stainless-compare-to-fuzzing-tools" title="Permalink to this headline">¶</a></h2>
+<h2>How does Stainless compare to fuzzing tools?<a class="headerlink" href="#how-does-stainless-compare-to-fuzzing-tools" title="Link to this heading">¶</a></h2>
 <p>Formal software verification finds proofs that programs work under all scenarios of interest. Formal verification tools help developers construct such proofs, automatically searching for proofs using theorem proving and constraint solving (using, e.g. SMT solvers), and static analysis to discover program invariants. When it succeeds, formal verification is guaranteed to identify all software errors, including, for example, security vulnerabilities or cases when the computation produces a wrong numerical or symbolic result. Because it involves building proofs, this approach may require knowledge of proofs by induction and substitution of equals for equals, typically covered in computer science undergraduate university education. The best approach to obtain formally verified software is to perform formal verification while software is developed. If we try to apply formal verification after software is already written, we should be prepared to invest at least the amount of effort needed to rewrite it.</p>
 <p>Testing can establish the presence of errors, but not their absence. Basic forms of testing can be easy to deploy, because running a program on a given input is a minimum requirement for software, but such testing is extremely limited. Suppose that we wish to test whether a program running on a smartphone performs multiplication of two machine numbers correctly. If we could check one test per <em>nanosecond</em>, we would still need many billions of years to enumerate all cases! This also illustrates how minuscule of a region of space around a given test a fuzzer can ever explore, despite an amazing speed at which some these fuzzing tools work. Formal software verification can cover all these cases with a single proof because it uses algebraic properties that are independent of the size of the data that software manipulates.</p>
 <p>To avoid enumeration, advanced testing methods such as symbolic execution embrace constraint solvers originally developed for formal verification. These techniques reduce to formal verification when programs have no loops or recursion; otherwise they end up sampling a small fraction of program executions, so they do not result in a proof. To cover more than just absence of crashes and vulnerabilities, testing also requires insights into the purpose of software, the environment in which the software needs to execute and the expected outputs for given inputs.</p>
 </section>
 <section id="does-stainless-use-smt-solvers">
-<h2>Does Stainless use SMT solvers?<a class="headerlink" href="#does-stainless-use-smt-solvers" title="Permalink to this headline">¶</a></h2>
+<h2>Does Stainless use SMT solvers?<a class="headerlink" href="#does-stainless-use-smt-solvers" title="Link to this heading">¶</a></h2>
 <p>Stainless uses SMT solvers such as z3, CVC and Princess. The component that encodes formulas with executable higher-order functions into these solvers is Inox. Inox is designed to emit quantifier-free queries for these solvers, which increases its ability to generate counter-examples. The use of SMT solvers allows Stainless to achieve notable automation in reasoning about, for example, equality, case analysis, bitvectors, and algebraic data types.</p>
 </section>
 <section id="what-are-the-conditions-required-for-stainless-to-be-applied-to-industry-software">
-<h2>What are the conditions required for Stainless to be applied to industry software?<a class="headerlink" href="#what-are-the-conditions-required-for-stainless-to-be-applied-to-industry-software" title="Permalink to this headline">¶</a></h2>
+<h2>What are the conditions required for Stainless to be applied to industry software?<a class="headerlink" href="#what-are-the-conditions-required-for-stainless-to-be-applied-to-industry-software" title="Link to this heading">¶</a></h2>
 <p>It is best to deploy formal verification when starting to develop software. In this way, software and its specifications are developed hand in hand, much like one can define a class hierarchy and other types during the process of writing an object-oriented program. It is also possible to focus on one part of an existing software system and rewrite it in Stainless; such efforts have been shown to work in industry for software components in Scala, Java, and C.  Software that has well-defined modular structure with clear responsibility of different modules is a good candidate for verification because one can expect that specifications at module boundaries will be non-controversial. In terms of developer skills, good knowledge of discrete mathematics, such as proofs by induction and algebra will make developers more effective at verification.</p>
 </section>
 <section id="can-i-use-stainless-with-java">
-<h2>Can I use Stainless with Java?<a class="headerlink" href="#can-i-use-stainless-with-java" title="Permalink to this headline">¶</a></h2>
+<h2>Can I use Stainless with Java?<a class="headerlink" href="#can-i-use-stainless-with-java" title="Link to this heading">¶</a></h2>
 <p>Scala has excellent interoperability with Java, so external libraries can be used to build application where some parts are verified using Stainless. Stainless uses Scala syntax trees and does not support verification of Java itself. Whereas functional Scala works as a both specification and implementation language, Java does not appear to be a good language for specifications, so much that Java verification tools in the past introduced their own logical notation that developers then must learn in addition to Java.</p>
 </section>
 <section id="can-i-use-stainless-with-rust">
-<h2>Can I use Stainless with Rust?<a class="headerlink" href="#can-i-use-stainless-with-rust" title="Permalink to this headline">¶</a></h2>
+<h2>Can I use Stainless with Rust?<a class="headerlink" href="#can-i-use-stainless-with-rust" title="Link to this heading">¶</a></h2>
 <p>Even though we had somewhat successful experiments translating Rust code into Stainless, we believe that, in the long term, it is more productive to use Scala as the starting point and generate low-level code. We are working on making this more practical in the future.</p>
 </section>
 <section id="proving-properties-of-size">
-<h2>Proving properties of size<a class="headerlink" href="#proving-properties-of-size" title="Permalink to this headline">¶</a></h2>
+<h2>Proving properties of size<a class="headerlink" href="#proving-properties-of-size" title="Link to this heading">¶</a></h2>
 <p>I have defined a size function on my algebraic data type.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">List</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">head</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">tail</span><span class="p">:</span> <span class="nc">List</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">List</span>
-<span class="k">case</span> <span class="k">object</span> <span class="nc">Nil</span> <span class="k">extends</span> <span class="nc">List</span>
-<span class="k">def</span> <span class="nf">size</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">)</span> <span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">(</span><span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-  <span class="k">case</span> <span class="nc">Nil</span> <span class="o">=&gt;</span> <span class="mi">0</span>
-  <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">_</span><span class="p">,</span> <span class="n">t</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">size</span><span class="p">(</span><span class="n">t</span><span class="p">)</span>
-<span class="p">})</span> <span class="n">ensuring</span><span class="p">(</span><span class="n">_</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">List</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">head</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">tail</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span>
+<span class="k">case</span><span class="w"> </span><span class="k">object</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">size</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">_</span><span class="p">,</span><span class="w"> </span><span class="n">t</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">t</span><span class="p">)</span>
+<span class="p">}).</span><span class="n">ensuring</span><span class="p">(</span><span class="n">_</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>Stainless neither proves nor gives a counterexample. Why?</p>
@@ -178,7 +177,7 @@ <h2>Proving properties of size<a class="headerlink" href="#proving-properties-of
 <cite>ensuring</cite> clause would not hold.</p>
 </section>
 <section id="compiling-stainless-programs-to-bytecode">
-<h2>Compiling Stainless programs to bytecode<a class="headerlink" href="#compiling-stainless-programs-to-bytecode" title="Permalink to this headline">¶</a></h2>
+<h2>Compiling Stainless programs to bytecode<a class="headerlink" href="#compiling-stainless-programs-to-bytecode" title="Link to this heading">¶</a></h2>
 <p>If you don’t use special constructs such as <code class="docutils literal notranslate"><span class="pre">choose</span></code> or unbounded <code class="docutils literal notranslate"><span class="pre">forall</span></code>, you
 should be able to compile Stainless programs to <cite>.class</cite> using <cite>scalac</cite> and
 execute them directly on the JVM, or integrate them as part as other
@@ -189,8 +188,7 @@ <h2>Compiling Stainless programs to bytecode<a class="headerlink" href="#compili
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="coq.html" class="btn btn-neutral float-left" title="Translation from Stainless to Coq" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="references.html" class="btn btn-neutral float-right" title="References" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -199,7 +197,7 @@ <h2>Compiling Stainless programs to bytecode<a class="headerlink" href="#compili
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on May 09, 2024.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -210,7 +208,7 @@ <h2>Compiling Stainless programs to bytecode<a class="headerlink" href="#compili
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/genc.html b/genc.html
index 7012d46e07..ce91bf0ff7 100644
--- a/genc.html
+++ b/genc.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Generating C Code &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Proving Theorems" href="neon.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -98,20 +100,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Generating C Code</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Generating C Code</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/genc.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -122,7 +121,7 @@
            <div itemprop="articleBody">
              
   <section id="generating-c-code">
-<span id="genc"></span><h1>Generating C Code<a class="headerlink" href="#generating-c-code" title="Permalink to this headline">¶</a></h1>
+<span id="genc"></span><h1>Generating C Code<a class="headerlink" href="#generating-c-code" title="Link to this heading">¶</a></h1>
 <p>Stainless can generate from Scala code an equivalent and safe C99 code. Using the verification, repair and
 synthesis features of Stainless this conversion can be made safely. Additionally, the produced code can be
 compiled with any standard-compliant C99 compiler to target the desired hardware architecture
@@ -136,7 +135,7 @@
 is done using <code class="docutils literal notranslate"><span class="pre">malloc</span></code> function family.</p>
 </div>
 <section id="requirements">
-<h2>Requirements<a class="headerlink" href="#requirements" title="Permalink to this headline">¶</a></h2>
+<h2>Requirements<a class="headerlink" href="#requirements" title="Link to this heading">¶</a></h2>
 <p>The following is required from the Scala program fed to GenC:</p>
 <blockquote>
 <div><ul class="simple">
@@ -159,7 +158,7 @@ <h2>Requirements<a class="headerlink" href="#requirements" title="Permalink to t
 </div></blockquote>
 </section>
 <section id="export">
-<h2>Export<a class="headerlink" href="#export" title="Permalink to this headline">¶</a></h2>
+<h2>Export<a class="headerlink" href="#export" title="Link to this heading">¶</a></h2>
 <p>Functions and classes can be marked with <code class="docutils literal notranslate"><span class="pre">&#64;cCode.export</span></code> (<code class="docutils literal notranslate"><span class="pre">import</span> <span class="pre">stainless.annotation._</span></code>),
 which affects GenC compilation in several ways.
 First, the names of these functions and classes will not get mangled when generating the C code.
@@ -169,18 +168,14 @@ <h2>Export<a class="headerlink" href="#export" title="Permalink to this headline
 are transformed into runtime assertions.</p>
 </section>
 <section id="supported-features">
-<h2>Supported Features<a class="headerlink" href="#supported-features" title="Permalink to this headline">¶</a></h2>
+<h2>Supported Features<a class="headerlink" href="#supported-features" title="Link to this heading">¶</a></h2>
 <p>The supported subset of Scala includes part of the core languages features, as well as some
 imperative features, while ensuring the same expression execution order in both
 languages.</p>
 <section id="types">
-<h3>Types<a class="headerlink" href="#types" title="Permalink to this headline">¶</a></h3>
+<h3>Types<a class="headerlink" href="#types" title="Link to this heading">¶</a></h3>
 <p>The following raw types and their corresponding literals are supported:</p>
 <table class="docutils align-default">
-<colgroup>
-<col style="width: 50%" />
-<col style="width: 50%" />
-</colgroup>
 <thead>
 <tr class="row-odd"><th class="head"><p>Scala</p></th>
 <th class="head"><p>C99</p></th>
@@ -223,20 +218,20 @@ <h3>Types<a class="headerlink" href="#types" title="Permalink to this headline">
 of ASCII characters only but it has no API to manipulate strings at the moment:
 <code class="docutils literal notranslate"><span class="pre">Char</span></code> is mapped to <code class="docutils literal notranslate"><span class="pre">char</span></code> and <code class="docutils literal notranslate"><span class="pre">String</span></code> is mapped to <code class="docutils literal notranslate"><span class="pre">char*</span></code>.</p>
 <section id="tuples">
-<h4>Tuples<a class="headerlink" href="#tuples" title="Permalink to this headline">¶</a></h4>
+<h4>Tuples<a class="headerlink" href="#tuples" title="Link to this heading">¶</a></h4>
 <p>Using <code class="docutils literal notranslate"><span class="pre">TupleN[T1,</span> <span class="pre">...,</span> <span class="pre">TN]</span></code> results in the creation of a C structure with the
 same fields and matching types for every combination of any supported type
 <code class="docutils literal notranslate"><span class="pre">T1,</span> <span class="pre">...,</span> <span class="pre">TN</span></code>. The name of the generated structure will be unique and reflect
 the sequence of types.</p>
 </section>
 <section id="arrays">
-<h4>Arrays<a class="headerlink" href="#arrays" title="Permalink to this headline">¶</a></h4>
+<h4>Arrays<a class="headerlink" href="#arrays" title="Link to this heading">¶</a></h4>
 <p>Arrays are compiled by GenC into C structs that also store the length of the array.
 For <code class="docutils literal notranslate"><span class="pre">Array[Int]</span></code> we get:</p>
-<div class="highlight-C notranslate"><div class="highlight"><pre><span></span><span class="k">typedef</span><span class="w"> </span><span class="k">struct</span><span class="w"> </span><span class="p">{</span><span class="w"></span>
-<span class="w">  </span><span class="kt">int32_t</span><span class="o">*</span><span class="w"> </span><span class="n">data</span><span class="p">;</span><span class="w"></span>
-<span class="w">  </span><span class="kt">int32_t</span><span class="w"> </span><span class="n">length</span><span class="p">;</span><span class="w"></span>
-<span class="p">}</span><span class="w"> </span><span class="n">array_int32</span><span class="p">;</span><span class="w"></span>
+<div class="highlight-C notranslate"><div class="highlight"><pre><span></span><span class="k">typedef</span><span class="w"> </span><span class="k">struct</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kt">int32_t</span><span class="o">*</span><span class="w"> </span><span class="n">data</span><span class="p">;</span>
+<span class="w">  </span><span class="kt">int32_t</span><span class="w"> </span><span class="n">length</span><span class="p">;</span>
+<span class="p">}</span><span class="w"> </span><span class="n">array_int32</span><span class="p">;</span>
 </pre></div>
 </div>
 <div class="admonition note">
@@ -253,30 +248,30 @@ <h4>Arrays<a class="headerlink" href="#arrays" title="Permalink to this headline
 array, and the right-hand-side needs to be a constant (or evaluate to a constant
 at compile time).</p>
 <p>See below for a case class with a fixed length array and its transformation in C:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span> <span class="nc">CONSTANT1</span><span class="p">:</span> <span class="nc">UInt16</span> <span class="o">=</span> <span class="mi">5</span>
-<span class="kd">val</span> <span class="nc">CONSTANT2</span><span class="p">:</span> <span class="nc">UInt16</span> <span class="o">=</span> <span class="mi">12</span>
-<span class="kd">val</span> <span class="nc">CONSTANT3</span><span class="p">:</span> <span class="nc">UInt16</span> <span class="o">=</span> <span class="nc">CONSTANT1</span> <span class="o">+</span> <span class="nc">CONSTANT2</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span><span class="w"> </span><span class="nc">CONSTANT1</span><span class="p">:</span><span class="w"> </span><span class="nc">UInt16</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">5</span>
+<span class="kd">val</span><span class="w"> </span><span class="nc">CONSTANT2</span><span class="p">:</span><span class="w"> </span><span class="nc">UInt16</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">12</span>
+<span class="kd">val</span><span class="w"> </span><span class="nc">CONSTANT3</span><span class="p">:</span><span class="w"> </span><span class="nc">UInt16</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">CONSTANT1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nc">CONSTANT2</span>
 
 <span class="nd">@cCode</span><span class="p">.</span><span class="k">export</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">W</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">a</span><span class="p">:</span> <span class="nc">Array</span><span class="p">[</span><span class="nc">Int</span><span class="p">],</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span>
-    <span class="n">a</span><span class="p">.</span><span class="n">length</span> <span class="o">==</span> <span class="nc">CONSTANT3</span><span class="p">.</span><span class="n">toInt</span> <span class="o">&amp;&amp;</span>
-    <span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">x</span> <span class="o">&amp;&amp;</span> <span class="n">x</span> <span class="o">&lt;=</span> <span class="mi">1000</span> <span class="o">&amp;&amp;</span>
-    <span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">y</span> <span class="o">&amp;&amp;</span> <span class="n">y</span> <span class="o">&lt;=</span> <span class="mi">1000</span>
-  <span class="p">)</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">W</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Array</span><span class="p">[</span><span class="nc">Int</span><span class="p">],</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span>
+<span class="w">    </span><span class="n">a</span><span class="p">.</span><span class="n">length</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="nc">CONSTANT3</span><span class="p">.</span><span class="n">toInt</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">    </span><span class="mi">0</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="mi">1000</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">    </span><span class="mi">0</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="mi">1000</span>
+<span class="w">  </span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
-<div class="highlight-C notranslate"><div class="highlight"><pre><span></span><span class="k">typedef</span><span class="w"> </span><span class="k">struct</span><span class="w"> </span><span class="p">{</span><span class="w"></span>
-<span class="w">  </span><span class="kt">int32_t</span><span class="w"> </span><span class="n">x</span><span class="p">;</span><span class="w"></span>
-<span class="w">  </span><span class="kt">int32_t</span><span class="w"> </span><span class="n">a</span><span class="p">[</span><span class="mi">17</span><span class="p">];</span><span class="w"></span>
-<span class="w">  </span><span class="kt">int32_t</span><span class="w"> </span><span class="n">y</span><span class="p">;</span><span class="w"></span>
-<span class="p">}</span><span class="w"> </span><span class="n">W</span><span class="p">;</span><span class="w"></span>
+<div class="highlight-C notranslate"><div class="highlight"><pre><span></span><span class="k">typedef</span><span class="w"> </span><span class="k">struct</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kt">int32_t</span><span class="w"> </span><span class="n">x</span><span class="p">;</span>
+<span class="w">  </span><span class="kt">int32_t</span><span class="w"> </span><span class="n">a</span><span class="p">[</span><span class="mi">17</span><span class="p">];</span>
+<span class="w">  </span><span class="kt">int32_t</span><span class="w"> </span><span class="n">y</span><span class="p">;</span>
+<span class="p">}</span><span class="w"> </span><span class="n">W</span><span class="p">;</span>
 </pre></div>
 </div>
 </section>
 <section id="classes">
-<h4>Classes<a class="headerlink" href="#classes" title="Permalink to this headline">¶</a></h4>
+<h4>Classes<a class="headerlink" href="#classes" title="Link to this heading">¶</a></h4>
 <p>The support for classes is restricted to non-recursive ones so that instances
 of such data-types live on the stack. The following language features are available:</p>
 <blockquote>
@@ -305,7 +300,7 @@ <h4>Classes<a class="headerlink" href="#classes" title="Permalink to this headli
 </section>
 </section>
 <section id="functions">
-<h3>Functions<a class="headerlink" href="#functions" title="Permalink to this headline">¶</a></h3>
+<h3>Functions<a class="headerlink" href="#functions" title="Link to this heading">¶</a></h3>
 <p>Functions with access to the variables in their respective scopes.  The
 following language features are available:</p>
 <blockquote>
@@ -342,14 +337,14 @@ <h3>Functions<a class="headerlink" href="#functions" title="Permalink to this he
 program, one has to define a main function without any argument, whose return type can be <code class="docutils literal notranslate"><span class="pre">Int</span></code>
 or <code class="docutils literal notranslate"><span class="pre">Unit</span></code>:</p>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@cCode</span><span class="p">.</span><span class="k">export</span>
-<span class="k">def</span> <span class="nf">main</span><span class="p">():</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="c1">// main code goes here</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">main</span><span class="p">():</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="c1">// main code goes here</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="constructs">
-<h3>Constructs<a class="headerlink" href="#constructs" title="Permalink to this headline">¶</a></h3>
+<h3>Constructs<a class="headerlink" href="#constructs" title="Link to this heading">¶</a></h3>
 <p>The idiomatic <code class="docutils literal notranslate"><span class="pre">if</span></code> statements such as <code class="docutils literal notranslate"><span class="pre">val</span> <span class="pre">b</span> <span class="pre">=</span> <span class="pre">if</span> <span class="pre">(x</span> <span class="pre">&gt;=</span> <span class="pre">0)</span> <span class="pre">true</span> <span class="pre">else</span> <span class="pre">false</span></code> are converted into
 a sequence of equivalent statements.</p>
 <p>Imperative <code class="docutils literal notranslate"><span class="pre">while</span></code> loops are also supported.</p>
@@ -358,13 +353,9 @@ <h3>Constructs<a class="headerlink" href="#constructs" title="Permalink to this
 <p>Assertions, invariant, pre- and post-conditions are not translated into C99 and are simply ignored.</p>
 </section>
 <section id="operators">
-<h3>Operators<a class="headerlink" href="#operators" title="Permalink to this headline">¶</a></h3>
+<h3>Operators<a class="headerlink" href="#operators" title="Link to this heading">¶</a></h3>
 <p>The following operators are supported:</p>
 <table class="docutils align-default">
-<colgroup>
-<col style="width: 50%" />
-<col style="width: 50%" />
-</colgroup>
 <thead>
 <tr class="row-odd"><th class="head"><p>Category</p></th>
 <th class="head"><p>Operators</p></th>
@@ -391,27 +382,27 @@ <h3>Operators<a class="headerlink" href="#operators" title="Permalink to this he
 </section>
 </section>
 <section id="global-state">
-<h2>Global State<a class="headerlink" href="#global-state" title="Permalink to this headline">¶</a></h2>
+<h2>Global State<a class="headerlink" href="#global-state" title="Link to this heading">¶</a></h2>
 <p>At the moment, Stainless does not support global mutable variables declared in objects.
 It is however possible to simulate global state by using classes marked with <code class="docutils literal notranslate"><span class="pre">&#64;cCode.global</span></code>,
 as shown in the <a class="reference external" href="https://github.com/epfl-lara/stainless/blob/master/frontends/benchmarks/genc/Global.scala">Global.scala</a>
 example:</p>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@cCode</span><span class="p">.</span><span class="n">global</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">GlobalState</span><span class="p">(</span>
-  <span class="kd">val</span> <span class="n">data</span><span class="p">:</span> <span class="nc">Array</span><span class="p">[</span><span class="nc">Int</span><span class="p">]</span> <span class="o">=</span> <span class="nc">Array</span><span class="p">.</span><span class="n">fill</span><span class="p">(</span><span class="mi">100</span><span class="p">)(</span><span class="mi">0</span><span class="p">),</span>
-  <span class="kd">var</span> <span class="n">stable</span><span class="p">:</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="kc">true</span><span class="p">,</span>
-  <span class="kd">var</span> <span class="n">x</span><span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="mi">5</span><span class="p">,</span>
-  <span class="kd">var</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="mi">7</span><span class="p">,</span>
-<span class="p">)</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span>
-    <span class="n">data</span><span class="p">.</span><span class="n">length</span> <span class="o">==</span> <span class="mi">100</span> <span class="o">&amp;&amp;</span> <span class="p">(</span>
-      <span class="o">!</span><span class="n">stable</span> <span class="o">||</span> <span class="p">(</span>
-        <span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">x</span> <span class="o">&amp;&amp;</span> <span class="n">x</span> <span class="o">&lt;=</span> <span class="mi">100</span> <span class="o">&amp;&amp;</span>
-        <span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">y</span> <span class="o">&amp;&amp;</span> <span class="n">y</span> <span class="o">&lt;=</span> <span class="mi">100</span> <span class="o">&amp;&amp;</span>
-        <span class="n">x</span> <span class="o">+</span> <span class="n">y</span> <span class="o">==</span> <span class="mi">12</span>
-      <span class="p">)</span>
-    <span class="p">)</span>
-  <span class="p">)</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">GlobalState</span><span class="p">(</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">data</span><span class="p">:</span><span class="w"> </span><span class="nc">Array</span><span class="p">[</span><span class="nc">Int</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Array</span><span class="p">.</span><span class="n">fill</span><span class="p">(</span><span class="mi">100</span><span class="p">)(</span><span class="mi">0</span><span class="p">),</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">stable</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">true</span><span class="p">,</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">5</span><span class="p">,</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">7</span><span class="p">,</span>
+<span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span>
+<span class="w">    </span><span class="n">data</span><span class="p">.</span><span class="n">length</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">100</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="p">(</span>
+<span class="w">      </span><span class="o">!</span><span class="n">stable</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="p">(</span>
+<span class="w">        </span><span class="mi">0</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="mi">100</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">        </span><span class="mi">0</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="mi">100</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">        </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">12</span>
+<span class="w">      </span><span class="p">)</span>
+<span class="w">    </span><span class="p">)</span>
+<span class="w">  </span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -433,34 +424,34 @@ <h2>Global State<a class="headerlink" href="#global-state" title="Permalink to t
 <p>These checks ensure that the fields of <code class="docutils literal notranslate"><span class="pre">GlobalState</span></code> can be compiled as global variables in <code class="docutils literal notranslate"><span class="pre">C</span></code>.
 Consider the <code class="docutils literal notranslate"><span class="pre">move</span></code> function from the <a class="reference external" href="https://github.com/epfl-lara/stainless/blob/master/frontends/benchmarks/genc/Global.scala">Global.scala</a>
 example:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">move</span><span class="p">()(</span><span class="k">implicit</span> <span class="n">state</span><span class="p">:</span> <span class="nc">GlobalState</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">state</span><span class="p">.</span><span class="n">stable</span> <span class="o">&amp;&amp;</span> <span class="n">state</span><span class="p">.</span><span class="n">y</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="n">state</span><span class="p">.</span><span class="n">stable</span> <span class="o">=</span> <span class="kc">false</span>
-  <span class="n">state</span><span class="p">.</span><span class="n">x</span> <span class="o">+=</span> <span class="mi">1</span>
-  <span class="n">state</span><span class="p">.</span><span class="n">y</span> <span class="o">-=</span> <span class="mi">1</span>
-  <span class="n">state</span><span class="p">.</span><span class="n">data</span><span class="p">(</span><span class="n">state</span><span class="p">.</span><span class="n">y</span><span class="p">)</span> <span class="o">=</span> <span class="mi">1</span>
-  <span class="n">state</span><span class="p">.</span><span class="n">stable</span> <span class="o">=</span> <span class="kc">true</span>
-  <span class="k">if</span> <span class="p">(</span><span class="n">state</span><span class="p">.</span><span class="n">y</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">)</span> <span class="n">move</span><span class="p">()</span>
-<span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">_</span> <span class="o">=&gt;</span> <span class="n">state</span><span class="p">.</span><span class="n">stable</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">move</span><span class="p">()(</span><span class="k">implicit</span><span class="w"> </span><span class="n">state</span><span class="p">:</span><span class="w"> </span><span class="nc">GlobalState</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="n">state</span><span class="p">.</span><span class="n">stable</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">state</span><span class="p">.</span><span class="n">y</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">   </span><span class="n">state</span><span class="p">.</span><span class="n">stable</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">false</span>
+<span class="w">   </span><span class="n">state</span><span class="p">.</span><span class="n">x</span><span class="w"> </span><span class="o">+=</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">   </span><span class="n">state</span><span class="p">.</span><span class="n">y</span><span class="w"> </span><span class="o">-=</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">   </span><span class="n">state</span><span class="p">.</span><span class="n">data</span><span class="p">(</span><span class="n">state</span><span class="p">.</span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">   </span><span class="n">state</span><span class="p">.</span><span class="n">stable</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">   </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">state</span><span class="p">.</span><span class="n">y</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">move</span><span class="p">()</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">_</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">state</span><span class="p">.</span><span class="n">stable</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>After compilation to C, we get the following function, with global declarations
 <code class="docutils literal notranslate"><span class="pre">stable</span></code>, <code class="docutils literal notranslate"><span class="pre">x</span></code>, <code class="docutils literal notranslate"><span class="pre">y</span></code>, and <code class="docutils literal notranslate"><span class="pre">data</span></code>.</p>
-<div class="highlight-C notranslate"><div class="highlight"><pre><span></span><span class="kt">int32_t</span><span class="w"> </span><span class="n">data</span><span class="p">[</span><span class="mi">100</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="p">};</span><span class="w"></span>
-<span class="kt">bool</span><span class="w"> </span><span class="n">stable</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">true</span><span class="p">;</span><span class="w"></span>
-<span class="kt">int32_t</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">5</span><span class="p">;</span><span class="w"></span>
-<span class="kt">int32_t</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">7</span><span class="p">;</span><span class="w"></span>
+<div class="highlight-C notranslate"><div class="highlight"><pre><span></span><span class="kt">int32_t</span><span class="w"> </span><span class="n">data</span><span class="p">[</span><span class="mi">100</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="p">};</span>
+<span class="kt">bool</span><span class="w"> </span><span class="n">stable</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">true</span><span class="p">;</span>
+<span class="kt">int32_t</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">5</span><span class="p">;</span>
+<span class="kt">int32_t</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">7</span><span class="p">;</span>
 
-<span class="kt">void</span><span class="w"> </span><span class="nf">move</span><span class="p">()</span><span class="w"> </span><span class="p">{</span><span class="w"></span>
-<span class="w">    </span><span class="n">stable</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">false</span><span class="p">;</span><span class="w"></span>
-<span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span><span class="w"></span>
-<span class="w">    </span><span class="n">y</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span><span class="w"></span>
-<span class="w">    </span><span class="n">data</span><span class="p">[</span><span class="n">y</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span><span class="w"></span>
-<span class="w">    </span><span class="n">stable</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">true</span><span class="p">;</span><span class="w"></span>
-<span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="p">{</span><span class="w"></span>
-<span class="w">        </span><span class="n">move</span><span class="p">();</span><span class="w"></span>
-<span class="w">    </span><span class="p">}</span><span class="w"></span>
-<span class="p">}</span><span class="w"></span>
+<span class="kt">void</span><span class="w"> </span><span class="nf">move</span><span class="p">()</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">stable</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">false</span><span class="p">;</span>
+<span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span>
+<span class="w">    </span><span class="n">y</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span>
+<span class="w">    </span><span class="n">data</span><span class="p">[</span><span class="n">y</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="p">;</span>
+<span class="w">    </span><span class="n">stable</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nb">true</span><span class="p">;</span>
+<span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="n">move</span><span class="p">();</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="p">}</span>
 </pre></div>
 </div>
 <p>Note that the initial values for the global variables correspond to the default values given
@@ -468,15 +459,15 @@ <h2>Global State<a class="headerlink" href="#global-state" title="Permalink to t
 annotation). When creating a global state instance (the only one), we do not pass arguments, to
 make sure that the instance is created using the default values:</p>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@cCode</span><span class="p">.</span><span class="k">export</span>
-<span class="k">def</span> <span class="nf">main</span><span class="p">()</span> <span class="p">{</span>
-  <span class="k">implicit</span> <span class="kd">val</span> <span class="n">gs</span> <span class="o">=</span> <span class="nc">GlobalState</span><span class="p">()</span>
-  <span class="nc">StdOut</span><span class="p">.</span><span class="n">print</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">x</span><span class="p">)</span>
-  <span class="nc">StdOut</span><span class="p">.</span><span class="n">print</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">y</span><span class="p">)</span>
-  <span class="n">move</span><span class="p">()</span>
-  <span class="nc">StdOut</span><span class="p">.</span><span class="n">print</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">data</span><span class="p">(</span><span class="mi">6</span><span class="p">))</span>
-  <span class="nc">StdOut</span><span class="p">.</span><span class="n">print</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">data</span><span class="p">(</span><span class="mi">7</span><span class="p">))</span>
-  <span class="nc">StdOut</span><span class="p">.</span><span class="n">print</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">x</span><span class="p">)</span>
-  <span class="nc">StdOut</span><span class="p">.</span><span class="n">println</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">y</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">main</span><span class="p">()</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">implicit</span><span class="w"> </span><span class="kd">val</span><span class="w"> </span><span class="n">gs</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">GlobalState</span><span class="p">()</span>
+<span class="w">  </span><span class="nc">StdOut</span><span class="p">.</span><span class="n">print</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">x</span><span class="p">)</span>
+<span class="w">  </span><span class="nc">StdOut</span><span class="p">.</span><span class="n">print</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">y</span><span class="p">)</span>
+<span class="w">  </span><span class="n">move</span><span class="p">()</span>
+<span class="w">  </span><span class="nc">StdOut</span><span class="p">.</span><span class="n">print</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">data</span><span class="p">(</span><span class="mi">6</span><span class="p">))</span>
+<span class="w">  </span><span class="nc">StdOut</span><span class="p">.</span><span class="n">print</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">data</span><span class="p">(</span><span class="mi">7</span><span class="p">))</span>
+<span class="w">  </span><span class="nc">StdOut</span><span class="p">.</span><span class="n">print</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">x</span><span class="p">)</span>
+<span class="w">  </span><span class="nc">StdOut</span><span class="p">.</span><span class="n">println</span><span class="p">(</span><span class="n">gs</span><span class="p">.</span><span class="n">y</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -488,14 +479,14 @@ <h2>Global State<a class="headerlink" href="#global-state" title="Permalink to t
 that declares global variables outside of the Stainless program.</p>
 </section>
 <section id="custom-conversion">
-<h2>Custom Conversion<a class="headerlink" href="#custom-conversion" title="Permalink to this headline">¶</a></h2>
+<h2>Custom Conversion<a class="headerlink" href="#custom-conversion" title="Link to this heading">¶</a></h2>
 <p>When it comes to function using system calls, such as I/Os, no automated conversion is possible. In
 those situations the user can define his own implementation for functions, add manual conversion
 from Scala types to C types or even drop some functions and types from the translation, with
 <code class="docutils literal notranslate"><span class="pre">&#64;cCode.function</span></code>, <code class="docutils literal notranslate"><span class="pre">&#64;cCode.typedef</span></code> and <code class="docutils literal notranslate"><span class="pre">&#64;cCode.drop</span></code> annotations from the package
 <code class="docutils literal notranslate"><span class="pre">stainless.annotation</span></code>. Their usage is described below.</p>
 <section id="custom-function-implementation">
-<h3>Custom Function Implementation<a class="headerlink" href="#custom-function-implementation" title="Permalink to this headline">¶</a></h3>
+<h3>Custom Function Implementation<a class="headerlink" href="#custom-function-implementation" title="Link to this heading">¶</a></h3>
 <p>In order to circumvent some current limitations of GenC, one can use <code class="docutils literal notranslate"><span class="pre">&#64;cCode.function(code,</span>
 <span class="pre">includes)</span></code> to define the corresponding implementation of any top-level function or method, usually
 accompanied by <code class="docutils literal notranslate"><span class="pre">&#64;extern</span></code>. Its usage is as follows:</p>
@@ -514,21 +505,21 @@ <h3>Custom Function Implementation<a class="headerlink" href="#custom-function-i
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="c1">// Print a 32-bit integer using the *correct*</span>
 <span class="c1">// format for printf in C99</span>
 <span class="nd">@cCode</span><span class="p">.</span><span class="n">function</span><span class="p">(</span>
-  <span class="n">code</span> <span class="o">=</span> <span class="s">&quot;&quot;&quot;</span>
+<span class="w">  </span><span class="n">code</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="s">&quot;&quot;&quot;</span>
 <span class="s">    | void __FUNCTION__(int32_t x) {</span>
 <span class="s">    |  printf(&quot;%&quot;PRIi32, x);</span>
 <span class="s">    | }</span>
 <span class="s">    &quot;&quot;&quot;</span><span class="p">,</span>
-  <span class="n">includes</span> <span class="o">=</span> <span class="s">&quot;inttypes.h:stdio.h&quot;</span>
+<span class="w">  </span><span class="n">includes</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="s">&quot;inttypes.h:stdio.h&quot;</span>
 <span class="p">)</span>
-<span class="k">def</span> <span class="nf">myprint</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">print</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">myprint</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">print</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="custom-type-translation">
-<h3>Custom Type Translation<a class="headerlink" href="#custom-type-translation" title="Permalink to this headline">¶</a></h3>
+<h3>Custom Type Translation<a class="headerlink" href="#custom-type-translation" title="Link to this heading">¶</a></h3>
 <p>When a whole type need to be represented using a special C type, the <code class="docutils literal notranslate"><span class="pre">&#64;cCode.typedef(alias,</span>
 <span class="pre">include)</span></code> annotation can be used. Here the <code class="docutils literal notranslate"><span class="pre">include</span></code> parameter is also optional, however it can
 only refer to one header, as it is not expected to have a type defined in several headers. The
@@ -537,23 +528,23 @@ <h3>Custom Type Translation<a class="headerlink" href="#custom-type-translation"
 program must accept a <code class="docutils literal notranslate"><span class="pre">C</span></code> in the generated C code. Usually, using this annotation implicates
 manually defining the implementation of functions using this type with <code class="docutils literal notranslate"><span class="pre">&#64;cCode.function</span></code>.</p>
 <p>Here is an example:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@cCode</span><span class="p">.</span><span class="n">typedef</span><span class="p">(</span><span class="n">alias</span> <span class="o">=</span> <span class="s">&quot;FILE*&quot;</span><span class="p">,</span> <span class="n">include</span> <span class="o">=</span> <span class="s">&quot;stdio.h&quot;</span><span class="p">)</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">MyFile</span><span class="p">(</span> <span class="p">...</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@cCode</span><span class="p">.</span><span class="n">typedef</span><span class="p">(</span><span class="n">alias</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="s">&quot;FILE*&quot;</span><span class="p">,</span><span class="w"> </span><span class="n">include</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="s">&quot;stdio.h&quot;</span><span class="p">)</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">MyFile</span><span class="p">(</span><span class="w"> </span><span class="p">...</span>
 </pre></div>
 </div>
 </section>
 <section id="ignore-function-or-type">
-<h3>Ignore Function or Type<a class="headerlink" href="#ignore-function-or-type" title="Permalink to this headline">¶</a></h3>
+<h3>Ignore Function or Type<a class="headerlink" href="#ignore-function-or-type" title="Link to this heading">¶</a></h3>
 <p>It is also possible to skip the translation of some functions or types that are only used as
 implementation details in proofs, for example, using the <code class="docutils literal notranslate"><span class="pre">&#64;cCode.drop()</span></code> annotation.</p>
 </section>
 </section>
 <section id="api-for-safe-low-level-programs">
-<h2>API For Safe Low Level Programs<a class="headerlink" href="#api-for-safe-low-level-programs" title="Permalink to this headline">¶</a></h2>
+<h2>API For Safe Low Level Programs<a class="headerlink" href="#api-for-safe-low-level-programs" title="Link to this heading">¶</a></h2>
 <p>In this section we describe the APIs that can be used to make the bridge between some Scala
 programming facilities and their low level, equivalent, C features.</p>
 <section id="i-os">
-<h3>I/Os<a class="headerlink" href="#i-os" title="Permalink to this headline">¶</a></h3>
+<h3>I/Os<a class="headerlink" href="#i-os" title="Link to this heading">¶</a></h3>
 <p>Similarly to Scala’s <code class="docutils literal notranslate"><span class="pre">scala.io.StdIn</span></code> and <code class="docutils literal notranslate"><span class="pre">scala.io.StdOut</span></code>, Stainless provides <code class="docutils literal notranslate"><span class="pre">stainless.io.StdIn</span></code> and
 <code class="docutils literal notranslate"><span class="pre">stainless.io.StdOut</span></code>. These two APIs are provided with equivalent C code for easy translation with
 GenC, but are also shaped to allow users to write proofs in a non-deterministic environment.</p>
@@ -571,8 +562,7 @@ <h3>I/Os<a class="headerlink" href="#i-os" title="Permalink to this headline">¶
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="library.html" class="btn btn-neutral float-left" title="Stainless Library" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="neon.html" class="btn btn-neutral float-right" title="Proving Theorems" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -581,7 +571,7 @@ <h3>I/Os<a class="headerlink" href="#i-os" title="Permalink to this headline">¶
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -592,7 +582,7 @@ <h3>I/Os<a class="headerlink" href="#i-os" title="Permalink to this headline">¶
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/genindex.html b/genindex.html
index 1fd183a25e..25504f0ecb 100644
--- a/genindex.html
+++ b/genindex.html
@@ -1,22 +1,21 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
   <meta charset="utf-8" />
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Index &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="#" />
     <link rel="search" title="Search" href="search.html" /> 
 </head>
@@ -26,20 +25,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul>
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -68,20 +70,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Index</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Index</li>
       <li class="wy-breadcrumbs-aside">
       </li>
   </ul>
@@ -106,7 +105,7 @@ <h1 id="index">Index</h1>
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on May 09, 2024.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -117,7 +116,7 @@ <h1 id="index">Index</h1>
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/gettingstarted.html b/gettingstarted.html
index 1eca72444e..515967d93c 100644
--- a/gettingstarted.html
+++ b/gettingstarted.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Verifying and Compiling Examples &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Tutorial: Sorting" href="tutorial.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -75,20 +77,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Verifying and Compiling Examples</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Verifying and Compiling Examples</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/gettingstarted.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -99,9 +98,9 @@
            <div itemprop="articleBody">
              
   <section id="verifying-and-compiling-examples">
-<span id="gettingstarted"></span><h1>Verifying and Compiling Examples<a class="headerlink" href="#verifying-and-compiling-examples" title="Permalink to this headline">¶</a></h1>
+<span id="gettingstarted"></span><h1>Verifying and Compiling Examples<a class="headerlink" href="#verifying-and-compiling-examples" title="Link to this heading">¶</a></h1>
 <section id="verifying-examples">
-<h2>Verifying Examples<a class="headerlink" href="#verifying-examples" title="Permalink to this headline">¶</a></h2>
+<h2>Verifying Examples<a class="headerlink" href="#verifying-examples" title="Link to this heading">¶</a></h2>
 <p>Stainless is currently available as either:</p>
 <ul class="simple">
 <li><p>a command line tool, which exposes most of the functionality, available as a ZIP file (recommended) or via Docker.</p></li>
@@ -110,14 +109,14 @@ <h2>Verifying Examples<a class="headerlink" href="#verifying-examples" title="Pe
 <p>See the <a class="reference internal" href="installation.html"><span class="doc">installation documentation</span></a> for more information.</p>
 <p>It is henceforth assumed that there exists a <code class="docutils literal notranslate"><span class="pre">stainless</span></code> script in in your <code class="docutils literal notranslate"><span class="pre">PATH</span></code>.</p>
 <p>To see the main options, use</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ stainless --help
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>stainless<span class="w"> </span>--help
 </pre></div>
 </div>
 <p>in your command line shell.
 You may also wish to consult the <a class="reference internal" href="options.html"><span class="doc">available command-line options</span></a>.</p>
 <p>You can try some of the examples from <code class="docutils literal notranslate"><span class="pre">frontends/benchmarks</span></code>
 distributed with Stainless:</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ stainless --solvers<span class="o">=</span>smt-cvc5 frontends/benchmarks/verification/invalid/InsertionSort.scala
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>stainless<span class="w"> </span>--solvers<span class="o">=</span>smt-cvc5<span class="w"> </span>frontends/benchmarks/verification/invalid/InsertionSort.scala
 </pre></div>
 </div>
 <p>and get something like this (some output cropped)</p>
@@ -183,7 +182,7 @@ <h2>Verifying Examples<a class="headerlink" href="#verifying-examples" title="Pe
 </div>
 </section>
 <section id="compiling-and-executing-examples">
-<h2>Compiling and Executing Examples<a class="headerlink" href="#compiling-and-executing-examples" title="Permalink to this headline">¶</a></h2>
+<h2>Compiling and Executing Examples<a class="headerlink" href="#compiling-and-executing-examples" title="Link to this heading">¶</a></h2>
 <p>Scala code written with Stainless library dependencies can be compiled and run using the
 library sources available on the <a class="reference external" href="https://github.com/epfl-lara/stainless">Stainless github repository</a>,
 along with the scala compiler and runner script.</p>
@@ -194,8 +193,7 @@ <h2>Compiling and Executing Examples<a class="headerlink" href="#compiling-and-e
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="installation.html" class="btn btn-neutral float-left" title="Installing Stainless" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="tutorial.html" class="btn btn-neutral float-right" title="Tutorial: Sorting" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -204,7 +202,7 @@ <h2>Compiling and Executing Examples<a class="headerlink" href="#compiling-and-e
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on May 09, 2024.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -215,7 +213,7 @@ <h2>Compiling and Executing Examples<a class="headerlink" href="#compiling-and-e
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/ghost.html b/ghost.html
index c34b7bc8a4..6ff42d4a02 100644
--- a/ghost.html
+++ b/ghost.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Ghost Context &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Working With Existing Code" href="wrap.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -78,20 +80,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Ghost Context</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Ghost Context</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/ghost.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -102,42 +101,42 @@
            <div itemprop="articleBody">
              
   <section id="ghost-context">
-<span id="ghost"></span><h1>Ghost Context<a class="headerlink" href="#ghost-context" title="Permalink to this headline">¶</a></h1>
+<span id="ghost"></span><h1>Ghost Context<a class="headerlink" href="#ghost-context" title="Link to this heading">¶</a></h1>
 <section id="introduction">
-<h2>Introduction<a class="headerlink" href="#introduction" title="Permalink to this headline">¶</a></h2>
+<h2>Introduction<a class="headerlink" href="#introduction" title="Link to this heading">¶</a></h2>
 <p>When verifying code, one often needs to introduce lemmas, auxiliary functions,
 additional fields and parameters, and contracts, whose only function is to specify
 and prove that some properties are satisfied by the program.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
+<span class="w"> </span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
+<span class="w"> </span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
 
-<span class="k">def</span> <span class="nf">isSorted</span><span class="p">(</span><span class="n">list</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="n">list</span> <span class="k">match</span> <span class="p">{</span>
-  <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span>                            <span class="o">=&gt;</span> <span class="kc">true</span>
-  <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">_</span><span class="p">,</span> <span class="nc">Nil</span><span class="p">())</span>                   <span class="o">=&gt;</span> <span class="kc">true</span>
-  <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x2</span><span class="p">,</span> <span class="n">_</span><span class="p">))</span> <span class="k">if</span> <span class="n">x1</span> <span class="o">&gt;</span> <span class="n">x2</span> <span class="o">=&gt;</span> <span class="kc">false</span>
-  <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">_</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span>                      <span class="o">=&gt;</span> <span class="n">isSorted</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
-<span class="p">}</span>
+<span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">isSorted</span><span class="p">(</span><span class="n">list</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">list</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">                            </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">   </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">_</span><span class="p">,</span><span class="w"> </span><span class="nc">Nil</span><span class="p">())</span><span class="w">                   </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">   </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x2</span><span class="p">,</span><span class="w"> </span><span class="n">_</span><span class="p">))</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="n">x1</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">x2</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">false</span>
+<span class="w">   </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">_</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w">                      </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">isSorted</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
+<span class="w"> </span><span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">sort</span><span class="p">(</span><span class="n">list</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]):</span> <span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="cm">/* ... */</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span>
-  <span class="n">res</span><span class="p">.</span><span class="n">contents</span> <span class="o">==</span> <span class="n">list</span><span class="p">.</span><span class="n">contents</span> <span class="o">&amp;&amp;</span>
-  <span class="n">isSorted</span><span class="p">(</span><span class="n">res</span><span class="p">)</span> <span class="o">&amp;&amp;</span>
-  <span class="n">res</span><span class="p">.</span><span class="n">size</span> <span class="o">==</span> <span class="n">l</span><span class="p">.</span><span class="n">size</span>
-<span class="p">}</span>
+<span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">sort</span><span class="p">(</span><span class="n">list</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]):</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="cm">/* ... */</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">   </span><span class="n">res</span><span class="p">.</span><span class="n">contents</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">list</span><span class="p">.</span><span class="n">contents</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">   </span><span class="n">isSorted</span><span class="p">(</span><span class="n">res</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">   </span><span class="n">res</span><span class="p">.</span><span class="n">size</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l</span><span class="p">.</span><span class="n">size</span>
+<span class="w"> </span><span class="p">}</span>
 </pre></div>
 </div>
 <p>One can alleviate this issue by adding the following import:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nc">StaticChecks</span><span class="p">.</span><span class="n">_</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nc">StaticChecks</span><span class="p">.</span><span class="n">_</span>
 </pre></div>
 </div>
 </section>
 <section id="ghost-annotation">
-<h2>Ghost annotation<a class="headerlink" href="#ghost-annotation" title="Permalink to this headline">¶</a></h2>
+<h2>Ghost annotation<a class="headerlink" href="#ghost-annotation" title="Link to this heading">¶</a></h2>
 </section>
 <section id="correctness-check">
-<h2>Correctness check<a class="headerlink" href="#correctness-check" title="Permalink to this headline">¶</a></h2>
+<h2>Correctness check<a class="headerlink" href="#correctness-check" title="Link to this heading">¶</a></h2>
 <p>As part of the verification pipeline, Stainless will check that it never
 encounters a <em>ghost expression</em> outside of a <em>ghost context</em>. Should
 the check fail, verification will fail and compilation will be aborted.</p>
@@ -157,88 +156,88 @@ <h2>Correctness check<a class="headerlink" href="#correctness-check" title="Perm
 </ul>
 </section>
 <section id="ghost-expression-elimination">
-<h2>Ghost expression elimination<a class="headerlink" href="#ghost-expression-elimination" title="Permalink to this headline">¶</a></h2>
+<h2>Ghost expression elimination<a class="headerlink" href="#ghost-expression-elimination" title="Link to this heading">¶</a></h2>
 <p>If the correctness check described in the previous section succeeds, the sbt plugin
 will then proceed to eliminate ghost methods and expressions from the programs.</p>
 </section>
 <section id="case-study">
-<h2>Case study<a class="headerlink" href="#case-study" title="Permalink to this headline">¶</a></h2>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nc">StaticChecks</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
+<h2>Case study<a class="headerlink" href="#case-study" title="Link to this heading">¶</a></h2>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nc">StaticChecks</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
 
-<span class="k">import</span> <span class="nn">java</span><span class="p">.</span><span class="nn">util</span><span class="p">.</span><span class="nc">ArrayDeque</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">java</span><span class="p">.</span><span class="nn">util</span><span class="p">.</span><span class="nc">ArrayDeque</span>
 
-<span class="k">object</span> <span class="nc">MessageQueue</span> <span class="p">{</span>
+<span class="k">object</span><span class="w"> </span><span class="nc">MessageQueue</span><span class="w"> </span><span class="p">{</span>
 
-  <span class="k">case</span> <span class="k">class</span> <span class="nc">MsgQueue</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span>
-    <span class="nd">@extern</span> <span class="nd">@pure</span>
-    <span class="n">queue</span><span class="p">:</span> <span class="nc">ArrayDeque</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span>
-    <span class="nd">@ghost</span>
-    <span class="kd">var</span> <span class="n">msgs</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span>
-  <span class="p">)</span> <span class="p">{</span>
-    <span class="k">def</span> <span class="nf">put</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">MsgQueue</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span>
+<span class="w">    </span><span class="nd">@extern</span><span class="w"> </span><span class="nd">@pure</span>
+<span class="w">    </span><span class="n">queue</span><span class="p">:</span><span class="w"> </span><span class="nc">ArrayDeque</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span>
+<span class="w">    </span><span class="nd">@ghost</span>
+<span class="w">    </span><span class="kd">var</span><span class="w"> </span><span class="n">msgs</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span>
+<span class="w">  </span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">def</span><span class="w"> </span><span class="nf">put</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
 
-      <span class="n">msgs</span> <span class="o">=</span> <span class="n">msg</span> <span class="o">::</span> <span class="n">msgs</span>
-      <span class="n">_put</span><span class="p">(</span><span class="n">msg</span><span class="p">)</span>
-    <span class="p">}</span>
+<span class="w">      </span><span class="n">msgs</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">msg</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">msgs</span>
+<span class="w">      </span><span class="n">_put</span><span class="p">(</span><span class="n">msg</span><span class="p">)</span>
+<span class="w">    </span><span class="p">}</span>
 
-    <span class="nd">@extern</span> <span class="nd">@pure</span>
-    <span class="k">private</span> <span class="k">def</span> <span class="nf">_put</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-      <span class="n">queue</span><span class="p">.</span><span class="n">addFirst</span><span class="p">(</span><span class="n">msg</span><span class="p">)</span>
-    <span class="p">}</span>
+<span class="w">    </span><span class="nd">@extern</span><span class="w"> </span><span class="nd">@pure</span>
+<span class="w">    </span><span class="k">private</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">_put</span><span class="p">(</span><span class="n">msg</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="n">queue</span><span class="p">.</span><span class="n">addFirst</span><span class="p">(</span><span class="n">msg</span><span class="p">)</span>
+<span class="w">    </span><span class="p">}</span>
 
-    <span class="k">def</span> <span class="nf">take</span><span class="p">():</span> <span class="nc">Option</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-      <span class="kd">val</span> <span class="n">result</span> <span class="o">=</span> <span class="n">_take</span><span class="p">()</span>
-      <span class="n">msgs</span> <span class="o">=</span> <span class="n">msgs</span><span class="p">.</span><span class="n">tailOption</span><span class="p">.</span><span class="n">getOrElse</span><span class="p">(</span><span class="nc">Nil</span><span class="p">())</span>
-      <span class="n">result</span>
-    <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span>
-      <span class="n">res</span> <span class="o">==</span> <span class="n">old</span><span class="p">(</span><span class="bp">this</span><span class="p">).</span><span class="n">msgs</span><span class="p">.</span><span class="n">headOption</span>
-    <span class="p">}</span>
+<span class="w">    </span><span class="k">def</span><span class="w"> </span><span class="nf">take</span><span class="p">():</span><span class="w"> </span><span class="nc">Option</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="kd">val</span><span class="w"> </span><span class="n">result</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">_take</span><span class="p">()</span>
+<span class="w">      </span><span class="n">msgs</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">msgs</span><span class="p">.</span><span class="n">tailOption</span><span class="p">.</span><span class="n">getOrElse</span><span class="p">(</span><span class="nc">Nil</span><span class="p">())</span>
+<span class="w">      </span><span class="n">result</span>
+<span class="w">   </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">      </span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">old</span><span class="p">(</span><span class="bp">this</span><span class="p">).</span><span class="n">msgs</span><span class="p">.</span><span class="n">headOption</span>
+<span class="w">    </span><span class="p">}</span>
 
-    <span class="nd">@extern</span> <span class="nd">@pure</span>
-    <span class="k">private</span> <span class="k">def</span> <span class="nf">_take</span><span class="p">():</span> <span class="nc">Option</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-      <span class="nc">Option</span><span class="p">(</span><span class="n">queue</span><span class="p">.</span><span class="n">pollFirst</span><span class="p">())</span>
-    <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span>
-      <span class="n">res</span> <span class="o">==</span> <span class="n">msgs</span><span class="p">.</span><span class="n">headOption</span>
-    <span class="p">}</span>
+<span class="w">    </span><span class="nd">@extern</span><span class="w"> </span><span class="nd">@pure</span>
+<span class="w">    </span><span class="k">private</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">_take</span><span class="p">():</span><span class="w"> </span><span class="nc">Option</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="nc">Option</span><span class="p">(</span><span class="n">queue</span><span class="p">.</span><span class="n">pollFirst</span><span class="p">())</span>
+<span class="w">   </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">      </span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">msgs</span><span class="p">.</span><span class="n">headOption</span>
+<span class="w">    </span><span class="p">}</span>
 
-    <span class="nd">@extern</span> <span class="nd">@pure</span>
-    <span class="k">def</span> <span class="nf">isEmpty</span><span class="p">:</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-      <span class="n">queue</span><span class="p">.</span><span class="n">size</span><span class="p">()</span> <span class="o">==</span> <span class="mi">0</span>
-    <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span>
-      <span class="n">res</span> <span class="o">==</span> <span class="n">msgs</span><span class="p">.</span><span class="n">isEmpty</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<span class="w">    </span><span class="nd">@extern</span><span class="w"> </span><span class="nd">@pure</span>
+<span class="w">    </span><span class="k">def</span><span class="w"> </span><span class="nf">isEmpty</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="n">queue</span><span class="p">.</span><span class="n">size</span><span class="p">()</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">   </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">      </span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">msgs</span><span class="p">.</span><span class="n">isEmpty</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="k">object</span> <span class="nc">MsgQueue</span> <span class="p">{</span>
-    <span class="nd">@extern</span> <span class="nd">@pure</span>
-    <span class="k">def</span> <span class="nf">empty</span><span class="p">[</span><span class="nc">A</span><span class="p">]:</span> <span class="nc">MsgQueue</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-      <span class="nc">MsgQueue</span><span class="p">(</span><span class="k">new</span> <span class="nc">ArrayDeque</span><span class="p">(),</span> <span class="nc">Nil</span><span class="p">())</span>
-    <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span>
-      <span class="n">res</span><span class="p">.</span><span class="n">isEmpty</span> <span class="o">&amp;&amp;</span> <span class="n">res</span><span class="p">.</span><span class="n">msgs</span><span class="p">.</span><span class="n">isEmpty</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="k">object</span><span class="w"> </span><span class="nc">MsgQueue</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="nd">@extern</span><span class="w"> </span><span class="nd">@pure</span>
+<span class="w">    </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">[</span><span class="nc">A</span><span class="p">]:</span><span class="w"> </span><span class="nc">MsgQueue</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="nc">MsgQueue</span><span class="p">(</span><span class="k">new</span><span class="w"> </span><span class="nc">ArrayDeque</span><span class="p">(),</span><span class="w"> </span><span class="nc">Nil</span><span class="p">())</span>
+<span class="w">   </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">      </span><span class="n">res</span><span class="p">.</span><span class="n">isEmpty</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">res</span><span class="p">.</span><span class="n">msgs</span><span class="p">.</span><span class="n">isEmpty</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="k">def</span> <span class="nf">test</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="kd">val</span> <span class="n">queue</span> <span class="o">=</span> <span class="nc">MsgQueue</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">String</span><span class="p">]</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">test</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">queue</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">MsgQueue</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">String</span><span class="p">]</span>
 
-    <span class="n">queue</span><span class="p">.</span><span class="n">put</span><span class="p">(</span><span class="s">&quot;World&quot;</span><span class="p">)</span>
-    <span class="n">queue</span><span class="p">.</span><span class="n">put</span><span class="p">(</span><span class="s">&quot;Hello&quot;</span><span class="p">)</span>
+<span class="w">    </span><span class="n">queue</span><span class="p">.</span><span class="n">put</span><span class="p">(</span><span class="s">&quot;World&quot;</span><span class="p">)</span>
+<span class="w">    </span><span class="n">queue</span><span class="p">.</span><span class="n">put</span><span class="p">(</span><span class="s">&quot;Hello&quot;</span><span class="p">)</span>
 
-    <span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">queue</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span>
+<span class="w">    </span><span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">queue</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span>
 
-    <span class="kd">val</span> <span class="n">a</span> <span class="o">=</span> <span class="n">queue</span><span class="p">.</span><span class="n">take</span><span class="p">()</span>
-    <span class="n">assert</span><span class="p">(</span><span class="n">a</span> <span class="o">==</span> <span class="nc">Some</span><span class="p">(</span><span class="s">&quot;Hello&quot;</span><span class="p">))</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">queue</span><span class="p">.</span><span class="n">take</span><span class="p">()</span>
+<span class="w">    </span><span class="n">assert</span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="nc">Some</span><span class="p">(</span><span class="s">&quot;Hello&quot;</span><span class="p">))</span>
 
-    <span class="kd">val</span> <span class="n">b</span> <span class="o">=</span> <span class="n">queue</span><span class="p">.</span><span class="n">take</span><span class="p">()</span>
-    <span class="n">assert</span><span class="p">(</span><span class="n">b</span> <span class="o">==</span> <span class="nc">Some</span><span class="p">(</span><span class="s">&quot;World&quot;</span><span class="p">))</span>
-    <span class="n">assert</span><span class="p">(</span><span class="n">queue</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">queue</span><span class="p">.</span><span class="n">take</span><span class="p">()</span>
+<span class="w">    </span><span class="n">assert</span><span class="p">(</span><span class="n">b</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="nc">Some</span><span class="p">(</span><span class="s">&quot;World&quot;</span><span class="p">))</span>
+<span class="w">    </span><span class="n">assert</span><span class="p">(</span><span class="n">queue</span><span class="p">.</span><span class="n">isEmpty</span><span class="p">)</span>
 
-    <span class="kd">val</span> <span class="n">c</span> <span class="o">=</span> <span class="n">queue</span><span class="p">.</span><span class="n">take</span><span class="p">()</span>
-    <span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">c</span><span class="p">.</span><span class="n">isDefined</span><span class="p">)</span>
-  <span class="p">}</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">c</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">queue</span><span class="p">.</span><span class="n">take</span><span class="p">()</span>
+<span class="w">    </span><span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">c</span><span class="p">.</span><span class="n">isDefined</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -248,8 +247,7 @@ <h2>Case study<a class="headerlink" href="#case-study" title="Permalink to this
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="equivalence.html" class="btn btn-neutral float-left" title="Equivalence Checking" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="wrap.html" class="btn btn-neutral float-right" title="Working With Existing Code" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -258,7 +256,7 @@ <h2>Case study<a class="headerlink" href="#case-study" title="Permalink to this
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -269,7 +267,7 @@ <h2>Case study<a class="headerlink" href="#case-study" title="Permalink to this
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/imperative.html b/imperative.html
index be724f120f..773eaad5d8 100644
--- a/imperative.html
+++ b/imperative.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Imperative &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Equivalence Checking" href="equivalence.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -82,20 +84,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Imperative</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Imperative</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/imperative.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -106,7 +105,7 @@
            <div itemprop="articleBody">
              
   <section id="imperative">
-<span id="id1"></span><h1>Imperative<a class="headerlink" href="#imperative" title="Permalink to this headline">¶</a></h1>
+<span id="id1"></span><h1>Imperative<a class="headerlink" href="#imperative" title="Link to this heading">¶</a></h1>
 <p>To complement the core <a class="reference internal" href="purescala.html"><span class="doc">Pure Scala</span></a> language, Stainless
 proposes a few extensions to that core language.</p>
 <p>On the technical side, these extensions do not have specific treatment in the
@@ -114,15 +113,15 @@
 constructs during a preprocessing phase in the Stainless front-end.</p>
 <p>These transformations are partly documented in the <a class="reference external" href="https://doi.org/10.5075/epfl-thesis-7636">EPFL PhD thesis of Régis Blanc</a>.</p>
 <section id="imperative-code">
-<h2>Imperative Code<a class="headerlink" href="#imperative-code" title="Permalink to this headline">¶</a></h2>
+<h2>Imperative Code<a class="headerlink" href="#imperative-code" title="Link to this heading">¶</a></h2>
 <p>Stainless lets you introduce local variables in functions, and use Scala assignments
 syntax.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">var</span> <span class="n">a</span> <span class="o">=</span> <span class="n">x</span>
-  <span class="kd">var</span> <span class="n">b</span> <span class="o">=</span> <span class="mi">42</span>
-  <span class="n">a</span> <span class="o">=</span> <span class="n">a</span> <span class="o">+</span> <span class="n">b</span>
-  <span class="n">b</span> <span class="o">=</span> <span class="n">a</span>
-  <span class="n">b</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">42</span>
+<span class="w">  </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">b</span>
+<span class="w">  </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">a</span>
+<span class="w">  </span><span class="n">b</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -141,18 +140,18 @@ <h2>Imperative Code<a class="headerlink" href="#imperative-code" title="Permalin
 declarations.</p>
 </section>
 <section id="while-loops">
-<h2>While loops<a class="headerlink" href="#while-loops" title="Permalink to this headline">¶</a></h2>
+<h2>While loops<a class="headerlink" href="#while-loops" title="Link to this heading">¶</a></h2>
 <p>You can use the <code class="docutils literal notranslate"><span class="pre">while</span></code> keyword. While loops usually combine the ability to
 declare variables and make a sequence of assignments in order to compute
 something useful:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">var</span> <span class="n">res</span> <span class="o">=</span> <span class="mi">0</span>
-  <span class="kd">var</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span>
-  <span class="k">while</span><span class="p">(</span><span class="n">i</span> <span class="o">&lt;</span> <span class="mi">10</span><span class="p">)</span> <span class="p">{</span>
-    <span class="n">res</span> <span class="o">=</span> <span class="n">res</span> <span class="o">+</span> <span class="n">i</span>
-    <span class="n">i</span> <span class="o">=</span> <span class="n">i</span> <span class="o">+</span> <span class="mi">1</span>
-  <span class="p">}</span>
-  <span class="n">res</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="k">while</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="mi">10</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">res</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">i</span>
+<span class="w">    </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">  </span><span class="p">}</span>
+<span class="w">  </span><span class="n">res</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -165,12 +164,12 @@ <h2>While loops<a class="headerlink" href="#while-loops" title="Permalink to thi
 of code relying on loops. Usually that invariant is too weak to prove anything remotely
 useful and you will need to annotate the loop with a stronger invariant.</p>
 <p>You can annotate a loop with an invariant as follows:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">var</span> <span class="n">res</span> <span class="o">=</span> <span class="mi">0</span>
-<span class="kd">var</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span>
-<span class="p">(</span><span class="k">while</span><span class="p">(</span><span class="n">i</span> <span class="o">&lt;</span> <span class="mi">10</span><span class="p">)</span> <span class="p">{</span>
-  <span class="n">res</span> <span class="o">=</span> <span class="n">res</span> <span class="o">+</span> <span class="n">i</span>
-  <span class="n">i</span> <span class="o">=</span> <span class="n">i</span> <span class="o">+</span> <span class="mi">1</span>
-<span class="p">})</span> <span class="n">invariant</span><span class="p">(</span><span class="n">i</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">res</span> <span class="o">&gt;=</span> <span class="n">i</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">var</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="kd">var</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="p">(</span><span class="k">while</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="mi">10</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">res</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">i</span>
+<span class="w">  </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<span class="p">})</span><span class="w"> </span><span class="n">invariant</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">i</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>The strange syntax comes from some Scala magic in order to make the keyword
@@ -190,48 +189,48 @@ <h2>While loops<a class="headerlink" href="#while-loops" title="Permalink to thi
 loop.</p>
 </section>
 <section id="arrays">
-<h2>Arrays<a class="headerlink" href="#arrays" title="Permalink to this headline">¶</a></h2>
+<h2>Arrays<a class="headerlink" href="#arrays" title="Link to this heading">¶</a></h2>
 <p>PureScala supports functional arrays, that is, the operations <code class="docutils literal notranslate"><span class="pre">apply</span></code> and
 <code class="docutils literal notranslate"><span class="pre">updated</span></code> which do not modify an array but only returns some result. In
 particular, <code class="docutils literal notranslate"><span class="pre">updated</span></code> returns a new copy of the array.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">f</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">Array</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span> <span class="nc">Array</span><span class="p">[</span><span class="nc">Int</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">a</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">))</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">f</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Array</span><span class="p">[</span><span class="nc">Int</span><span class="p">]):</span><span class="w"> </span><span class="nc">Array</span><span class="p">[</span><span class="nc">Int</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">a</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span><span class="w"> </span><span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">))</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>However, using functional arrays is not the most natural way to work with
 arrays, and arrays are often used in imperative implementations of algorithms.
 We add the usual <code class="docutils literal notranslate"><span class="pre">update</span></code> operation on arrays:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span> <span class="n">a</span> <span class="o">=</span> <span class="nc">Array</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="c1">//2</span>
-<span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="o">=</span> <span class="mi">10</span>
-<span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="c1">//10</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Array</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">)</span>
+<span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="c1">//2</span>
+<span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">10</span>
+<span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="c1">//10</span>
 </pre></div>
 </div>
 <p>Stainless simply rewrite arrays using <code class="docutils literal notranslate"><span class="pre">update</span></code> operation as the assignment of function arrays
 using <code class="docutils literal notranslate"><span class="pre">updated</span></code>.  This leverages the built-in algorithm for functional arrays
 and relies on the elimination procedure for assignments. Concretely, it would
 transform the above on the following equivalent implementation:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">var</span> <span class="n">a</span> <span class="o">=</span> <span class="nc">Array</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">)</span>
-<span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="c1">//2</span>
-<span class="n">a</span> <span class="o">=</span> <span class="n">a</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="mi">10</span><span class="p">)</span>
-<span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="c1">//10</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">var</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Array</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">)</span>
+<span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="c1">//2</span>
+<span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">a</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="mi">10</span><span class="p">)</span>
+<span class="n">a</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="c1">//10</span>
 </pre></div>
 </div>
 <p>Stainless also has a <code class="docutils literal notranslate"><span class="pre">swap</span></code> operation in <code class="docutils literal notranslate"><span class="pre">stainless.lang</span></code>, which is equivalent to two updates.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">swap</span><span class="p">[</span><span class="nd">@mutable</span> <span class="nc">T</span><span class="p">](</span><span class="n">a1</span><span class="p">:</span> <span class="nc">Array</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span> <span class="n">i1</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">a2</span><span class="p">:</span> <span class="nc">Array</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span> <span class="n">i2</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Unit</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">swap</span><span class="p">[</span><span class="nd">@mutable</span><span class="w"> </span><span class="nc">T</span><span class="p">](</span><span class="n">a1</span><span class="p">:</span><span class="w"> </span><span class="nc">Array</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span><span class="w"> </span><span class="n">i1</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">a2</span><span class="p">:</span><span class="w"> </span><span class="nc">Array</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span><span class="w"> </span><span class="n">i2</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span>
 </pre></div>
 </div>
 </section>
 <section id="mutable-objects">
-<h2>Mutable Objects<a class="headerlink" href="#mutable-objects" title="Permalink to this headline">¶</a></h2>
+<h2>Mutable Objects<a class="headerlink" href="#mutable-objects" title="Link to this heading">¶</a></h2>
 <p>A restricted form of mutable classes is supported via case classes with <code class="docutils literal notranslate"><span class="pre">var</span></code>
 arguments:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">A</span><span class="p">(</span><span class="kd">var</span> <span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span>
-<span class="k">def</span> <span class="nf">f</span><span class="p">():</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">a</span> <span class="o">=</span> <span class="k">new</span> <span class="nc">A</span><span class="p">(</span><span class="mi">10</span><span class="p">)</span>
-  <span class="n">a</span><span class="p">.</span><span class="n">x</span> <span class="o">=</span> <span class="mi">13</span>
-  <span class="n">a</span><span class="p">.</span><span class="n">x</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">A</span><span class="p">(</span><span class="kd">var</span><span class="w"> </span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">f</span><span class="p">():</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="nc">A</span><span class="p">(</span><span class="mi">10</span><span class="p">)</span>
+<span class="w">  </span><span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">13</span>
+<span class="w">  </span><span class="n">a</span><span class="p">.</span><span class="n">x</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -240,28 +239,28 @@ <h2>Mutable Objects<a class="headerlink" href="#mutable-objects" title="Permalin
 the modified parameter changed.</p>
 </section>
 <section id="aliasing">
-<h2>Aliasing<a class="headerlink" href="#aliasing" title="Permalink to this headline">¶</a></h2>
+<h2>Aliasing<a class="headerlink" href="#aliasing" title="Link to this heading">¶</a></h2>
 <p>With mutable data structures comes the problem of aliasing. In Stainless, we
 maintain the invariant that in any scope, there is at most one pointer to some
 mutable structure. Stainless will issue an error if you try to create an alias to
 some mutable structure in the same scope:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span> <span class="n">a</span> <span class="o">=</span> <span class="nc">Array</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">)</span>
-<span class="kd">val</span> <span class="n">b</span> <span class="o">=</span> <span class="n">a</span> <span class="c1">//error: illegal aliasing</span>
-<span class="n">b</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span> <span class="o">=</span> <span class="mi">10</span>
-<span class="n">assert</span><span class="p">(</span><span class="n">a</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span> <span class="o">==</span> <span class="mi">10</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Array</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">4</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="c1">//error: illegal aliasing</span>
+<span class="n">b</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">10</span>
+<span class="n">assert</span><span class="p">(</span><span class="n">a</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">10</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>However, Stainless correctly supports aliasing mutable structures when passing it
 as a parameter to a function (assuming its scope is not shared with the call
 site, i.e. not a nested function). Essentially you can do:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">A</span><span class="p">(</span><span class="kd">var</span> <span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span>
-<span class="k">def</span> <span class="nf">updateA</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">a</span><span class="p">.</span><span class="n">x</span> <span class="o">=</span> <span class="mi">14</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">A</span><span class="p">(</span><span class="kd">var</span><span class="w"> </span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">updateA</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">14</span>
 <span class="p">}</span>
-<span class="k">def</span> <span class="nf">f</span><span class="p">():</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">a</span> <span class="o">=</span> <span class="nc">A</span><span class="p">(</span><span class="mi">10</span><span class="p">)</span>
-  <span class="n">updateA</span><span class="p">(</span><span class="n">a</span><span class="p">)</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">x</span> <span class="o">==</span> <span class="mi">14</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">f</span><span class="p">():</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">A</span><span class="p">(</span><span class="mi">10</span><span class="p">)</span>
+<span class="w">  </span><span class="n">updateA</span><span class="p">(</span><span class="n">a</span><span class="p">)</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">14</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -269,29 +268,29 @@ <h2>Aliasing<a class="headerlink" href="#aliasing" title="Permalink to this head
 <code class="docutils literal notranslate"><span class="pre">a</span></code> and this will be visible at the call site.</p>
 </section>
 <section id="annotations-for-imperative-programming">
-<h2>Annotations for Imperative Programming<a class="headerlink" href="#annotations-for-imperative-programming" title="Permalink to this headline">¶</a></h2>
+<h2>Annotations for Imperative Programming<a class="headerlink" href="#annotations-for-imperative-programming" title="Link to this heading">¶</a></h2>
 <p>We introduce the special function <code class="docutils literal notranslate"><span class="pre">old</span></code> that can be used in postconditions to
 talk about the value of a variable before the execution of the block. When you refer to a variable
 or mutable structure in a post-condition, Stainless will always consider the current value of
 the object, so that in the case of a post-condition this would refer to the final value of the
 object. Using <code class="docutils literal notranslate"><span class="pre">old</span></code>, you can refer to the original value of the variable and check some
 properties:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">A</span><span class="p">(</span><span class="kd">var</span> <span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span>
-<span class="k">def</span> <span class="nf">inc</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">a</span><span class="p">.</span><span class="n">x</span> <span class="o">=</span> <span class="n">a</span><span class="p">.</span><span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
-<span class="p">}</span> <span class="n">ensuring</span><span class="p">(</span><span class="n">_</span> <span class="o">=&gt;</span> <span class="n">a</span><span class="p">.</span><span class="n">x</span> <span class="o">==</span> <span class="n">old</span><span class="p">(</span><span class="n">a</span><span class="p">).</span><span class="n">x</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">A</span><span class="p">(</span><span class="kd">var</span><span class="w"> </span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span>
+<span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">inc</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">_</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">old</span><span class="p">(</span><span class="n">a</span><span class="p">).</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
 </pre></div>
 </div>
 <p><code class="docutils literal notranslate"><span class="pre">old</span></code> can be wrapped around any identifier that is affected by the body. You can also use
 <code class="docutils literal notranslate"><span class="pre">old</span></code> for variables in scope, in the case of nested functions:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">f</span><span class="p">():</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">var</span> <span class="n">x</span> <span class="o">=</span> <span class="mi">0</span>
-  <span class="k">def</span> <span class="nf">inc</span><span class="p">():</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">x</span> <span class="o">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
-  <span class="p">}</span> <span class="n">ensuring</span><span class="p">(</span><span class="n">_</span> <span class="o">=&gt;</span> <span class="n">x</span> <span class="o">==</span> <span class="n">old</span><span class="p">(</span><span class="n">x</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span>
-
-  <span class="n">inc</span><span class="p">();</span> <span class="n">inc</span><span class="p">();</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">x</span> <span class="o">==</span> <span class="mi">2</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">f</span><span class="p">():</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">inc</span><span class="p">():</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">_</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">old</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+
+<span class="w">  </span><span class="n">inc</span><span class="p">();</span><span class="w"> </span><span class="n">inc</span><span class="p">();</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -299,106 +298,106 @@ <h2>Annotations for Imperative Programming<a class="headerlink" href="#annotatio
 Contrarily to <code class="docutils literal notranslate"><span class="pre">old</span></code>, <code class="docutils literal notranslate"><span class="pre">snapshot</span></code> allows to refer to the state of an object prior to its mutation within
 the body of the function, as long as it is used in a <a class="reference internal" href="ghost.html"><span class="doc">ghost context</span></a>.</p>
 <p>For instance:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">updateArray</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">Array</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">],</span> <span class="n">i</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">i</span> <span class="o">&amp;&amp;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">a</span><span class="p">.</span><span class="n">length</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">a</span><span class="p">(</span><span class="n">i</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">a</span><span class="p">(</span><span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="nd">@ghost</span> <span class="kd">val</span> <span class="n">a0</span> <span class="o">=</span> <span class="n">snapshot</span><span class="p">(</span><span class="n">a</span><span class="p">)</span>
-  <span class="n">a</span><span class="p">(</span><span class="n">i</span><span class="p">)</span> <span class="o">=</span> <span class="n">x</span>
-  <span class="c1">// a0 is unaffected by the update of a</span>
-  <span class="c1">// Note: using StaticChecks assert, which introduces a ghost context</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">a0</span><span class="p">(</span><span class="n">i</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">a</span><span class="p">(</span><span class="n">i</span><span class="p">)</span> <span class="o">==</span> <span class="n">x</span><span class="p">)</span>
-  <span class="nd">@ghost</span> <span class="kd">val</span> <span class="n">a1</span> <span class="o">=</span> <span class="n">snapshot</span><span class="p">(</span><span class="n">a</span><span class="p">)</span>
-  <span class="n">a</span><span class="p">(</span><span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span> <span class="o">=</span> <span class="mi">2</span> <span class="o">*</span> <span class="n">x</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">a1</span><span class="p">(</span><span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">a</span><span class="p">(</span><span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span> <span class="o">==</span> <span class="mi">2</span> <span class="o">*</span> <span class="n">x</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">updateArray</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Array</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">],</span><span class="w"> </span><span class="n">i</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="mi">0</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">a</span><span class="p">.</span><span class="n">length</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">a</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">a</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">  </span><span class="nd">@ghost</span><span class="w"> </span><span class="kd">val</span><span class="w"> </span><span class="n">a0</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">snapshot</span><span class="p">(</span><span class="n">a</span><span class="p">)</span>
+<span class="w">  </span><span class="n">a</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span>
+<span class="w">  </span><span class="c1">// a0 is unaffected by the update of a</span>
+<span class="w">  </span><span class="c1">// Note: using StaticChecks assert, which introduces a ghost context</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">a0</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">a</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
+<span class="w">  </span><span class="nd">@ghost</span><span class="w"> </span><span class="kd">val</span><span class="w"> </span><span class="n">a1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">snapshot</span><span class="p">(</span><span class="n">a</span><span class="p">)</span>
+<span class="w">  </span><span class="n">a</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">a1</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">a</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="extern-functions-and-abstract-methods">
-<h2>Extern functions and abstract methods<a class="headerlink" href="#extern-functions-and-abstract-methods" title="Permalink to this headline">¶</a></h2>
+<h2>Extern functions and abstract methods<a class="headerlink" href="#extern-functions-and-abstract-methods" title="Link to this heading">¶</a></h2>
 <p><code class="docutils literal notranslate"><span class="pre">&#64;extern</span></code> functions and abstract methods of non-sealed trait taking mutable objects as parameters are treated as-if
 they were applying arbitrary modifications to them.
 For instance, the assertions in the following snippet are invalid:</p>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@extern</span>
-<span class="k">def</span> <span class="nf">triple</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="o">???</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">triple</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">???</span>
 
-<span class="k">trait</span> <span class="nc">UnsealedTrait</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">quadruple</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">BigInt</span>
+<span class="k">trait</span><span class="w"> </span><span class="nc">UnsealedTrait</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">quadruple</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">test1</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">i</span> <span class="o">=</span> <span class="n">mc</span><span class="p">.</span><span class="n">i</span>
-  <span class="n">triple</span><span class="p">(</span><span class="n">mc</span><span class="p">)</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">i</span> <span class="o">==</span> <span class="n">mc</span><span class="p">.</span><span class="n">i</span><span class="p">)</span> <span class="c1">// Invalid, mc.i could be anything</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">test1</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mc</span><span class="p">.</span><span class="n">i</span>
+<span class="w">  </span><span class="n">triple</span><span class="p">(</span><span class="n">mc</span><span class="p">)</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">mc</span><span class="p">.</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="c1">// Invalid, mc.i could be anything</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">test2</span><span class="p">(</span><span class="n">ut</span><span class="p">:</span> <span class="nc">UnsealedTrait</span><span class="p">,</span> <span class="n">mc</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">i</span> <span class="o">=</span> <span class="n">mc</span><span class="p">.</span><span class="n">i</span>
-  <span class="n">ut</span><span class="p">.</span><span class="n">quadruple</span><span class="p">(</span><span class="n">mc</span><span class="p">)</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">i</span> <span class="o">==</span> <span class="n">mc</span><span class="p">.</span><span class="n">i</span><span class="p">)</span> <span class="c1">// Invalid as well</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">test2</span><span class="p">(</span><span class="n">ut</span><span class="p">:</span><span class="w"> </span><span class="nc">UnsealedTrait</span><span class="p">,</span><span class="w"> </span><span class="n">mc</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mc</span><span class="p">.</span><span class="n">i</span>
+<span class="w">  </span><span class="n">ut</span><span class="p">.</span><span class="n">quadruple</span><span class="p">(</span><span class="n">mc</span><span class="p">)</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">mc</span><span class="p">.</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="c1">// Invalid as well</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>Annotating such methods or functions with <code class="docutils literal notranslate"><span class="pre">&#64;pure</span></code> tells Stainless to assume the parameters are not mutated:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">MutableClass</span><span class="p">(</span><span class="kd">var</span> <span class="n">i</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">(</span><span class="kd">var</span><span class="w"> </span><span class="n">i</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span>
 
-<span class="nd">@pure</span> <span class="nd">@extern</span>
-<span class="k">def</span> <span class="nf">triple</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="o">???</span>
+<span class="nd">@pure</span><span class="w"> </span><span class="nd">@extern</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">triple</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">???</span>
 
-<span class="k">trait</span> <span class="nc">UnsealedTrait</span> <span class="p">{</span>
-  <span class="nd">@pure</span>
-  <span class="k">def</span> <span class="nf">quadruple</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">BigInt</span>
+<span class="k">trait</span><span class="w"> </span><span class="nc">UnsealedTrait</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="nd">@pure</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">quadruple</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">test1</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">i</span> <span class="o">=</span> <span class="n">mc</span><span class="p">.</span><span class="n">i</span>
-  <span class="n">triple</span><span class="p">(</span><span class="n">mc</span><span class="p">)</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">i</span> <span class="o">==</span> <span class="n">mc</span><span class="p">.</span><span class="n">i</span><span class="p">)</span> <span class="c1">// Ok</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">test1</span><span class="p">(</span><span class="n">mc</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mc</span><span class="p">.</span><span class="n">i</span>
+<span class="w">  </span><span class="n">triple</span><span class="p">(</span><span class="n">mc</span><span class="p">)</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">mc</span><span class="p">.</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="c1">// Ok</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">test2</span><span class="p">(</span><span class="n">ut</span><span class="p">:</span> <span class="nc">UnsealedTrait</span><span class="p">,</span> <span class="n">mc</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">i</span> <span class="o">=</span> <span class="n">mc</span><span class="p">.</span><span class="n">i</span>
-  <span class="n">ut</span><span class="p">.</span><span class="n">quadruple</span><span class="p">(</span><span class="n">mc</span><span class="p">)</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">i</span> <span class="o">==</span> <span class="n">mc</span><span class="p">.</span><span class="n">i</span><span class="p">)</span> <span class="c1">// Ok</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">test2</span><span class="p">(</span><span class="n">ut</span><span class="p">:</span><span class="w"> </span><span class="nc">UnsealedTrait</span><span class="p">,</span><span class="w"> </span><span class="n">mc</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mc</span><span class="p">.</span><span class="n">i</span>
+<span class="w">  </span><span class="n">ut</span><span class="p">.</span><span class="n">quadruple</span><span class="p">(</span><span class="n">mc</span><span class="p">)</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">mc</span><span class="p">.</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="c1">// Ok</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>Note that Stainless will enforce purity for visible implementations of <code class="docutils literal notranslate"><span class="pre">quadruple</span></code>.</p>
 <p>Sometimes, a method or <code class="docutils literal notranslate"><span class="pre">&#64;extern</span></code> function may mutate some parameters but not all of them.
 In such cases, the untouched parameters can be annotated with <code class="docutils literal notranslate"><span class="pre">&#64;pure</span></code>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">MutableClass</span><span class="p">(</span><span class="kd">var</span> <span class="n">i</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">(</span><span class="kd">var</span><span class="w"> </span><span class="n">i</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span>
 
 <span class="nd">@extern</span>
-<span class="k">def</span> <span class="nf">sum</span><span class="p">(</span><span class="nd">@pure</span> <span class="n">mc1</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">,</span> <span class="n">mc2</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="o">???</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">sum</span><span class="p">(</span><span class="nd">@pure</span><span class="w"> </span><span class="n">mc1</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">,</span><span class="w"> </span><span class="n">mc2</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">???</span>
 
-<span class="k">trait</span> <span class="nc">UnsealedTrait</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">doubleSum</span><span class="p">(</span><span class="nd">@pure</span> <span class="n">mc1</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">,</span> <span class="n">mc2</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">BigInt</span>
+<span class="k">trait</span><span class="w"> </span><span class="nc">UnsealedTrait</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">doubleSum</span><span class="p">(</span><span class="nd">@pure</span><span class="w"> </span><span class="n">mc1</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">,</span><span class="w"> </span><span class="n">mc2</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">test1</span><span class="p">(</span><span class="n">mc1</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">,</span> <span class="n">mc2</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">i1</span> <span class="o">=</span> <span class="n">mc1</span><span class="p">.</span><span class="n">i</span>
-  <span class="kd">val</span> <span class="n">i2</span> <span class="o">=</span> <span class="n">mc2</span><span class="p">.</span><span class="n">i</span>
-  <span class="n">sum</span><span class="p">(</span><span class="n">mc1</span><span class="p">,</span> <span class="n">mc2</span><span class="p">)</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">i1</span> <span class="o">==</span> <span class="n">mc1</span><span class="p">.</span><span class="n">i</span><span class="p">)</span> <span class="c1">// Ok</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">i2</span> <span class="o">==</span> <span class="n">mc2</span><span class="p">.</span><span class="n">i</span><span class="p">)</span> <span class="c1">// Invalid, mc2.i may have any value</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">test1</span><span class="p">(</span><span class="n">mc1</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">,</span><span class="w"> </span><span class="n">mc2</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">i1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mc1</span><span class="p">.</span><span class="n">i</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">i2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mc2</span><span class="p">.</span><span class="n">i</span>
+<span class="w">  </span><span class="n">sum</span><span class="p">(</span><span class="n">mc1</span><span class="p">,</span><span class="w"> </span><span class="n">mc2</span><span class="p">)</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">i1</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">mc1</span><span class="p">.</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="c1">// Ok</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">i2</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">mc2</span><span class="p">.</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="c1">// Invalid, mc2.i may have any value</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">test2</span><span class="p">(</span><span class="n">ut</span><span class="p">:</span> <span class="nc">UnsealedTrait</span><span class="p">,</span> <span class="n">mc1</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">,</span> <span class="n">mc2</span><span class="p">:</span> <span class="nc">MutableClass</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">i1</span> <span class="o">=</span> <span class="n">mc1</span><span class="p">.</span><span class="n">i</span>
-  <span class="kd">val</span> <span class="n">i2</span> <span class="o">=</span> <span class="n">mc2</span><span class="p">.</span><span class="n">i</span>
-  <span class="n">ut</span><span class="p">.</span><span class="n">doubleSum</span><span class="p">(</span><span class="n">mc1</span><span class="p">,</span> <span class="n">mc2</span><span class="p">)</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">i1</span> <span class="o">==</span> <span class="n">mc1</span><span class="p">.</span><span class="n">i</span><span class="p">)</span> <span class="c1">// Ok</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">i2</span> <span class="o">==</span> <span class="n">mc2</span><span class="p">.</span><span class="n">i</span><span class="p">)</span> <span class="c1">// Invalid</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">test2</span><span class="p">(</span><span class="n">ut</span><span class="p">:</span><span class="w"> </span><span class="nc">UnsealedTrait</span><span class="p">,</span><span class="w"> </span><span class="n">mc1</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">,</span><span class="w"> </span><span class="n">mc2</span><span class="p">:</span><span class="w"> </span><span class="nc">MutableClass</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">i1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mc1</span><span class="p">.</span><span class="n">i</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">i2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">mc2</span><span class="p">.</span><span class="n">i</span>
+<span class="w">  </span><span class="n">ut</span><span class="p">.</span><span class="n">doubleSum</span><span class="p">(</span><span class="n">mc1</span><span class="p">,</span><span class="w"> </span><span class="n">mc2</span><span class="p">)</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">i1</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">mc1</span><span class="p">.</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="c1">// Ok</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">i2</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">mc2</span><span class="p">.</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="c1">// Invalid</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="trait-variables">
-<h2>Trait Variables<a class="headerlink" href="#trait-variables" title="Permalink to this headline">¶</a></h2>
+<h2>Trait Variables<a class="headerlink" href="#trait-variables" title="Link to this heading">¶</a></h2>
 <p>Traits are allowed to declare variables, with the restriction that these cannot be
 assigned a default value.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">trait</span> <span class="nc">MutableBox</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="p">{</span>
-  <span class="kd">var</span> <span class="n">value</span><span class="p">:</span> <span class="nc">A</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">trait</span><span class="w"> </span><span class="nc">MutableBox</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">value</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -406,67 +405,67 @@ <h2>Trait Variables<a class="headerlink" href="#trait-variables" title="Permalin
 <ol class="loweralpha simple">
 <li><p>a mutable field of a case class</p></li>
 </ol>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">Box</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="kd">var</span> <span class="n">value</span><span class="p">:</span> <span class="nc">A</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">MutableBox</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Box</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="kd">var</span><span class="w"> </span><span class="n">value</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">MutableBox</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span>
 </pre></div>
 </div>
 <ol class="loweralpha simple" start="2">
 <li><p>a pair of getter/setter</p></li>
 </ol>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">WriteOnceBox</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span>
-  <span class="kd">var</span> <span class="n">underlying</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span>
-  <span class="kd">var</span> <span class="n">written</span><span class="p">:</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="kc">false</span>
-<span class="p">)</span> <span class="k">extends</span> <span class="nc">MutableBox</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="p">{</span>
-
-  <span class="k">def</span> <span class="nf">value</span><span class="p">:</span> <span class="nc">A</span> <span class="o">=</span> <span class="n">underlying</span>
-
-  <span class="k">def</span> <span class="nf">value_=</span><span class="p">(</span><span class="n">newValue</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="k">if</span> <span class="p">(</span><span class="o">!</span><span class="n">written</span><span class="p">)</span> <span class="p">{</span>
-      <span class="n">underlying</span> <span class="o">=</span> <span class="n">newValue</span>
-      <span class="n">written</span> <span class="o">=</span> <span class="kc">true</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">WriteOnceBox</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">underlying</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span>
+<span class="w">  </span><span class="kd">var</span><span class="w"> </span><span class="n">written</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">false</span>
+<span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">MutableBox</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">value</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">underlying</span>
+
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">value_=</span><span class="p">(</span><span class="n">newValue</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="o">!</span><span class="n">written</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="n">underlying</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">newValue</span>
+<span class="w">      </span><span class="n">written</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>Note: a setter is not required to actually perform any mutation, and the following
 is a perfectly valid sub-class of <cite>MutableBox</cite>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">ImmutableBox</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">underlying</span><span class="p">:</span> <span class="nc">A</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">MutableBox</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">value</span><span class="p">:</span> <span class="nc">A</span> <span class="o">=</span> <span class="n">underlying</span>
-  <span class="k">def</span> <span class="nf">value_=</span><span class="p">(</span><span class="n">newValue</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">()</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">ImmutableBox</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">underlying</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">MutableBox</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">value</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">underlying</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">value_=</span><span class="p">(</span><span class="n">newValue</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">()</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="return-keyword">
-<h2>Return keyword<a class="headerlink" href="#return-keyword" title="Permalink to this headline">¶</a></h2>
+<h2>Return keyword<a class="headerlink" href="#return-keyword" title="Link to this heading">¶</a></h2>
 <p>Stainless partially supports the <cite>return</cite> keyword. For verification, an internal
 phase of Stainless (called <cite>ReturnElimination</cite>) injects a data-structure named
 <cite>ControlFlow</cite> to simulate the control flow of programs with returns.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Ret</span><span class="p">,</span> <span class="nc">Cur</span><span class="p">]</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Return</span><span class="p">[</span><span class="nc">Ret</span><span class="p">,</span> <span class="nc">Cur</span><span class="p">](</span><span class="n">value</span><span class="p">:</span> <span class="nc">Ret</span><span class="p">)</span>  <span class="k">extends</span> <span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Ret</span><span class="p">,</span> <span class="nc">Cur</span><span class="p">]</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Proceed</span><span class="p">[</span><span class="nc">Ret</span><span class="p">,</span> <span class="nc">Cur</span><span class="p">](</span><span class="n">value</span><span class="p">:</span> <span class="nc">Cur</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Ret</span><span class="p">,</span> <span class="nc">Cur</span><span class="p">]</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Ret</span><span class="p">,</span><span class="w"> </span><span class="nc">Cur</span><span class="p">]</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Return</span><span class="p">[</span><span class="nc">Ret</span><span class="p">,</span><span class="w"> </span><span class="nc">Cur</span><span class="p">](</span><span class="n">value</span><span class="p">:</span><span class="w"> </span><span class="nc">Ret</span><span class="p">)</span><span class="w">  </span><span class="k">extends</span><span class="w"> </span><span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Ret</span><span class="p">,</span><span class="w"> </span><span class="nc">Cur</span><span class="p">]</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Proceed</span><span class="p">[</span><span class="nc">Ret</span><span class="p">,</span><span class="w"> </span><span class="nc">Cur</span><span class="p">](</span><span class="n">value</span><span class="p">:</span><span class="w"> </span><span class="nc">Cur</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Ret</span><span class="p">,</span><span class="w"> </span><span class="nc">Cur</span><span class="p">]</span>
 </pre></div>
 </div>
 <p>Here is a function taken from <a class="reference external" href="https://github.com/epfl-lara/stainless/blob/master/frontends/benchmarks/imperative/valid/ControlFlow2.scala">ControlFlow2.scala</a>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Option</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">],</span> <span class="n">a</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">,</span> <span class="n">b</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="k">if</span> <span class="p">(</span><span class="n">a</span> <span class="o">&amp;&amp;</span> <span class="n">b</span><span class="p">)</span> <span class="p">{</span>
-    <span class="k">return</span> <span class="mi">1</span>
-  <span class="p">}</span>
-
-  <span class="kd">val</span> <span class="n">y</span> <span class="o">=</span> <span class="n">x</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">None</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="k">return</span> <span class="mi">0</span>
-    <span class="k">case</span> <span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span> <span class="k">if</span> <span class="n">a</span> <span class="o">=&gt;</span> <span class="k">return</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
-    <span class="k">case</span> <span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span> <span class="k">if</span> <span class="n">b</span> <span class="o">=&gt;</span> <span class="k">return</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">2</span>
-    <span class="k">case</span> <span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>      <span class="o">=&gt;</span> <span class="n">x</span>
-  <span class="p">};</span>
-
-  <span class="o">-</span><span class="n">y</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Option</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">],</span><span class="w"> </span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">return</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">None</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">2</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w">      </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">x</span>
+<span class="w">  </span><span class="p">};</span>
+
+<span class="w">  </span><span class="o">-</span><span class="n">y</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>The program transformation can be inspected by running:</p>
 <blockquote>
-<div><div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>stainless ControlFlow2.scala --batched --debug<span class="o">=</span>trees --debug-objects<span class="o">=</span>foo --debug-phases<span class="o">=</span>ReturnElimination
+<div><div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>stainless<span class="w"> </span>ControlFlow2.scala<span class="w"> </span>--batched<span class="w"> </span>--debug<span class="o">=</span>trees<span class="w"> </span>--debug-objects<span class="o">=</span>foo<span class="w"> </span>--debug-phases<span class="o">=</span>ReturnElimination
 </pre></div>
 </div>
 </div></blockquote>
@@ -474,29 +473,29 @@ <h2>Return keyword<a class="headerlink" href="#return-keyword" title="Permalink
 use the <code class="docutils literal notranslate"><span class="pre">--print-ids</span></code> option so that Stainless expressions get displayed with
 unique identifiers, at the cost of readability):</p>
 <blockquote>
-<div><div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Option</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">],</span> <span class="n">a</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">,</span> <span class="n">b</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">cf0</span><span class="p">:</span> <span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">]</span> <span class="o">=</span> <span class="k">if</span> <span class="p">(</span><span class="n">a</span> <span class="o">&amp;&amp;</span> <span class="n">b</span><span class="p">)</span> <span class="p">{</span>
-    <span class="nc">Return</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">](</span><span class="mi">1</span><span class="p">)</span>
-  <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
-    <span class="nc">Proceed</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">](())</span>
-  <span class="p">}</span>
-  <span class="n">cf0</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span> <span class="o">=&gt;</span>
-      <span class="n">retValue</span>
-    <span class="k">case</span> <span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span> <span class="o">=&gt;</span>
-      <span class="kd">val</span> <span class="n">cf1</span><span class="p">:</span> <span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span> <span class="nc">BigInt</span><span class="p">]</span> <span class="o">=</span> <span class="n">x</span> <span class="k">match</span> <span class="p">{</span>
-        <span class="k">case</span> <span class="nc">None</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="nc">Return</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span> <span class="nc">BigInt</span><span class="p">](</span><span class="mi">0</span><span class="p">)</span>
-        <span class="k">case</span> <span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span> <span class="k">if</span> <span class="n">a</span> <span class="o">=&gt;</span> <span class="nc">Return</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span> <span class="nc">BigInt</span><span class="p">](</span><span class="n">x</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span>
-        <span class="k">case</span> <span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span> <span class="k">if</span> <span class="n">b</span> <span class="o">=&gt;</span> <span class="nc">Return</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span> <span class="nc">BigInt</span><span class="p">](</span><span class="n">x</span> <span class="o">+</span> <span class="mi">2</span><span class="p">)</span>
-        <span class="k">case</span> <span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>      <span class="o">=&gt;</span> <span class="nc">Proceed</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span> <span class="nc">BigInt</span><span class="p">](</span><span class="n">x</span><span class="p">)</span>
-      <span class="p">}</span>
-      <span class="n">cf1</span> <span class="k">match</span> <span class="p">{</span>
-        <span class="k">case</span> <span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span> <span class="o">=&gt;</span>
-          <span class="n">retValue</span>
-        <span class="k">case</span> <span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span> <span class="o">=&gt;</span>
-          <span class="o">-</span><span class="n">proceedValue</span>
-      <span class="p">}</span>
-  <span class="p">}</span>
+<div><div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Option</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">],</span><span class="w"> </span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">cf0</span><span class="p">:</span><span class="w"> </span><span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="nc">Return</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">](</span><span class="mi">1</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="nc">Proceed</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">](())</span>
+<span class="w">  </span><span class="p">}</span>
+<span class="w">  </span><span class="n">cf0</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">      </span><span class="n">retValue</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">      </span><span class="kd">val</span><span class="w"> </span><span class="n">cf1</span><span class="p">:</span><span class="w"> </span><span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="nc">None</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Return</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">](</span><span class="mi">0</span><span class="p">)</span>
+<span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Return</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">](</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Return</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">](</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">2</span><span class="p">)</span>
+<span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="nc">Some</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w">      </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Proceed</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">](</span><span class="n">x</span><span class="p">)</span>
+<span class="w">      </span><span class="p">}</span>
+<span class="w">      </span><span class="n">cf1</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">          </span><span class="n">retValue</span>
+<span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">          </span><span class="o">-</span><span class="n">proceedValue</span>
+<span class="w">      </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -504,18 +503,18 @@ <h2>Return keyword<a class="headerlink" href="#return-keyword" title="Permalink
 <p>Stainless also supports <code class="docutils literal notranslate"><span class="pre">return</span></code> in while loops, and transforms them to local functions, also in
 the <code class="docutils literal notranslate"><span class="pre">ReturnElimination</span></code> phase. Here is a function taken from <a class="reference external" href="https://github.com/epfl-lara/stainless/blob/master/frontends/benchmarks/imperative/valid/ReturnInWhile.scala">ReturnInWhile.scala</a>.</p>
 <blockquote>
-<div><div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">returnN</span><span class="p">(</span><span class="n">n</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">n</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="kd">var</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span>
-  <span class="p">(</span><span class="k">while</span> <span class="p">(</span><span class="kc">true</span><span class="p">)</span> <span class="p">{</span>
-    <span class="n">decreases</span><span class="p">(</span><span class="n">n</span> <span class="o">-</span> <span class="n">i</span><span class="p">)</span>
-    <span class="k">if</span> <span class="p">(</span><span class="n">i</span> <span class="o">==</span> <span class="n">n</span><span class="p">)</span> <span class="k">return</span> <span class="n">i</span>
-    <span class="n">i</span> <span class="o">+=</span> <span class="mi">1</span>
-  <span class="p">}).</span><span class="n">invariant</span><span class="p">(</span><span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">i</span> <span class="o">&amp;&amp;</span> <span class="n">i</span> <span class="o">&lt;=</span> <span class="n">n</span><span class="p">)</span>
-
-  <span class="n">assert</span><span class="p">(</span><span class="kc">false</span><span class="p">,</span> <span class="s">&quot;unreachable code&quot;</span><span class="p">)</span>
-  <span class="mi">0</span>
-<span class="p">}.</span><span class="n">ensuring</span><span class="p">((</span><span class="n">res</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">res</span> <span class="o">==</span> <span class="n">n</span><span class="p">)</span>
+<div><div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">returnN</span><span class="p">(</span><span class="n">n</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">   </span><span class="kd">var</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">   </span><span class="p">(</span><span class="k">while</span><span class="w"> </span><span class="p">(</span><span class="kc">true</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">     </span><span class="n">decreases</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">i</span><span class="p">)</span>
+<span class="w">     </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="k">return</span><span class="w"> </span><span class="n">i</span>
+<span class="w">     </span><span class="n">i</span><span class="w"> </span><span class="o">+=</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">   </span><span class="p">}).</span><span class="n">invariant</span><span class="p">(</span><span class="mi">0</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span>
+
+<span class="w">   </span><span class="n">assert</span><span class="p">(</span><span class="kc">false</span><span class="p">,</span><span class="w"> </span><span class="s">&quot;unreachable code&quot;</span><span class="p">)</span>
+<span class="w">   </span><span class="mi">0</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="p">((</span><span class="n">res</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">n</span><span class="p">)</span>
 </pre></div>
 </div>
 </div></blockquote>
@@ -526,63 +525,63 @@ <h2>Return keyword<a class="headerlink" href="#return-keyword" title="Permalink
 <code class="docutils literal notranslate"><span class="pre">returnWhile</span></code> function. When the while loop returns, we check in addition that
 the postcondition of the top-level holds (see comment).</p>
 <blockquote>
-<div><div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">returnN</span><span class="p">(</span><span class="n">n</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">n</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
-
-  <span class="kd">var</span> <span class="n">i</span><span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="mi">0</span>
-  <span class="kd">val</span> <span class="n">cf0</span><span class="p">:</span> <span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="k">def</span> <span class="nf">returnNWhile</span><span class="p">:</span> <span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-      <span class="n">require</span><span class="p">(</span><span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">i</span> <span class="o">&amp;&amp;</span> <span class="n">i</span> <span class="o">&lt;=</span> <span class="n">n</span><span class="p">)</span>
-      <span class="n">decreases</span><span class="p">(</span><span class="n">n</span> <span class="o">-</span> <span class="n">i</span><span class="p">)</span>
-      <span class="p">{</span>
-        <span class="kd">val</span> <span class="n">cf1</span><span class="p">:</span> <span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">]</span> <span class="o">=</span> <span class="k">if</span> <span class="p">(</span><span class="n">i</span> <span class="o">==</span> <span class="n">n</span><span class="p">)</span> <span class="p">{</span>
-          <span class="nc">Return</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">](</span><span class="n">i</span><span class="p">)</span>
-        <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
-          <span class="nc">Proceed</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">](())</span>
-        <span class="p">}</span>
-        <span class="n">cf1</span> <span class="k">match</span> <span class="p">{</span>
-          <span class="k">case</span> <span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">Return</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">](</span><span class="n">retValue</span><span class="p">)</span>
-          <span class="k">case</span> <span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span> <span class="o">=&gt;</span>
-            <span class="nc">Proceed</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">]({</span>
-              <span class="n">i</span> <span class="o">=</span> <span class="p">(</span><span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span>
-              <span class="p">()</span>
-            <span class="p">})</span>
-        <span class="p">}</span>
-      <span class="p">}</span> <span class="k">match</span> <span class="p">{</span>
-        <span class="k">case</span> <span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span> <span class="o">=&gt;</span>
-          <span class="nc">Return</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">](</span><span class="n">retValue</span><span class="p">)</span>
-        <span class="k">case</span> <span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span> <span class="o">=&gt;</span>
-          <span class="k">if</span> <span class="p">(</span><span class="kc">true</span><span class="p">)</span> <span class="p">{</span>
-            <span class="n">returnNWhile</span>
-          <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
-            <span class="nc">Proceed</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">](())</span>
-          <span class="p">}</span>
-      <span class="p">}</span>
-    <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-      <span class="p">(</span><span class="n">cfWhile</span><span class="p">:</span> <span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">])</span> <span class="o">=&gt;</span> <span class="n">cfWhile</span> <span class="k">match</span> <span class="p">{</span>
-        <span class="k">case</span> <span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span> <span class="o">=&gt;</span>
-          <span class="c1">// we check the postcondition `retValue == n` of the top-level function</span>
-          <span class="n">retValue</span> <span class="o">==</span> <span class="n">n</span> <span class="o">&amp;&amp;</span>
-          <span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">i</span> <span class="o">&amp;&amp;</span> <span class="n">i</span> <span class="o">&lt;=</span> <span class="n">n</span>
-        <span class="k">case</span> <span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span> <span class="o">=&gt;</span>
-          <span class="n">¬</span><span class="kc">true</span> <span class="o">&amp;&amp;</span> <span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">i</span> <span class="o">&amp;&amp;</span> <span class="n">i</span> <span class="o">&lt;=</span> <span class="n">n</span>
-      <span class="p">}</span>
-    <span class="p">}</span>
-    <span class="k">if</span> <span class="p">(</span><span class="kc">true</span><span class="p">)</span> <span class="p">{</span>
-      <span class="n">returnNWhile</span>
-    <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
-      <span class="nc">Proceed</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Unit</span><span class="p">](())</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
-  <span class="n">cf0</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">retValue</span>
-    <span class="k">case</span> <span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span> <span class="o">=&gt;</span>
-      <span class="n">assert</span><span class="p">(</span><span class="kc">false</span><span class="p">,</span> <span class="s">&quot;unreachable code&quot;</span><span class="p">)</span>
-      <span class="mi">0</span>
-  <span class="p">}</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-  <span class="p">(</span><span class="n">res</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">res</span> <span class="o">==</span> <span class="n">n</span>
-<span class="p">}</span>
+<div><div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">returnN</span><span class="p">(</span><span class="n">n</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+
+<span class="w">   </span><span class="kd">var</span><span class="w"> </span><span class="n">i</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">   </span><span class="kd">val</span><span class="w"> </span><span class="n">cf0</span><span class="p">:</span><span class="w"> </span><span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">     </span><span class="k">def</span><span class="w"> </span><span class="nf">returnNWhile</span><span class="p">:</span><span class="w"> </span><span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">       </span><span class="n">require</span><span class="p">(</span><span class="mi">0</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">n</span><span class="p">)</span>
+<span class="w">       </span><span class="n">decreases</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">i</span><span class="p">)</span>
+<span class="w">       </span><span class="p">{</span>
+<span class="w">         </span><span class="kd">val</span><span class="w"> </span><span class="n">cf1</span><span class="p">:</span><span class="w"> </span><span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">           </span><span class="nc">Return</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">](</span><span class="n">i</span><span class="p">)</span>
+<span class="w">         </span><span class="p">}</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="p">{</span>
+<span class="w">           </span><span class="nc">Proceed</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">](())</span>
+<span class="w">         </span><span class="p">}</span>
+<span class="w">         </span><span class="n">cf1</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">           </span><span class="k">case</span><span class="w"> </span><span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Return</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">](</span><span class="n">retValue</span><span class="p">)</span>
+<span class="w">           </span><span class="k">case</span><span class="w"> </span><span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">             </span><span class="nc">Proceed</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">]({</span>
+<span class="w">               </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<span class="w">               </span><span class="p">()</span>
+<span class="w">             </span><span class="p">})</span>
+<span class="w">         </span><span class="p">}</span>
+<span class="w">       </span><span class="p">}</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">         </span><span class="k">case</span><span class="w"> </span><span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">           </span><span class="nc">Return</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">](</span><span class="n">retValue</span><span class="p">)</span>
+<span class="w">         </span><span class="k">case</span><span class="w"> </span><span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">           </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="kc">true</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">             </span><span class="n">returnNWhile</span>
+<span class="w">           </span><span class="p">}</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="p">{</span>
+<span class="w">             </span><span class="nc">Proceed</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">](())</span>
+<span class="w">           </span><span class="p">}</span>
+<span class="w">       </span><span class="p">}</span>
+<span class="w">    </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">       </span><span class="p">(</span><span class="n">cfWhile</span><span class="p">:</span><span class="w"> </span><span class="nc">ControlFlow</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">])</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">cfWhile</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">         </span><span class="k">case</span><span class="w"> </span><span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">           </span><span class="c1">// we check the postcondition `retValue == n` of the top-level function</span>
+<span class="w">           </span><span class="n">retValue</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">           </span><span class="mi">0</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">n</span>
+<span class="w">         </span><span class="k">case</span><span class="w"> </span><span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">           </span><span class="n">¬</span><span class="kc">true</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">n</span>
+<span class="w">       </span><span class="p">}</span>
+<span class="w">     </span><span class="p">}</span>
+<span class="w">     </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="kc">true</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">       </span><span class="n">returnNWhile</span>
+<span class="w">     </span><span class="p">}</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="p">{</span>
+<span class="w">       </span><span class="nc">Proceed</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Unit</span><span class="p">](())</span>
+<span class="w">     </span><span class="p">}</span>
+<span class="w">   </span><span class="p">}</span>
+<span class="w">   </span><span class="n">cf0</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Return</span><span class="p">(</span><span class="n">retValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">retValue</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Proceed</span><span class="p">(</span><span class="n">proceedValue</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">       </span><span class="n">assert</span><span class="p">(</span><span class="kc">false</span><span class="p">,</span><span class="w"> </span><span class="s">&quot;unreachable code&quot;</span><span class="p">)</span>
+<span class="w">       </span><span class="mi">0</span>
+<span class="w">   </span><span class="p">}</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="p">(</span><span class="n">res</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">n</span>
+<span class="w"> </span><span class="p">}</span>
 </pre></div>
 </div>
 </div></blockquote>
@@ -594,8 +593,7 @@ <h2>Return keyword<a class="headerlink" href="#return-keyword" title="Permalink
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="laws.html" class="btn btn-neutral float-left" title="Specifying Algebraic Properties" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="equivalence.html" class="btn btn-neutral float-right" title="Equivalence Checking" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -604,7 +602,7 @@ <h2>Return keyword<a class="headerlink" href="#return-keyword" title="Permalink
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on May 09, 2024.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -615,7 +613,7 @@ <h2>Return keyword<a class="headerlink" href="#return-keyword" title="Permalink
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/index.html b/index.html
index c6752a5ce8..80cf18ecb9 100644
--- a/index.html
+++ b/index.html
@@ -1,23 +1,23 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Stainless documentation &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+        <script async="async" src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Introduction" href="intro.html" /> 
@@ -28,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="#" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="#" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul>
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -70,20 +73,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="#">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="#" class="icon icon-home"></a> &raquo;</li>
-      <li>Stainless documentation</li>
+      <li><a href="#" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Stainless documentation</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/index.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -94,7 +94,7 @@
            <div itemprop="articleBody">
              
   <section id="stainless-documentation">
-<h1>Stainless documentation<a class="headerlink" href="#stainless-documentation" title="Permalink to this headline">¶</a></h1>
+<h1>Stainless documentation<a class="headerlink" href="#stainless-documentation" title="Link to this heading">¶</a></h1>
 <p>Contents:</p>
 <div class="toctree-wrapper compound">
 <ul>
@@ -265,8 +265,7 @@ <h1>Stainless documentation<a class="headerlink" href="#stainless-documentation"
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="intro.html" class="btn btn-neutral float-right" title="Introduction" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
 
@@ -274,7 +273,7 @@ <h1>Stainless documentation<a class="headerlink" href="#stainless-documentation"
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on May 09, 2024.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -285,7 +284,7 @@ <h1>Stainless documentation<a class="headerlink" href="#stainless-documentation"
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/installation.html b/installation.html
index d96806cee4..de946ecafa 100644
--- a/installation.html
+++ b/installation.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Installing Stainless &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Verifying and Compiling Examples" href="gettingstarted.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1 current"><a class="current reference internal" href="#">Installing Stainless</a><ul>
@@ -89,20 +91,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Installing Stainless</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Installing Stainless</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/installation.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -113,41 +112,41 @@
            <div itemprop="articleBody">
              
   <section id="installing-stainless">
-<span id="installation"></span><h1>Installing Stainless<a class="headerlink" href="#installing-stainless" title="Permalink to this headline">¶</a></h1>
+<span id="installation"></span><h1>Installing Stainless<a class="headerlink" href="#installing-stainless" title="Link to this heading">¶</a></h1>
 <section id="general-requirement">
-<span id="requirements"></span><h2>General Requirement<a class="headerlink" href="#general-requirement" title="Permalink to this headline">¶</a></h2>
+<span id="requirements"></span><h2>General Requirement<a class="headerlink" href="#general-requirement" title="Link to this heading">¶</a></h2>
 <ul class="simple">
 <li><p>Java 17 JRE
 It suffices to have headless OpenJDK JRE 17 (e.g. one that one gets with <code class="docutils literal notranslate"><span class="pre">apt</span> <span class="pre">install</span> <span class="pre">openjdk-17-jre-headless</span></code> on Debian/Ubuntu).
 Make sure that <code class="docutils literal notranslate"><span class="pre">java</span> <span class="pre">-version</span></code> reports a version starting with 1.17, such as <code class="docutils literal notranslate"><span class="pre">openjdk</span> <span class="pre">version</span> <span class="pre">&quot;1.17</span></code> or <code class="docutils literal notranslate"><span class="pre">java</span> <span class="pre">version</span> <span class="pre">&quot;1.17</span></code>.</p></li>
 </ul>
-<p>Stainless bundles Scala compiler front-end and runs it before it starts compilation. We recommend using the Scala 3 front end (originally named dotty), though Scala 2 is also available.</p>
+<p>Stainless bundles Scala 3 compiler front-end and runs it before it starts compilation.</p>
 </section>
 <section id="use-standalone-release-recommended">
-<span id="standalone-release"></span><h2>Use Standalone Release (recommended)<a class="headerlink" href="#use-standalone-release-recommended" title="Permalink to this headline">¶</a></h2>
+<span id="standalone-release"></span><h2>Use Standalone Release (recommended)<a class="headerlink" href="#use-standalone-release-recommended" title="Link to this heading">¶</a></h2>
 <ol class="arabic simple">
 <li><p>Download the latest Stainless release from the <a class="reference external" href="https://github.com/epfl-lara/stainless/releases">Releases page on GitHub</a>, under the <strong>Assets</strong> section. Make sure to pick the appropriate ZIP for your operating system. This release is bundled with Z3 4.12.2 and cvc5 1.0.8.</p></li>
 <li><p>Unzip the the file you just downloaded to a directory.</p></li>
 <li><p>(Optional) Add this directory to your <code class="docutils literal notranslate"><span class="pre">PATH</span></code>. This will let you invoke Stainless via the <code class="docutils literal notranslate"><span class="pre">stainless</span></code> command instead of its fully qualified path in step 5.</p></li>
 <li><p>Paste the following code in a file named <code class="docutils literal notranslate"><span class="pre">HelloStainless.scala</span></code>:</p></li>
 </ol>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
 
-<span class="k">object</span> <span class="nc">HelloStainless</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">myTail</span><span class="p">(</span><span class="n">xs</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">require</span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">nonEmpty</span><span class="p">)</span>
-    <span class="n">xs</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">h</span><span class="p">,</span> <span class="n">_</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">h</span>
-      <span class="c1">// Match provably exhaustive</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<span class="k">object</span><span class="w"> </span><span class="nc">HelloStainless</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">myTail</span><span class="p">(</span><span class="n">xs</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">require</span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">nonEmpty</span><span class="p">)</span>
+<span class="w">    </span><span class="n">xs</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">_</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">h</span>
+<span class="w">      </span><span class="c1">// Match provably exhaustive</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <ol class="arabic simple" start="5">
 <li><p>In a terminal, type the following command, substituting the proper path to the directory where you unzipped the latest release:</p></li>
 </ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ /path/to/unzipped/directory/stainless HelloStainless.scala
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>/path/to/unzipped/directory/stainless<span class="w"> </span>HelloStainless.scala
 </pre></div>
 </div>
 <ol class="arabic simple" start="6">
@@ -189,7 +188,7 @@
 <p>Note: If the warning above says something about falling back on the Princess solver, you might be missing the <code class="docutils literal notranslate"><span class="pre">libgomp1</span></code> library,
 which you can install with your favorite package manager. For example, on Debian/Ubuntu, just run <code class="docutils literal notranslate"><span class="pre">apt-get</span> <span class="pre">install</span> <span class="pre">libgomp1</span></code>.</p>
 <section id="usage-within-an-existing-project">
-<span id="sbt-project"></span><h3>Usage Within An Existing Project<a class="headerlink" href="#usage-within-an-existing-project" title="Permalink to this headline">¶</a></h3>
+<span id="sbt-project"></span><h3>Usage Within An Existing Project<a class="headerlink" href="#usage-within-an-existing-project" title="Link to this heading">¶</a></h3>
 <p>Stainless can also be used within an existing SBT 1.7.x project.</p>
 <ol class="arabic simple">
 <li><p>Start by installing an external solver (see Section “<a class="reference internal" href="#smt-solvers"><span class="std std-ref">External Solver Binaries</span></a>”).</p></li>
@@ -221,10 +220,10 @@
 <li><p>In your project’s build file, enable the <code class="docutils literal notranslate"><span class="pre">StainlessPlugin</span></code> on the modules that should be verified by Stainless. Below is an example:</p></li>
 </ol>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="c1">// build.sbt</span>
-<span class="k">lazy</span> <span class="kd">val</span> <span class="n">algorithm</span> <span class="o">=</span> <span class="n">project</span>
-  <span class="p">.</span><span class="n">in</span><span class="p">(</span><span class="n">file</span><span class="p">(</span><span class="s">&quot;algorithm&quot;</span><span class="p">))</span>
-  <span class="p">.</span><span class="n">enablePlugins</span><span class="p">(</span><span class="nc">StainlessPlugin</span><span class="p">)</span> <span class="c1">// &lt;-- Enabling Stainless verification on this module!</span>
-  <span class="p">.</span><span class="n">settings</span><span class="p">(...)</span>
+<span class="k">lazy</span><span class="w"> </span><span class="kd">val</span><span class="w"> </span><span class="n">algorithm</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">project</span>
+<span class="w">  </span><span class="p">.</span><span class="n">in</span><span class="p">(</span><span class="n">file</span><span class="p">(</span><span class="s">&quot;algorithm&quot;</span><span class="p">))</span>
+<span class="w">  </span><span class="p">.</span><span class="n">enablePlugins</span><span class="p">(</span><span class="nc">StainlessPlugin</span><span class="p">)</span><span class="w"> </span><span class="c1">// &lt;-- Enabling Stainless verification on this module!</span>
+<span class="w">  </span><span class="p">.</span><span class="n">settings</span><span class="p">(...)</span>
 </pre></div>
 </div>
 <p>Note that if you are using <code class="docutils literal notranslate"><span class="pre">.scala</span></code> build files you need to use the fully qualified name <code class="docutils literal notranslate"><span class="pre">ch.epfl.lara.sbt.stainless.StainlessPlugin</span></code>. Also, because Stainless accepts a subset of the Scala language, you may need to refactor your build a bit and code to successfully use Stainless on a module.</p>
@@ -237,19 +236,34 @@
 <li><p>It is possible to specify extra source dependencies to be added to the set of files processed by Stainless via the <code class="docutils literal notranslate"><span class="pre">stainlessExtraDeps</span></code> setting. For example, to add both the <code class="docutils literal notranslate"><span class="pre">stainless-algebra</span></code> and <code class="docutils literal notranslate"><span class="pre">stainless-actors</span></code> packages, along with the latter’s dependency on Akka,
 one can add the following settings to their build:</p></li>
 </ol>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">stainlessExtraDeps</span> <span class="o">++=</span> <span class="nc">Seq</span><span class="p">(</span>
-  <span class="s">&quot;ch.epfl.lara&quot;</span> <span class="o">%%</span> <span class="s">&quot;stainless-algebra&quot;</span> <span class="o">%</span> <span class="s">&quot;0.1.2&quot;</span><span class="p">,</span>
-  <span class="s">&quot;ch.epfl.lara&quot;</span> <span class="o">%%</span> <span class="s">&quot;stainless-actors&quot;</span>  <span class="o">%</span> <span class="s">&quot;0.1.1&quot;</span><span class="p">,</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">stainlessExtraDeps</span><span class="w"> </span><span class="o">++=</span><span class="w"> </span><span class="nc">Seq</span><span class="p">(</span>
+<span class="w">  </span><span class="s">&quot;ch.epfl.lara&quot;</span><span class="w"> </span><span class="o">%%</span><span class="w"> </span><span class="s">&quot;stainless-algebra&quot;</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="s">&quot;0.1.2&quot;</span><span class="p">,</span>
+<span class="w">  </span><span class="s">&quot;ch.epfl.lara&quot;</span><span class="w"> </span><span class="o">%%</span><span class="w"> </span><span class="s">&quot;stainless-actors&quot;</span><span class="w">  </span><span class="o">%</span><span class="w"> </span><span class="s">&quot;0.1.1&quot;</span><span class="p">,</span>
 <span class="p">)</span>
 
-<span class="n">libraryDependencies</span> <span class="o">+=</span> <span class="s">&quot;com.typesafe.akka&quot;</span> <span class="o">%%</span> <span class="s">&quot;akka-actor&quot;</span> <span class="o">%</span> <span class="s">&quot;2.5.21&quot;</span>
+<span class="n">libraryDependencies</span><span class="w"> </span><span class="o">+=</span><span class="w"> </span><span class="s">&quot;com.typesafe.akka&quot;</span><span class="w"> </span><span class="o">%%</span><span class="w"> </span><span class="s">&quot;akka-actor&quot;</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="s">&quot;2.5.21&quot;</span>
 </pre></div>
 </div>
 <p>Note that the dependencies specified in <code class="docutils literal notranslate"><span class="pre">stainlessExtraDeps</span></code> must be available as a source JAR from any of the resolvers configured in the build.</p>
 </section>
 </section>
 <section id="running-code-with-stainless-dependencies">
-<span id="running-code"></span><h2>Running Code with Stainless dependencies<a class="headerlink" href="#running-code-with-stainless-dependencies" title="Permalink to this headline">¶</a></h2>
+<span id="running-code"></span><h2>Running Code with Stainless dependencies<a class="headerlink" href="#running-code-with-stainless-dependencies" title="Link to this heading">¶</a></h2>
+<p>If you are debugging your scala code before running stainless on it (e.g. using a simple editor with <cite>scala-cli –watch</cite>), you can use this workflow with stainless as well; you just need to make sure that Stainless libraries are visible to the Scala compiler.</p>
+<p>The simplest way is to use the release package, which contains <cite>stainless-cli</cite> script, a simple wrapper around <cite>scala-cli</cite> that adds the jar dependency on the compiled and source version of stainless library.</p>
+<p>Building a jar:</p>
+<p>You can package the Stainless library into a jar like this:</p>
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span><span class="nb">cd</span><span class="w"> </span>path/to/stainless/
+$<span class="w"> </span>sbt<span class="w"> </span>stainless-library/packageBin
+</pre></div>
+</div>
+<p>Add the generated Stainless library jar file when invoking the compiler with <code class="docutils literal notranslate"><span class="pre">scalac</span></code> and the JVM with <code class="docutils literal notranslate"><span class="pre">scala</span></code> or <code class="docutils literal notranslate"><span class="pre">java</span></code>. For instance:</p>
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>mkdir<span class="w"> </span>-p<span class="w"> </span>~/.scala_objects
+$<span class="w"> </span>scalac<span class="w"> </span>-d<span class="w"> </span>~/.scala_objects<span class="w"> </span>-cp<span class="w"> </span>/path/to/stainless/frontends/library/target/scala-3.3.3/stainless-library_3-X.Y.Z-A-BCDEFGHI.jar<span class="w"> </span>MyFile1.scala<span class="w"> </span>MyFile2.scala<span class="w"> </span><span class="c1"># and so on</span>
+$<span class="w"> </span>scala<span class="w"> </span>-cp<span class="w"> </span>~/.scala_objects:/path/to/stainless/frontends/library/target/scala-3.3.3/stainless-library_3-X.Y.Z-A-BCDEFGHI.jar<span class="w"> </span>MyMainClass
+</pre></div>
+</div>
+<p>where <code class="docutils literal notranslate"><span class="pre">X.Y.Z</span></code> is the Stainless version and <code class="docutils literal notranslate"><span class="pre">A-BCDEFGHI</span></code> is some hash (which can be autocompleted by the terminal).</p>
 <p>Using sources:</p>
 <ol class="arabic simple">
 <li><p>Clone the sources from <a class="reference external" href="https://github.com/epfl-lara/stainless">https://github.com/epfl-lara/stainless</a></p></li>
@@ -257,22 +271,9 @@
 <li><p>Compile your code (here in <code class="docutils literal notranslate"><span class="pre">MyFile.scala</span></code>, though you can have more than one file) while referring to the Stainless library sources: <code class="docutils literal notranslate"><span class="pre">scalac</span> <span class="pre">-d</span> <span class="pre">~/.scala_objects</span> <span class="pre">$(find</span> <span class="pre">/path/to/stainless/frontends/library/stainless/</span> <span class="pre">-name</span> <span class="pre">&quot;*.scala&quot;)</span> <span class="pre">MyFile.scala</span></code></p></li>
 <li><p>Run your code (replace <code class="docutils literal notranslate"><span class="pre">MyMainClass</span></code> with the name of your main object): <code class="docutils literal notranslate"><span class="pre">scala</span> <span class="pre">-cp</span> <span class="pre">~/.scala_objects</span> <span class="pre">MyMainClass</span></code></p></li>
 </ol>
-<p>Using jar:</p>
-<p>You can package the Stainless library into a jar to avoid the need to compile it every time:</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ <span class="nb">cd</span> path/to/stainless/
-$ sbt stainless-library/packageBin
-</pre></div>
-</div>
-<p>Add the generated Stainless library jar file when invoking the compiler with <code class="docutils literal notranslate"><span class="pre">scalac</span></code> and the JVM with <code class="docutils literal notranslate"><span class="pre">scala</span></code> or <code class="docutils literal notranslate"><span class="pre">java</span></code>. For instance:</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ mkdir -p ~/.scala_objects
-$ scalac -d ~/.scala_objects -cp /path/to/stainless/frontends/library/target/scala-2.13/stainless-library_2.13-X.Y.Z-A-BCDEFGHI.jar MyFile1.scala MyFile2.scala <span class="c1"># and so on</span>
-$ scala -cp ~/.scala_objects:/path/to/stainless/frontends/library/target/scala-2.13/stainless-library_2.13-X.Y.Z-A-BCDEFGHI.jar MyMainClass
-</pre></div>
-</div>
-<p>where <code class="docutils literal notranslate"><span class="pre">X.Y.Z</span></code> is the Stainless version and <code class="docutils literal notranslate"><span class="pre">A-BCDEFGHI</span></code> is some hash (which can be autocompleted by the terminal).</p>
 </section>
 <section id="external-solver-binaries">
-<span id="smt-solvers"></span><h2>External Solver Binaries<a class="headerlink" href="#external-solver-binaries" title="Permalink to this headline">¶</a></h2>
+<span id="smt-solvers"></span><h2>External Solver Binaries<a class="headerlink" href="#external-solver-binaries" title="Link to this heading">¶</a></h2>
 <p>If no external SMT solvers (such as Z3 or cvc5) are found, Stainless will use the bundled Scala-based <a class="reference external" href="http://www.philipp.ruemmer.org/princess.shtml">Princess solver</a></p>
 <p>To improve performance, we highly recommend that you install the following two additional external SMT solvers as binaries for your platform:</p>
 <ul class="simple">
@@ -285,14 +286,14 @@
 <p>You can use multiple solvers in portfolio mode, as with the options <code class="docutils literal notranslate"><span class="pre">--timeout=15</span> <span class="pre">--solvers=smt-z3,smt-cvc5</span></code>, where verification succeeds if at least one of the solvers proves (within the given number of seconds) each the verification conditions. We suggest to order the solvers starting from the one most likely to succeed quickly.</p>
 <p>For final verification runs of highly critical software, we recommend that (instead of the portfolio mode) you obtain several solvers and their versions, then try a single solver at a time and ensure that each verification run succeeds (thus applying N-version programming to SMT solver implementations).</p>
 <section id="install-z3-4-12-2">
-<h3>Install Z3 4.12.2<a class="headerlink" href="#install-z3-4-12-2" title="Permalink to this headline">¶</a></h3>
+<h3>Install Z3 4.12.2<a class="headerlink" href="#install-z3-4-12-2" title="Link to this heading">¶</a></h3>
 <ol class="arabic simple">
 <li><p>Download Z3 4.12.2 from <a class="reference external" href="https://github.com/Z3Prover/z3/releases/tag/z3-4.12.2">https://github.com/Z3Prover/z3/releases/tag/z3-4.12.2</a></p></li>
 <li><p>Unzip the downloaded archive</p></li>
 <li><p>Copy the <code class="docutils literal notranslate"><span class="pre">z3</span></code> binary found in the <code class="docutils literal notranslate"><span class="pre">bin/</span></code> directory of the inflated archive to a directory in your <code class="docutils literal notranslate"><span class="pre">$PATH</span></code>, eg., <code class="docutils literal notranslate"><span class="pre">/usr/local/bin</span></code>.</p></li>
 <li><p>Make sure <code class="docutils literal notranslate"><span class="pre">z3</span></code> can be found, by opening a new terminal window and typing:</p></li>
 </ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ z3 --version
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>z3<span class="w"> </span>--version
 </pre></div>
 </div>
 <ol class="arabic simple" start="5">
@@ -303,7 +304,7 @@ <h3>Install Z3 4.12.2<a class="headerlink" href="#install-z3-4-12-2" title="Perm
 </div>
 </section>
 <section id="install-cvc5-1-0-8">
-<h3>Install cvc5 1.0.8<a class="headerlink" href="#install-cvc5-1-0-8" title="Permalink to this headline">¶</a></h3>
+<h3>Install cvc5 1.0.8<a class="headerlink" href="#install-cvc5-1-0-8" title="Link to this heading">¶</a></h3>
 <ol class="arabic simple">
 <li><p>Download cvc5 1.0.8 from <a class="reference external" href="https://github.com/cvc5/cvc5/releases/tag/cvc5-1.0.8">https://github.com/cvc5/cvc5/releases/tag/cvc5-1.0.8</a> for your platform.</p></li>
 <li><p>Copy or link the downloaded binary under name <code class="docutils literal notranslate"><span class="pre">cvc5</span></code> to a directory in your <code class="docutils literal notranslate"><span class="pre">$PATH</span></code>, eg., <code class="docutils literal notranslate"><span class="pre">/usr/local/bin</span></code>.</p></li>
@@ -311,7 +312,7 @@ <h3>Install cvc5 1.0.8<a class="headerlink" href="#install-cvc5-1-0-8" title="Pe
 <ol class="arabic simple" start="4">
 <li><p>Make sure <code class="docutils literal notranslate"><span class="pre">cvc5</span></code> can be found, by opening a new terminal window and typing:</p></li>
 </ol>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ cvc5 --version <span class="p">|</span> head
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>cvc5<span class="w"> </span>--version<span class="w"> </span><span class="p">|</span><span class="w"> </span>head
 </pre></div>
 </div>
 <ol class="arabic simple" start="5">
@@ -323,70 +324,68 @@ <h3>Install cvc5 1.0.8<a class="headerlink" href="#install-cvc5-1-0-8" title="Pe
 </section>
 </section>
 <section id="build-from-source-on-linux-macos">
-<h2>Build from Source on Linux &amp; macOS<a class="headerlink" href="#build-from-source-on-linux-macos" title="Permalink to this headline">¶</a></h2>
+<h2>Build from Source on Linux &amp; macOS<a class="headerlink" href="#build-from-source-on-linux-macos" title="Link to this heading">¶</a></h2>
 <p>To build Stainless, we use <code class="docutils literal notranslate"><span class="pre">sbt</span></code>. In a typical configuration, <code class="docutils literal notranslate"><span class="pre">sbt</span> <span class="pre">universal:stage</span></code> in the root of the source tree should work, yet,
 in an attempt to be more reproducible and independent from SBT cache and path, the instructions below assume that the directory called <code class="docutils literal notranslate"><span class="pre">stainless</span></code> does not exist, they instruct <code class="docutils literal notranslate"><span class="pre">sbt</span></code> to use a relative path for its bootstrap, and do not require adding <code class="docutils literal notranslate"><span class="pre">sbt</span></code> to your path.</p>
 <p><strong>Install SBT</strong></p>
 <p>Follow the instructions at <a class="reference external" href="http://www.scala-sbt.org/">http://www.scala-sbt.org/</a> to install <code class="docutils literal notranslate"><span class="pre">sbt</span></code> 1.7.3 (or somewhat later version).</p>
 <p><strong>Check out sources</strong></p>
 <p>Get the sources of Stainless by cloning the official Stainless repository:</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ git clone https://github.com/epfl-lara/stainless.git
-Cloning into <span class="s1">&#39;stainless&#39;</span>...
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>git<span class="w"> </span>clone<span class="w"> </span>--recursive<span class="w"> </span>https://github.com/epfl-lara/stainless.git
+Cloning<span class="w"> </span>into<span class="w"> </span><span class="s1">&#39;stainless&#39;</span>...
+$<span class="w"> </span><span class="nb">cd</span><span class="w"> </span>stainless
+$<span class="w"> </span>git<span class="w"> </span>submodule<span class="w"> </span>update<span class="w"> </span>--init<span class="w"> </span>--recursive
 </pre></div>
 </div>
 <p><strong>Run SBT</strong></p>
 <p>The following instructions will invoke SBT while using a stainless sub-directory to download files.</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ <span class="nb">cd</span> stainless
-$ sbt universal:stage
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>sbt<span class="w"> </span>universal:stage
 </pre></div>
 </div>
 <p><strong>Where to find generated files</strong></p>
-<p>The compilation will automatically generate the bash script <code class="docutils literal notranslate"><span class="pre">stainless-dotty</span></code> (and the Scala2 one <code class="docutils literal notranslate"><span class="pre">stainless-scalac</span></code>).</p>
+<p>The compilation will automatically generate the bash script <code class="docutils literal notranslate"><span class="pre">stainless-dotty</span></code>.</p>
 <p>You may want to introduce a soft-link from to a file called <code class="docutils literal notranslate"><span class="pre">stainless</span></code>:</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ ln -s frontends/dotty/target/universal/stage/bin/stainless-dotty stainless
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>ln<span class="w"> </span>-s<span class="w"> </span>frontends/dotty/target/universal/stage/bin/stainless-dotty<span class="w"> </span>stainless
 </pre></div>
 </div>
-<p>and, for the Scala2 version of the front end,</p>
-<blockquote>
-<div><p>$ ln -s frontends/scalac/target/universal/stage/bin/stainless-scalac stainless-scalac-old</p>
-</div></blockquote>
 <p>Analogous scripts work for various platforms and allow additional control over the execution, such as passing JVM arguments or system properties:</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ stainless -Dscalaz3.debug.load<span class="o">=</span><span class="nb">true</span> -J-Xmx6G --help
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>stainless<span class="w"> </span>-Dscalaz3.debug.load<span class="o">=</span><span class="nb">true</span><span class="w"> </span>-J-Xmx6G<span class="w"> </span>--help
 </pre></div>
 </div>
-<p>Note that Stainless is organized as a structure of several projects. The main project lives in <code class="docutils literal notranslate"><span class="pre">core</span></code> while the two available frontends can be found in <code class="docutils literal notranslate"><span class="pre">frontends/dotty</span></code> (and <code class="docutils literal notranslate"><span class="pre">frontends/scalac</span></code>).  From a user point of view, this should most of the time be transparent and the build command should take care of everything.</p>
+<p>Note that Stainless is organized as a structure of several projects. The main project lives in <code class="docutils literal notranslate"><span class="pre">core</span></code> while the Scala 3 frontend can be found in <code class="docutils literal notranslate"><span class="pre">frontends/dotty</span></code>.  From a user point of view, this should most of the time be transparent and the build command should take care of everything.</p>
 </section>
 <section id="build-from-source-on-windows-10">
-<h2>Build from Source on Windows 10<a class="headerlink" href="#build-from-source-on-windows-10" title="Permalink to this headline">¶</a></h2>
-<p>Before following the infrequently updated instructions in this section, considering running Ubuntu on Windows 10 (through e.g. WSL) and following the instructions for Linux.</p>
+<h2>Build from Source on Windows 10<a class="headerlink" href="#build-from-source-on-windows-10" title="Link to this heading">¶</a></h2>
+<p>Before following the infrequently updated instructions in this section, considering running Ubuntu on Windows 10 (through e.g. WSL2) and following the instructions for Linux.</p>
 <p>Get the sources of Stainless by cloning the official Stainless repository. You will need a Git shell for windows, e.g.  <a class="reference external" href="https://git-for-windows.github.io/">Git for Windows</a>.
 On Windows, please do not use <code class="docutils literal notranslate"><span class="pre">sbt</span> <span class="pre">universal:stage</span></code> as this generates a Windows batch file which is unusable, because it contains commands that are too long for Windows.
-Instead, please use <code class="docutils literal notranslate"><span class="pre">sbt</span> <span class="pre">stainless-scalac-standalone/assembly</span></code> as follows:</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ git clone https://github.com/epfl-lara/stainless.git
-Cloning into <span class="s1">&#39;stainless&#39;</span>...
-// ...
-$ <span class="nb">cd</span> stainless
-$ sbt stainless-scalac-standalone/assembly
-// takes about <span class="m">1</span> minutes
+Instead, please use <code class="docutils literal notranslate"><span class="pre">sbt</span> <span class="pre">stainless-dotty-standalone/assembly</span></code> as follows:</p>
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>git<span class="w"> </span>clone<span class="w"> </span>--recursive<span class="w"> </span>https://github.com/epfl-lara/stainless.git
+Cloning<span class="w"> </span>into<span class="w"> </span><span class="s1">&#39;stainless&#39;</span>...
+//<span class="w"> </span>...
+$<span class="w"> </span><span class="nb">cd</span><span class="w"> </span>stainless
+$<span class="w"> </span>git<span class="w"> </span>submodule<span class="w"> </span>update<span class="w"> </span>--init<span class="w"> </span>--recursive
+$<span class="w"> </span>sbt<span class="w"> </span>stainless-dotty-standalone/assembly
+//<span class="w"> </span>takes<span class="w"> </span>about<span class="w"> </span><span class="m">1</span><span class="w"> </span>minutes
 </pre></div>
 </div>
 <p>Running Stainless can then be done with the command: <code class="docutils literal notranslate"><span class="pre">java</span> <span class="pre">-jar</span> <span class="pre">frontends\stainless-dotty-standalone\target\scala-3.3.3\stainless-dotty-standalone-{VERSION}.jar</span></code>, where <code class="docutils literal notranslate"><span class="pre">VERSION</span></code> denotes Stainless version.</p>
 </section>
 <section id="running-tests">
-<h2>Running Tests<a class="headerlink" href="#running-tests" title="Permalink to this headline">¶</a></h2>
+<h2>Running Tests<a class="headerlink" href="#running-tests" title="Link to this heading">¶</a></h2>
 <p>Stainless comes with a test suite. Use the following commands to
 invoke different test suites:</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ sbt <span class="nb">test</span>
-$ sbt it:test
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>sbt<span class="w"> </span><span class="nb">test</span>
+$<span class="w"> </span>sbt<span class="w"> </span>it:test
 </pre></div>
 </div>
 <p>It’s also possible to run tests in isolation, for example, the following command runs <code class="docutils literal notranslate"><span class="pre">Extraction</span></code> tests on all files in <code class="docutils literal notranslate"><span class="pre">termination/looping</span></code>:</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$ sbt <span class="s1">&#39;it:testOnly *ExtractionSuite* -- -z &quot;in termination/looping&quot;&#39;</span>
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>$<span class="w"> </span>sbt<span class="w"> </span><span class="s1">&#39;it:testOnly *ExtractionSuite* -- -z &quot;in termination/looping&quot;&#39;</span>
 </pre></div>
 </div>
 </section>
 <section id="building-stainless-documentation">
-<h2>Building Stainless Documentation<a class="headerlink" href="#building-stainless-documentation" title="Permalink to this headline">¶</a></h2>
+<h2>Building Stainless Documentation<a class="headerlink" href="#building-stainless-documentation" title="Link to this heading">¶</a></h2>
 <p>Stainless documentation is available at <a class="reference external" href="https://epfl-lara.github.io/stainless/">https://epfl-lara.github.io/stainless/</a> .
 To build the documentation locally, you will need Sphinx (
 <a class="reference external" href="http://sphinx-doc.org/">http://sphinx-doc.org/</a> ), a restructured text toolkit that
@@ -400,39 +399,39 @@ <h2>Building Stainless Documentation<a class="headerlink" href="#building-stainl
 <p>Note for project maintainers: to build documentation on GitHub Pages, use <code class="docutils literal notranslate"><span class="pre">make</span> <span class="pre">gh-pages</span></code> in the same Makefile, or adapt it to you needs.</p>
 </section>
 <section id="using-ides-with-no-colors-option-emacs-illustration">
-<h2>Using IDEs with –no-colors option. Emacs illustration<a class="headerlink" href="#using-ides-with-no-colors-option-emacs-illustration" title="Permalink to this headline">¶</a></h2>
+<h2>Using IDEs with –no-colors option. Emacs illustration<a class="headerlink" href="#using-ides-with-no-colors-option-emacs-illustration" title="Link to this heading">¶</a></h2>
 <p>Using command line option <code class="docutils literal notranslate"><span class="pre">--no-colors</span></code> asks stainless to produce clear 7-bit ASCII output with error messages in a standardized format:</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>FileName.scala:LineNo:ColNo: text of the error message
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>FileName.scala:LineNo:ColNo:<span class="w"> </span>text<span class="w"> </span>of<span class="w"> </span>the<span class="w"> </span>error<span class="w"> </span>message
 </pre></div>
 </div>
 <p>This helps IDEs to pick up line numbers and show error location in the source file.</p>
 <p>In <code class="docutils literal notranslate"><span class="pre">emacs</span></code> editor, you can invoke <code class="docutils literal notranslate"><span class="pre">ansi-term</span></code> and <code class="docutils literal notranslate"><span class="pre">compilation-shell-minor-mode</span></code>. Then, run</p>
-<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>stainless --no-colors &lt;InputFilesAndOptions&gt;
+<div class="highlight-bash notranslate"><div class="highlight"><pre><span></span>stainless<span class="w"> </span>--no-colors<span class="w"> </span>&lt;InputFilesAndOptions&gt;
 </pre></div>
 </div>
 <p>You may also consider using the <code class="docutils literal notranslate"><span class="pre">--watch</span></code> option.</p>
 <p>You should now be able to click on a message for verification condition to jump to the appropriate position in the appropriate file, as well as to use emacs commands <code class="docutils literal notranslate"><span class="pre">previous-error</span></code> and <code class="docutils literal notranslate"><span class="pre">next-error</span></code> to navigate through errors and other verification-condition outcomes.</p>
 <p>Here is a very simple illustration that introduces an interactive <code class="docutils literal notranslate"><span class="pre">comp-ansi-term</span></code> command that creates new window with ansi-term and minor compilation mode:</p>
-<div class="highlight-lisp notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="k">setq</span> <span class="nv">comp-terminal-current-number</span> <span class="mi">1</span><span class="p">)</span>
-<span class="p">(</span><span class="nb">defun</span> <span class="nv">create-numbered-comp-terminal</span> <span class="p">()</span>
-  <span class="p">(</span><span class="nv">ansi-term</span> <span class="s">&quot;/bin/bash&quot;</span><span class="p">)</span>
-  <span class="p">(</span><span class="nv">rename-buffer</span> <span class="p">(</span><span class="nv">concat</span> <span class="s">&quot;q&quot;</span> <span class="p">(</span><span class="nv">number-to-string</span> <span class="nv">comp-terminal-current-number</span><span class="p">))</span> <span class="mi">1</span><span class="p">)</span>
-  <span class="p">(</span><span class="k">setq</span> <span class="nv">comp-terminal-current-number</span> <span class="p">(</span><span class="nb">+</span> <span class="nv">comp-terminal-current-number</span> <span class="mi">1</span><span class="p">))</span>
-  <span class="p">(</span><span class="nv">compilation-shell-minor-mode</span><span class="p">)</span>
+<div class="highlight-lisp notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="k">setq</span><span class="w"> </span><span class="nv">comp-terminal-current-number</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<span class="p">(</span><span class="nb">defun</span><span class="w"> </span><span class="nv">create-numbered-comp-terminal</span><span class="w"> </span><span class="p">()</span>
+<span class="w">  </span><span class="p">(</span><span class="nv">ansi-term</span><span class="w"> </span><span class="s">&quot;/bin/bash&quot;</span><span class="p">)</span>
+<span class="w">  </span><span class="p">(</span><span class="nv">rename-buffer</span><span class="w"> </span><span class="p">(</span><span class="nv">concat</span><span class="w"> </span><span class="s">&quot;q&quot;</span><span class="w"> </span><span class="p">(</span><span class="nv">number-to-string</span><span class="w"> </span><span class="nv">comp-terminal-current-number</span><span class="p">))</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<span class="w">  </span><span class="p">(</span><span class="k">setq</span><span class="w"> </span><span class="nv">comp-terminal-current-number</span><span class="w"> </span><span class="p">(</span><span class="nb">+</span><span class="w"> </span><span class="nv">comp-terminal-current-number</span><span class="w"> </span><span class="mi">1</span><span class="p">))</span>
+<span class="w">  </span><span class="p">(</span><span class="nv">compilation-shell-minor-mode</span><span class="p">)</span>
 <span class="p">)</span>
-<span class="p">(</span><span class="nb">defun</span> <span class="nv">comp-ansi-term</span> <span class="p">(</span><span class="nv">arg</span><span class="p">)</span>
-  <span class="s">&quot;Run ansi-term with bash and compilation-shell-minor-mode in buffer named q_N for increasing N&quot;</span> <span class="p">(</span><span class="nv">interactive</span> <span class="s">&quot;P&quot;</span><span class="p">)</span>
-  <span class="p">(</span><span class="nv">create-numbered-comp-terminal</span><span class="p">)</span>
-  <span class="p">(</span><span class="nv">split-window-vertically</span><span class="p">)</span>
-  <span class="p">(</span><span class="nv">previous-buffer</span><span class="p">)</span>
-  <span class="p">(</span><span class="nv">other-window</span> <span class="mi">1</span><span class="p">)</span>
+<span class="p">(</span><span class="nb">defun</span><span class="w"> </span><span class="nv">comp-ansi-term</span><span class="w"> </span><span class="p">(</span><span class="nv">arg</span><span class="p">)</span>
+<span class="w">  </span><span class="s">&quot;Run ansi-term with bash and compilation-shell-minor-mode in buffer named q_N for increasing N&quot;</span><span class="w"> </span><span class="p">(</span><span class="nv">interactive</span><span class="w"> </span><span class="s">&quot;P&quot;</span><span class="p">)</span>
+<span class="w">  </span><span class="p">(</span><span class="nv">create-numbered-comp-terminal</span><span class="p">)</span>
+<span class="w">  </span><span class="p">(</span><span class="nv">split-window-vertically</span><span class="p">)</span>
+<span class="w">  </span><span class="p">(</span><span class="nv">previous-buffer</span><span class="p">)</span>
+<span class="w">  </span><span class="p">(</span><span class="nv">other-window</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
 <span class="p">)</span>
 </pre></div>
 </div>
 <p>The following globally binds the above command to the F3 key and binds F7 and F8 to commands for navigating reports:</p>
-<div class="highlight-lisp notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="nv">global-set-key</span> <span class="nv">[f3]</span> <span class="ss">&#39;comp-ansi-term</span><span class="p">)</span>
-<span class="p">(</span><span class="nv">global-set-key</span> <span class="nv">[f7]</span> <span class="ss">&#39;previous-error</span><span class="p">)</span>
-<span class="p">(</span><span class="nv">global-set-key</span> <span class="nv">[f8]</span> <span class="ss">&#39;next-error</span><span class="p">)</span>
+<div class="highlight-lisp notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="nv">global-set-key</span><span class="w"> </span><span class="nv">[f3]</span><span class="w"> </span><span class="ss">&#39;comp-ansi-term</span><span class="p">)</span>
+<span class="p">(</span><span class="nv">global-set-key</span><span class="w"> </span><span class="nv">[f7]</span><span class="w"> </span><span class="ss">&#39;previous-error</span><span class="p">)</span>
+<span class="p">(</span><span class="nv">global-set-key</span><span class="w"> </span><span class="nv">[f8]</span><span class="w"> </span><span class="ss">&#39;next-error</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>For more information, please consult the documentation for <code class="docutils literal notranslate"><span class="pre">emacs</span></code>.</p>
@@ -442,8 +441,7 @@ <h2>Using IDEs with –no-colors option. Emacs illustration<a class="headerlink"
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="intro.html" class="btn btn-neutral float-left" title="Introduction" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="gettingstarted.html" class="btn btn-neutral float-right" title="Verifying and Compiling Examples" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -452,7 +450,7 @@ <h2>Using IDEs with –no-colors option. Emacs illustration<a class="headerlink"
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on May 09, 2024.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -463,7 +461,7 @@ <h2>Using IDEs with –no-colors option. Emacs illustration<a class="headerlink"
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/internals.html b/internals.html
index db76d93298..ce691e0145 100644
--- a/internals.html
+++ b/internals.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Stainless’ Internals &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="prev" title="References" href="references.html" /> 
@@ -28,20 +27,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -70,20 +72,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Stainless’ Internals</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Stainless’ Internals</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/internals.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -94,16 +93,15 @@
            <div itemprop="articleBody">
              
   <section id="stainless-internals">
-<span id="internals"></span><h1>Stainless’ Internals<a class="headerlink" href="#stainless-internals" title="Permalink to this headline">¶</a></h1>
+<span id="internals"></span><h1>Stainless’ Internals<a class="headerlink" href="#stainless-internals" title="Link to this heading">¶</a></h1>
 <p>The main component of Stainless and the dataflow in its pipeline:</p>
-<a class="reference internal image-reference" href="_images/pipeline.svg"><img alt="_images/pipeline.svg" src="_images/pipeline.svg" width="90%" /></a>
+<a class="reference internal image-reference" href="_images/pipeline.svg"><img alt="_images/pipeline.svg" src="_images/pipeline.svg" style="width: 90%;" /></a>
 </section>
 
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="references.html" class="btn btn-neutral float-left" title="References" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
     </div>
 
@@ -111,7 +109,7 @@
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -122,7 +120,7 @@
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/intro.html b/intro.html
index 7240d621dc..4a9a9257eb 100644
--- a/intro.html
+++ b/intro.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Introduction &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Installing Stainless" href="installation.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1 current"><a class="current reference internal" href="#">Introduction</a><ul>
 <li class="toctree-l2"><a class="reference internal" href="#stainless-and-scala">Stainless and Scala</a></li>
@@ -76,20 +78,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Introduction</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Introduction</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/intro.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -100,7 +99,7 @@
            <div itemprop="articleBody">
              
   <section id="introduction">
-<h1>Introduction<a class="headerlink" href="#introduction" title="Permalink to this headline">¶</a></h1>
+<h1>Introduction<a class="headerlink" href="#introduction" title="Link to this heading">¶</a></h1>
 <p>The Stainless verification framework aims to help developers build
 verified Scala software. It encourages using a small set of core
 Scala features and provides unique verification functionality.
@@ -113,7 +112,7 @@ <h1>Introduction<a class="headerlink" href="#introduction" title="Permalink to t
 <li><p>verify that your program will terminate on all inputs</p></li>
 </ul>
 <section id="stainless-and-scala">
-<h2>Stainless and Scala<a class="headerlink" href="#stainless-and-scala" title="Permalink to this headline">¶</a></h2>
+<h2>Stainless and Scala<a class="headerlink" href="#stainless-and-scala" title="Link to this heading">¶</a></h2>
 <p>Stainless attempts to strike a delicate balance between the
 convenience of use on the one hand and the simplicity of
 reasoning on the other hand. Stainless supports verification
@@ -148,19 +147,19 @@ <h2>Stainless and Scala<a class="headerlink" href="#stainless-and-scala" title="
 To learn more about the functionality that Stainless provides, read on below.</p>
 </section>
 <section id="software-verification">
-<h2>Software Verification<a class="headerlink" href="#software-verification" title="Permalink to this headline">¶</a></h2>
+<h2>Software Verification<a class="headerlink" href="#software-verification" title="Link to this heading">¶</a></h2>
 <p>The Stainless program verifier collects a list of top-level functions,
 and verifies the <em>validity</em> of their <em>contracts</em>. Essentially, for each function,
 it will (try to) prove that the postcondition always holds, assuming a given
 precondition does hold. A simple example:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">factorial</span><span class="p">(</span><span class="n">n</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">n</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="k">if</span><span class="p">(</span><span class="n">n</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="p">{</span>
-    <span class="nc">BigInt</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-  <span class="p">}</span> <span class="k">else</span> <span class="p">{</span>
-    <span class="n">n</span> <span class="o">*</span> <span class="n">factorial</span><span class="p">(</span><span class="n">n</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span>
-  <span class="p">}</span>
-<span class="p">}</span> <span class="n">ensuring</span><span class="p">(</span><span class="n">res</span> <span class="o">=&gt;</span> <span class="n">res</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">factorial</span><span class="p">(</span><span class="n">n</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">   </span><span class="k">if</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">     </span><span class="nc">BigInt</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
+<span class="w">   </span><span class="p">}</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="p">{</span>
+<span class="w">     </span><span class="n">n</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">factorial</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<span class="w">   </span><span class="p">}</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>Stainless generates a <code class="docutils literal notranslate"><span class="pre">postcondition</span></code> verification condition for the above
@@ -185,7 +184,7 @@ <h2>Software Verification<a class="headerlink" href="#software-verification" tit
 <a class="reference internal" href="purescala.html"><span class="doc">Pure Scala</span></a> and <a class="reference internal" href="imperative.html"><span class="doc">Imperative</span></a>.</p>
 </section>
 <section id="program-termination">
-<h2>Program Termination<a class="headerlink" href="#program-termination" title="Permalink to this headline">¶</a></h2>
+<h2>Program Termination<a class="headerlink" href="#program-termination" title="Link to this heading">¶</a></h2>
 <p>A “verified” function in stainless is guaranteed to never crash, however, it can
 still lead to an infinite evaluation. Stainless therefore provides a termination
 checker that complements the verification of safety properties.</p>
@@ -210,10 +209,10 @@ <h2>Program Termination<a class="headerlink" href="#program-termination" title="
 occur through the <code class="docutils literal notranslate"><span class="pre">decreases</span></code> construct. For example, the
 <a class="reference external" href="https://en.wikipedia.org/wiki/McCarthy_91_function">McCarthy 91 function</a>
 can be shown terminating as follows:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">M</span><span class="p">(</span><span class="n">n</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">decreases</span><span class="p">(</span><span class="n">stainless</span><span class="p">.</span><span class="n">math</span><span class="p">.</span><span class="n">max</span><span class="p">(</span><span class="mi">101</span> <span class="o">-</span> <span class="n">n</span><span class="p">,</span> <span class="mi">0</span><span class="p">))</span>
-  <span class="k">if</span> <span class="p">(</span><span class="n">n</span> <span class="o">&gt;</span> <span class="mi">100</span><span class="p">)</span> <span class="n">n</span> <span class="o">-</span> <span class="mi">10</span> <span class="k">else</span> <span class="nc">M</span><span class="p">(</span><span class="nc">M</span><span class="p">(</span><span class="n">n</span> <span class="o">+</span> <span class="mi">11</span><span class="p">))</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">(</span><span class="n">_</span> <span class="o">==</span> <span class="p">(</span><span class="k">if</span> <span class="p">(</span><span class="n">n</span> <span class="o">&gt;</span> <span class="mi">100</span><span class="p">)</span> <span class="n">n</span> <span class="o">-</span> <span class="mi">10</span> <span class="k">else</span> <span class="nc">BigInt</span><span class="p">(</span><span class="mi">91</span><span class="p">)))</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">M</span><span class="p">(</span><span class="n">n</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">decreases</span><span class="p">(</span><span class="n">stainless</span><span class="p">.</span><span class="n">math</span><span class="p">.</span><span class="n">max</span><span class="p">(</span><span class="mi">101</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="mi">0</span><span class="p">))</span>
+<span class="w">   </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">100</span><span class="p">)</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">10</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="nc">M</span><span class="p">(</span><span class="nc">M</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">11</span><span class="p">))</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">_</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">100</span><span class="p">)</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">10</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">(</span><span class="mi">91</span><span class="p">)))</span>
 </pre></div>
 </div>
 <p>It is also possible to add a pre-condition (<code class="docutils literal notranslate"><span class="pre">require(...)</span></code>) <em>before</em> <code class="docutils literal notranslate"><span class="pre">decreases</span></code>.</p>
@@ -223,8 +222,7 @@ <h2>Program Termination<a class="headerlink" href="#program-termination" title="
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="index.html" class="btn btn-neutral float-left" title="Stainless documentation" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="installation.html" class="btn btn-neutral float-right" title="Installing Stainless" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -233,7 +231,7 @@ <h2>Program Termination<a class="headerlink" href="#program-termination" title="
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -244,7 +242,7 @@ <h2>Program Termination<a class="headerlink" href="#program-termination" title="
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/laws.html b/laws.html
index 9530da1ce3..2bd9934fee 100644
--- a/laws.html
+++ b/laws.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Specifying Algebraic Properties &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Imperative" href="imperative.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -79,20 +81,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Specifying Algebraic Properties</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Specifying Algebraic Properties</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/laws.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -103,9 +102,9 @@
            <div itemprop="articleBody">
              
   <section id="specifying-algebraic-properties">
-<span id="laws"></span><h1>Specifying Algebraic Properties<a class="headerlink" href="#specifying-algebraic-properties" title="Permalink to this headline">¶</a></h1>
+<span id="laws"></span><h1>Specifying Algebraic Properties<a class="headerlink" href="#specifying-algebraic-properties" title="Link to this heading">¶</a></h1>
 <section id="introduction">
-<h2>Introduction<a class="headerlink" href="#introduction" title="Permalink to this headline">¶</a></h2>
+<h2>Introduction<a class="headerlink" href="#introduction" title="Link to this heading">¶</a></h2>
 <p>Many datatypes that programmers deal with on a day-to-day basis often provide
 the same set of operations, for example:</p>
 <ul class="simple">
@@ -125,7 +124,7 @@ <h2>Introduction<a class="headerlink" href="#introduction" title="Permalink to t
 mechanism for expressing the properties: typeclasses.</p>
 </section>
 <section id="typeclasses">
-<h2>Typeclasses<a class="headerlink" href="#typeclasses" title="Permalink to this headline">¶</a></h2>
+<h2>Typeclasses<a class="headerlink" href="#typeclasses" title="Link to this heading">¶</a></h2>
 <p>Typeclasses were introduced by Wadler &amp; Blott <a class="reference internal" href="#wb89" id="id1"><span>[WB89]</span></a> as an extension
 to the Hindley/Milner type system to implement a certain kind of overloading,
 known as <em>ad-hoc</em> polymorphism.</p>
@@ -139,29 +138,29 @@ <h2>Typeclasses<a class="headerlink" href="#typeclasses" title="Permalink to thi
 Here is for example, the definition and implementation of a <code class="docutils literal notranslate"><span class="pre">Monoid</span></code>, ie. a typeclass
 for datatypes which can be mashed together associatively, and which have an
 identity element w.r.t. to this operation:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">empty</span><span class="p">:</span> <span class="nc">A</span>
-  <span class="k">def</span> <span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">A</span>
-
-  <span class="nd">@law</span>
-  <span class="k">def</span> <span class="nf">law_leftIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">append</span><span class="p">(</span><span class="n">empty</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="o">==</span> <span class="n">x</span>
-  <span class="p">}</span>
-
-  <span class="nd">@law</span>
-  <span class="k">def</span> <span class="nf">law_rightIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">empty</span><span class="p">)</span> <span class="o">==</span> <span class="n">x</span>
-  <span class="p">}</span>
-
-  <span class="nd">@law</span>
-  <span class="k">def</span> <span class="nf">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">z</span><span class="p">:</span> <span class="nc">A</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">append</span><span class="p">(</span><span class="n">y</span><span class="p">,</span> <span class="n">z</span><span class="p">))</span> <span class="o">==</span> <span class="n">append</span><span class="p">(</span><span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">),</span> <span class="n">z</span><span class="p">)</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">A</span>
+
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_leftIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">append</span><span class="p">(</span><span class="n">empty</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_rightIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">empty</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">append</span><span class="p">(</span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">))</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">append</span><span class="p">(</span><span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">),</span><span class="w"> </span><span class="n">z</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">implicit</span> <span class="kd">val</span> <span class="n">bigIntAdditiveMonoid</span><span class="p">:</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="o">=</span> <span class="k">new</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">empty</span><span class="p">:</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="mi">0</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="n">x</span> <span class="o">+</span> <span class="n">y</span>
+<span class="k">implicit</span><span class="w"> </span><span class="kd">val</span><span class="w"> </span><span class="n">bigIntAdditiveMonoid</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -184,133 +183,133 @@ <h2>Typeclasses<a class="headerlink" href="#typeclasses" title="Permalink to thi
 </div>
 <p>Armed with the knowledge that our <code class="docutils literal notranslate"><span class="pre">Monoid</span></code> will always be lawful, one can now fearlessly write
 the <code class="docutils literal notranslate"><span class="pre">foldMap</span></code> function, and get the expected result:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foldMap</span><span class="p">[</span><span class="nc">A</span><span class="p">,</span> <span class="nc">M</span><span class="p">](</span><span class="n">xs</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">])(</span><span class="n">f</span><span class="p">:</span> <span class="nc">A</span> <span class="o">=&gt;</span> <span class="nc">M</span><span class="p">)(</span><span class="k">implicit</span> <span class="nc">M</span><span class="p">:</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">M</span><span class="p">]):</span> <span class="nc">M</span> <span class="o">=</span> <span class="n">xs</span> <span class="k">match</span> <span class="p">{</span>
-  <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">=&gt;</span> <span class="nc">M</span><span class="p">.</span><span class="n">empty</span>
-  <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">y</span><span class="p">,</span> <span class="n">ys</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">M</span><span class="p">.</span><span class="n">append</span><span class="p">(</span><span class="n">f</span><span class="p">(</span><span class="n">y</span><span class="p">),</span> <span class="n">foldMap</span><span class="p">(</span><span class="n">ys</span><span class="p">)(</span><span class="n">f</span><span class="p">))</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">foldMap</span><span class="p">[</span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="nc">M</span><span class="p">](</span><span class="n">xs</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">])(</span><span class="n">f</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">M</span><span class="p">)(</span><span class="k">implicit</span><span class="w"> </span><span class="nc">M</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">M</span><span class="p">]):</span><span class="w"> </span><span class="nc">M</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">xs</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">M</span><span class="p">.</span><span class="n">empty</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">ys</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">M</span><span class="p">.</span><span class="n">append</span><span class="p">(</span><span class="n">f</span><span class="p">(</span><span class="n">y</span><span class="p">),</span><span class="w"> </span><span class="n">foldMap</span><span class="p">(</span><span class="n">ys</span><span class="p">)(</span><span class="n">f</span><span class="p">))</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">sumBigInt</span><span class="p">(</span><span class="n">xs</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">foldMap</span><span class="p">(</span><span class="n">xs</span><span class="p">)(</span><span class="n">x</span> <span class="o">=&gt;</span> <span class="n">x</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">sumBigInt</span><span class="p">(</span><span class="n">xs</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">foldMap</span><span class="p">(</span><span class="n">xs</span><span class="p">)(</span><span class="n">x</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>Sometimes, Stainless will not be able to automatically prove that an instance is lawful,
 for example when the property of interest involves a recursive definition over an inductive
 data type, as in the following code:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">Nat</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">+</span><span class="p">(</span><span class="n">m</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">):</span> <span class="nc">Nat</span> <span class="o">=</span> <span class="bp">this</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Zero</span> <span class="o">=&gt;</span> <span class="n">m</span>
-    <span class="k">case</span> <span class="nc">Succ</span><span class="p">(</span><span class="n">n</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">Succ</span><span class="p">(</span><span class="n">n</span> <span class="o">+</span> <span class="n">m</span><span class="p">)</span>
-  <span class="p">}</span>
-
-  <span class="k">def</span> <span class="nf">*</span><span class="p">(</span><span class="n">m</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">):</span> <span class="nc">Nat</span> <span class="o">=</span> <span class="bp">this</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Zero</span> <span class="o">=&gt;</span> <span class="nc">Zero</span>
-    <span class="k">case</span> <span class="nc">Succ</span><span class="p">(</span><span class="n">n</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">n</span> <span class="o">*</span> <span class="n">m</span> <span class="o">+</span> <span class="n">m</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Nat</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">+</span><span class="p">(</span><span class="n">m</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">):</span><span class="w"> </span><span class="nc">Nat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="bp">this</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Zero</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">m</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Succ</span><span class="p">(</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Succ</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">m</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">*</span><span class="p">(</span><span class="n">m</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">):</span><span class="w"> </span><span class="nc">Nat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="bp">this</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Zero</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Zero</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Succ</span><span class="p">(</span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">m</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">m</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">final</span> <span class="k">case</span> <span class="k">object</span> <span class="nc">Zero</span> <span class="k">extends</span> <span class="nc">Nat</span>
-<span class="k">final</span> <span class="k">case</span> <span class="k">class</span> <span class="nc">Succ</span><span class="p">(</span><span class="n">prev</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">Nat</span>
+<span class="k">final</span><span class="w"> </span><span class="k">case</span><span class="w"> </span><span class="k">object</span><span class="w"> </span><span class="nc">Zero</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Nat</span>
+<span class="k">final</span><span class="w"> </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Succ</span><span class="p">(</span><span class="n">prev</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Nat</span>
 
-<span class="k">final</span> <span class="kd">val</span> <span class="nc">One</span> <span class="o">=</span> <span class="nc">Succ</span><span class="p">(</span><span class="nc">Zero</span><span class="p">)</span>
+<span class="k">final</span><span class="w"> </span><span class="kd">val</span><span class="w"> </span><span class="nc">One</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Succ</span><span class="p">(</span><span class="nc">Zero</span><span class="p">)</span>
 
-<span class="k">implicit</span> <span class="k">def</span> <span class="nf">natAdditiveMonoid</span><span class="p">:</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">Nat</span><span class="p">]</span> <span class="o">=</span> <span class="k">new</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">Nat</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">empty</span><span class="p">:</span> <span class="n">nat</span> <span class="o">=</span> <span class="nc">Zero</span>
-  <span class="k">def</span> <span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">):</span> <span class="nc">Nat</span> <span class="o">=</span> <span class="n">x</span> <span class="o">+</span> <span class="n">y</span>
+<span class="k">implicit</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">natAdditiveMonoid</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">Nat</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">Nat</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">:</span><span class="w"> </span><span class="n">nat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Zero</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">):</span><span class="w"> </span><span class="nc">Nat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>To help Stainless out, one needs to prove that <code class="docutils literal notranslate"><span class="pre">Zero</span></code> indeed the right identity of <code class="docutils literal notranslate"><span class="pre">+</span></code>,
 as well as the associativity of the latter.</p>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@induct</span>
-<span class="k">def</span> <span class="nf">lemma_rightIdentity_plus</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">x</span> <span class="o">+</span> <span class="nc">Zero</span> <span class="o">==</span> <span class="n">x</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">lemma_rightIdentity_plus</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="nc">Zero</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span>
 <span class="p">}.</span><span class="n">holds</span>
 
 <span class="nd">@induct</span>
-<span class="k">def</span> <span class="nf">lemma_associativity_plus</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">,</span> <span class="n">z</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">x</span> <span class="o">+</span> <span class="p">(</span><span class="n">y</span> <span class="o">+</span> <span class="n">z</span><span class="p">)</span> <span class="o">==</span> <span class="p">(</span><span class="n">x</span> <span class="o">+</span> <span class="n">y</span><span class="p">)</span> <span class="o">+</span> <span class="n">z</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">lemma_associativity_plus</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">z</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">z</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
 <p>One can then override the law of interest, and instantiate the lemma over the relevant parameters:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">implicit</span> <span class="k">def</span> <span class="nf">natAdditiveMonoid</span><span class="p">:</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">Nat</span><span class="p">]</span> <span class="o">=</span> <span class="k">new</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">Nat</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">empty</span><span class="p">:</span> <span class="n">nat</span> <span class="o">=</span> <span class="nc">Zero</span>
-  <span class="k">def</span> <span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">):</span> <span class="nc">Nat</span> <span class="o">=</span> <span class="n">x</span> <span class="o">+</span> <span class="n">y</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">implicit</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">natAdditiveMonoid</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">Nat</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">Nat</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">:</span><span class="w"> </span><span class="n">nat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Zero</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">):</span><span class="w"> </span><span class="nc">Nat</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span>
 
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">law_rightIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="bp">super</span><span class="p">.</span><span class="n">law_rightIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">)</span> <span class="n">because</span> <span class="n">lemma_rightIdentity_plus</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">law_rightIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="bp">super</span><span class="p">.</span><span class="n">law_rightIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="n">lemma_rightIdentity_plus</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">,</span> <span class="n">z</span><span class="p">:</span> <span class="nc">Nat</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="bp">super</span><span class="p">.</span><span class="n">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">,</span> <span class="n">z</span><span class="p">)</span> <span class="n">because</span> <span class="n">lemma_associativity_plus</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">,</span> <span class="n">z</span><span class="p">)</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">Nat</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="bp">super</span><span class="p">.</span><span class="n">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">)</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="n">lemma_associativity_plus</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>With these modifications, the example goes through without a hitch.</p>
 </section>
 <section id="typeclass-inheritance">
-<h2>Typeclass inheritance<a class="headerlink" href="#typeclass-inheritance" title="Permalink to this headline">¶</a></h2>
+<h2>Typeclass inheritance<a class="headerlink" href="#typeclass-inheritance" title="Link to this heading">¶</a></h2>
 <p>Some algebraic structures can be defined as some other algebraic structure plus some additional
 operations and/or laws, eg. a monoid can be seen as a semigroup with identity.</p>
 <p>In Scala, typeclasses allow to represent such relationship between algebraic structures by mean of inheritance.</p>
 <p>Let’s take for example the <code class="docutils literal notranslate"><span class="pre">Ord</span></code> typeclass, which describes totally ordered datatypes.</p>
 <p>This class is defined as follows:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">trait</span> <span class="nc">Eq</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">equals</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Boolean</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">trait</span><span class="w"> </span><span class="nc">Eq</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">equals</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span>
 <span class="p">}</span>
 
-<span class="k">trait</span> <span class="nc">Ord</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="k">extends</span> <span class="nc">Eq</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">lessThanEq</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Boolean</span>
+<span class="k">trait</span><span class="w"> </span><span class="nc">Ord</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Eq</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">lessThanEq</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span>
 
-  <span class="k">def</span> <span class="nf">lessThan</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="n">lessThanEq</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="o">!</span><span class="n">equals</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">lessThan</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">lessThanEq</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="o">!</span><span class="n">equals</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>This can also be read as: if <code class="docutils literal notranslate"><span class="pre">A</span></code> is an instance of <code class="docutils literal notranslate"><span class="pre">Ord</span></code>, then it also is a instance of <code class="docutils literal notranslate"><span class="pre">Eq</span></code>.</p>
 </section>
 <section id="associated-methods">
-<h2>Associated methods<a class="headerlink" href="#associated-methods" title="Permalink to this headline">¶</a></h2>
+<h2>Associated methods<a class="headerlink" href="#associated-methods" title="Link to this heading">¶</a></h2>
 <p>On top of abstract operations, a typeclass can also introduces concrete methods which
 do not need to (but can) be re-defined by the programmer at instance declaration time,
 just like the <code class="docutils literal notranslate"><span class="pre">lessThan</span></code> method of the <code class="docutils literal notranslate"><span class="pre">Ord</span></code> class above.</p>
 <p>While such methods could be defined as a standalone function with an <code class="docutils literal notranslate"><span class="pre">Ord</span></code> constraint,
 having it be a part of the class allows users to override it with e.g. a more efficient
 implementation specific to the datatype they are instantiating the class for, as shown below:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">object</span> <span class="nc">BigIntOrd</span> <span class="k">extends</span> <span class="nc">Ord</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">equal</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="o">=</span> <span class="n">x</span> <span class="o">==</span> <span class="n">y</span>
-  <span class="k">def</span> <span class="nf">lessThanEq</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="o">=</span> <span class="n">x</span> <span class="o">&lt;=</span> <span class="n">y</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">object</span><span class="w"> </span><span class="nc">BigIntOrd</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Ord</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">equal</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">y</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">lessThanEq</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">y</span>
 
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">lessThan</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="n">x</span> <span class="o">&lt;</span> <span class="n">y</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">lessThan</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">y</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="coherence">
-<h2>Coherence<a class="headerlink" href="#coherence" title="Permalink to this headline">¶</a></h2>
+<h2>Coherence<a class="headerlink" href="#coherence" title="Link to this heading">¶</a></h2>
 <p>Let’s now look at an issue that might arise when working with typeclasses in Scala.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">empty</span><span class="p">:</span> <span class="nc">A</span>
-  <span class="k">def</span> <span class="nf">combine</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">A</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">combine</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">A</span>
 <span class="p">}</span>
 
-<span class="k">implicit</span> <span class="kd">val</span> <span class="n">bigIntAddMonoid</span><span class="p">:</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="o">=</span> <span class="k">new</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">empty</span><span class="p">:</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="mi">0</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">combine</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="n">x</span> <span class="o">+</span> <span class="n">y</span>
+<span class="k">implicit</span><span class="w"> </span><span class="kd">val</span><span class="w"> </span><span class="n">bigIntAddMonoid</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">combine</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span>
 <span class="p">}</span>
 
-<span class="k">implicit</span> <span class="kd">val</span> <span class="n">bigIntProdMonoid</span><span class="p">:</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="o">=</span> <span class="k">new</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">empty</span><span class="p">:</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="mi">1</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">combine</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="n">x</span> <span class="o">*</span> <span class="n">y</span>
+<span class="k">implicit</span><span class="w"> </span><span class="kd">val</span><span class="w"> </span><span class="n">bigIntProdMonoid</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">combine</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">y</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">fold</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">list</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">])(</span><span class="k">implicit</span> <span class="nc">M</span><span class="p">:</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span> <span class="nc">A</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">list</span><span class="p">.</span><span class="n">foldRight</span><span class="p">(</span><span class="nc">M</span><span class="p">.</span><span class="n">empty</span><span class="p">)(</span><span class="nc">M</span><span class="p">.</span><span class="n">combine</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">fold</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">list</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">])(</span><span class="k">implicit</span><span class="w"> </span><span class="nc">M</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span><span class="w"> </span><span class="nc">A</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">list</span><span class="p">.</span><span class="n">foldRight</span><span class="p">(</span><span class="nc">M</span><span class="p">.</span><span class="n">empty</span><span class="p">)(</span><span class="nc">M</span><span class="p">.</span><span class="n">combine</span><span class="p">)</span>
 <span class="p">}</span>
 
-<span class="kd">val</span> <span class="n">list</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="o">=</span> <span class="nc">List</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">)</span>
-<span class="kd">val</span> <span class="n">res</span><span class="p">:</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="n">fold</span><span class="p">(</span><span class="n">list</span><span class="p">)</span> <span class="c1">// ?</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">list</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">List</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">res</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">fold</span><span class="p">(</span><span class="n">list</span><span class="p">)</span><span class="w"> </span><span class="c1">// ?</span>
 </pre></div>
 </div>
 <p>Here, the Scala compiler bails out with an <em>ambiguous implicits</em> error but for good reasons this time.
@@ -333,83 +332,83 @@ <h2>Coherence<a class="headerlink" href="#coherence" title="Permalink to this he
 <p>One might still want to provide both an additive and multiplicative <code class="docutils literal notranslate"><span class="pre">Monoid</span></code> instance for integers.
 To this end, one can wrap values of type <code class="docutils literal notranslate"><span class="pre">BigInt</span></code> with two different wrapper classes for which
 we will define the respective instances:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">Sum</span><span class="p">(</span><span class="n">value</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span>     <span class="k">extends</span> <span class="nc">AnyVal</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Product</span><span class="p">(</span><span class="n">value</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">AnyVal</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Sum</span><span class="p">(</span><span class="n">value</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w">     </span><span class="k">extends</span><span class="w"> </span><span class="nc">AnyVal</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Product</span><span class="p">(</span><span class="n">value</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">AnyVal</span>
 
-<span class="k">implicit</span> <span class="kd">val</span> <span class="n">bigIntSumMonoid</span><span class="p">:</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">Sum</span><span class="p">]</span> <span class="o">=</span> <span class="k">new</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">Sum</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">empty</span><span class="p">:</span> <span class="nc">Sum</span> <span class="o">=</span> <span class="nc">Sum</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">combine</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Sum</span> <span class="o">=</span> <span class="nc">Sum</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">value</span> <span class="o">+</span> <span class="n">y</span><span class="p">.</span><span class="n">value</span><span class="p">)</span>
+<span class="k">implicit</span><span class="w"> </span><span class="kd">val</span><span class="w"> </span><span class="n">bigIntSumMonoid</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">Sum</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">Sum</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">:</span><span class="w"> </span><span class="nc">Sum</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Sum</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">combine</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Sum</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Sum</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">value</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="p">.</span><span class="n">value</span><span class="p">)</span>
 <span class="p">}</span>
 
-<span class="k">implicit</span> <span class="kd">val</span> <span class="n">bigIntProductMonoid</span><span class="p">:</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">Product</span><span class="p">]</span> <span class="o">=</span> <span class="k">new</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">Product</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">empty</span><span class="p">:</span> <span class="nc">Product</span> <span class="o">=</span> <span class="nc">Product</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">combine</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Product</span> <span class="o">=</span> <span class="nc">Product</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">value</span> <span class="o">*</span> <span class="n">y</span><span class="p">.</span><span class="n">value</span><span class="p">)</span>
+<span class="k">implicit</span><span class="w"> </span><span class="kd">val</span><span class="w"> </span><span class="n">bigIntProductMonoid</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">Product</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">Product</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">:</span><span class="w"> </span><span class="nc">Product</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Product</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">combine</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Product</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Product</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">value</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">y</span><span class="p">.</span><span class="n">value</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foldMap</span><span class="p">[</span><span class="nc">A</span><span class="p">,</span> <span class="nc">B</span><span class="p">](</span><span class="n">list</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">])(</span><span class="n">f</span><span class="p">:</span> <span class="nc">A</span> <span class="o">=&gt;</span> <span class="nc">B</span><span class="p">)(</span><span class="k">implicit</span> <span class="nc">M</span><span class="p">:</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">B</span><span class="p">]):</span> <span class="nc">B</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">list</span><span class="p">.</span><span class="n">map</span><span class="p">(</span><span class="n">f</span><span class="p">).</span><span class="n">foldRight</span><span class="p">(</span><span class="nc">M</span><span class="p">.</span><span class="n">empty</span><span class="p">)(</span><span class="nc">M</span><span class="p">.</span><span class="n">combine</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">foldMap</span><span class="p">[</span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="nc">B</span><span class="p">](</span><span class="n">list</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">])(</span><span class="n">f</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">B</span><span class="p">)(</span><span class="k">implicit</span><span class="w"> </span><span class="nc">M</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">B</span><span class="p">]):</span><span class="w"> </span><span class="nc">B</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">list</span><span class="p">.</span><span class="n">map</span><span class="p">(</span><span class="n">f</span><span class="p">).</span><span class="n">foldRight</span><span class="p">(</span><span class="nc">M</span><span class="p">.</span><span class="n">empty</span><span class="p">)(</span><span class="nc">M</span><span class="p">.</span><span class="n">combine</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>It then becomes possible to unambiguously pick which instance to use depending on the semantics one wants:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span> <span class="n">list</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="o">=</span> <span class="nc">List</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span><span class="w"> </span><span class="n">list</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">List</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="mi">3</span><span class="p">)</span>
 
-<span class="kd">val</span> <span class="n">sum</span><span class="p">:</span> <span class="nc">BigInt</span>     <span class="o">=</span> <span class="n">foldMap</span><span class="p">(</span><span class="n">list</span><span class="p">)(</span><span class="nc">Sum</span><span class="p">(</span><span class="n">_</span><span class="p">)).</span><span class="n">value</span>     <span class="c1">// 5</span>
-<span class="kd">val</span> <span class="n">product</span><span class="p">:</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="n">foldMap</span><span class="p">(</span><span class="n">list</span><span class="p">)(</span><span class="nc">Product</span><span class="p">(</span><span class="n">_</span><span class="p">)).</span><span class="n">value</span> <span class="c1">// 6</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">sum</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w">     </span><span class="o">=</span><span class="w"> </span><span class="n">foldMap</span><span class="p">(</span><span class="n">list</span><span class="p">)(</span><span class="nc">Sum</span><span class="p">(</span><span class="n">_</span><span class="p">)).</span><span class="n">value</span><span class="w">     </span><span class="c1">// 5</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">product</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">foldMap</span><span class="p">(</span><span class="n">list</span><span class="p">)(</span><span class="nc">Product</span><span class="p">(</span><span class="n">_</span><span class="p">)).</span><span class="n">value</span><span class="w"> </span><span class="c1">// 6</span>
 </pre></div>
 </div>
 </section>
 <section id="under-the-hood">
-<h2>Under the hood<a class="headerlink" href="#under-the-hood" title="Permalink to this headline">¶</a></h2>
+<h2>Under the hood<a class="headerlink" href="#under-the-hood" title="Link to this heading">¶</a></h2>
 <p>In this section we describe how laws are encoded within Stainless.</p>
 <p>Let’s take as an example the Semigroup+Monoid hierarchy, slightly
 amended to exercise at once all the features described above.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">Semigroup</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">A</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Semigroup</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">A</span>
 
-  <span class="nd">@law</span>
-  <span class="k">def</span> <span class="nf">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">z</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">append</span><span class="p">(</span><span class="n">y</span><span class="p">,</span> <span class="n">z</span><span class="p">))</span> <span class="o">==</span> <span class="n">append</span><span class="p">(</span><span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">),</span> <span class="n">z</span><span class="p">)</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">append</span><span class="p">(</span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">))</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">append</span><span class="p">(</span><span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">),</span><span class="w"> </span><span class="n">z</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">abstract</span> <span class="k">class</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="k">extends</span> <span class="nc">Semigroup</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">empty</span><span class="p">:</span> <span class="nc">A</span>
+<span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Semigroup</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span>
 
-  <span class="nd">@law</span>
-  <span class="k">def</span> <span class="nf">law_leftIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">append</span><span class="p">(</span><span class="n">empty</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="o">==</span> <span class="n">x</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_leftIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">append</span><span class="p">(</span><span class="n">empty</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="nd">@law</span>
-  <span class="k">def</span> <span class="nf">law_rightIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">empty</span><span class="p">)</span> <span class="o">==</span> <span class="n">x</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_rightIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">append</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">empty</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">z</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="c1">// We refine the Semigroup associativity law with a dummy</span>
-    <span class="c1">// predicate `refineLaw` to demonstrate this feature.</span>
-    <span class="bp">super</span><span class="p">.</span><span class="n">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">,</span> <span class="n">z</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">refineLaw</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">,</span> <span class="n">z</span><span class="p">)</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="c1">// We refine the Semigroup associativity law with a dummy</span>
+<span class="w">    </span><span class="c1">// predicate `refineLaw` to demonstrate this feature.</span>
+<span class="w">    </span><span class="bp">super</span><span class="p">.</span><span class="n">law_associativity</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">refineLaw</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">refineLaw</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">z</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="kc">true</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">refineLaw</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">true</span>
 </pre></div>
 </div>
 <p>Together with a simple implementation for <code class="docutils literal notranslate"><span class="pre">BigInt</span></code>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">bigIntAdditiveMonoid</span><span class="p">:</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="o">=</span> <span class="k">new</span> <span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">empty</span><span class="p">:</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="mi">0</span>
-  <span class="k">def</span> <span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="n">x</span> <span class="o">+</span> <span class="n">y</span>
-
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">law_rightIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="c1">// no manual proof is needed in this case, but we include</span>
-    <span class="c1">// a dummy one for the sake of this example.</span>
-    <span class="n">someProof</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">bigIntAdditiveMonoid</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="nc">Monoid</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">append</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span>
+
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">law_rightIdentity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="c1">// no manual proof is needed in this case, but we include</span>
+<span class="w">    </span><span class="c1">// a dummy one for the sake of this example.</span>
+<span class="w">    </span><span class="n">someProof</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">someProof</span><span class="p">:</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="kc">true</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">someProof</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">true</span>
 </pre></div>
 </div>
 <p>Here is the internal Stainless AST pretty much right after extraction
@@ -418,146 +417,146 @@ <h2>Under the hood<a class="headerlink" href="#under-the-hood" title="Permalink
 (ie. the number after the <code class="docutils literal notranslate"><span class="pre">$</span></code> sign at the end of its name) which will prove useful
 for reading the code after the next phase, as it introduces new symbols with the same
 name but different identifiers.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">Semigroup$0</span><span class="p">[</span><span class="nc">A$85</span><span class="p">]</span> <span class="p">{</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Semigroup$0</span><span class="p">[</span><span class="nc">A$85</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
 
-  <span class="nd">@abstract</span>
-  <span class="k">def</span> <span class="nf">append$3</span><span class="p">(</span><span class="n">x$108</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">y$24</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">):</span> <span class="nc">A$85</span> <span class="o">=</span> <span class="o">&lt;</span><span class="n">empty</span> <span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">A$85</span><span class="p">]</span>
+<span class="w">  </span><span class="nd">@abstract</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">append$3</span><span class="p">(</span><span class="n">x$108</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">y$24</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">):</span><span class="w"> </span><span class="nc">A$85</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">&lt;</span><span class="n">empty</span><span class="w"> </span><span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">A$85</span><span class="p">]</span>
 
-  <span class="nd">@law</span>
-  <span class="k">def</span> <span class="nf">law_associativity$0</span><span class="p">(</span><span class="n">x$109</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">y$25</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">z$11</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$109</span><span class="p">,</span> <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">y$25</span><span class="p">,</span> <span class="n">z$11</span><span class="p">))</span> <span class="o">==</span>
-    <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$109</span><span class="p">,</span> <span class="n">y$25</span><span class="p">),</span> <span class="n">z$11</span><span class="p">)</span>
-   <span class="p">}</span>
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity$0</span><span class="p">(</span><span class="n">x$109</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">y$25</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">z$11</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$109</span><span class="p">,</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">y$25</span><span class="p">,</span><span class="w"> </span><span class="n">z$11</span><span class="p">))</span><span class="w"> </span><span class="o">==</span>
+<span class="w">    </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$109</span><span class="p">,</span><span class="w"> </span><span class="n">y$25</span><span class="p">),</span><span class="w"> </span><span class="n">z$11</span><span class="p">)</span>
+<span class="w">   </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">abstract</span> <span class="k">class</span> <span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span> <span class="k">extends</span> <span class="nc">Semigroup$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span> <span class="p">{</span>
+<span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Semigroup$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
 
-  <span class="nd">@abstract</span>
-  <span class="k">def</span> <span class="nf">empty$6</span><span class="p">:</span> <span class="nc">A$86</span> <span class="o">=</span> <span class="o">&lt;</span><span class="n">empty</span> <span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span>
+<span class="w">  </span><span class="nd">@abstract</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty$6</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">&lt;</span><span class="n">empty</span><span class="w"> </span><span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span>
 
-  <span class="nd">@law</span>
-  <span class="k">def</span> <span class="nf">law_leftIdentity$0</span><span class="p">(</span><span class="n">x$110</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span>
-   <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">empty$6</span><span class="p">,</span> <span class="n">x$110</span><span class="p">)</span> <span class="o">==</span> <span class="n">x$110</span>
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_leftIdentity$0</span><span class="p">(</span><span class="n">x$110</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span>
+<span class="w">   </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">empty$6</span><span class="p">,</span><span class="w"> </span><span class="n">x$110</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x$110</span>
 
-  <span class="nd">@law</span>
-  <span class="k">def</span> <span class="nf">law_rightIdentity$0</span><span class="p">(</span><span class="n">x$111</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span>
-   <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$111</span><span class="p">,</span> <span class="bp">this</span><span class="p">.</span><span class="n">empty$6</span><span class="p">)</span> <span class="o">==</span> <span class="n">x$111</span>
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_rightIdentity$0</span><span class="p">(</span><span class="n">x$111</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span>
+<span class="w">   </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$111</span><span class="p">,</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">empty$6</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x$111</span>
 
-  <span class="k">def</span> <span class="nf">law_associativity$1</span><span class="p">(</span><span class="n">x$112</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">,</span> <span class="n">y$26</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">,</span> <span class="n">z$12</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span>
-    <span class="bp">super</span><span class="p">.</span><span class="n">law_associativity$0</span><span class="p">(</span><span class="n">x$112</span><span class="p">,</span> <span class="n">y$26</span><span class="p">,</span> <span class="n">z$12</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">refineLaw$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">](</span><span class="n">x$112</span><span class="p">,</span> <span class="n">y$26</span><span class="p">,</span> <span class="n">z$12</span><span class="p">)</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity$1</span><span class="p">(</span><span class="n">x$112</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">,</span><span class="w"> </span><span class="n">z$12</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span>
+<span class="w">    </span><span class="bp">super</span><span class="p">.</span><span class="n">law_associativity$0</span><span class="p">(</span><span class="n">x$112</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">,</span><span class="w"> </span><span class="n">z$12</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">refineLaw$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">](</span><span class="n">x$112</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">,</span><span class="w"> </span><span class="n">z$12</span><span class="p">)</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">refineLaw$0</span><span class="p">[</span><span class="nc">A$87</span><span class="p">](</span><span class="n">x$113</span><span class="p">:</span> <span class="nc">A$87</span><span class="p">,</span> <span class="n">y$27</span><span class="p">:</span> <span class="nc">A$87</span><span class="p">,</span> <span class="n">z$13</span><span class="p">:</span> <span class="nc">A$87</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="kc">true</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">refineLaw$0</span><span class="p">[</span><span class="nc">A$87</span><span class="p">](</span><span class="n">x$113</span><span class="p">:</span><span class="w"> </span><span class="nc">A$87</span><span class="p">,</span><span class="w"> </span><span class="n">y$27</span><span class="p">:</span><span class="w"> </span><span class="nc">A$87</span><span class="p">,</span><span class="w"> </span><span class="n">z$13</span><span class="p">:</span><span class="w"> </span><span class="nc">A$87</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">true</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">$anon$0</span><span class="p">()</span> <span class="k">extends</span> <span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">empty$7</span><span class="p">:</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="mi">0</span>
-  <span class="k">def</span> <span class="nf">append$4</span><span class="p">(</span><span class="n">x$112</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y$26</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="n">x$112</span> <span class="o">+</span> <span class="n">y$26</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">$anon$0</span><span class="p">()</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty$7</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">append$4</span><span class="p">(</span><span class="n">x$112</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x$112</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y$26</span>
 
-  <span class="k">def</span> <span class="nf">law_rightIdentity$1</span><span class="p">(</span><span class="n">x$113</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="n">someProof$0</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_rightIdentity$1</span><span class="p">(</span><span class="n">x$113</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">someProof$0</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">bigIntAdditiveMonoid$0</span><span class="p">:</span> <span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="o">=</span> <span class="n">$anon$0</span><span class="p">()</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">bigIntAdditiveMonoid$0</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">$anon$0</span><span class="p">()</span>
 
-<span class="k">def</span> <span class="nf">someProof$0</span><span class="p">:</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="kc">true</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">someProof$0</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">true</span>
 </pre></div>
 </div>
 <p>The code above maps in straightforward way to the original code.</p>
 <p>Let’s now take a look at the output of the <code class="docutils literal notranslate"><span class="pre">Laws</span></code> phase. This is
 the phase which desugars the law definitions and their overrides
 into methods with explicit postconditions.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">Semigroup$0</span><span class="p">[</span><span class="nc">A$85</span><span class="p">]</span> <span class="p">{</span>
-
-  <span class="nd">@abstract</span>
-  <span class="k">def</span> <span class="nf">append$3</span><span class="p">(</span><span class="n">x$108</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">y$24</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">):</span> <span class="nc">A$85</span> <span class="o">=</span> <span class="o">&lt;</span><span class="n">empty</span> <span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">A$85</span><span class="p">]</span>
-
-  <span class="nd">@final</span>
-  <span class="nd">@inlineOnce</span>
-  <span class="nd">@derived</span><span class="p">(</span><span class="n">law_associativity$0</span><span class="p">)</span>
-  <span class="k">def</span> <span class="nf">law_associativity$2</span><span class="p">(</span><span class="n">x$120</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">y$30</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">z$14</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$120</span><span class="p">,</span> <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">y$30</span><span class="p">,</span> <span class="n">z$14</span><span class="p">))</span> <span class="o">==</span>
-    <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$120</span><span class="p">,</span> <span class="n">y$30</span><span class="p">),</span> <span class="n">z$14</span><span class="p">)</span>
-  <span class="p">}</span>
-
-  <span class="nd">@abstract</span>
-  <span class="k">def</span> <span class="nf">law_associativity$0</span><span class="p">(</span><span class="n">x$109</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">y$25</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">z$11</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="o">&lt;</span><span class="n">empty</span> <span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">Boolean</span><span class="p">]</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-    <span class="p">(</span><span class="n">res$82</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">res$82</span> <span class="o">&amp;&amp;</span> <span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$109</span><span class="p">,</span> <span class="n">y$25</span><span class="p">,</span> <span class="n">z$11</span><span class="p">)</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Semigroup$0</span><span class="p">[</span><span class="nc">A$85</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+
+<span class="w">  </span><span class="nd">@abstract</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">append$3</span><span class="p">(</span><span class="n">x$108</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">y$24</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">):</span><span class="w"> </span><span class="nc">A$85</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">&lt;</span><span class="n">empty</span><span class="w"> </span><span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">A$85</span><span class="p">]</span>
+
+<span class="w">  </span><span class="nd">@final</span>
+<span class="w">  </span><span class="nd">@inlineOnce</span>
+<span class="w">  </span><span class="nd">@derived</span><span class="p">(</span><span class="n">law_associativity$0</span><span class="p">)</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity$2</span><span class="p">(</span><span class="n">x$120</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">y$30</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">z$14</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$120</span><span class="p">,</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">y$30</span><span class="p">,</span><span class="w"> </span><span class="n">z$14</span><span class="p">))</span><span class="w"> </span><span class="o">==</span>
+<span class="w">    </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$120</span><span class="p">,</span><span class="w"> </span><span class="n">y$30</span><span class="p">),</span><span class="w"> </span><span class="n">z$14</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="nd">@abstract</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity$0</span><span class="p">(</span><span class="n">x$109</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">y$25</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">z$11</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="o">&lt;</span><span class="n">empty</span><span class="w"> </span><span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">Boolean</span><span class="p">]</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="p">(</span><span class="n">res$82</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res$82</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$109</span><span class="p">,</span><span class="w"> </span><span class="n">y$25</span><span class="p">,</span><span class="w"> </span><span class="n">z$11</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">abstract</span> <span class="k">class</span> <span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span> <span class="k">extends</span> <span class="nc">Semigroup$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span> <span class="p">{</span>
-
-  <span class="nd">@abstract</span>
-  <span class="k">def</span> <span class="nf">empty$6</span><span class="p">:</span> <span class="nc">A$86</span> <span class="o">=</span> <span class="o">&lt;</span><span class="n">empty</span> <span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span>
-
-  <span class="nd">@final</span>
-  <span class="nd">@inlineOnce</span>
-  <span class="nd">@derived</span><span class="p">(</span><span class="n">law_leftIdentity$0</span><span class="p">)</span>
-  <span class="k">def</span> <span class="nf">law_leftIdentity$1</span><span class="p">(</span><span class="n">x$116</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span>
-    <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">empty$6</span><span class="p">,</span> <span class="n">x$116</span><span class="p">)</span> <span class="o">==</span> <span class="n">x$116</span>
-
-  <span class="nd">@abstract</span>
-  <span class="k">def</span> <span class="nf">law_leftIdentity$0</span><span class="p">(</span><span class="n">x$110</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="o">&lt;</span><span class="n">empty</span> <span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">Boolean</span><span class="p">]</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-    <span class="p">(</span><span class="n">res$77</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">res$77</span> <span class="o">&amp;&amp;</span> <span class="bp">this</span><span class="p">.</span><span class="n">law_leftIdentity$1</span><span class="p">(</span><span class="n">x$110</span><span class="p">)</span>
-  <span class="p">}</span>
-
-  <span class="nd">@final</span>
-  <span class="nd">@inlineOnce</span>
-  <span class="nd">@derived</span><span class="p">(</span><span class="n">law_rightIdentity$0</span><span class="p">)</span>
-  <span class="k">def</span> <span class="nf">law_rightIdentity$2</span><span class="p">(</span><span class="n">x$117</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span>
-    <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$117</span><span class="p">,</span> <span class="bp">this</span><span class="p">.</span><span class="n">empty$6</span><span class="p">)</span> <span class="o">==</span> <span class="n">x$117</span>
-
-  <span class="nd">@abstract</span>
-  <span class="k">def</span> <span class="nf">law_rightIdentity$0</span><span class="p">(</span><span class="n">x$111</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="o">&lt;</span><span class="n">empty</span> <span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">Boolean</span><span class="p">]</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-    <span class="p">(</span><span class="n">res$80</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">res$80</span> <span class="o">&amp;&amp;</span> <span class="bp">this</span><span class="p">.</span><span class="n">law_rightIdentity$2</span><span class="p">(</span><span class="n">x$111</span><span class="p">)</span>
-  <span class="p">}</span>
-
-  <span class="nd">@law</span>
-  <span class="k">def</span> <span class="nf">law_associativity$1</span><span class="p">(</span><span class="n">x$112</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">,</span> <span class="n">y$26</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">,</span> <span class="n">z$12</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$112</span><span class="p">,</span> <span class="n">y$26</span><span class="p">,</span> <span class="n">z$12</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">refineLaw$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">](</span><span class="n">x$112</span><span class="p">,</span> <span class="n">y$26</span><span class="p">,</span> <span class="n">z$12</span><span class="p">)</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-    <span class="p">(</span><span class="n">res$84</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">res$84</span> <span class="o">&amp;&amp;</span> <span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$112</span><span class="p">,</span> <span class="n">y$26</span><span class="p">,</span> <span class="n">z$12</span><span class="p">)</span>
-  <span class="p">}</span>
+<span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Semigroup$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+
+<span class="w">  </span><span class="nd">@abstract</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty$6</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">&lt;</span><span class="n">empty</span><span class="w"> </span><span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">A$86</span><span class="p">]</span>
+
+<span class="w">  </span><span class="nd">@final</span>
+<span class="w">  </span><span class="nd">@inlineOnce</span>
+<span class="w">  </span><span class="nd">@derived</span><span class="p">(</span><span class="n">law_leftIdentity$0</span><span class="p">)</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_leftIdentity$1</span><span class="p">(</span><span class="n">x$116</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span>
+<span class="w">    </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">empty$6</span><span class="p">,</span><span class="w"> </span><span class="n">x$116</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x$116</span>
+
+<span class="w">  </span><span class="nd">@abstract</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_leftIdentity$0</span><span class="p">(</span><span class="n">x$110</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="o">&lt;</span><span class="n">empty</span><span class="w"> </span><span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">Boolean</span><span class="p">]</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="p">(</span><span class="n">res$77</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res$77</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">law_leftIdentity$1</span><span class="p">(</span><span class="n">x$110</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="nd">@final</span>
+<span class="w">  </span><span class="nd">@inlineOnce</span>
+<span class="w">  </span><span class="nd">@derived</span><span class="p">(</span><span class="n">law_rightIdentity$0</span><span class="p">)</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_rightIdentity$2</span><span class="p">(</span><span class="n">x$117</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span>
+<span class="w">    </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$117</span><span class="p">,</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">empty$6</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x$117</span>
+
+<span class="w">  </span><span class="nd">@abstract</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_rightIdentity$0</span><span class="p">(</span><span class="n">x$111</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="o">&lt;</span><span class="n">empty</span><span class="w"> </span><span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">Boolean</span><span class="p">]</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="p">(</span><span class="n">res$80</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res$80</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">law_rightIdentity$2</span><span class="p">(</span><span class="n">x$111</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity$1</span><span class="p">(</span><span class="n">x$112</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">,</span><span class="w"> </span><span class="n">z$12</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$112</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">,</span><span class="w"> </span><span class="n">z$12</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">refineLaw$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">](</span><span class="n">x$112</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">,</span><span class="w"> </span><span class="n">z$12</span><span class="p">)</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="p">(</span><span class="n">res$84</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res$84</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$112</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">,</span><span class="w"> </span><span class="n">z$12</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
 <span class="nd">@derived</span><span class="p">(</span><span class="n">bigIntAdditiveMonoid$0</span><span class="p">)</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">$anon$0</span><span class="p">()</span> <span class="k">extends</span> <span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="p">{</span>
-
-  <span class="k">def</span> <span class="nf">empty$7</span><span class="p">:</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="mi">0</span>
-  <span class="k">def</span> <span class="nf">append$4</span><span class="p">(</span><span class="n">x$114</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y$27</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="n">x$114</span> <span class="o">+</span> <span class="n">y$27</span>
-
-  <span class="nd">@law</span>
-  <span class="nd">@derived</span><span class="p">(</span><span class="n">law_leftIdentity$0</span><span class="p">)</span>
-  <span class="k">def</span> <span class="nf">law_leftIdentity$2</span><span class="p">(</span><span class="n">x$119</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="kc">true</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-    <span class="p">(</span><span class="n">res$84</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="bp">this</span><span class="p">.</span><span class="n">law_leftIdentity$1</span><span class="p">(</span><span class="n">x$119</span><span class="p">)</span>
-  <span class="p">}</span>
-
-  <span class="nd">@law</span>
-  <span class="k">def</span> <span class="nf">law_rightIdentity$1</span><span class="p">(</span><span class="n">x$115</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">someProof$0</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-    <span class="p">(</span><span class="n">res$79</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">res$79</span> <span class="o">&amp;&amp;</span> <span class="bp">this</span><span class="p">.</span><span class="n">law_rightIdentity$2</span><span class="p">(</span><span class="n">x$115</span><span class="p">)</span>
-  <span class="p">}</span>
-
-  <span class="nd">@law</span>
-  <span class="nd">@derived</span><span class="p">(</span><span class="n">law_associativity$0</span><span class="p">)</span>
-  <span class="k">def</span> <span class="nf">law_associativity$2</span><span class="p">(</span><span class="n">x$120</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y$29</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">z$13</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="kc">true</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-    <span class="p">(</span><span class="n">res$85</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$1</span><span class="p">(</span><span class="n">x$120</span><span class="p">,</span> <span class="n">y$29</span><span class="p">,</span> <span class="n">z$13</span><span class="p">)</span>
-  <span class="p">}</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">$anon$0</span><span class="p">()</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty$7</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">append$4</span><span class="p">(</span><span class="n">x$114</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y$27</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x$114</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y$27</span>
+
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="nd">@derived</span><span class="p">(</span><span class="n">law_leftIdentity$0</span><span class="p">)</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_leftIdentity$2</span><span class="p">(</span><span class="n">x$119</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="kc">true</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="p">(</span><span class="n">res$84</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">law_leftIdentity$1</span><span class="p">(</span><span class="n">x$119</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_rightIdentity$1</span><span class="p">(</span><span class="n">x$115</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">someProof$0</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="p">(</span><span class="n">res$79</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res$79</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">law_rightIdentity$2</span><span class="p">(</span><span class="n">x$115</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="nd">@law</span>
+<span class="w">  </span><span class="nd">@derived</span><span class="p">(</span><span class="n">law_associativity$0</span><span class="p">)</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity$2</span><span class="p">(</span><span class="n">x$120</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y$29</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">z$13</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="kc">true</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="p">(</span><span class="n">res$85</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$1</span><span class="p">(</span><span class="n">x$120</span><span class="p">,</span><span class="w"> </span><span class="n">y$29</span><span class="p">,</span><span class="w"> </span><span class="n">z$13</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">bigIntAdditiveMonoid$0</span><span class="p">:</span> <span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="o">=</span> <span class="n">$anon$0</span><span class="p">()</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">bigIntAdditiveMonoid$0</span><span class="p">:</span><span class="w"> </span><span class="nc">Monoid$0</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">$anon$0</span><span class="p">()</span>
 
-<span class="k">def</span> <span class="nf">someProof$0</span><span class="p">:</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="kc">true</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">someProof$0</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">true</span>
 </pre></div>
 </div>
 <p>There are a few things going on here:</p>
@@ -573,24 +572,24 @@ <h2>Under the hood<a class="headerlink" href="#under-the-hood" title="Permalink
 law’s body, without having to inline it or call the law itself,
 which is disallowed since it is conceptually an abstract method, as
 evidenced by its newly added <code class="docutils literal notranslate"><span class="pre">&#64;abstract</span></code> flag.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="c1">// In class `Semigroup`...</span>
-
-<span class="c1">// This is the helper method.</span>
-<span class="nd">@final</span>
-<span class="nd">@inlineOnce</span>
-<span class="nd">@derived</span><span class="p">(</span><span class="n">law_associativity$0</span><span class="p">)</span>
-<span class="k">def</span> <span class="nf">law_associativity$2</span><span class="p">(</span><span class="n">x$120</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">y$30</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">z$14</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$120</span><span class="p">,</span> <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">y$30</span><span class="p">,</span> <span class="n">z$14</span><span class="p">))</span> <span class="o">==</span>
-  <span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$120</span><span class="p">,</span> <span class="n">y$30</span><span class="p">),</span> <span class="n">z$14</span><span class="p">)</span>
-<span class="p">}</span>
-
-<span class="c1">// This is the original law definition, which now became an abstract method.</span>
-<span class="nd">@abstract</span>
-<span class="k">def</span> <span class="nf">law_associativity$0</span><span class="p">(</span><span class="n">x$109</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">y$25</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">,</span> <span class="n">z$11</span><span class="p">:</span> <span class="nc">A$85</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="o">&lt;</span><span class="n">empty</span> <span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">Boolean</span><span class="p">]</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-  <span class="p">(</span><span class="n">res$82</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">res$82</span> <span class="o">&amp;&amp;</span> <span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$109</span><span class="p">,</span> <span class="n">y$25</span><span class="p">,</span> <span class="n">z$11</span><span class="p">)</span>
-<span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="c1">// In class `Semigroup`...</span>
+
+<span class="w"> </span><span class="c1">// This is the helper method.</span>
+<span class="w"> </span><span class="nd">@final</span>
+<span class="w"> </span><span class="nd">@inlineOnce</span>
+<span class="w"> </span><span class="nd">@derived</span><span class="p">(</span><span class="n">law_associativity$0</span><span class="p">)</span>
+<span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity$2</span><span class="p">(</span><span class="n">x$120</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">y$30</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">z$14</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$120</span><span class="p">,</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">y$30</span><span class="p">,</span><span class="w"> </span><span class="n">z$14</span><span class="p">))</span><span class="w"> </span><span class="o">==</span>
+<span class="w">   </span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">append$3</span><span class="p">(</span><span class="n">x$120</span><span class="p">,</span><span class="w"> </span><span class="n">y$30</span><span class="p">),</span><span class="w"> </span><span class="n">z$14</span><span class="p">)</span>
+<span class="w"> </span><span class="p">}</span>
+
+<span class="w"> </span><span class="c1">// This is the original law definition, which now became an abstract method.</span>
+<span class="w"> </span><span class="nd">@abstract</span>
+<span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity$0</span><span class="p">(</span><span class="n">x$109</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">y$25</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">,</span><span class="w"> </span><span class="n">z$11</span><span class="p">:</span><span class="w"> </span><span class="nc">A$85</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="o">&lt;</span><span class="n">empty</span><span class="w"> </span><span class="n">tree</span><span class="o">&gt;</span><span class="p">[</span><span class="nc">Boolean</span><span class="p">]</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="p">(</span><span class="n">res$82</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res$82</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$109</span><span class="p">,</span><span class="w"> </span><span class="n">y$25</span><span class="p">,</span><span class="w"> </span><span class="n">z$11</span><span class="p">)</span>
+<span class="w"> </span><span class="p">}</span>
 </pre></div>
 </div>
 </li>
@@ -599,14 +598,14 @@ <h2>Under the hood<a class="headerlink" href="#under-the-hood" title="Permalink
 while still satisfying the original law via a call to the helper
 method introduced in the previous step. This step ensures that laws
 cannot be fully redefined, and thus potentially weakened, in subclasses.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="c1">// In class `Monoid`...</span>
-
-<span class="nd">@law</span>
-<span class="k">def</span> <span class="nf">law_associativity$1</span><span class="p">(</span><span class="n">x$112</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">,</span> <span class="n">y$26</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">,</span> <span class="n">z$12</span><span class="p">:</span> <span class="nc">A$86</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$112</span><span class="p">,</span> <span class="n">y$26</span><span class="p">,</span> <span class="n">z$12</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">refineLaw$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">](</span><span class="n">x$112</span><span class="p">,</span> <span class="n">y$26</span><span class="p">,</span> <span class="n">z$12</span><span class="p">)</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-  <span class="p">(</span><span class="n">res$84</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">res$84</span> <span class="o">&amp;&amp;</span> <span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$112</span><span class="p">,</span> <span class="n">y$26</span><span class="p">,</span> <span class="n">z$12</span><span class="p">)</span>
-<span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="c1">// In class `Monoid`...</span>
+
+<span class="w"> </span><span class="nd">@law</span>
+<span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">law_associativity$1</span><span class="p">(</span><span class="n">x$112</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">,</span><span class="w"> </span><span class="n">z$12</span><span class="p">:</span><span class="w"> </span><span class="nc">A$86</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$112</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">,</span><span class="w"> </span><span class="n">z$12</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">refineLaw$0</span><span class="p">[</span><span class="nc">A$86</span><span class="p">](</span><span class="n">x$112</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">,</span><span class="w"> </span><span class="n">z$12</span><span class="p">)</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="p">(</span><span class="n">res$84</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res$84</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">law_associativity$2</span><span class="p">(</span><span class="n">x$112</span><span class="p">,</span><span class="w"> </span><span class="n">y$26</span><span class="p">,</span><span class="w"> </span><span class="n">z$12</span><span class="p">)</span>
+<span class="w"> </span><span class="p">}</span>
 </pre></div>
 </div>
 </li>
@@ -614,14 +613,14 @@ <h2>Under the hood<a class="headerlink" href="#under-the-hood" title="Permalink
 are provided with a postcondition which again ensures that their body holds,
 while still satisfying the law they override, again via a call to the helper
 method introduced in step 1.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="c1">// In class `$anon$0`...</span>
-
-<span class="nd">@law</span>
-<span class="k">def</span> <span class="nf">law_rightIdentity$1</span><span class="p">(</span><span class="n">x$115</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">someProof$0</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-  <span class="p">(</span><span class="n">res$79</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">res$79</span> <span class="o">&amp;&amp;</span> <span class="bp">this</span><span class="p">.</span><span class="n">law_rightIdentity$2</span><span class="p">(</span><span class="n">x$115</span><span class="p">)</span>
-<span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="c1">// In class `$anon$0`...</span>
+
+<span class="w"> </span><span class="nd">@law</span>
+<span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">law_rightIdentity$1</span><span class="p">(</span><span class="n">x$115</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">someProof$0</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="p">(</span><span class="n">res$79</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res$79</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">law_rightIdentity$2</span><span class="p">(</span><span class="n">x$115</span><span class="p">)</span>
+<span class="w"> </span><span class="p">}</span>
 </pre></div>
 </div>
 </li>
@@ -630,15 +629,15 @@ <h2>Under the hood<a class="headerlink" href="#under-the-hood" title="Permalink
 will be generated. Those stubs just have <code class="docutils literal notranslate"><span class="pre">true</span></code> as a body, and a postcondition
 which calls to the appropriate law helper introduced in step 1.
 This expresses the fact that the law holds on its own, without any additional proof steps.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="c1">// In class `$anon$0`</span>
-
-<span class="nd">@law</span>
-<span class="nd">@derived</span><span class="p">(</span><span class="n">law_leftIdentity$0</span><span class="p">)</span>
-<span class="k">def</span> <span class="nf">law_leftIdentity$2</span><span class="p">(</span><span class="n">x$119</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kc">true</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-  <span class="p">(</span><span class="n">res$84</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="bp">this</span><span class="p">.</span><span class="n">law_leftIdentity$1</span><span class="p">(</span><span class="n">x$119</span><span class="p">)</span>
-<span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="c1">// In class `$anon$0`</span>
+
+<span class="w"> </span><span class="nd">@law</span>
+<span class="w"> </span><span class="nd">@derived</span><span class="p">(</span><span class="n">law_leftIdentity$0</span><span class="p">)</span>
+<span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">law_leftIdentity$2</span><span class="p">(</span><span class="n">x$119</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="kc">true</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="p">(</span><span class="n">res$84</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">law_leftIdentity$1</span><span class="p">(</span><span class="n">x$119</span><span class="p">)</span>
+<span class="w"> </span><span class="p">}</span>
 </pre></div>
 </div>
 </li>
@@ -650,21 +649,21 @@ <h2>Under the hood<a class="headerlink" href="#under-the-hood" title="Permalink
 during the encoding as to ensure that laws cannot be weakened. Doing so can nonetheless help
 readability, since it makes the code match more closely to the semantics of Scala.</p>
 </div>
-<dl class="citation">
-<dt class="label" id="wb89"><span class="brackets"><a class="fn-backref" href="#id1">WB89</a></span></dt>
-<dd><ol class="upperalpha simple" start="16">
+<div role="list" class="citation-list">
+<div class="citation" id="wb89" role="doc-biblioentry">
+<span class="label"><span class="fn-bracket">[</span><a role="doc-backlink" href="#id1">WB89</a><span class="fn-bracket">]</span></span>
+<ol class="upperalpha simple" start="16">
 <li><p>Wadler and S. Blott. 1989. How to make ad-hoc polymorphism less ad hoc.</p></li>
 </ol>
-</dd>
-</dl>
+</div>
+</div>
 </section>
 </section>
 
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="verification.html" class="btn btn-neutral float-left" title="Verification conditions" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="imperative.html" class="btn btn-neutral float-right" title="Imperative" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -673,7 +672,7 @@ <h2>Under the hood<a class="headerlink" href="#under-the-hood" title="Permalink
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -684,7 +683,7 @@ <h2>Under the hood<a class="headerlink" href="#under-the-hood" title="Permalink
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/library.html b/library.html
index 547db83ed9..e02ba16a50 100644
--- a/library.html
+++ b/library.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Stainless Library &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Generating C Code" href="genc.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -82,20 +84,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Stainless Library</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Stainless Library</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/library.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -106,7 +105,7 @@
            <div itemprop="articleBody">
              
   <section id="stainless-library">
-<span id="library"></span><h1>Stainless Library<a class="headerlink" href="#stainless-library" title="Permalink to this headline">¶</a></h1>
+<span id="library"></span><h1>Stainless Library<a class="headerlink" href="#stainless-library" title="Link to this heading">¶</a></h1>
 <p>Stainless defines its own library with some core data types and
 operations on them, which work with the fragment supported
 by Stainless, available in <code class="docutils literal notranslate"><span class="pre">frontends/library/stainless</span></code>, which
@@ -139,10 +138,6 @@
 <cite>import</cite> directive at the top of Stainless’ compilation units.
 Here is a quick summary of what to import.</p>
 <table class="docutils align-default">
-<colgroup>
-<col style="width: 33%" />
-<col style="width: 67%" />
-</colgroup>
 <thead>
 <tr class="row-odd"><th class="head"><p>Package to import</p></th>
 <th class="head"><p>What it gives access to</p></th>
@@ -162,14 +157,10 @@
 </table>
 <p>To learn more, we encourage you to look in the <cite>library/</cite> subdirectory of Stainless distribution.</p>
 <section id="annotations">
-<h2>Annotations<a class="headerlink" href="#annotations" title="Permalink to this headline">¶</a></h2>
+<h2>Annotations<a class="headerlink" href="#annotations" title="Link to this heading">¶</a></h2>
 <p>Stainless provides some special annotations in the package <code class="docutils literal notranslate"><span class="pre">stainless.annotation</span></code>,
 which instruct Stainless to handle some functions or objects in a specialized way.</p>
 <table class="docutils align-default">
-<colgroup>
-<col style="width: 23%" />
-<col style="width: 77%" />
-</colgroup>
 <thead>
 <tr class="row-odd"><th class="head"><p>Annotation</p></th>
 <th class="head"><p>Meaning</p></th>
@@ -245,10 +236,6 @@ <h2>Annotations<a class="headerlink" href="#annotations" title="Permalink to thi
 <p>Stainless also has some special keywords defined in <code class="docutils literal notranslate"><span class="pre">stainless.lang</span></code> that can be used around
 function calls. <a class="reference external" href="https://github.com/epfl-lara/stainless/blob/master/frontends/benchmarks/verification/valid/MicroTests/VisibleOpaque.scala">Here</a> is an example for <code class="docutils literal notranslate"><span class="pre">unfold</span></code>.</p>
 <table class="docutils align-default">
-<colgroup>
-<col style="width: 23%" />
-<col style="width: 77%" />
-</colgroup>
 <thead>
 <tr class="row-odd"><th class="head"><p>Annotation</p></th>
 <th class="head"><p>Meaning</p></th>
@@ -267,22 +254,18 @@ <h2>Annotations<a class="headerlink" href="#annotations" title="Permalink to thi
 </table>
 </section>
 <section id="list-t">
-<h2>List[T]<a class="headerlink" href="#list-t" title="Permalink to this headline">¶</a></h2>
+<h2>List[T]<a class="headerlink" href="#list-t" title="Link to this heading">¶</a></h2>
 <p>As there is no special support for Lists in SMT solvers, Stainless Lists are encoded
 as an ordinary algebraic data type:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Cons</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">h</span><span class="p">:</span> <span class="nc">T</span><span class="p">,</span> <span class="n">t</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span> <span class="k">extends</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Nil</span><span class="p">[</span><span class="nc">T</span><span class="p">]()</span> <span class="k">extends</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Cons</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">h</span><span class="p">:</span><span class="w"> </span><span class="nc">T</span><span class="p">,</span><span class="w"> </span><span class="n">t</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Nil</span><span class="p">[</span><span class="nc">T</span><span class="p">]()</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
 </pre></div>
 </div>
 <section id="list-api">
-<h3>List API<a class="headerlink" href="#list-api" title="Permalink to this headline">¶</a></h3>
+<h3>List API<a class="headerlink" href="#list-api" title="Link to this heading">¶</a></h3>
 <p>Stainless Lists support a rich and strongly specified API.</p>
 <table class="docutils align-default">
-<colgroup>
-<col style="width: 50%" />
-<col style="width: 50%" />
-</colgroup>
 <thead>
 <tr class="row-odd"><th class="head"><p>Method signature for <code class="docutils literal notranslate"><span class="pre">List[T]</span></code></p></th>
 <th class="head"><p>Short description</p></th>
@@ -466,13 +449,9 @@ <h3>List API<a class="headerlink" href="#list-api" title="Permalink to this head
 </table>
 </section>
 <section id="additional-operations-on-lists">
-<h3>Additional operations on Lists<a class="headerlink" href="#additional-operations-on-lists" title="Permalink to this headline">¶</a></h3>
+<h3>Additional operations on Lists<a class="headerlink" href="#additional-operations-on-lists" title="Link to this heading">¶</a></h3>
 <p>The object <code class="docutils literal notranslate"><span class="pre">ListOps</span></code> offers this additional operations:</p>
 <table class="docutils align-default">
-<colgroup>
-<col style="width: 52%" />
-<col style="width: 48%" />
-</colgroup>
 <thead>
 <tr class="row-odd"><th class="head"><p>Function signature</p></th>
 <th class="head"><p>Short description</p></th>
@@ -499,14 +478,10 @@ <h3>Additional operations on Lists<a class="headerlink" href="#additional-operat
 </table>
 </section>
 <section id="theorems-on-lists">
-<h3>Theorems on Lists<a class="headerlink" href="#theorems-on-lists" title="Permalink to this headline">¶</a></h3>
+<h3>Theorems on Lists<a class="headerlink" href="#theorems-on-lists" title="Link to this heading">¶</a></h3>
 <p>The following theorems on Lists have been proven by Stainless and are included
 in the object <code class="docutils literal notranslate"><span class="pre">ListSpecs</span></code>:</p>
 <table class="docutils align-default">
-<colgroup>
-<col style="width: 53%" />
-<col style="width: 47%" />
-</colgroup>
 <thead>
 <tr class="row-odd"><th class="head"><p>Theorem signature</p></th>
 <th class="head"><p>Proven Claim</p></th>
@@ -546,7 +521,7 @@ <h3>Theorems on Lists<a class="headerlink" href="#theorems-on-lists" title="Perm
 </section>
 </section>
 <section id="set-t-map-t">
-<h2>Set[T], Map[T]<a class="headerlink" href="#set-t-map-t" title="Permalink to this headline">¶</a></h2>
+<h2>Set[T], Map[T]<a class="headerlink" href="#set-t-map-t" title="Link to this heading">¶</a></h2>
 <p>Stainless uses its own Sets and Maps, which are defined in the <code class="docutils literal notranslate"><span class="pre">stainless.lang</span></code> package.
 However, these classes are not implemented within Stainless.
 Instead, they are parsed into specialized trees.
@@ -557,10 +532,6 @@ <h2>Set[T], Map[T]<a class="headerlink" href="#set-t-map-t" title="Permalink to
 <p>Additionally, the following functions for Sets are provided in the
 <code class="docutils literal notranslate"><span class="pre">stainless.collection</span></code> package:</p>
 <table class="docutils align-default">
-<colgroup>
-<col style="width: 58%" />
-<col style="width: 42%" />
-</colgroup>
 <thead>
 <tr class="row-odd"><th class="head"><p>Function signature</p></th>
 <th class="head"><p>Short description</p></th>
@@ -582,29 +553,29 @@ <h2>Set[T], Map[T]<a class="headerlink" href="#set-t-map-t" title="Permalink to
 </table>
 </section>
 <section id="partialfunction-a-b">
-<h2>PartialFunction[A, B]<a class="headerlink" href="#partialfunction-a-b" title="Permalink to this headline">¶</a></h2>
+<h2>PartialFunction[A, B]<a class="headerlink" href="#partialfunction-a-b" title="Link to this heading">¶</a></h2>
 <p>To define anonymous functions with preconditions, Stainless has a <code class="docutils literal notranslate"><span class="pre">PartialFunction[A,</span> <span class="pre">B]</span></code> type
 with the corresponding annotation <code class="docutils literal notranslate"><span class="pre">A</span> <span class="pre">~&gt;</span> <span class="pre">B</span></code>. To construct a partial function, you must use
 <code class="docutils literal notranslate"><span class="pre">PartialFunction.apply</span></code> as in the <code class="docutils literal notranslate"><span class="pre">unOpt</span></code> function below. The precondition written in the
 <code class="docutils literal notranslate"><span class="pre">require</span></code> becomes the <code class="docutils literal notranslate"><span class="pre">pre</span></code> field of the partial function (as in the call to <code class="docutils literal notranslate"><span class="pre">f.pre</span></code> in <code class="docutils literal notranslate"><span class="pre">map1</span></code>).</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">map1</span><span class="p">[</span><span class="nc">A</span><span class="p">,</span> <span class="nc">B</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span> <span class="n">f</span><span class="p">:</span> <span class="nc">A</span> <span class="o">~&gt;</span> <span class="nc">B</span><span class="p">):</span> <span class="nc">List</span><span class="p">[</span><span class="nc">B</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">forall</span><span class="p">(</span><span class="n">f</span><span class="p">.</span><span class="n">pre</span><span class="p">))</span>
-  <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">Cons</span><span class="p">[</span><span class="nc">B</span><span class="p">](</span><span class="n">f</span><span class="p">(</span><span class="n">x</span><span class="p">),</span> <span class="n">map1</span><span class="p">(</span><span class="n">xs</span><span class="p">,</span> <span class="n">f</span><span class="p">))</span>
-    <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">=&gt;</span> <span class="nc">Nil</span><span class="p">[</span><span class="nc">B</span><span class="p">]()</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">map1</span><span class="p">[</span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="nc">B</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span><span class="w"> </span><span class="n">f</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="w"> </span><span class="o">~&gt;</span><span class="w"> </span><span class="nc">B</span><span class="p">):</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">B</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">forall</span><span class="p">(</span><span class="n">f</span><span class="p">.</span><span class="n">pre</span><span class="p">))</span>
+<span class="w">  </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Cons</span><span class="p">[</span><span class="nc">B</span><span class="p">](</span><span class="n">f</span><span class="p">(</span><span class="n">x</span><span class="p">),</span><span class="w"> </span><span class="n">map1</span><span class="p">(</span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">f</span><span class="p">))</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Nil</span><span class="p">[</span><span class="nc">B</span><span class="p">]()</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">unOpt</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Option</span><span class="p">[</span><span class="nc">T</span><span class="p">]]):</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">forall</span><span class="p">(</span><span class="n">_</span><span class="p">.</span><span class="n">nonEmpty</span><span class="p">))</span>
-  <span class="n">map1</span><span class="p">(</span><span class="n">l</span><span class="p">,</span> <span class="nc">PartialFunction</span> <span class="p">{(</span><span class="n">x</span><span class="p">:</span><span class="nc">Option</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span> <span class="o">=&gt;</span> <span class="n">require</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">nonEmpty</span><span class="p">);</span> <span class="n">x</span><span class="p">.</span><span class="n">get</span><span class="p">})</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">unOpt</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Option</span><span class="p">[</span><span class="nc">T</span><span class="p">]]):</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">forall</span><span class="p">(</span><span class="n">_</span><span class="p">.</span><span class="n">nonEmpty</span><span class="p">))</span>
+<span class="w">  </span><span class="n">map1</span><span class="p">(</span><span class="n">l</span><span class="p">,</span><span class="w"> </span><span class="nc">PartialFunction</span><span class="w"> </span><span class="p">{(</span><span class="n">x</span><span class="p">:</span><span class="nc">Option</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">require</span><span class="p">(</span><span class="n">x</span><span class="p">.</span><span class="n">nonEmpty</span><span class="p">);</span><span class="w"> </span><span class="n">x</span><span class="p">.</span><span class="n">get</span><span class="p">})</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>Partial functions can also be written using pattern matching:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">unOptCase</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Option</span><span class="p">[</span><span class="nc">T</span><span class="p">]]):</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">forall</span> <span class="p">{</span> <span class="k">case</span> <span class="nc">Some</span><span class="p">(</span><span class="n">_</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="kc">true</span><span class="p">;</span> <span class="k">case</span> <span class="n">_</span> <span class="o">=&gt;</span> <span class="kc">false</span> <span class="p">})</span>
-  <span class="n">map1</span><span class="p">(</span><span class="n">l</span><span class="p">,</span> <span class="nc">PartialFunction</span><span class="p">[</span><span class="nc">Option</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span> <span class="nc">T</span><span class="p">]</span> <span class="p">{</span> <span class="k">case</span> <span class="nc">Some</span><span class="p">(</span><span class="n">v</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">v</span> <span class="p">})</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">unOptCase</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Option</span><span class="p">[</span><span class="nc">T</span><span class="p">]]):</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">l</span><span class="p">.</span><span class="n">forall</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="k">case</span><span class="w"> </span><span class="nc">Some</span><span class="p">(</span><span class="n">_</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">true</span><span class="p">;</span><span class="w"> </span><span class="k">case</span><span class="w"> </span><span class="n">_</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">false</span><span class="w"> </span><span class="p">})</span>
+<span class="w">  </span><span class="n">map1</span><span class="p">(</span><span class="n">l</span><span class="p">,</span><span class="w"> </span><span class="nc">PartialFunction</span><span class="p">[</span><span class="nc">Option</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span><span class="w"> </span><span class="nc">T</span><span class="p">]</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="k">case</span><span class="w"> </span><span class="nc">Some</span><span class="p">(</span><span class="n">v</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">v</span><span class="w"> </span><span class="p">})</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -614,8 +585,7 @@ <h2>PartialFunction[A, B]<a class="headerlink" href="#partialfunction-a-b" title
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="purescala.html" class="btn btn-neutral float-left" title="Pure Scala" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="genc.html" class="btn btn-neutral float-right" title="Generating C Code" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -624,7 +594,7 @@ <h2>PartialFunction[A, B]<a class="headerlink" href="#partialfunction-a-b" title
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -635,7 +605,7 @@ <h2>PartialFunction[A, B]<a class="headerlink" href="#partialfunction-a-b" title
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/limitations.html b/limitations.html
index ae29c132f4..506ecb125b 100644
--- a/limitations.html
+++ b/limitations.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Limitations of Verification &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Case Studies" href="casestudies.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -74,20 +76,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Limitations of Verification</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Limitations of Verification</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/limitations.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -98,7 +97,7 @@
            <div itemprop="articleBody">
              
   <section id="limitations-of-verification">
-<span id="limitations"></span><h1>Limitations of Verification<a class="headerlink" href="#limitations-of-verification" title="Permalink to this headline">¶</a></h1>
+<span id="limitations"></span><h1>Limitations of Verification<a class="headerlink" href="#limitations-of-verification" title="Link to this heading">¶</a></h1>
 <p>A goal of Stainless is to ensure that proven properties hold in
 all program executions so that, for example, verified programs
 do not crash and all of the preconditions and postconditions
@@ -110,7 +109,7 @@
 <p>Below we document several cases where we are aware that the
 discrepancy exists and provide suggested workarounds.</p>
 <section id="out-of-memory-errors">
-<h2>Out of Memory Errors<a class="headerlink" href="#out-of-memory-errors" title="Permalink to this headline">¶</a></h2>
+<h2>Out of Memory Errors<a class="headerlink" href="#out-of-memory-errors" title="Link to this heading">¶</a></h2>
 <p>By default, Stainless assumes that unbounded data types can
 be arbitrarily large and that all well-founded recursive
 functions have enough stack space to finish their computation.
@@ -138,8 +137,7 @@ <h2>Out of Memory Errors<a class="headerlink" href="#out-of-memory-errors" title
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="neon.html" class="btn btn-neutral float-left" title="Proving Theorems" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="casestudies.html" class="btn btn-neutral float-right" title="Case Studies" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -148,7 +146,7 @@ <h2>Out of Memory Errors<a class="headerlink" href="#out-of-memory-errors" title
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -159,7 +157,7 @@ <h2>Out of Memory Errors<a class="headerlink" href="#out-of-memory-errors" title
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/neon.html b/neon.html
index b73f223931..bad9d58cd8 100644
--- a/neon.html
+++ b/neon.html
@@ -1,24 +1,23 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Proving Theorems &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
         <script async="async" src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Limitations of Verification" href="limitations.html" />
@@ -30,20 +29,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -90,20 +92,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Proving Theorems</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Proving Theorems</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/neon.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -114,7 +113,7 @@
            <div itemprop="articleBody">
              
   <section id="proving-theorems">
-<span id="neon"></span><h1>Proving Theorems<a class="headerlink" href="#proving-theorems" title="Permalink to this headline">¶</a></h1>
+<span id="neon"></span><h1>Proving Theorems<a class="headerlink" href="#proving-theorems" title="Link to this heading">¶</a></h1>
 <p>Verifying the contract of a function is really proving a mathematical
 theorem. Stainless can be seen as a (mostly) automated theorem prover. It is
 automated in the sense that once the property stated, Stainless will proceed with searching
@@ -124,7 +123,7 @@
 more complicated ones. In the remaining subsections, we provide code patterns and introduce
 simple domain-specific language operators that can help in constructing complex Stainless proofs.</p>
 <section id="a-practical-introduction-to-proofs">
-<h2>A practical introduction to proofs<a class="headerlink" href="#a-practical-introduction-to-proofs" title="Permalink to this headline">¶</a></h2>
+<h2>A practical introduction to proofs<a class="headerlink" href="#a-practical-introduction-to-proofs" title="Link to this heading">¶</a></h2>
 <p>When writing logical propositions such as preconditions or
 postconditions in Stainless, one is basically writing Boolean
 predicates. They can be as simple as testing whether a list is empty
@@ -133,17 +132,17 @@ <h2>A practical introduction to proofs<a class="headerlink" href="#a-practical-i
 always hold.  They can be expressed using Boolean-valued methods that
 return <code class="docutils literal notranslate"><span class="pre">true</span></code> for all their inputs.</p>
 <p>To make this more concrete, let’s take a simple lemma as an
-example <a class="footnote-reference brackets" href="#example-dir" id="id1">1</a>. Here we want to prove that the append operation (<code class="docutils literal notranslate"><span class="pre">++</span></code>) on
+example <a class="footnote-reference brackets" href="#example-dir" id="id1" role="doc-noteref"><span class="fn-bracket">[</span>1<span class="fn-bracket">]</span></a>. Here we want to prove that the append operation (<code class="docutils literal notranslate"><span class="pre">++</span></code>) on
 lists preserves the content of the two lists being concatenated. This
 proposition is relatively straightforward and Stainless is able to verify
 that it always holds.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span> <span class="c1">// for List</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>       <span class="c1">// for holds</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span><span class="w"> </span><span class="c1">// for List</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span><span class="w">       </span><span class="c1">// for holds</span>
 
-<span class="k">object</span> <span class="nc">Example</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">appendContent</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span> <span class="n">l2</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">l1</span><span class="p">.</span><span class="n">content</span> <span class="o">++</span> <span class="n">l2</span><span class="p">.</span><span class="n">content</span> <span class="o">==</span> <span class="p">(</span><span class="n">l1</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">content</span>
-  <span class="p">}.</span><span class="n">holds</span>
+<span class="k">object</span><span class="w"> </span><span class="nc">Example</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">appendContent</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span><span class="w"> </span><span class="n">l2</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">l1</span><span class="p">.</span><span class="n">content</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">content</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="n">l1</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">content</span>
+<span class="w">  </span><span class="p">}.</span><span class="n">holds</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -153,13 +152,13 @@ <h2>A practical introduction to proofs<a class="headerlink" href="#a-practical-i
 <p>Now let’s look at another example that looks trivial but for which Stainless
 needs some help with the proof: we want to prove that adding <code class="docutils literal notranslate"><span class="pre">Nil</span></code>
 at the end of a list has no effect.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span> <span class="c1">// for List</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>       <span class="c1">// for holds</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span><span class="w"> </span><span class="c1">// for List</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span><span class="w">       </span><span class="c1">// for holds</span>
 
-<span class="k">object</span> <span class="nc">Example</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">rightUnitAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">l1</span> <span class="o">++</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">==</span> <span class="n">l1</span>
-  <span class="p">}.</span><span class="n">holds</span>
+<span class="k">object</span><span class="w"> </span><span class="nc">Example</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">rightUnitAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">l1</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l1</span>
+<span class="w">  </span><span class="p">}.</span><span class="n">holds</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -168,8 +167,8 @@ <h2>A practical introduction to proofs<a class="headerlink" href="#a-practical-i
 times out. But why does this happen?  The proposition doesn’t seem
 more complicated than <code class="docutils literal notranslate"><span class="pre">appendContent</span></code>. Perhaps even more
 surprisingly, Stainless <em>is</em> able to verify the following:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">leftUnitAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="nc">Nil</span><span class="p">()</span> <span class="o">++</span> <span class="n">l1</span> <span class="o">==</span> <span class="n">l1</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">leftUnitAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l1</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l1</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -182,10 +181,10 @@ <h2>A practical introduction to proofs<a class="headerlink" href="#a-practical-i
 What then, is the difference between the two examples above?  To
 answer this question, we need to have a look at the definition of the
 <code class="docutils literal notranslate"><span class="pre">++</span></code> method:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">++</span><span class="p">(</span><span class="n">that</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span><span class="bp">this</span> <span class="k">match</span> <span class="p">{</span>
-  <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="n">that</span>
-  <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span> <span class="o">++</span> <span class="n">that</span><span class="p">)</span>
-<span class="p">})</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span> <span class="cm">/* ... */</span> <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">++</span><span class="p">(</span><span class="n">that</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="bp">this</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">that</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">that</span><span class="p">)</span>
+<span class="p">}).</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="cm">/* ... */</span><span class="w"> </span><span class="p">}</span>
 </pre></div>
 </div>
 <p>Note that the implementation of <code class="docutils literal notranslate"><span class="pre">++</span></code> is recursive in its first
@@ -197,19 +196,19 @@ <h2>A practical introduction to proofs<a class="headerlink" href="#a-practical-i
 prove <code class="docutils literal notranslate"><span class="pre">rightUnitAppend</span></code>, we need to proceed with a case analysis.  The
 resulting proof has a recursive (i.e. inductive) structure reminiscent
 of the definition of <code class="docutils literal notranslate"><span class="pre">++</span></code>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span> <span class="c1">// for List</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>       <span class="c1">// for holds</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">proof</span><span class="p">.</span><span class="n">_</span>      <span class="c1">// for because</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span><span class="w"> </span><span class="c1">// for List</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span><span class="w">       </span><span class="c1">// for holds</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">proof</span><span class="p">.</span><span class="n">_</span><span class="w">      </span><span class="c1">// for because</span>
 
-<span class="k">object</span> <span class="nc">Example</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">rightUnitAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="p">(</span><span class="n">l1</span> <span class="o">++</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">==</span> <span class="n">l1</span><span class="p">)</span> <span class="n">because</span> <span class="p">{</span>
-      <span class="n">l1</span> <span class="k">match</span> <span class="p">{</span>
-        <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="kc">true</span>
-        <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">rightUnitAppend</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
-      <span class="p">}</span>
-    <span class="p">}</span>
-  <span class="p">}.</span><span class="n">holds</span>
+<span class="k">object</span><span class="w"> </span><span class="nc">Example</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">rightUnitAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="p">(</span><span class="n">l1</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l1</span><span class="p">)</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="n">l1</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">rightUnitAppend</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
+<span class="w">      </span><span class="p">}</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}.</span><span class="n">holds</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -229,14 +228,14 @@ <h2>A practical introduction to proofs<a class="headerlink" href="#a-practical-i
 and the inductive case is performed on <code class="docutils literal notranslate"><span class="pre">Cons</span></code> objects.</p>
 </section>
 <section id="techniques-for-proving-non-trivial-propositions">
-<h2>Techniques for proving non-trivial propositions<a class="headerlink" href="#techniques-for-proving-non-trivial-propositions" title="Permalink to this headline">¶</a></h2>
+<h2>Techniques for proving non-trivial propositions<a class="headerlink" href="#techniques-for-proving-non-trivial-propositions" title="Link to this heading">¶</a></h2>
 <p>In the previous section, we saw that “proof hints” can improve the odds
 of Stainless successfully verifying a given proposition.  In this section,
 we will have a closer look at what constitutes such a proof and
 discuss a few techniques for writing them.</p>
 <p>As mentioned earlier, propositions are represented by Boolean
 expressions in Stainless.  But how are proofs represented?  They are just
-Boolean expressions as well <a class="footnote-reference brackets" href="#props-not-types" id="id2">2</a>. The difference
+Boolean expressions as well <a class="footnote-reference brackets" href="#props-not-types" id="id2" role="doc-noteref"><span class="fn-bracket">[</span>2<span class="fn-bracket">]</span></a>. The difference
 between propositions and proofs is not their representation, but how
 they are used by Stainless.  Intuitively, a proof <code class="docutils literal notranslate"><span class="pre">p:</span> <span class="pre">Boolean</span></code> for a
 proposition <code class="docutils literal notranslate"><span class="pre">x:</span> <span class="pre">Boolean</span></code> is an expression such that</p>
@@ -255,13 +254,13 @@ <h2>Techniques for proving non-trivial propositions<a class="headerlink" href="#
 more closely resemble the definitions of functions used in <code class="docutils literal notranslate"><span class="pre">x</span></code>.  We
 have already seen an example of this principle in the previous
 section: let’s have another look at the proof of <code class="docutils literal notranslate"><span class="pre">rightUnitAppend</span></code>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">rightUnitAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">x</span> <span class="o">=</span> <span class="n">l1</span> <span class="o">++</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">==</span> <span class="n">l1</span>
-  <span class="kd">val</span> <span class="n">p</span> <span class="o">=</span> <span class="n">l1</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="kc">true</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">rightUnitAppend</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
-  <span class="p">}</span>
-  <span class="n">x</span> <span class="n">because</span> <span class="n">p</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">rightUnitAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">l1</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l1</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">p</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">l1</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">rightUnitAppend</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="n">p</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -277,7 +276,7 @@ <h2>Techniques for proving non-trivial propositions<a class="headerlink" href="#
 We will discuss induction in more detail in Section
 “<a class="reference internal" href="#induction"><span class="std std-ref">Induction</span></a>”.</p>
 <section id="divide-and-conquer">
-<h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Permalink to this headline">¶</a></h3>
+<h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Link to this heading">¶</a></h3>
 <p>Before we delve into the details of particular proof techniques, it is
 worth revisiting a guiding principle for writing proofs – whether it
 be in Stainless, by hand, or using some other form of mechanized proof
@@ -326,10 +325,10 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 assumes its argument in its precondition.  As a result, Stainless will
 check that <code class="docutils literal notranslate"><span class="pre">x</span></code> holds while verifying the call to <code class="docutils literal notranslate"><span class="pre">check(x)</span></code>.
 For example, when verifying the following function:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">proof</span><span class="p">.</span><span class="n">check</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">proof</span><span class="p">.</span><span class="n">check</span>
 
-<span class="k">def</span> <span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">check</span><span class="p">(</span><span class="n">x</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">||</span> <span class="n">x</span> <span class="o">&lt;</span> <span class="mi">0</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">check</span><span class="p">(</span><span class="n">x</span> <span class="o">+</span> <span class="mi">0</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">check</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">check</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -348,7 +347,7 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 <p>This is especially helpful when “debugging” proofs.</p>
 </section>
 <section id="proof-control-using-assert-and-check">
-<span id="proofcontrol"></span><h3>Proof control using <code class="docutils literal notranslate"><span class="pre">assert</span></code> and <code class="docutils literal notranslate"><span class="pre">check</span></code><a class="headerlink" href="#proof-control-using-assert-and-check" title="Permalink to this headline">¶</a></h3>
+<span id="proofcontrol"></span><h3>Proof control using <code class="docutils literal notranslate"><span class="pre">assert</span></code> and <code class="docutils literal notranslate"><span class="pre">check</span></code><a class="headerlink" href="#proof-control-using-assert-and-check" title="Link to this heading">¶</a></h3>
 <p>Both the <code class="docutils literal notranslate"><span class="pre">assert</span></code> and <code class="docutils literal notranslate"><span class="pre">check</span></code> keywords generate a verification condition for
 the corresponding formula in the current context. The difference in these
 keywords is in how they affect the context of other verification conditions. As
@@ -356,26 +355,26 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 outside the block of the assertion, while <code class="docutils literal notranslate"><span class="pre">check</span></code> does. Thus you can use
 assertions to prove local properties, and use <code class="docutils literal notranslate"><span class="pre">check</span></code> to have the property
 (checked and) visible outside the block.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foo</span><span class="p">():</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">x</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">assert</span><span class="p">(</span><span class="n">b1</span><span class="p">)</span> <span class="c1">// verification condition: b1</span>
-    <span class="n">check</span><span class="p">(</span><span class="n">b2</span><span class="p">)</span>  <span class="c1">// verification condition: b1 ==&gt; b2</span>
-  <span class="p">}</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">b3</span><span class="p">)</span>   <span class="c1">// verification condition: b2 ==&gt; b3 (b1 not visible to the solver)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">foo</span><span class="p">():</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">assert</span><span class="p">(</span><span class="n">b1</span><span class="p">)</span><span class="w"> </span><span class="c1">// verification condition: b1</span>
+<span class="w">    </span><span class="n">check</span><span class="p">(</span><span class="n">b2</span><span class="p">)</span><span class="w">  </span><span class="c1">// verification condition: b1 ==&gt; b2</span>
+<span class="w">  </span><span class="p">}</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">b3</span><span class="p">)</span><span class="w">   </span><span class="c1">// verification condition: b2 ==&gt; b3 (b1 not visible to the solver)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>Similarly, <code class="docutils literal notranslate"><span class="pre">assert</span></code>’s are not guaranteed to be visible when generating
 verification conditions for postconditions, while <code class="docutils literal notranslate"><span class="pre">check</span></code>’s are.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foo</span><span class="p">():</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">b1</span><span class="p">)</span> <span class="c1">// verification condition: b1</span>
-  <span class="n">check</span><span class="p">(</span><span class="n">b2</span><span class="p">)</span>  <span class="c1">// verification condition: b1 ==&gt; b2</span>
-<span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">_</span> <span class="o">=&gt;</span> <span class="n">b3</span><span class="p">)</span> <span class="c1">// verification condition b2 ==&gt; b3 (b1 might not be visible to the solver)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">foo</span><span class="p">():</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">assert</span><span class="p">(</span><span class="n">b1</span><span class="p">)</span><span class="w"> </span><span class="c1">// verification condition: b1</span>
+<span class="w">   </span><span class="n">check</span><span class="p">(</span><span class="n">b2</span><span class="p">)</span><span class="w">  </span><span class="c1">// verification condition: b1 ==&gt; b2</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">_</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">b3</span><span class="p">)</span><span class="w"> </span><span class="c1">// verification condition b2 ==&gt; b3 (b1 might not be visible to the solver)</span>
 </pre></div>
 </div>
 </section>
 <section id="induction">
-<span id="id3"></span><h3>Induction<a class="headerlink" href="#induction" title="Permalink to this headline">¶</a></h3>
+<span id="id3"></span><h3>Induction<a class="headerlink" href="#induction" title="Link to this heading">¶</a></h3>
 <p>The vast majority of functional programs are written as functions over
 <a class="reference internal" href="purescala.html#purescala"><span class="std std-ref">ADTs</span></a>, and consequently, Stainless comes with some special
 support for verifying properties of ADTs.  Among other things, Stainless
@@ -384,11 +383,11 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 <em>structural induction</em>.  We have already seen an example of such an
 inductive property, namely <code class="docutils literal notranslate"><span class="pre">rightUnitAppend</span></code>.  In fact, using
 <code class="docutils literal notranslate"><span class="pre">&#64;induct</span></code>, Stainless is able to prove <code class="docutils literal notranslate"><span class="pre">rightUnitAppend</span></code> directly:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>  <span class="c1">// for @induct</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span><span class="w">  </span><span class="c1">// for @induct</span>
 
 <span class="nd">@induct</span>
-<span class="k">def</span> <span class="nf">rightUnitAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">l1</span> <span class="o">++</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">==</span> <span class="n">l1</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">rightUnitAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">l1</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l1</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -398,13 +397,13 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 functions with non-trivial base cases or inductive steps.  In such
 cases, one may still try to provide proof hints by performing <em>manual
 case analysis</em>.  Consider the following lemma about list reversal:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span> <span class="c1">// for List</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>       <span class="c1">// for holds</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span><span class="w"> </span><span class="c1">// for List</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span><span class="w">       </span><span class="c1">// for holds</span>
 
-<span class="k">object</span> <span class="nc">Example</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">reverseReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">l</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">l</span>
-  <span class="p">}.</span><span class="n">holds</span>
+<span class="k">object</span><span class="w"> </span><span class="nc">Example</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">reverseReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">l</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l</span>
+<span class="w">  </span><span class="p">}.</span><span class="n">holds</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -412,13 +411,13 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 So let’s try and prove the lemma using manual case analysis.  We start
 by adding an “unrolled” version of the proposition and inserting calls
 to <code class="docutils literal notranslate"><span class="pre">check</span></code> in each branch of the resulting pattern match:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">reverseReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">l</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">l</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="n">check</span> <span class="p">{</span>  <span class="nc">Nil</span><span class="p">[</span><span class="nc">T</span><span class="p">]().</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span> <span class="o">==</span> <span class="nc">Nil</span><span class="p">[</span><span class="nc">T</span><span class="p">]()</span>  <span class="p">}</span>
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">check</span> <span class="p">{</span> <span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">).</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span> <span class="o">==</span> <span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">)</span> <span class="p">}</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">reverseReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">l</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w">  </span><span class="nc">Nil</span><span class="p">[</span><span class="nc">T</span><span class="p">]().</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="nc">Nil</span><span class="p">[</span><span class="nc">T</span><span class="p">]()</span><span class="w">  </span><span class="p">}</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">).</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="p">}</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -446,13 +445,13 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 is, or replace it by <code class="docutils literal notranslate"><span class="pre">trivial</span></code>.  Unfortunately, Stainless wasn’t able to
 verify the inductive step, something is missing.  Let’s try to
 manually reduce the inductive case and see where we get.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">reverseReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">l</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">l</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="n">trivial</span>
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">check</span> <span class="p">{</span> <span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span> <span class="o">:+</span> <span class="n">x</span><span class="p">).</span><span class="n">reverse</span> <span class="o">==</span> <span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">)</span> <span class="p">}</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">reverseReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">l</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="p">}</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -463,8 +462,8 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 property of <code class="docutils literal notranslate"><span class="pre">reverse</span></code>, given by the following lemma (which Stainless <em>is</em>
 able to prove using <code class="docutils literal notranslate"><span class="pre">&#64;induct</span></code>):</p>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nd">@induct</span>
-<span class="k">def</span> <span class="nf">snocReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span> <span class="n">t</span><span class="p">:</span> <span class="nc">T</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="p">(</span><span class="n">l</span> <span class="o">:+</span> <span class="n">t</span><span class="p">).</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">t</span> <span class="o">::</span> <span class="n">l</span><span class="p">.</span><span class="n">reverse</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">snocReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span><span class="w"> </span><span class="n">t</span><span class="p">:</span><span class="w"> </span><span class="nc">T</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="p">(</span><span class="n">l</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">t</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">l</span><span class="p">.</span><span class="n">reverse</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -472,17 +471,17 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 reversing it is equivalent to first reversing <code class="docutils literal notranslate"><span class="pre">l</span></code> and then
 prepending <code class="docutils literal notranslate"><span class="pre">t</span></code>.  Using this lemma, we can write the proof of
 <code class="docutils literal notranslate"><span class="pre">reverseReverse</span></code> as</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">reverseReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">l</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">l</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="n">trivial</span>
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">check</span> <span class="p">{</span>
-        <span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span> <span class="o">:+</span> <span class="n">x</span><span class="p">).</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span> <span class="o">&amp;&amp;</span>
-        <span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span>   <span class="o">==</span> <span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">)</span>               <span class="n">because</span>
-          <span class="n">snocReverse</span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">reverseReverse</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
-      <span class="p">}</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">reverseReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">l</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">        </span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span><span class="w">   </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w">               </span><span class="n">because</span>
+<span class="w">          </span><span class="n">snocReverse</span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">reverseReverse</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
+<span class="w">      </span><span class="p">}</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -492,13 +491,13 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 <code class="docutils literal notranslate"><span class="pre">reverseReverse(xs)</span></code>.  Similarly, the call to <code class="docutils literal notranslate"><span class="pre">check</span></code> is somewhat
 redundant now that Stainless is able to verify the entire proof.  We could
 thus “simplify” the above to</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">reverseReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">l</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">l</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="n">trivial</span>
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">snocReverse</span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">reverseReverse</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">reverseReverse</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">l</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">snocReverse</span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">reverseReverse</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -511,11 +510,11 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 – the form of induction that is perhaps more familiar to most
 readers.  Consider the following definition of the exponential
 function <span class="math notranslate nohighlight">\(exp(x, y) = x^y\)</span> over integers:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">exp</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">y</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="k">if</span>      <span class="p">(</span><span class="n">x</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="mi">0</span>
-  <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="n">y</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="mi">1</span>
-  <span class="k">else</span>             <span class="n">x</span> <span class="o">*</span> <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">exp</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">  </span><span class="k">if</span><span class="w">      </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">  </span><span class="k">else</span><span class="w">             </span><span class="n">x</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -524,9 +523,9 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 some properties of this function using natural induction.  One such
 property is that for any pair of positive numbers <span class="math notranslate nohighlight">\(x, y \geq 0\)</span>,
 the exponential <span class="math notranslate nohighlight">\(x^y\)</span> is again a positive number.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">positive</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">y</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">x</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">0</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">positive</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">  </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -534,25 +533,25 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 verify the lemma without hints.  As with the previous example, we
 start writing our inductive proof by expanding the top-level <code class="docutils literal notranslate"><span class="pre">if</span></code>
 statement in the definition of <code class="docutils literal notranslate"><span class="pre">exp</span></code>.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">positive</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">y</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">x</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="k">if</span>      <span class="p">(</span><span class="n">x</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">check</span> <span class="p">{</span> <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="p">}</span>  <span class="c1">// &lt;-- valid</span>
-    <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="n">y</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">check</span> <span class="p">{</span> <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="p">}</span>  <span class="c1">// &lt;-- valid</span>
-    <span class="k">else</span>             <span class="n">check</span> <span class="p">{</span> <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="p">}</span>  <span class="c1">// &lt;-- unknown</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">positive</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">  </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">if</span><span class="w">      </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="p">}</span><span class="w">  </span><span class="c1">// &lt;-- valid</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="p">}</span><span class="w">  </span><span class="c1">// &lt;-- valid</span>
+<span class="w">    </span><span class="k">else</span><span class="w">             </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="p">}</span><span class="w">  </span><span class="c1">// &lt;-- unknown</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
 <p>Stainless was able to verify the first two (base) cases, but not the
 inductive step, so let’s continue unfolding <code class="docutils literal notranslate"><span class="pre">exp</span></code> for that case.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">positive</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">y</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">x</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="k">if</span>      <span class="p">(</span><span class="n">x</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">trivial</span>
-    <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="n">y</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">trivial</span>
-    <span class="k">else</span>             <span class="n">check</span> <span class="p">{</span> <span class="n">x</span> <span class="o">*</span> <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">positive</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">  </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">if</span><span class="w">      </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">    </span><span class="k">else</span><span class="w">             </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -561,52 +560,52 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 precondition) and so is <code class="docutils literal notranslate"><span class="pre">exp(x,</span> <span class="pre">y</span> <span class="pre">-</span> <span class="pre">1)</span></code> (by the inductive
 hypothesis).  Hence the product <code class="docutils literal notranslate"><span class="pre">x</span> <span class="pre">*</span> <span class="pre">exp(x,</span> <span class="pre">y</span> <span class="pre">-</span> <span class="pre">1)</span></code> is again
 positive.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">positive</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">y</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">x</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="k">if</span>      <span class="p">(</span><span class="n">x</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">trivial</span>
-    <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="n">y</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">trivial</span>
-    <span class="k">else</span>             <span class="n">check</span> <span class="p">{</span>
-      <span class="n">x</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="n">because</span> <span class="n">positive</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">positive</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">  </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">if</span><span class="w">      </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">    </span><span class="k">else</span><span class="w">             </span><span class="n">check</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="n">x</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="n">positive</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
 <p>With these hints, Stainless is able to verify the proof.  Again, we could
 shorten the proof by omitting inequalities that Stainless can infer
 directly, albeit at the expense of readability.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">positiveShort</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">y</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">&amp;&amp;</span> <span class="n">x</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="k">if</span>      <span class="p">(</span><span class="n">x</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">trivial</span>
-    <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="n">y</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">trivial</span>
-    <span class="k">else</span>             <span class="n">positiveShort</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">positiveShort</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">  </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">if</span><span class="w">      </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">    </span><span class="k">else</span><span class="w">             </span><span class="n">positiveShort</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
 <p>We conclude the section with the inductive proof of another, somewhat
 more interesting property of the exponential function, namely that
 <span class="math notranslate nohighlight">\((x y)^z = x^z y^z\)</span>.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">expMultCommute</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">z</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">z</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="n">exp</span><span class="p">(</span><span class="n">x</span> <span class="o">*</span> <span class="n">y</span><span class="p">,</span> <span class="n">z</span><span class="p">)</span> <span class="o">==</span> <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">z</span><span class="p">)</span> <span class="o">*</span> <span class="n">exp</span><span class="p">(</span><span class="n">y</span><span class="p">,</span> <span class="n">z</span><span class="p">)</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="k">if</span>      <span class="p">(</span><span class="n">x</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">trivial</span>
-    <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="n">y</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">trivial</span>
-    <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="n">z</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">trivial</span>
-    <span class="k">else</span>             <span class="n">check</span> <span class="p">{</span>
-      <span class="n">x</span> <span class="o">*</span> <span class="n">y</span> <span class="o">*</span> <span class="n">exp</span><span class="p">(</span><span class="n">x</span> <span class="o">*</span> <span class="n">y</span><span class="p">,</span> <span class="n">z</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span> <span class="o">==</span>
-        <span class="n">x</span> <span class="o">*</span> <span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">z</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span> <span class="o">*</span> <span class="n">y</span> <span class="o">*</span> <span class="n">exp</span><span class="p">(</span><span class="n">y</span><span class="p">,</span> <span class="n">z</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span> <span class="n">because</span>
-        <span class="n">expMultCommute</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">,</span> <span class="n">z</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">expMultCommute</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">z</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">  </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">exp</span><span class="p">(</span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">)</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">if</span><span class="w">      </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">z</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">    </span><span class="k">else</span><span class="w">             </span><span class="n">check</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="n">x</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">==</span>
+<span class="w">        </span><span class="n">x</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">exp</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">exp</span><span class="p">(</span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="n">because</span>
+<span class="w">        </span><span class="n">expMultCommute</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
 </section>
 <section id="relational-reasoning">
-<span id="rel-reasoning"></span><h3>Relational reasoning<a class="headerlink" href="#relational-reasoning" title="Permalink to this headline">¶</a></h3>
+<span id="rel-reasoning"></span><h3>Relational reasoning<a class="headerlink" href="#relational-reasoning" title="Link to this heading">¶</a></h3>
 <p>The majority of the example propositions we have seen so far related
 some expression (e.g. <code class="docutils literal notranslate"><span class="pre">l.reverse</span> <span class="pre">++</span> <span class="pre">Nil()</span></code> or <code class="docutils literal notranslate"><span class="pre">exp(x,</span> <span class="pre">y)</span></code>) to some
 other expression (e.g. <code class="docutils literal notranslate"><span class="pre">...</span> <span class="pre">==</span> <span class="pre">l1</span></code> or <code class="docutils literal notranslate"><span class="pre">...</span> <span class="pre">&gt;=</span> <span class="pre">0</span></code>).  This is
@@ -631,7 +630,7 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 as <code class="docutils literal notranslate"><span class="pre">++</span></code> or <code class="docutils literal notranslate"><span class="pre">reverse</span></code> on lists.  For example, Stainless is not able to
 verify that the following holds for arbitrary pairs of lists <code class="docutils literal notranslate"><span class="pre">l1</span></code>
 and <code class="docutils literal notranslate"><span class="pre">l2</span></code>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="n">l1</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="n">l1</span><span class="p">.</span><span class="n">reverse</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="n">l1</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l1</span><span class="p">.</span><span class="n">reverse</span>
 </pre></div>
 </div>
 <p>The hard part of giving hints to Stainless is often to find them in the
@@ -641,21 +640,21 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 intermediate equations to the right-hand side.  Using <code class="docutils literal notranslate"><span class="pre">check</span></code>
 statements we can identify where Stainless times out and hence potentially
 needs hints.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">reverseAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span> <span class="n">l2</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="p">(</span> <span class="p">(</span><span class="n">l1</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="n">l1</span><span class="p">.</span><span class="n">reverse</span> <span class="p">)</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="n">l1</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">=&gt;</span>
-        <span class="cm">/* 1 */</span> <span class="n">check</span> <span class="p">{</span> <span class="p">(</span><span class="nc">Nil</span><span class="p">()</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span>                  <span class="p">}</span> <span class="o">&amp;&amp;</span>
-        <span class="cm">/* 2 */</span> <span class="n">check</span> <span class="p">{</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span>            <span class="o">==</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="nc">Nil</span><span class="p">()</span>         <span class="p">}</span> <span class="o">&amp;&amp;</span>
-        <span class="cm">/* 3 */</span> <span class="n">check</span> <span class="p">{</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="nc">Nil</span><span class="p">()</span>   <span class="o">==</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="nc">Nil</span><span class="p">().</span><span class="n">reverse</span> <span class="p">}</span>
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span>
-        <span class="cm">/* 4 */</span> <span class="n">check</span> <span class="p">{</span> <span class="p">((</span><span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">)</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">reverse</span>       <span class="o">==</span> <span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="p">(</span><span class="n">xs</span> <span class="o">++</span> <span class="n">l2</span><span class="p">)).</span><span class="n">reverse</span>       <span class="p">}</span> <span class="o">&amp;&amp;</span>
-        <span class="cm">/* 5 */</span> <span class="n">check</span> <span class="p">{</span> <span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="p">(</span><span class="n">xs</span> <span class="o">++</span> <span class="n">l2</span><span class="p">)).</span><span class="n">reverse</span>       <span class="o">==</span> <span class="p">(</span><span class="n">xs</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">reverse</span> <span class="o">:+</span> <span class="n">x</span>         <span class="p">}</span> <span class="o">&amp;&amp;</span>
-        <span class="cm">/* 6 */</span> <span class="n">check</span> <span class="p">{</span> <span class="p">(</span><span class="n">xs</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">reverse</span> <span class="o">:+</span> <span class="n">x</span>         <span class="o">==</span> <span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">)</span> <span class="o">:+</span> <span class="n">x</span> <span class="p">}</span> <span class="o">&amp;&amp;</span>
-        <span class="cm">/* 7 */</span> <span class="n">check</span> <span class="p">{</span> <span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">)</span> <span class="o">:+</span> <span class="n">x</span> <span class="o">==</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span> <span class="o">:+</span> <span class="n">x</span><span class="p">)</span> <span class="p">}</span> <span class="o">&amp;&amp;</span>
-        <span class="cm">/* 8 */</span> <span class="n">check</span> <span class="p">{</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span> <span class="o">:+</span> <span class="n">x</span><span class="p">)</span> <span class="o">==</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">).</span><span class="n">reverse</span> <span class="p">}</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">reverseAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span><span class="w"> </span><span class="n">l2</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="p">(</span><span class="w"> </span><span class="p">(</span><span class="n">l1</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l1</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">l1</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">        </span><span class="cm">/* 1 */</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="p">(</span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w">                  </span><span class="p">}</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">        </span><span class="cm">/* 2 */</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w">            </span><span class="o">==</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">         </span><span class="p">}</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">        </span><span class="cm">/* 3 */</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">   </span><span class="o">==</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="nc">Nil</span><span class="p">().</span><span class="n">reverse</span><span class="w"> </span><span class="p">}</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">        </span><span class="cm">/* 4 */</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="p">((</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">reverse</span><span class="w">       </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">)).</span><span class="n">reverse</span><span class="w">       </span><span class="p">}</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">        </span><span class="cm">/* 5 */</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">)).</span><span class="n">reverse</span><span class="w">       </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="w">         </span><span class="p">}</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">        </span><span class="cm">/* 6 */</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="w">         </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">)</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="p">}</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">        </span><span class="cm">/* 7 */</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">)</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="p">}</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">        </span><span class="cm">/* 8 */</span><span class="w"> </span><span class="n">check</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="p">}</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -683,15 +682,15 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 of most equations are duplicated.  One option is to completely remove
 the equations (they are implied by the instantiations of the lemmas)
 and simply write</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">reverseAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span> <span class="n">l2</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="p">(</span> <span class="p">(</span><span class="n">l1</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="n">l1</span><span class="p">.</span><span class="n">reverse</span> <span class="p">)</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="n">l1</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">=&gt;</span>
-        <span class="n">rightUnitAppend</span><span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="p">)</span>
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span>
-        <span class="n">reverseAppend</span><span class="p">(</span><span class="n">xs</span><span class="p">,</span> <span class="n">l2</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">snocAfterAppend</span><span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span> <span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">reverseAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span><span class="w"> </span><span class="n">l2</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="p">(</span><span class="w"> </span><span class="p">(</span><span class="n">l1</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l1</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">l1</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">        </span><span class="n">rightUnitAppend</span><span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="p">)</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">        </span><span class="n">reverseAppend</span><span class="p">(</span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">l2</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">snocAfterAppend</span><span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -700,26 +699,26 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 interleave the equations with their associated proofs.  This has the
 advantage of not losing information that is still useful for a human
 being reading the proof later on:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">reverseAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span> <span class="n">l2</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="p">(</span> <span class="p">(</span><span class="n">l1</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">reverse</span> <span class="o">==</span> <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="n">l1</span><span class="p">.</span><span class="n">reverse</span> <span class="p">)</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="n">l1</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">=&gt;</span> <span class="p">{</span>
-        <span class="p">(</span><span class="nc">Nil</span><span class="p">()</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">reverse</span>         <span class="o">==|</span> <span class="n">trivial</span>                     <span class="o">|</span>
-        <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span>                    <span class="o">==|</span> <span class="n">rightUnitAppend</span><span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="p">)</span> <span class="o">|</span>
-        <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="nc">Nil</span><span class="p">()</span>           <span class="o">==|</span> <span class="n">trivial</span>                     <span class="o">|</span>
-        <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="nc">Nil</span><span class="p">().</span><span class="n">reverse</span>
-      <span class="p">}.</span><span class="n">qed</span>
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="p">{</span>
-        <span class="p">((</span><span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">)</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">reverse</span>         <span class="o">==|</span> <span class="n">trivial</span>               <span class="o">|</span>
-        <span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="p">(</span><span class="n">xs</span> <span class="o">++</span> <span class="n">l2</span><span class="p">)).</span><span class="n">reverse</span>         <span class="o">==|</span> <span class="n">trivial</span>               <span class="o">|</span>
-        <span class="p">(</span><span class="n">xs</span> <span class="o">++</span> <span class="n">l2</span><span class="p">).</span><span class="n">reverse</span> <span class="o">:+</span> <span class="n">x</span>           <span class="o">==|</span> <span class="n">reverseAppend</span><span class="p">(</span><span class="n">xs</span><span class="p">,</span> <span class="n">l2</span><span class="p">)</span> <span class="o">|</span>
-        <span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">)</span> <span class="o">:+</span> <span class="n">x</span>   <span class="o">==|</span>
-          <span class="n">snocAfterAppend</span><span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span> <span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span>                <span class="o">|</span>
-        <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span> <span class="o">:+</span> <span class="n">x</span><span class="p">)</span>   <span class="o">==|</span> <span class="n">trivial</span>               <span class="o">|</span>
-        <span class="n">l2</span><span class="p">.</span><span class="n">reverse</span> <span class="o">++</span> <span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">).</span><span class="n">reverse</span>
-      <span class="p">}.</span><span class="n">qed</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">reverseAppend</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l1</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span><span class="w"> </span><span class="n">l2</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="p">(</span><span class="w"> </span><span class="p">(</span><span class="n">l1</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l1</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="p">)</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">l1</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="p">(</span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">reverse</span><span class="w">         </span><span class="o">==|</span><span class="w"> </span><span class="n">trivial</span><span class="w">                     </span><span class="o">|</span>
+<span class="w">        </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w">                    </span><span class="o">==|</span><span class="w"> </span><span class="n">rightUnitAppend</span><span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="p">)</span><span class="w"> </span><span class="o">|</span>
+<span class="w">        </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">           </span><span class="o">==|</span><span class="w"> </span><span class="n">trivial</span><span class="w">                     </span><span class="o">|</span>
+<span class="w">        </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="nc">Nil</span><span class="p">().</span><span class="n">reverse</span>
+<span class="w">      </span><span class="p">}.</span><span class="n">qed</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="p">((</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">reverse</span><span class="w">         </span><span class="o">==|</span><span class="w"> </span><span class="n">trivial</span><span class="w">               </span><span class="o">|</span>
+<span class="w">        </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">)).</span><span class="n">reverse</span><span class="w">         </span><span class="o">==|</span><span class="w"> </span><span class="n">trivial</span><span class="w">               </span><span class="o">|</span>
+<span class="w">        </span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">l2</span><span class="p">).</span><span class="n">reverse</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="w">           </span><span class="o">==|</span><span class="w"> </span><span class="n">reverseAppend</span><span class="p">(</span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">l2</span><span class="p">)</span><span class="w"> </span><span class="o">|</span>
+<span class="w">        </span><span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">)</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="w">   </span><span class="o">==|</span>
+<span class="w">          </span><span class="n">snocAfterAppend</span><span class="p">(</span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w">                </span><span class="o">|</span>
+<span class="w">        </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w">   </span><span class="o">==|</span><span class="w"> </span><span class="n">trivial</span><span class="w">               </span><span class="o">|</span>
+<span class="w">        </span><span class="n">l2</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">).</span><span class="n">reverse</span>
+<span class="w">      </span><span class="p">}.</span><span class="n">qed</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -740,7 +739,7 @@ <h3>Divide and Conquer<a class="headerlink" href="#divide-and-conquer" title="Pe
 relations on a case-by-case basis.</p>
 </section>
 <section id="limits-of-the-approach-hofs-quantifiers-and-termination">
-<h3>Limits of the approach: HOFs, quantifiers and termination<a class="headerlink" href="#limits-of-the-approach-hofs-quantifiers-and-termination" title="Permalink to this headline">¶</a></h3>
+<h3>Limits of the approach: HOFs, quantifiers and termination<a class="headerlink" href="#limits-of-the-approach-hofs-quantifiers-and-termination" title="Link to this heading">¶</a></h3>
 <p>While the techniques discussed in this section are useful in general,
 their applicability has, of course, its limitations in practice.  These
 limitations are mostly due to Stainless’ limited support for certain
@@ -751,26 +750,26 @@ <h3>Limits of the approach: HOFs, quantifiers and termination<a class="headerlin
 some interesting propositions.  Here is another list example, which
 relates the <code class="docutils literal notranslate"><span class="pre">foldLeft</span></code>, <code class="docutils literal notranslate"><span class="pre">foldRight</span></code> and <code class="docutils literal notranslate"><span class="pre">reverse</span></code> operations
 defined on lists and makes crucial use of HOFs:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">proof</span><span class="p">.</span><span class="n">_</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">proof</span><span class="p">.</span><span class="n">_</span>
 
-<span class="k">def</span> <span class="nf">folds</span><span class="p">[</span><span class="nc">A</span><span class="p">,</span> <span class="nc">B</span><span class="p">](</span><span class="n">xs</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span> <span class="n">z</span><span class="p">:</span> <span class="nc">B</span><span class="p">,</span> <span class="n">f</span><span class="p">:</span> <span class="p">(</span><span class="nc">B</span><span class="p">,</span> <span class="nc">A</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">B</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">f2</span> <span class="o">=</span> <span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">z</span><span class="p">:</span> <span class="nc">B</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">f</span><span class="p">(</span><span class="n">z</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span>
-  <span class="n">xs</span><span class="p">.</span><span class="n">foldLeft</span><span class="p">(</span><span class="n">z</span><span class="p">)(</span><span class="n">f</span><span class="p">)</span> <span class="o">==</span> <span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">foldRight</span><span class="p">(</span><span class="n">z</span><span class="p">)(</span><span class="n">f2</span><span class="p">)</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="n">xs</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">=&gt;</span> <span class="kc">true</span>
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="p">{</span>
-        <span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">).</span><span class="n">foldLeft</span><span class="p">(</span><span class="n">z</span><span class="p">)(</span><span class="n">f</span><span class="p">)</span>              <span class="o">==|</span> <span class="n">trivial</span>               <span class="o">|</span>
-        <span class="n">xs</span><span class="p">.</span><span class="n">foldLeft</span><span class="p">(</span><span class="n">f</span><span class="p">(</span><span class="n">z</span><span class="p">,</span> <span class="n">x</span><span class="p">))(</span><span class="n">f</span><span class="p">)</span>               <span class="o">==|</span> <span class="n">folds</span><span class="p">(</span><span class="n">xs</span><span class="p">,</span> <span class="n">f</span><span class="p">(</span><span class="n">z</span><span class="p">,</span> <span class="n">x</span><span class="p">),</span> <span class="n">f</span><span class="p">)</span> <span class="o">|</span>
-        <span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">foldRight</span><span class="p">(</span><span class="n">f</span><span class="p">(</span><span class="n">z</span><span class="p">,</span> <span class="n">x</span><span class="p">))(</span><span class="n">f2</span><span class="p">)</span>     <span class="o">==|</span> <span class="n">trivial</span>               <span class="o">|</span>
-        <span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">foldRight</span><span class="p">(</span><span class="n">f2</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">z</span><span class="p">))(</span><span class="n">f2</span><span class="p">)</span>    <span class="o">==|</span>
-          <span class="n">snocFoldRight</span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span> <span class="n">x</span><span class="p">,</span> <span class="n">z</span><span class="p">,</span> <span class="n">f2</span><span class="p">)</span>                           <span class="o">|</span>
-        <span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span> <span class="o">:+</span> <span class="n">x</span><span class="p">).</span><span class="n">foldRight</span><span class="p">(</span><span class="n">z</span><span class="p">)(</span><span class="n">f2</span><span class="p">)</span>    <span class="o">==|</span> <span class="n">trivial</span>               <span class="o">|</span>
-        <span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">).</span><span class="n">reverse</span><span class="p">.</span><span class="n">foldRight</span><span class="p">(</span><span class="n">z</span><span class="p">)(</span><span class="n">f2</span><span class="p">)</span>
-      <span class="p">}.</span><span class="n">qed</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">folds</span><span class="p">[</span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="nc">B</span><span class="p">](</span><span class="n">xs</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span><span class="w"> </span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">B</span><span class="p">,</span><span class="w"> </span><span class="n">f</span><span class="p">:</span><span class="w"> </span><span class="p">(</span><span class="nc">B</span><span class="p">,</span><span class="w"> </span><span class="nc">A</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">B</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">f2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">B</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">f</span><span class="p">(</span><span class="n">z</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">)</span>
+<span class="w">  </span><span class="n">xs</span><span class="p">.</span><span class="n">foldLeft</span><span class="p">(</span><span class="n">z</span><span class="p">)(</span><span class="n">f</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">foldRight</span><span class="p">(</span><span class="n">z</span><span class="p">)(</span><span class="n">f2</span><span class="p">)</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">xs</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">).</span><span class="n">foldLeft</span><span class="p">(</span><span class="n">z</span><span class="p">)(</span><span class="n">f</span><span class="p">)</span><span class="w">              </span><span class="o">==|</span><span class="w"> </span><span class="n">trivial</span><span class="w">               </span><span class="o">|</span>
+<span class="w">        </span><span class="n">xs</span><span class="p">.</span><span class="n">foldLeft</span><span class="p">(</span><span class="n">f</span><span class="p">(</span><span class="n">z</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">))(</span><span class="n">f</span><span class="p">)</span><span class="w">               </span><span class="o">==|</span><span class="w"> </span><span class="n">folds</span><span class="p">(</span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">f</span><span class="p">(</span><span class="n">z</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">),</span><span class="w"> </span><span class="n">f</span><span class="p">)</span><span class="w"> </span><span class="o">|</span>
+<span class="w">        </span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">foldRight</span><span class="p">(</span><span class="n">f</span><span class="p">(</span><span class="n">z</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">))(</span><span class="n">f2</span><span class="p">)</span><span class="w">     </span><span class="o">==|</span><span class="w"> </span><span class="n">trivial</span><span class="w">               </span><span class="o">|</span>
+<span class="w">        </span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">.</span><span class="n">foldRight</span><span class="p">(</span><span class="n">f2</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">))(</span><span class="n">f2</span><span class="p">)</span><span class="w">    </span><span class="o">==|</span>
+<span class="w">          </span><span class="n">snocFoldRight</span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">,</span><span class="w"> </span><span class="n">f2</span><span class="p">)</span><span class="w">                           </span><span class="o">|</span>
+<span class="w">        </span><span class="p">(</span><span class="n">xs</span><span class="p">.</span><span class="n">reverse</span><span class="w"> </span><span class="o">:+</span><span class="w"> </span><span class="n">x</span><span class="p">).</span><span class="n">foldRight</span><span class="p">(</span><span class="n">z</span><span class="p">)(</span><span class="n">f2</span><span class="p">)</span><span class="w">    </span><span class="o">==|</span><span class="w"> </span><span class="n">trivial</span><span class="w">               </span><span class="o">|</span>
+<span class="w">        </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">).</span><span class="n">reverse</span><span class="p">.</span><span class="n">foldRight</span><span class="p">(</span><span class="n">z</span><span class="p">)(</span><span class="n">f2</span><span class="p">)</span>
+<span class="w">      </span><span class="p">}.</span><span class="n">qed</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -784,23 +783,23 @@ <h3>Limits of the approach: HOFs, quantifiers and termination<a class="headerlin
 Stainless recognizes as valid, but which are not well-founded.  Consider
 the following lemma, which apparently establishes that all lists are
 empty:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">proof</span><span class="p">.</span><span class="n">_</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">proof</span><span class="p">.</span><span class="n">_</span>
 
-<span class="k">object</span> <span class="nc">NotWellFounded</span> <span class="p">{</span>
+<span class="k">object</span><span class="w"> </span><span class="nc">NotWellFounded</span><span class="w"> </span><span class="p">{</span>
 
-  <span class="c1">// This proof is not well-founded.  Since Stainless doesn&#39;t run the</span>
-  <span class="c1">// termination checker by default, it will accept the proof as</span>
-  <span class="c1">// valid.</span>
-  <span class="k">def</span> <span class="nf">allListsAreEmpty</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">xs</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">xs</span><span class="p">.</span><span class="n">isEmpty</span> <span class="n">because</span> <span class="p">{</span>
-      <span class="n">xs</span> <span class="k">match</span> <span class="p">{</span>
-        <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="n">trivial</span>
-        <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">allListsAreEmpty</span><span class="p">(</span><span class="n">x</span> <span class="o">::</span> <span class="n">xs</span><span class="p">)</span>
-      <span class="p">}</span>
-    <span class="p">}</span>
-  <span class="p">}.</span><span class="n">holds</span>
+<span class="w">  </span><span class="c1">// This proof is not well-founded.  Since Stainless doesn&#39;t run the</span>
+<span class="w">  </span><span class="c1">// termination checker by default, it will accept the proof as</span>
+<span class="w">  </span><span class="c1">// valid.</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">allListsAreEmpty</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">xs</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">xs</span><span class="p">.</span><span class="n">isEmpty</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="n">xs</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">        </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">allListsAreEmpty</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span>
+<span class="w">      </span><span class="p">}</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}.</span><span class="n">holds</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -812,7 +811,7 @@ <h3>Limits of the approach: HOFs, quantifiers and termination<a class="headerlin
 </section>
 </section>
 <section id="techniques-for-proving-non-trivial-postconditions">
-<span id="post-cond"></span><h2>Techniques for proving non-trivial postconditions<a class="headerlink" href="#techniques-for-proving-non-trivial-postconditions" title="Permalink to this headline">¶</a></h2>
+<span id="post-cond"></span><h2>Techniques for proving non-trivial postconditions<a class="headerlink" href="#techniques-for-proving-non-trivial-postconditions" title="Link to this heading">¶</a></h2>
 <p>When proving a mathematical lemma, the return type of the
 corresponding function is most of
 the time, if not always, <code class="docutils literal notranslate"><span class="pre">Boolean</span></code>. For those proofs it is rather easy to
@@ -821,46 +820,46 @@ <h3>Limits of the approach: HOFs, quantifiers and termination<a class="headerlin
 the addition of rational numbers, we are no longer dealing with <code class="docutils literal notranslate"><span class="pre">Boolean</span></code> so
 we need a strategy to properly write <code class="docutils literal notranslate"><span class="pre">ensuring</span></code> statements.</p>
 <section id="rationals-a-simple-example">
-<h3>Rationals: a simple example<a class="headerlink" href="#rationals-a-simple-example" title="Permalink to this headline">¶</a></h3>
+<h3>Rationals: a simple example<a class="headerlink" href="#rationals-a-simple-example" title="Link to this heading">¶</a></h3>
 <p>Let’s take rational numbers as an example: we define them as a case class with
 two attributes, <cite>n</cite> for the numerator and <cite>d</cite> for the denominator. We also
 define three simple properties on them: <code class="docutils literal notranslate"><span class="pre">isRational</span></code>, <code class="docutils literal notranslate"><span class="pre">isNonZero</span></code> and
 <code class="docutils literal notranslate"><span class="pre">isPositive</span></code>.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">Rational</span><span class="p">(</span><span class="n">n</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">d</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">isRational</span> <span class="o">=</span> <span class="n">d</span> <span class="o">!=</span> <span class="mi">0</span>
-  <span class="k">def</span> <span class="nf">isPositive</span> <span class="o">=</span> <span class="n">isRational</span> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="n">n</span> <span class="o">*</span> <span class="n">d</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="k">def</span> <span class="nf">isNonZero</span>  <span class="o">=</span> <span class="n">isRational</span> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="n">n</span> <span class="o">!=</span> <span class="mi">0</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Rational</span><span class="p">(</span><span class="n">n</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">d</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">isRational</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">isPositive</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">isRational</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">isNonZero</span><span class="w">  </span><span class="o">=</span><span class="w"> </span><span class="n">isRational</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
 
-  <span class="c1">// ...</span>
+<span class="w">  </span><span class="c1">// ...</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>And on top of that, we want to support addition on <code class="docutils literal notranslate"><span class="pre">Rational</span></code> in a way that
 the rationality and positiveness properties are correctly preserved:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">+</span><span class="p">(</span><span class="n">that</span><span class="p">:</span> <span class="nc">Rational</span><span class="p">):</span> <span class="nc">Rational</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">isRational</span> <span class="o">&amp;&amp;</span> <span class="n">that</span><span class="p">.</span><span class="n">isRational</span><span class="p">)</span>
-  <span class="nc">Rational</span><span class="p">(</span><span class="n">n</span> <span class="o">*</span> <span class="n">that</span><span class="p">.</span><span class="n">d</span> <span class="o">+</span> <span class="n">that</span><span class="p">.</span><span class="n">n</span> <span class="o">*</span> <span class="n">d</span><span class="p">,</span> <span class="n">d</span> <span class="o">*</span> <span class="n">that</span><span class="p">.</span><span class="n">d</span><span class="p">)</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span>
-  <span class="n">res</span><span class="p">.</span><span class="n">isRational</span> <span class="o">&amp;&amp;</span>
-  <span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">isPositive</span> <span class="o">==</span> <span class="n">that</span><span class="p">.</span><span class="n">isPositive</span> <span class="o">==&gt;</span> <span class="n">res</span><span class="p">.</span><span class="n">isPositive</span> <span class="o">==</span> <span class="bp">this</span><span class="p">.</span><span class="n">isPositive</span><span class="p">)</span>
-<span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">+</span><span class="p">(</span><span class="n">that</span><span class="p">:</span><span class="w"> </span><span class="nc">Rational</span><span class="p">):</span><span class="w"> </span><span class="nc">Rational</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="n">isRational</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">that</span><span class="p">.</span><span class="n">isRational</span><span class="p">)</span>
+<span class="w">   </span><span class="nc">Rational</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">that</span><span class="p">.</span><span class="n">d</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">that</span><span class="p">.</span><span class="n">n</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">d</span><span class="p">,</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">that</span><span class="p">.</span><span class="n">d</span><span class="p">)</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">   </span><span class="n">res</span><span class="p">.</span><span class="n">isRational</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">   </span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">isPositive</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">that</span><span class="p">.</span><span class="n">isPositive</span><span class="w"> </span><span class="o">==&gt;</span><span class="w"> </span><span class="n">res</span><span class="p">.</span><span class="n">isPositive</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">isPositive</span><span class="p">)</span>
+<span class="w"> </span><span class="p">}</span>
 </pre></div>
 </div>
 <p>In this simple case, things work nicely and we can write the
 multiplication in a similar fashion:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">*</span><span class="p">(</span><span class="n">that</span><span class="p">:</span> <span class="nc">Rational</span><span class="p">):</span> <span class="nc">Rational</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">isRational</span> <span class="o">&amp;&amp;</span> <span class="n">that</span><span class="p">.</span><span class="n">isRational</span><span class="p">)</span>
-  <span class="nc">Rational</span><span class="p">(</span><span class="n">n</span> <span class="o">*</span> <span class="n">that</span><span class="p">.</span><span class="n">n</span><span class="p">,</span> <span class="n">d</span> <span class="o">*</span> <span class="n">that</span><span class="p">.</span><span class="n">d</span><span class="p">)</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span>
-  <span class="n">res</span><span class="p">.</span><span class="n">isRational</span> <span class="o">&amp;&amp;</span>
-  <span class="p">(</span><span class="n">res</span><span class="p">.</span><span class="n">isNonZero</span>  <span class="o">==</span> <span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">isNonZero</span> <span class="o">&amp;&amp;</span> <span class="n">that</span><span class="p">.</span><span class="n">isNonZero</span><span class="p">))</span> <span class="o">&amp;&amp;</span>
-  <span class="p">(</span><span class="n">res</span><span class="p">.</span><span class="n">isPositive</span> <span class="o">==</span> <span class="p">(</span><span class="o">!</span><span class="n">res</span><span class="p">.</span><span class="n">isNonZero</span> <span class="o">||</span> <span class="bp">this</span><span class="p">.</span><span class="n">isPositive</span> <span class="o">==</span> <span class="n">that</span><span class="p">.</span><span class="n">isPositive</span><span class="p">))</span>
-<span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">*</span><span class="p">(</span><span class="n">that</span><span class="p">:</span><span class="w"> </span><span class="nc">Rational</span><span class="p">):</span><span class="w"> </span><span class="nc">Rational</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="n">isRational</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">that</span><span class="p">.</span><span class="n">isRational</span><span class="p">)</span>
+<span class="w">   </span><span class="nc">Rational</span><span class="p">(</span><span class="n">n</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">that</span><span class="p">.</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">that</span><span class="p">.</span><span class="n">d</span><span class="p">)</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">   </span><span class="n">res</span><span class="p">.</span><span class="n">isRational</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">   </span><span class="p">(</span><span class="n">res</span><span class="p">.</span><span class="n">isNonZero</span><span class="w">  </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="bp">this</span><span class="p">.</span><span class="n">isNonZero</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">that</span><span class="p">.</span><span class="n">isNonZero</span><span class="p">))</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">   </span><span class="p">(</span><span class="n">res</span><span class="p">.</span><span class="n">isPositive</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="o">!</span><span class="n">res</span><span class="p">.</span><span class="n">isNonZero</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="bp">this</span><span class="p">.</span><span class="n">isPositive</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">that</span><span class="p">.</span><span class="n">isPositive</span><span class="p">))</span>
+<span class="w"> </span><span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="measures-a-slightly-more-complex-example">
-<h3>Measures: a slightly more complex example<a class="headerlink" href="#measures-a-slightly-more-complex-example" title="Permalink to this headline">¶</a></h3>
+<h3>Measures: a slightly more complex example<a class="headerlink" href="#measures-a-slightly-more-complex-example" title="Link to this heading">¶</a></h3>
 <p>Now let’s look at a slightly more complex example: measures on
 discrete probability spaces.  We represent such measures using a
 <code class="docutils literal notranslate"><span class="pre">List</span></code>-like recursive data structure: a generic abstract class
@@ -878,26 +877,26 @@ <h3>Measures: a slightly more complex example<a class="headerlink" href="#measur
 which recursively checks that all the weights in a measure are
 positive rationals (note that all our measures have finite support).</p>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="cm">/** Measures on discrete probability spaces. */</span>
-<span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="p">{</span>
+<span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
 
-  <span class="cm">/** All weights must be positive. */</span>
-  <span class="k">def</span> <span class="nf">isMeasure</span><span class="p">:</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="bp">this</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Empty</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="kc">true</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">w</span><span class="p">,</span> <span class="n">m</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">w</span><span class="p">.</span><span class="n">isPositive</span> <span class="o">&amp;&amp;</span> <span class="n">m</span><span class="p">.</span><span class="n">isMeasure</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="cm">/** All weights must be positive. */</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">isMeasure</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="bp">this</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Empty</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">w</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">w</span><span class="p">.</span><span class="n">isPositive</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">m</span><span class="p">.</span><span class="n">isMeasure</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="c1">// ...</span>
+<span class="w">  </span><span class="c1">// ...</span>
 <span class="p">}</span>
 
 <span class="cm">/** The empty measure maps every subset of the space A to 0. */</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Empty</span><span class="p">[</span><span class="nc">A</span><span class="p">]()</span> <span class="k">extends</span> <span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Empty</span><span class="p">[</span><span class="nc">A</span><span class="p">]()</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span>
 
 <span class="cm">/**</span>
 <span class="cm"> * The &#39;Cons&#39; measure adjoins an additional element &#39;x&#39; of type &#39;A&#39;</span>
 <span class="cm"> * to an existing measure &#39;m&#39; over &#39;A&#39;.  Note that &#39;x&#39; might already</span>
 <span class="cm"> * be present in &#39;m&#39;.</span>
 <span class="cm"> */</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Cons</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">,</span> <span class="n">w</span><span class="p">:</span> <span class="nc">Rational</span><span class="p">,</span> <span class="n">m</span><span class="p">:</span> <span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">])</span> <span class="k">extends</span> <span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Cons</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="n">w</span><span class="p">:</span><span class="w"> </span><span class="nc">Rational</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">:</span><span class="w"> </span><span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">])</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span>
 </pre></div>
 </div>
 <p>The defining operation on a measure <code class="docutils literal notranslate"><span class="pre">m</span></code> is its evaluation <code class="docutils literal notranslate"><span class="pre">m(xs)</span></code>
@@ -909,21 +908,21 @@ <h3>Measures: a slightly more complex example<a class="headerlink" href="#measur
 to verify this postcondition.</p>
 <p>We can provide the necessary hint to Stainless by performing structural
 induction on <code class="docutils literal notranslate"><span class="pre">this</span></code> inside the postcondition as follows:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="cm">/** Compute the value of this measure on a subset of the space &#39;A&#39;. */</span>
-<span class="k">def</span> <span class="nf">apply</span><span class="p">(</span><span class="n">xs</span><span class="p">:</span> <span class="nc">Set</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span> <span class="nc">Rational</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span> <span class="p">(</span><span class="n">isMeasure</span><span class="p">)</span>
-  <span class="bp">this</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Empty</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="nc">Rational</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">)</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">w</span><span class="p">,</span> <span class="n">m</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="k">if</span> <span class="p">(</span><span class="n">xs</span> <span class="n">contains</span> <span class="n">x</span><span class="p">)</span> <span class="n">w</span> <span class="o">+</span> <span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span> <span class="k">else</span> <span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
-  <span class="p">}</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span>
-  <span class="n">res</span><span class="p">.</span><span class="n">isPositive</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="bp">this</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Empty</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="n">trivial</span>
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">w</span><span class="p">,</span> <span class="n">m</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">).</span><span class="n">isPositive</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
-<span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="cm">/** Compute the value of this measure on a subset of the space &#39;A&#39;. */</span>
+<span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">apply</span><span class="p">(</span><span class="n">xs</span><span class="p">:</span><span class="w"> </span><span class="nc">Set</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span><span class="w"> </span><span class="nc">Rational</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="w"> </span><span class="p">(</span><span class="n">isMeasure</span><span class="p">)</span>
+<span class="w">   </span><span class="bp">this</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Empty</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Rational</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">w</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="n">contains</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="n">w</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>
+<span class="w">   </span><span class="p">}</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">   </span><span class="n">res</span><span class="p">.</span><span class="n">isPositive</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">     </span><span class="bp">this</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">       </span><span class="k">case</span><span class="w"> </span><span class="nc">Empty</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">       </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">w</span><span class="p">,</span><span class="w"> </span><span class="n">m</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">).</span><span class="n">isPositive</span>
+<span class="w">     </span><span class="p">}</span>
+<span class="w">   </span><span class="p">}</span>
+<span class="w"> </span><span class="p">}</span>
 </pre></div>
 </div>
 <p>Notice the similarity between the pattern match in the body of the
@@ -932,21 +931,21 @@ <h3>Measures: a slightly more complex example<a class="headerlink" href="#measur
 </section>
 </section>
 <section id="a-complex-example-additivity-of-measures">
-<h2>A complex example: additivity of measures<a class="headerlink" href="#a-complex-example-additivity-of-measures" title="Permalink to this headline">¶</a></h2>
+<h2>A complex example: additivity of measures<a class="headerlink" href="#a-complex-example-additivity-of-measures" title="Link to this heading">¶</a></h2>
 <p>Using the principles and techniques discussed so far, one can prove
 quite advanced propositions using Stainless.  Returning to the
 measure-theoretic example from the previous section, we would like to
 prove that our implementation of measures is properly <em>additive</em>.
 Formally, a measure <span class="math notranslate nohighlight">\(\mu \colon A \to \mathbb{R}\)</span> on a countable
 set <span class="math notranslate nohighlight">\(A\)</span> must fulfill the following additivity property
-<a class="footnote-reference brackets" href="#dicrete-meas" id="id4">3</a>:</p>
+<a class="footnote-reference brackets" href="#dicrete-meas" id="id4" role="doc-noteref"><span class="fn-bracket">[</span>3<span class="fn-bracket">]</span></a>:</p>
 <div class="math notranslate nohighlight">
 \[\forall A_1, A_2 \subseteq A . A_1 \cap A_2 = \emptyset \Rightarrow
 \mu(A_1 \cup A_2) = \mu(A_1) + \mu(A_2)\]</div>
 <p>which we can express in Stainless as</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">additivity</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">m</span><span class="p">:</span> <span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span> <span class="n">xs</span><span class="p">:</span> <span class="nc">Set</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span> <span class="n">ys</span><span class="p">:</span> <span class="nc">Set</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">m</span><span class="p">.</span><span class="n">isMeasure</span> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="n">xs</span> <span class="n">&amp;</span> <span class="n">ys</span><span class="p">).</span><span class="n">isEmpty</span><span class="p">)</span>
-  <span class="n">m</span><span class="p">(</span><span class="n">xs</span> <span class="o">++</span> <span class="n">ys</span><span class="p">)</span> <span class="o">==</span> <span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span> <span class="o">+</span> <span class="n">m</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">additivity</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">m</span><span class="p">:</span><span class="w"> </span><span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span><span class="w"> </span><span class="n">xs</span><span class="p">:</span><span class="w"> </span><span class="nc">Set</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span><span class="w"> </span><span class="n">ys</span><span class="p">:</span><span class="w"> </span><span class="nc">Set</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">m</span><span class="p">.</span><span class="n">isMeasure</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="n">&amp;</span><span class="w"> </span><span class="n">ys</span><span class="p">).</span><span class="n">isEmpty</span><span class="p">)</span>
+<span class="w">  </span><span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">ys</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">m</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
@@ -954,39 +953,39 @@ <h2>A complex example: additivity of measures<a class="headerlink" href="#a-comp
 <code class="docutils literal notranslate"><span class="pre">m</span></code>, case analysis on the parameters <code class="docutils literal notranslate"><span class="pre">xs</span></code> and <code class="docutils literal notranslate"><span class="pre">ys</span></code>, equational
 reasoning, and properties of rational numbers (in the form of
 user-defined lemmas) as well as sets (using Stainless’s built-in support).</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">additivity</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">m</span><span class="p">:</span> <span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span> <span class="n">xs</span><span class="p">:</span> <span class="nc">Set</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span> <span class="n">ys</span><span class="p">:</span> <span class="nc">Set</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">m</span><span class="p">.</span><span class="n">isMeasure</span> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="n">xs</span> <span class="n">&amp;</span> <span class="n">ys</span><span class="p">).</span><span class="n">isEmpty</span><span class="p">)</span>
-  <span class="n">m</span><span class="p">(</span><span class="n">xs</span> <span class="o">++</span> <span class="n">ys</span><span class="p">)</span> <span class="o">==</span> <span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span> <span class="o">+</span> <span class="n">m</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span> <span class="n">because</span> <span class="p">{</span>
-    <span class="n">m</span> <span class="k">match</span> <span class="p">{</span>
-      <span class="k">case</span> <span class="nc">Empty</span><span class="p">()</span>       <span class="o">=&gt;</span> <span class="n">trivial</span>
-      <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">w</span><span class="p">,</span> <span class="n">n</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="k">if</span> <span class="p">(</span><span class="n">xs</span> <span class="n">contains</span> <span class="n">x</span><span class="p">)</span> <span class="p">{</span>
-        <span class="n">w</span> <span class="o">+</span> <span class="n">n</span><span class="p">(</span><span class="n">xs</span> <span class="o">++</span> <span class="n">ys</span><span class="p">)</span>     <span class="o">==|</span> <span class="n">additivity</span><span class="p">(</span><span class="n">n</span><span class="p">,</span> <span class="n">xs</span><span class="p">,</span> <span class="n">ys</span><span class="p">)</span>        <span class="o">|</span>
-        <span class="n">w</span> <span class="o">+</span> <span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span> <span class="o">+</span> <span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">))</span> <span class="o">==|</span> <span class="n">plusAssoc</span><span class="p">(</span><span class="n">w</span><span class="p">,</span> <span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">),</span> <span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">))</span>   <span class="o">|</span>
-        <span class="p">(</span><span class="n">w</span> <span class="o">+</span> <span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">))</span> <span class="o">+</span> <span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span> <span class="o">==|</span> <span class="o">!</span><span class="p">(</span><span class="n">ys</span> <span class="n">contains</span> <span class="n">x</span><span class="p">)</span>             <span class="o">|</span>
-        <span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span>       <span class="o">+</span> <span class="n">m</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span>
-      <span class="p">}.</span><span class="n">qed</span> <span class="k">else</span> <span class="k">if</span> <span class="p">(</span><span class="n">ys</span> <span class="n">contains</span> <span class="n">x</span><span class="p">)</span> <span class="p">{</span>
-        <span class="n">w</span> <span class="o">+</span> <span class="n">n</span><span class="p">(</span><span class="n">xs</span> <span class="o">++</span> <span class="n">ys</span><span class="p">)</span>     <span class="o">==|</span> <span class="n">additivity</span><span class="p">(</span><span class="n">n</span><span class="p">,</span> <span class="n">xs</span><span class="p">,</span> <span class="n">ys</span><span class="p">)</span>        <span class="o">|</span>
-        <span class="n">w</span> <span class="o">+</span> <span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span> <span class="o">+</span> <span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">))</span> <span class="o">==|</span> <span class="n">plusComm</span><span class="p">(</span><span class="n">w</span><span class="p">,</span> <span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span> <span class="o">+</span> <span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">)))</span> <span class="o">|</span>
-        <span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span> <span class="o">+</span> <span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">))</span> <span class="o">+</span> <span class="n">w</span> <span class="o">==|</span> <span class="n">plusAssoc</span><span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">),</span> <span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">),</span> <span class="n">w</span><span class="p">)</span>   <span class="o">|</span>
-        <span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span> <span class="o">+</span> <span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span> <span class="o">+</span> <span class="n">w</span><span class="p">)</span> <span class="o">==|</span> <span class="n">plusComm</span><span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">),</span> <span class="n">w</span><span class="p">)</span>           <span class="o">|</span>
-        <span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span> <span class="o">+</span> <span class="p">(</span><span class="n">w</span> <span class="o">+</span> <span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">))</span> <span class="o">==|</span> <span class="o">!</span><span class="p">(</span><span class="n">xs</span> <span class="n">contains</span> <span class="n">x</span><span class="p">)</span>             <span class="o">|</span>
-        <span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span> <span class="o">+</span> <span class="n">m</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span>
-      <span class="p">}.</span><span class="n">qed</span> <span class="k">else</span> <span class="p">{</span>
-        <span class="n">n</span><span class="p">(</span><span class="n">xs</span> <span class="o">++</span> <span class="n">ys</span><span class="p">)</span>         <span class="o">==|</span> <span class="n">additivity</span><span class="p">(</span><span class="n">n</span><span class="p">,</span> <span class="n">xs</span><span class="p">,</span> <span class="n">ys</span><span class="p">)</span>        <span class="o">|</span>
-        <span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span> <span class="o">+</span> <span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span>
-      <span class="p">}.</span><span class="n">qed</span>
-    <span class="p">}</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">additivity</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">m</span><span class="p">:</span><span class="w"> </span><span class="nc">Meas</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span><span class="w"> </span><span class="n">xs</span><span class="p">:</span><span class="w"> </span><span class="nc">Set</span><span class="p">[</span><span class="nc">A</span><span class="p">],</span><span class="w"> </span><span class="n">ys</span><span class="p">:</span><span class="w"> </span><span class="nc">Set</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">m</span><span class="p">.</span><span class="n">isMeasure</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="n">&amp;</span><span class="w"> </span><span class="n">ys</span><span class="p">).</span><span class="n">isEmpty</span><span class="p">)</span>
+<span class="w">  </span><span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">ys</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">m</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span><span class="w"> </span><span class="n">because</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">m</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Empty</span><span class="p">()</span><span class="w">       </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">trivial</span>
+<span class="w">      </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">w</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="n">contains</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="n">w</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">ys</span><span class="p">)</span><span class="w">     </span><span class="o">==|</span><span class="w"> </span><span class="n">additivity</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">ys</span><span class="p">)</span><span class="w">        </span><span class="o">|</span>
+<span class="w">        </span><span class="n">w</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">))</span><span class="w"> </span><span class="o">==|</span><span class="w"> </span><span class="n">plusAssoc</span><span class="p">(</span><span class="n">w</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">),</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">))</span><span class="w">   </span><span class="o">|</span>
+<span class="w">        </span><span class="p">(</span><span class="n">w</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">))</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span><span class="w"> </span><span class="o">==|</span><span class="w"> </span><span class="o">!</span><span class="p">(</span><span class="n">ys</span><span class="w"> </span><span class="n">contains</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w">             </span><span class="o">|</span>
+<span class="w">        </span><span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w">       </span><span class="o">+</span><span class="w"> </span><span class="n">m</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span>
+<span class="w">      </span><span class="p">}.</span><span class="n">qed</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">ys</span><span class="w"> </span><span class="n">contains</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="n">w</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">ys</span><span class="p">)</span><span class="w">     </span><span class="o">==|</span><span class="w"> </span><span class="n">additivity</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">ys</span><span class="p">)</span><span class="w">        </span><span class="o">|</span>
+<span class="w">        </span><span class="n">w</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">))</span><span class="w"> </span><span class="o">==|</span><span class="w"> </span><span class="n">plusComm</span><span class="p">(</span><span class="n">w</span><span class="p">,</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">)))</span><span class="w"> </span><span class="o">|</span>
+<span class="w">        </span><span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">))</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">w</span><span class="w"> </span><span class="o">==|</span><span class="w"> </span><span class="n">plusAssoc</span><span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">),</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">),</span><span class="w"> </span><span class="n">w</span><span class="p">)</span><span class="w">   </span><span class="o">|</span>
+<span class="w">        </span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">w</span><span class="p">)</span><span class="w"> </span><span class="o">==|</span><span class="w"> </span><span class="n">plusComm</span><span class="p">(</span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">),</span><span class="w"> </span><span class="n">w</span><span class="p">)</span><span class="w">           </span><span class="o">|</span>
+<span class="w">        </span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">w</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">))</span><span class="w"> </span><span class="o">==|</span><span class="w"> </span><span class="o">!</span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="n">contains</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="w">             </span><span class="o">|</span>
+<span class="w">        </span><span class="n">m</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">m</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span>
+<span class="w">      </span><span class="p">}.</span><span class="n">qed</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="p">{</span>
+<span class="w">        </span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">ys</span><span class="p">)</span><span class="w">         </span><span class="o">==|</span><span class="w"> </span><span class="n">additivity</span><span class="p">(</span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">,</span><span class="w"> </span><span class="n">ys</span><span class="p">)</span><span class="w">        </span><span class="o">|</span>
+<span class="w">        </span><span class="n">n</span><span class="p">(</span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">n</span><span class="p">(</span><span class="n">ys</span><span class="p">)</span>
+<span class="w">      </span><span class="p">}.</span><span class="n">qed</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}.</span><span class="n">holds</span>
 </pre></div>
 </div>
 <p>The full proof (including the proofs of all helper lemmas) as well as
 its generalization to <em>sub-additivity</em> can be found in the
 <code class="docutils literal notranslate"><span class="pre">testcases/verification/proof/measure/</span></code> directory of the Stainless
-distribution <a class="footnote-reference brackets" href="#example-dir" id="id5">1</a>.</p>
+distribution <a class="footnote-reference brackets" href="#example-dir" id="id5" role="doc-noteref"><span class="fn-bracket">[</span>1<span class="fn-bracket">]</span></a>.</p>
 </section>
 <section id="quick-recap">
-<h2>Quick Recap<a class="headerlink" href="#quick-recap" title="Permalink to this headline">¶</a></h2>
+<h2>Quick Recap<a class="headerlink" href="#quick-recap" title="Link to this heading">¶</a></h2>
 <p>Let’s summarize what we’ve learned here. To write proofs efficiently,
 it’s good to keep the following in mind:</p>
 <ol class="arabic">
@@ -1010,35 +1009,38 @@ <h2>Quick Recap<a class="headerlink" href="#quick-recap" title="Permalink to thi
 </li>
 </ol>
 <p class="rubric">Footnotes</p>
-<dl class="footnote brackets">
-<dt class="label" id="example-dir"><span class="brackets">1</span><span class="fn-backref">(<a href="#id1">1</a>,<a href="#id5">2</a>)</span></dt>
-<dd><p>The source code of this example and all others in
+<aside class="footnote-list brackets">
+<aside class="footnote brackets" id="example-dir" role="doc-footnote">
+<span class="label"><span class="fn-bracket">[</span>1<span class="fn-bracket">]</span></span>
+<span class="backrefs">(<a role="doc-backlink" href="#id1">1</a>,<a role="doc-backlink" href="#id5">2</a>)</span>
+<p>The source code of this example and all others in
 this chapter is included in the Stainless distribution.  Examples about
 lists can be found in <code class="docutils literal notranslate"><span class="pre">library/collection/List.scala</span></code>, other
 examples are located in the <code class="docutils literal notranslate"><span class="pre">testcases/verification/proof/</span></code>
 directory.</p>
-</dd>
-<dt class="label" id="props-not-types"><span class="brackets"><a class="fn-backref" href="#id2">2</a></span></dt>
-<dd><p>Propositions and proofs
+</aside>
+<aside class="footnote brackets" id="props-not-types" role="doc-footnote">
+<span class="label"><span class="fn-bracket">[</span><a role="doc-backlink" href="#id2">2</a><span class="fn-bracket">]</span></span>
+<p>Propositions and proofs
 live in the same universe in Stainless.  This is contrary to
 e.g. type-theoretic proof assistants where propositions are
 represented by types and proofs are terms inhabiting such types.</p>
-</dd>
-<dt class="label" id="dicrete-meas"><span class="brackets"><a class="fn-backref" href="#id4">3</a></span></dt>
-<dd><p>To be precise, we are assuming here the underlying
+</aside>
+<aside class="footnote brackets" id="dicrete-meas" role="doc-footnote">
+<span class="label"><span class="fn-bracket">[</span><a role="doc-backlink" href="#id4">3</a><span class="fn-bracket">]</span></span>
+<p>To be precise, we are assuming here the underlying
 measurable space <span class="math notranslate nohighlight">\((A, \mathcal{P}(A))\)</span>, where <span class="math notranslate nohighlight">\(A\)</span> is
 countable and <span class="math notranslate nohighlight">\(\mathcal{P}(A)\)</span> denotes its discrete σ-algebra
 (i.e. the power set of <span class="math notranslate nohighlight">\(A\)</span>).</p>
-</dd>
-</dl>
+</aside>
+</aside>
 </section>
 </section>
 
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="genc.html" class="btn btn-neutral float-left" title="Generating C Code" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="limitations.html" class="btn btn-neutral float-right" title="Limitations of Verification" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -1047,7 +1049,7 @@ <h2>Quick Recap<a class="headerlink" href="#quick-recap" title="Permalink to thi
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -1058,7 +1060,7 @@ <h2>Quick Recap<a class="headerlink" href="#quick-recap" title="Permalink to thi
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/options.html b/options.html
index 943e372500..a947e61ea8 100644
--- a/options.html
+++ b/options.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Specifying Options &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Verification conditions" href="verification.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -90,20 +92,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Specifying Options</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Specifying Options</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/options.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -114,7 +113,7 @@
            <div itemprop="articleBody">
              
   <section id="specifying-options">
-<span id="cmdlineoptions"></span><h1>Specifying Options<a class="headerlink" href="#specifying-options" title="Permalink to this headline">¶</a></h1>
+<span id="cmdlineoptions"></span><h1>Specifying Options<a class="headerlink" href="#specifying-options" title="Link to this heading">¶</a></h1>
 <p>Stainless’s command line options have the form <code class="docutils literal notranslate"><span class="pre">--option</span></code> or <code class="docutils literal notranslate"><span class="pre">--option=value</span></code>.
 To enable a flag option, use <code class="docutils literal notranslate"><span class="pre">--option=true</span></code> or <code class="docutils literal notranslate"><span class="pre">on</span></code> or <code class="docutils literal notranslate"><span class="pre">yes</span></code>,
 or just <code class="docutils literal notranslate"><span class="pre">--option</span></code>. To disable a flag option, use <code class="docutils literal notranslate"><span class="pre">--option=false</span></code>.</p>
@@ -123,7 +122,7 @@
 <p>The rest of this section presents some of the command-line options that Stainless recognizes.
 For a short (but always up-to-date) summary, you can also invoke <code class="docutils literal notranslate"><span class="pre">stainless</span> <span class="pre">--help</span></code>.</p>
 <section id="choosing-which-stainless-feature-to-use">
-<h2>Choosing which Stainless feature to use<a class="headerlink" href="#choosing-which-stainless-feature-to-use" title="Permalink to this headline">¶</a></h2>
+<h2>Choosing which Stainless feature to use<a class="headerlink" href="#choosing-which-stainless-feature-to-use" title="Link to this heading">¶</a></h2>
 <p>The first group of options determines which feature of Stainless will be used.
 By default, <code class="docutils literal notranslate"><span class="pre">--verification</span></code> is chosen.</p>
 <ul>
@@ -164,7 +163,7 @@ <h2>Choosing which Stainless feature to use<a class="headerlink" href="#choosing
 </ul>
 </section>
 <section id="additional-top-level-options">
-<h2>Additional top-level options<a class="headerlink" href="#additional-top-level-options" title="Permalink to this headline">¶</a></h2>
+<h2>Additional top-level options<a class="headerlink" href="#additional-top-level-options" title="Link to this heading">¶</a></h2>
 <p>These options are available to all Stainless components:</p>
 <ul>
 <li><p><code class="docutils literal notranslate"><span class="pre">--watch</span></code></p>
@@ -272,10 +271,10 @@ <h2>Additional top-level options<a class="headerlink" href="#additional-top-leve
 </ul>
 </section>
 <section id="additional-options-by-component">
-<h2>Additional Options (by component)<a class="headerlink" href="#additional-options-by-component" title="Permalink to this headline">¶</a></h2>
+<h2>Additional Options (by component)<a class="headerlink" href="#additional-options-by-component" title="Link to this heading">¶</a></h2>
 <p>The following options relate to specific components in Stainless.</p>
 <section id="verification">
-<h3>Verification<a class="headerlink" href="#verification" title="Permalink to this headline">¶</a></h3>
+<h3>Verification<a class="headerlink" href="#verification" title="Link to this heading">¶</a></h3>
 <ul>
 <li><p><code class="docutils literal notranslate"><span class="pre">--strict-aritmetic</span></code></p>
 <p>Check arithmetic operations for unintended behaviour and
@@ -296,7 +295,7 @@ <h3>Verification<a class="headerlink" href="#verification" title="Permalink to t
 </ul>
 </section>
 <section id="termination">
-<h3>Termination<a class="headerlink" href="#termination" title="Permalink to this headline">¶</a></h3>
+<h3>Termination<a class="headerlink" href="#termination" title="Link to this heading">¶</a></h3>
 <ul>
 <li><p><code class="docutils literal notranslate"><span class="pre">--ignore-posts</span></code></p>
 <p>Ignore postconditions during termination verification.</p>
@@ -304,7 +303,7 @@ <h3>Termination<a class="headerlink" href="#termination" title="Permalink to thi
 </ul>
 </section>
 <section id="unrolling-solver">
-<h3>Unrolling Solver<a class="headerlink" href="#unrolling-solver" title="Permalink to this headline">¶</a></h3>
+<h3>Unrolling Solver<a class="headerlink" href="#unrolling-solver" title="Link to this heading">¶</a></h3>
 <ul>
 <li><p><code class="docutils literal notranslate"><span class="pre">--check-models</span></code></p>
 <p>Double-check counterexamples with the evaluator.</p>
@@ -331,7 +330,7 @@ <h3>Unrolling Solver<a class="headerlink" href="#unrolling-solver" title="Permal
 </ul>
 </section>
 <section id="cvc5-solver">
-<h3>cvc5 Solver<a class="headerlink" href="#cvc5-solver" title="Permalink to this headline">¶</a></h3>
+<h3>cvc5 Solver<a class="headerlink" href="#cvc5-solver" title="Link to this heading">¶</a></h3>
 <ul>
 <li><p><code class="docutils literal notranslate"><span class="pre">--solver:cvc5=&lt;cvc5-opt&gt;</span></code></p>
 <p>Pass extra command-line arguments to cvc5.</p>
@@ -339,7 +338,7 @@ <h3>cvc5 Solver<a class="headerlink" href="#cvc5-solver" title="Permalink to thi
 </ul>
 </section>
 <section id="evaluators">
-<h3>Evaluators<a class="headerlink" href="#evaluators" title="Permalink to this headline">¶</a></h3>
+<h3>Evaluators<a class="headerlink" href="#evaluators" title="Link to this heading">¶</a></h3>
 <ul>
 <li><p><code class="docutils literal notranslate"><span class="pre">--codegen</span></code></p>
 <p>Use compiled evaluator instead of an interpreter.</p>
@@ -359,7 +358,7 @@ <h3>Evaluators<a class="headerlink" href="#evaluators" title="Permalink to this
 </ul>
 </section>
 <section id="tests-generation">
-<h3>Tests generation<a class="headerlink" href="#tests-generation" title="Permalink to this headline">¶</a></h3>
+<h3>Tests generation<a class="headerlink" href="#tests-generation" title="Link to this heading">¶</a></h3>
 <ul>
 <li><p><code class="docutils literal notranslate"><span class="pre">testgen-file=&lt;file&gt;</span></code></p>
 <p>Specifies the output file for the generated tests.</p>
@@ -371,7 +370,7 @@ <h3>Tests generation<a class="headerlink" href="#tests-generation" title="Permal
 </section>
 </section>
 <section id="configuration-file">
-<h2>Configuration File<a class="headerlink" href="#configuration-file" title="Permalink to this headline">¶</a></h2>
+<h2>Configuration File<a class="headerlink" href="#configuration-file" title="Link to this heading">¶</a></h2>
 <p>Stainless supports setting default values for command line options configuration files.
 To specify configuration file you can use the option <code class="docutils literal notranslate"><span class="pre">`--config-file=FILE</span></code>. The default is
 <code class="docutils literal notranslate"><span class="pre">stainless.conf</span></code> or <code class="docutils literal notranslate"><span class="pre">.stainless.conf</span></code>. The file should be a valid HOCON file.</p>
@@ -392,9 +391,9 @@ <h2>Configuration File<a class="headerlink" href="#configuration-file" title="Pe
 <cite>b</cite> or <cite>a</cite>, the first of those is going to be loaded.</p>
 </section>
 <section id="library-files">
-<h2>Library Files<a class="headerlink" href="#library-files" title="Permalink to this headline">¶</a></h2>
+<h2>Library Files<a class="headerlink" href="#library-files" title="Link to this heading">¶</a></h2>
 <section id="purpose-of-library-files">
-<h3>Purpose of library files<a class="headerlink" href="#purpose-of-library-files" title="Permalink to this headline">¶</a></h3>
+<h3>Purpose of library files<a class="headerlink" href="#purpose-of-library-files" title="Link to this heading">¶</a></h3>
 <p>Stainless contains library source Scala files that define types and functions that are meant to be always available
 via import statements such as <code class="docutils literal notranslate"><span class="pre">import</span> <span class="pre">stainless.lang._</span></code>, <code class="docutils literal notranslate"><span class="pre">import</span> <span class="pre">stainless.annotation._</span></code>,
 <code class="docutils literal notranslate"><span class="pre">import</span> <span class="pre">stainless.collection._</span></code>, and so on. Many of these types have special treatment inside the extraction
@@ -402,7 +401,7 @@ <h3>Purpose of library files<a class="headerlink" href="#purpose-of-library-file
 At build time, the <code class="docutils literal notranslate"><span class="pre">build.sbt</span></code> script computes the list of these files by traversing the <code class="docutils literal notranslate"><span class="pre">frontends/library/</span></code> directory.</p>
 </section>
 <section id="changing-the-list-of-library-files">
-<h3>Changing the list of library files<a class="headerlink" href="#changing-the-list-of-library-files" title="Permalink to this headline">¶</a></h3>
+<h3>Changing the list of library files<a class="headerlink" href="#changing-the-list-of-library-files" title="Link to this heading">¶</a></h3>
 <p>To support further customization, if at run time stainless finds
 a file <code class="docutils literal notranslate"><span class="pre">libfiles.txt</span></code> in the current directory, it replaces the list of library files files with the list contained
 in this file, one file per line, with paths relative to the directory <code class="docutils literal notranslate"><span class="pre">frontends/library/</span></code>. For example, <code class="docutils literal notranslate"><span class="pre">libfiles.txt</span></code>
@@ -440,8 +439,7 @@ <h3>Changing the list of library files<a class="headerlink" href="#changing-the-
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="tutorial.html" class="btn btn-neutral float-left" title="Tutorial: Sorting" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="verification.html" class="btn btn-neutral float-right" title="Verification conditions" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -450,7 +448,7 @@ <h3>Changing the list of library files<a class="headerlink" href="#changing-the-
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on May 09, 2024.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -461,7 +459,7 @@ <h3>Changing the list of library files<a class="headerlink" href="#changing-the-
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/purescala.html b/purescala.html
index 653b832a37..461936fe3f 100644
--- a/purescala.html
+++ b/purescala.html
@@ -1,24 +1,23 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Pure Scala &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
         <script async="async" src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Stainless Library" href="library.html" />
@@ -30,20 +29,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -120,20 +122,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Pure Scala</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Pure Scala</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/purescala.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -146,7 +145,7 @@
   <blockquote>
 <div></div></blockquote>
 <section id="pure-scala">
-<span id="purescala"></span><h1>Pure Scala<a class="headerlink" href="#pure-scala" title="Permalink to this headline">¶</a></h1>
+<span id="purescala"></span><h1>Pure Scala<a class="headerlink" href="#pure-scala" title="Link to this heading">¶</a></h1>
 <p>The input to Stainless is a purely functional <strong>subset</strong> of <a class="reference external" href="http://www.scala-lang.org/">Scala</a>, which we call
 <strong>Pure Scala</strong>. Constructs specific for Stainless are defined inside
 Stainless’s libraries in package <cite>stainless</cite> and its subpackages.
@@ -158,25 +157,25 @@
 <li><p>Algebraic Data Type (ADT) definitions in the form of an
 abstract class and case classes/objects</p></li>
 </ol>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">MyList</span>
-<span class="k">case</span> <span class="k">object</span> <span class="nc">MyEmpty</span> <span class="k">extends</span> <span class="nc">MyList</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">MyCons</span><span class="p">(</span><span class="n">elem</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">rest</span><span class="p">:</span> <span class="nc">MyList</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">MyList</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">MyList</span>
+<span class="k">case</span><span class="w"> </span><span class="k">object</span><span class="w"> </span><span class="nc">MyEmpty</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">MyList</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">MyCons</span><span class="p">(</span><span class="n">elem</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">rest</span><span class="p">:</span><span class="w"> </span><span class="nc">MyList</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">MyList</span>
 </pre></div>
 </div>
 <ol class="arabic simple" start="2">
 <li><p>Objects/modules, for grouping classes and functions</p></li>
 </ol>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span> <span class="nc">Specs</span> <span class="p">{</span>
-   <span class="k">def</span> <span class="nf">increment</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">{</span>
-      <span class="n">a</span> <span class="o">+</span> <span class="mi">1</span>
-   <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span><span class="w"> </span><span class="nc">Specs</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="k">def</span><span class="w"> </span><span class="nf">increment</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="n">a</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">   </span><span class="p">}</span>
 
-   <span class="k">case</span> <span class="k">class</span> <span class="nc">Identifier</span><span class="p">(</span><span class="n">id</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span>
+<span class="w">   </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Identifier</span><span class="p">(</span><span class="n">id</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <section id="booleans">
-<h2>Booleans<a class="headerlink" href="#booleans" title="Permalink to this headline">¶</a></h2>
+<h2>Booleans<a class="headerlink" href="#booleans" title="Link to this heading">¶</a></h2>
 <p>Booleans are used to express truth conditions in Stainless.
 Unlike some proof assistants, there is no separation
 at the type level between
@@ -186,20 +185,20 @@ <h2>Booleans<a class="headerlink" href="#booleans" title="Permalink to this head
 notation, along
 with a new shorthand for implication. The <cite>if</cite> expression
 is also present.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">a</span> <span class="o">&amp;&amp;</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">||</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">==</span> <span class="n">b</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">a</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">b</span>
 <span class="o">!</span><span class="n">a</span>
-<span class="n">a</span> <span class="o">==&gt;</span> <span class="n">b</span> <span class="c1">// Stainless syntax for boolean implication</span>
+<span class="n">a</span><span class="w"> </span><span class="o">==&gt;</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="c1">// Stainless syntax for boolean implication</span>
 </pre></div>
 </div>
 <p>Stainless uses short-circuit interpretation of <cite>&amp;&amp;</cite>, <cite>||</cite>, and <cite>==&gt;</cite>,
 which evaluates the second argument only when needed:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">a</span> <span class="o">&amp;&amp;</span> <span class="n">b</span>  <span class="o">===</span> <span class="k">if</span> <span class="p">(</span><span class="n">a</span><span class="p">)</span> <span class="n">b</span> <span class="k">else</span> <span class="kc">false</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">a</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">b</span><span class="w">  </span><span class="o">===</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="kc">false</span>
 
-<span class="n">a</span> <span class="o">||</span> <span class="n">b</span>  <span class="o">===</span> <span class="k">if</span> <span class="p">(</span><span class="n">a</span><span class="p">)</span> <span class="kc">true</span> <span class="k">else</span> <span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="n">b</span><span class="w">  </span><span class="o">===</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="kc">true</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="n">b</span>
 
-<span class="n">a</span> <span class="o">==&gt;</span> <span class="n">b</span> <span class="o">===</span> <span class="k">if</span> <span class="p">(</span><span class="n">a</span><span class="p">)</span> <span class="n">b</span> <span class="k">else</span> <span class="kc">true</span>
+<span class="n">a</span><span class="w"> </span><span class="o">==&gt;</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">===</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="kc">true</span>
 </pre></div>
 </div>
 <p>This aspect is important because of:</p>
@@ -214,20 +213,20 @@ <h2>Booleans<a class="headerlink" href="#booleans" title="Permalink to this head
 </ol>
 </section>
 <section id="algebraic-data-types">
-<span id="adts"></span><h2>Algebraic Data Types<a class="headerlink" href="#algebraic-data-types" title="Permalink to this headline">¶</a></h2>
+<span id="adts"></span><h2>Algebraic Data Types<a class="headerlink" href="#algebraic-data-types" title="Link to this heading">¶</a></h2>
 <section id="abstract-classes">
-<h3>Abstract Classes<a class="headerlink" href="#abstract-classes" title="Permalink to this headline">¶</a></h3>
+<h3>Abstract Classes<a class="headerlink" href="#abstract-classes" title="Link to this heading">¶</a></h3>
 <p>ADT roots need to be defined as abstract, unless the ADT is defined with only one case class/object. Unlike in Scala, abstract classes cannot define fields or constructor arguments.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">MyType</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">MyType</span>
 </pre></div>
 </div>
 <p>An abstract class can be extended by other abstract classes.</p>
 </section>
 <section id="case-classes">
-<h3>Case Classes<a class="headerlink" href="#case-classes" title="Permalink to this headline">¶</a></h3>
+<h3>Case Classes<a class="headerlink" href="#case-classes" title="Link to this heading">¶</a></h3>
 <p>The abstract root can also be extended by a case-class, defining several fields:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">MyCase1</span><span class="p">(</span><span class="n">f</span><span class="p">:</span> <span class="nc">Type</span><span class="p">,</span> <span class="n">f2</span><span class="p">:</span> <span class="nc">MyType</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">MyType</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">MyCase2</span><span class="p">(</span><span class="n">f</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">MyType</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">MyCase1</span><span class="p">(</span><span class="n">f</span><span class="p">:</span><span class="w"> </span><span class="nc">Type</span><span class="p">,</span><span class="w"> </span><span class="n">f2</span><span class="p">:</span><span class="w"> </span><span class="nc">MyType</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">MyType</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">MyCase2</span><span class="p">(</span><span class="n">f</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">MyType</span>
 </pre></div>
 </div>
 <div class="admonition note">
@@ -235,8 +234,8 @@ <h3>Case Classes<a class="headerlink" href="#case-classes" title="Permalink to t
 <p>You can also define single case-class, for Tuple-like structures.</p>
 </div>
 <p>You can add invariants to case classes using a <code class="docutils literal notranslate"><span class="pre">require</span></code> clause, as follows:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">Positive</span><span class="p">(</span><span class="n">value</span><span class="p">:</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="mi">0</span><span class="p">)</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">value</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Positive</span><span class="p">(</span><span class="n">value</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">value</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -252,19 +251,19 @@ <h3>Case Classes<a class="headerlink" href="#case-classes" title="Permalink to t
 </div>
 </section>
 <section id="case-objects">
-<h3>Case Objects<a class="headerlink" href="#case-objects" title="Permalink to this headline">¶</a></h3>
+<h3>Case Objects<a class="headerlink" href="#case-objects" title="Link to this heading">¶</a></h3>
 <p>It is also possible to defined case objects, without fields:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">object</span> <span class="nc">BaseCase</span> <span class="k">extends</span> <span class="nc">MyType</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">object</span><span class="w"> </span><span class="nc">BaseCase</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">MyType</span>
 </pre></div>
 </div>
 </section>
 <section id="value-classes">
-<h3>Value Classes<a class="headerlink" href="#value-classes" title="Permalink to this headline">¶</a></h3>
+<h3>Value Classes<a class="headerlink" href="#value-classes" title="Link to this heading">¶</a></h3>
 <p>One can define a value class just like in standard Scala,
 by extending the <code class="docutils literal notranslate"><span class="pre">AnyVal</span></code> class.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">Positive</span><span class="p">(</span><span class="n">value</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">AnyVal</span> <span class="p">{</span>
-  <span class="nd">@invariant</span>
-  <span class="k">def</span> <span class="nf">isPositive</span><span class="p">:</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="n">value</span> <span class="o">&gt;=</span> <span class="mi">0</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Positive</span><span class="p">(</span><span class="n">value</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">AnyVal</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="nd">@invariant</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">isPositive</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">value</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -278,85 +277,85 @@ <h3>Value Classes<a class="headerlink" href="#value-classes" title="Permalink to
 </section>
 </section>
 <section id="generics">
-<h2>Generics<a class="headerlink" href="#generics" title="Permalink to this headline">¶</a></h2>
+<h2>Generics<a class="headerlink" href="#generics" title="Link to this heading">¶</a></h2>
 <p>Stainless supports type parameters for classes and functions.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span> <span class="nc">Test</span> <span class="p">{</span>
-  <span class="k">abstract</span> <span class="k">class</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
-  <span class="k">case</span> <span class="k">class</span> <span class="nc">Cons</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">hd</span><span class="p">:</span> <span class="nc">T</span><span class="p">,</span> <span class="n">tl</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span> <span class="k">extends</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
-  <span class="k">case</span> <span class="k">class</span> <span class="nc">Nil</span><span class="p">[</span><span class="nc">T</span><span class="p">]()</span> <span class="k">extends</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span><span class="w"> </span><span class="nc">Test</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Cons</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">hd</span><span class="p">:</span><span class="w"> </span><span class="nc">T</span><span class="p">,</span><span class="w"> </span><span class="n">tl</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Nil</span><span class="p">[</span><span class="nc">T</span><span class="p">]()</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
 
-  <span class="k">def</span> <span class="nf">contains</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span> <span class="n">el</span><span class="p">:</span> <span class="nc">T</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span> <span class="p">...</span> <span class="p">}</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">contains</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">],</span><span class="w"> </span><span class="n">el</span><span class="p">:</span><span class="w"> </span><span class="nc">T</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="p">...</span><span class="w"> </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <div class="admonition note">
 <p class="admonition-title">Note</p>
 <p>Type parameters can also be marked as co- or contra-variant, eg.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">List</span><span class="p">[</span><span class="o">+</span><span class="nc">T</span><span class="p">]</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Cons</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">hd</span><span class="p">:</span> <span class="nc">T</span><span class="p">,</span> <span class="n">tl</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span> <span class="k">extends</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
-<span class="k">case</span> <span class="k">object</span> <span class="nc">Nil</span> <span class="k">extends</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Nothing</span><span class="p">]</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="o">+</span><span class="nc">T</span><span class="p">]</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Cons</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">hd</span><span class="p">:</span><span class="w"> </span><span class="nc">T</span><span class="p">,</span><span class="w"> </span><span class="n">tl</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
+<span class="k">case</span><span class="w"> </span><span class="k">object</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Nothing</span><span class="p">]</span>
 </pre></div>
 </div>
 </div>
 </section>
 <section id="methods">
-<h2>Methods<a class="headerlink" href="#methods" title="Permalink to this headline">¶</a></h2>
+<h2>Methods<a class="headerlink" href="#methods" title="Link to this heading">¶</a></h2>
 <p>You can define methods in classes.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">contains</span><span class="p">(</span><span class="n">e</span><span class="p">:</span> <span class="nc">T</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span> <span class="p">..</span> <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">contains</span><span class="p">(</span><span class="n">e</span><span class="p">:</span><span class="w"> </span><span class="nc">T</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="p">..</span><span class="w"> </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Cons</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">hd</span><span class="p">:</span> <span class="nc">T</span><span class="p">,</span> <span class="n">tl</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span> <span class="k">extends</span> <span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
-<span class="k">case</span> <span class="k">object</span> <span class="nc">Nil</span> <span class="k">extends</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Nothing</span><span class="p">]</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Cons</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">hd</span><span class="p">:</span><span class="w"> </span><span class="nc">T</span><span class="p">,</span><span class="w"> </span><span class="n">tl</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span>
+<span class="k">case</span><span class="w"> </span><span class="k">object</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Nothing</span><span class="p">]</span>
 
-<span class="k">def</span> <span class="nf">test</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">])</span> <span class="o">=</span> <span class="n">a</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">test</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">Int</span><span class="p">])</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">a</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>It is possible to define abstract methods in abstract classes and implement them in case classes.
 Multiple layers of inheritance are allowed, as is the ability to override concrete methods.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">A</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">x</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Int</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">A</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">x</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span>
 <span class="p">}</span>
 
-<span class="k">abstract</span> <span class="k">class</span> <span class="nc">B</span> <span class="k">extends</span> <span class="nc">A</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">x</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">require</span><span class="p">(</span><span class="n">a</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">)</span>
-    <span class="mi">42</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">_</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="p">}</span>
+<span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">B</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">A</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">x</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">require</span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">    </span><span class="mi">42</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">_</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">C</span><span class="p">(</span><span class="n">c</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">B</span> <span class="p">{</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">x</span><span class="p">(</span><span class="n">i</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">require</span><span class="p">(</span><span class="n">i</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
-    <span class="k">if</span> <span class="p">(</span><span class="n">i</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="mi">0</span>
-    <span class="k">else</span> <span class="n">c</span> <span class="o">+</span> <span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="o">-</span><span class="mi">1</span><span class="p">)</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">(</span> <span class="n">_</span> <span class="o">==</span> <span class="n">c</span> <span class="o">*</span> <span class="n">i</span> <span class="p">)</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">C</span><span class="p">(</span><span class="n">c</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">B</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">x</span><span class="p">(</span><span class="n">i</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">require</span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">i</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="n">c</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="p">(</span><span class="n">i</span><span class="o">-</span><span class="mi">1</span><span class="p">)</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="w"> </span><span class="n">_</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">c</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="p">)</span>
 <span class="p">}</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">D</span><span class="p">()</span> <span class="k">extends</span> <span class="nc">B</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">D</span><span class="p">()</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">B</span>
 </pre></div>
 </div>
 <p>It is also possible to call methods of a superclass with the <code class="docutils literal notranslate"><span class="pre">super</span></code> keyword.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">Base</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">double</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="n">x</span> <span class="o">*</span> <span class="mi">2</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Base</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">double</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="mi">2</span>
 <span class="p">}</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Override</span><span class="p">()</span> <span class="k">extends</span> <span class="nc">Base</span> <span class="p">{</span>
-  <span class="k">override</span> <span class="k">def</span> <span class="nf">double</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="bp">super</span><span class="p">.</span><span class="n">double</span><span class="p">(</span><span class="n">x</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span> <span class="o">+</span> <span class="mi">42</span>
-  <span class="p">}</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Override</span><span class="p">()</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Base</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">override</span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">double</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="bp">super</span><span class="p">.</span><span class="n">double</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">42</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>Abstract methods may have contracts in terms of pre- and postconditions. The
 syntax uses <code class="docutils literal notranslate"><span class="pre">???</span></code> and is as follows:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">Set</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">contains</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">t</span><span class="p">:</span> <span class="nc">T</span><span class="p">):</span> <span class="nc">Boolean</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Set</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">contains</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">t</span><span class="p">:</span><span class="w"> </span><span class="nc">T</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span>
 
-  <span class="k">def</span> <span class="nf">add</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">t</span><span class="p">:</span> <span class="nc">T</span><span class="p">):</span> <span class="nc">Set</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">require</span><span class="p">(</span><span class="o">!</span><span class="bp">this</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="n">t</span><span class="p">))</span>
-    <span class="p">(</span><span class="o">???</span> <span class="p">:</span> <span class="nc">Set</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span>
-  <span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">res</span> <span class="o">=&gt;</span> <span class="n">res</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="n">t</span><span class="p">))</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">add</span><span class="p">[</span><span class="nc">T</span><span class="p">](</span><span class="n">t</span><span class="p">:</span><span class="w"> </span><span class="nc">T</span><span class="p">):</span><span class="w"> </span><span class="nc">Set</span><span class="p">[</span><span class="nc">T</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">require</span><span class="p">(</span><span class="o">!</span><span class="bp">this</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="n">t</span><span class="p">))</span>
+<span class="w">    </span><span class="p">(</span><span class="o">???</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">Set</span><span class="p">[</span><span class="nc">T</span><span class="p">])</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="n">t</span><span class="p">))</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -372,17 +371,17 @@ <h2>Methods<a class="headerlink" href="#methods" title="Permalink to this headli
 <a class="reference external" href="https://github.com/epfl-lara/stainless-project.g8">https://github.com/epfl-lara/stainless-project.g8</a> for an example of how to setup
 such a hybrid project).</p>
 <section id="copy-method">
-<h3>Copy Method<a class="headerlink" href="#copy-method" title="Permalink to this headline">¶</a></h3>
+<h3>Copy Method<a class="headerlink" href="#copy-method" title="Link to this heading">¶</a></h3>
 <p>The <code class="docutils literal notranslate"><span class="pre">copy</span></code> method of classes with immutable fields is extracted as well,
 and ensures that the class invariant (if any) is maintained by requiring it
 to be satisfied as a precondition.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">Foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">x</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">prop</span><span class="p">(</span><span class="n">foo</span><span class="p">:</span> <span class="nc">Foo</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">y</span> <span class="o">&gt;</span> <span class="mi">1</span><span class="p">)</span>
-  <span class="n">foo</span><span class="p">.</span><span class="n">copy</span><span class="p">(</span><span class="n">x</span> <span class="o">=</span> <span class="n">y</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">prop</span><span class="p">(</span><span class="n">foo</span><span class="p">:</span><span class="w"> </span><span class="nc">Foo</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span>
+<span class="w">  </span><span class="n">foo</span><span class="p">.</span><span class="n">copy</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">y</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -393,111 +392,111 @@ <h3>Copy Method<a class="headerlink" href="#copy-method" title="Permalink to thi
 </div>
 </section>
 <section id="initialization">
-<h3>Initialization<a class="headerlink" href="#initialization" title="Permalink to this headline">¶</a></h3>
+<h3>Initialization<a class="headerlink" href="#initialization" title="Link to this heading">¶</a></h3>
 <p>In Pure Scala, initialization of <code class="docutils literal notranslate"><span class="pre">val</span></code>’s  may not have future or self-references:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span> <span class="nc">Initialization</span> <span class="p">{</span>
-  <span class="k">case</span> <span class="k">class</span> <span class="nc">C</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="p">{</span>
-    <span class="kd">val</span> <span class="n">y</span> <span class="o">=</span> <span class="n">x</span>       <span class="c1">// ok</span>
-    <span class="kd">val</span> <span class="n">z</span> <span class="o">=</span> <span class="n">y</span> <span class="o">+</span> <span class="n">x</span>   <span class="c1">// ok</span>
-    <span class="kd">val</span> <span class="n">a</span> <span class="o">=</span> <span class="n">b</span>       <span class="c1">// Error: &quot;because field `a` can only refer to previous fields, not to `b`&quot;</span>
-    <span class="kd">val</span> <span class="n">b</span> <span class="o">=</span> <span class="n">z</span> <span class="o">+</span> <span class="n">y</span>   <span class="c1">// ok</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span><span class="w"> </span><span class="nc">Initialization</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">C</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w">       </span><span class="c1">// ok</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="w">   </span><span class="c1">// ok</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">b</span><span class="w">       </span><span class="c1">// Error: &quot;because field `a` can only refer to previous fields, not to `b`&quot;</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="w">   </span><span class="c1">// ok</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="overriding">
-<h3>Overriding<a class="headerlink" href="#overriding" title="Permalink to this headline">¶</a></h3>
+<h3>Overriding<a class="headerlink" href="#overriding" title="Link to this heading">¶</a></h3>
 <p>Stainless supports overriding methods with some constraints:
 * A <code class="docutils literal notranslate"><span class="pre">val</span></code> in an abstract class can only be overridden by a concrete class parameter.
 * Methods and <code class="docutils literal notranslate"><span class="pre">lazy</span> <span class="pre">val``s</span> <span class="pre">in</span> <span class="pre">abstract</span> <span class="pre">classes</span> <span class="pre">can</span> <span class="pre">be</span> <span class="pre">overridden</span> <span class="pre">by</span> <span class="pre">concrete</span> <span class="pre">methods</span> <span class="pre">or</span>
 <span class="pre">``lazy</span> <span class="pre">val</span></code>’s (interchangably), or by a concrete class parameter, but not by
 a <code class="docutils literal notranslate"><span class="pre">val</span></code>.</p>
 <p>Here are a few examples that are rejected by Stainless:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span> <span class="nc">BadOverride1</span> <span class="p">{</span>
-  <span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">Abs</span> <span class="p">{</span>
-    <span class="n">require</span><span class="p">(</span><span class="n">x</span> <span class="o">!=</span> <span class="mi">0</span><span class="p">)</span>
-    <span class="kd">val</span> <span class="n">x</span><span class="p">:</span> <span class="nc">Int</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span><span class="w"> </span><span class="nc">BadOverride1</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Abs</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">require</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="c1">// Error: &quot;Abstract values `x` must be overridden with fields in concrete subclass&quot;</span>
-  <span class="k">case</span> <span class="k">class</span> <span class="nc">AbsInvalid</span><span class="p">()</span> <span class="k">extends</span> <span class="nc">Abs</span> <span class="p">{</span>
-    <span class="k">def</span> <span class="nf">x</span><span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="mi">1</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="c1">// Error: &quot;Abstract values `x` must be overridden with fields in concrete subclass&quot;</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">AbsInvalid</span><span class="p">()</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Abs</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">def</span><span class="w"> </span><span class="nf">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span> <span class="nc">BadOverride2</span> <span class="p">{</span>
-  <span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">Abs</span> <span class="p">{</span>
-    <span class="kd">val</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Int</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span><span class="w"> </span><span class="nc">BadOverride2</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Abs</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="c1">// Error: &quot;Abstract values `y` must be overridden with fields in concrete subclass&quot;</span>
-  <span class="k">case</span> <span class="k">class</span> <span class="nc">AbsInvalid</span><span class="p">()</span> <span class="k">extends</span> <span class="nc">Abs</span> <span class="p">{</span>
-    <span class="kd">val</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="mi">2</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="c1">// Error: &quot;Abstract values `y` must be overridden with fields in concrete subclass&quot;</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">AbsInvalid</span><span class="p">()</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Abs</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span> <span class="nc">BadOverride3</span> <span class="p">{</span>
-  <span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">AAA</span> <span class="p">{</span>
-    <span class="k">def</span> <span class="nf">f</span><span class="p">:</span> <span class="nc">BigInt</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span><span class="w"> </span><span class="nc">BadOverride3</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">AAA</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">def</span><span class="w"> </span><span class="nf">f</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="c1">// Error: &quot;because abstract methods BadOverride3.AAA.f were not overridden by</span>
-  <span class="c1">//         a method, a lazy val, or a constructor parameter&quot;</span>
-  <span class="k">case</span> <span class="k">class</span> <span class="nc">BBB</span><span class="p">()</span> <span class="k">extends</span> <span class="nc">AAA</span> <span class="p">{</span>
-    <span class="kd">val</span> <span class="n">f</span><span class="p">:</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="mi">0</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="c1">// Error: &quot;because abstract methods BadOverride3.AAA.f were not overridden by</span>
+<span class="w">  </span><span class="c1">//         a method, a lazy val, or a constructor parameter&quot;</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">BBB</span><span class="p">()</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">AAA</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">f</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="default-parameters">
-<h3>Default Parameters<a class="headerlink" href="#default-parameters" title="Permalink to this headline">¶</a></h3>
+<h3>Default Parameters<a class="headerlink" href="#default-parameters" title="Link to this heading">¶</a></h3>
 <p>Functions and methods can have default values for their parameters.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">test</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="mi">21</span><span class="p">):</span> <span class="nc">Int</span> <span class="o">=</span> <span class="n">x</span> <span class="o">*</span> <span class="mi">2</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">test</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">21</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="mi">2</span>
 
-<span class="n">assert</span><span class="p">(</span><span class="n">test</span><span class="p">()</span> <span class="o">==</span> <span class="mi">42</span><span class="p">)</span> <span class="c1">// valid</span>
+<span class="n">assert</span><span class="p">(</span><span class="n">test</span><span class="p">()</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">42</span><span class="p">)</span><span class="w"> </span><span class="c1">// valid</span>
 </pre></div>
 </div>
 </section>
 </section>
 <section id="type-definitions">
-<h2>Type Definitions<a class="headerlink" href="#type-definitions" title="Permalink to this headline">¶</a></h2>
+<h2>Type Definitions<a class="headerlink" href="#type-definitions" title="Link to this heading">¶</a></h2>
 <section id="type-aliases">
-<h3>Type Aliases<a class="headerlink" href="#type-aliases" title="Permalink to this headline">¶</a></h3>
+<h3>Type Aliases<a class="headerlink" href="#type-aliases" title="Link to this heading">¶</a></h3>
 <p>Type aliases can be defined the usual way:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span> <span class="nc">testcase</span> <span class="p">{</span>
-  <span class="k">type</span> <span class="nc">Identifier</span> <span class="o">=</span> <span class="nc">String</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span><span class="w"> </span><span class="nc">testcase</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">type</span><span class="w"> </span><span class="nc">Identifier</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">String</span>
 
-  <span class="k">def</span> <span class="nf">newIdentifier</span><span class="p">:</span> <span class="nc">Identifier</span> <span class="o">=</span> <span class="cm">/* returns a String */</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">newIdentifier</span><span class="p">:</span><span class="w"> </span><span class="nc">Identifier</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="cm">/* returns a String */</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>Type aliases can also have one or more type parameters:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">type</span> <span class="nc">Collection</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="o">=</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">type</span><span class="w"> </span><span class="nc">Collection</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span>
 
-<span class="k">def</span> <span class="nf">singleton</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">Collection</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span> <span class="o">=</span> <span class="nc">List</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">singleton</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">Collection</span><span class="p">[</span><span class="nc">A</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">List</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
 </pre></div>
 </div>
 </section>
 <section id="type-members">
-<h3>Type Members<a class="headerlink" href="#type-members" title="Permalink to this headline">¶</a></h3>
+<h3>Type Members<a class="headerlink" href="#type-members" title="Link to this heading">¶</a></h3>
 <p>Much like classes can have field members and method members, they can also
 define type members. Much like other members, those can also be declared
 abstract within an abstract class and overridden in implementations:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">Grass</span><span class="p">()</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Grass</span><span class="p">()</span>
 
-<span class="k">abstract</span> <span class="k">class</span> <span class="nc">Animal</span> <span class="p">{</span>
-  <span class="k">type</span> <span class="nc">Food</span>
-  <span class="kd">val</span> <span class="n">happy</span><span class="p">:</span> <span class="nc">Boolean</span>
-  <span class="k">def</span> <span class="nf">eat</span><span class="p">(</span><span class="n">food</span><span class="p">:</span> <span class="nc">Food</span><span class="p">):</span> <span class="nc">Animal</span>
+<span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Animal</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">type</span><span class="w"> </span><span class="nc">Food</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">happy</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">eat</span><span class="p">(</span><span class="n">food</span><span class="p">:</span><span class="w"> </span><span class="nc">Food</span><span class="p">):</span><span class="w"> </span><span class="nc">Animal</span>
 <span class="p">}</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Cow</span><span class="p">(</span><span class="n">happy</span><span class="p">:</span> <span class="nc">Boolean</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">Animal</span> <span class="p">{</span>
-  <span class="k">type</span> <span class="nc">Food</span> <span class="o">=</span> <span class="nc">Grass</span>
-  <span class="k">def</span> <span class="nf">eat</span><span class="p">(</span><span class="n">g</span><span class="p">:</span> <span class="nc">Grass</span><span class="p">):</span> <span class="nc">Cow</span> <span class="o">=</span> <span class="nc">Cow</span><span class="p">(</span><span class="n">happy</span> <span class="o">=</span> <span class="kc">true</span><span class="p">)</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Cow</span><span class="p">(</span><span class="n">happy</span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Animal</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">type</span><span class="w"> </span><span class="nc">Food</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Grass</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">eat</span><span class="p">(</span><span class="n">g</span><span class="p">:</span><span class="w"> </span><span class="nc">Grass</span><span class="p">):</span><span class="w"> </span><span class="nc">Cow</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Cow</span><span class="p">(</span><span class="n">happy</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="kc">true</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -506,48 +505,48 @@ <h3>Type Members<a class="headerlink" href="#type-members" title="Permalink to t
 can depend on another variable, by selecting a type member on the latter:</p>
 <div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="c1">//                             Path-dependent type</span>
 <span class="c1">//                                 vvvvvvvvvvv</span>
-<span class="k">def</span> <span class="nf">giveFood</span><span class="p">(</span><span class="n">animal</span><span class="p">:</span> <span class="nc">Animal</span><span class="p">)(</span><span class="n">food</span><span class="p">:</span> <span class="n">animal</span><span class="p">.</span><span class="nc">Food</span><span class="p">):</span> <span class="nc">Animal</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">animal</span><span class="p">.</span><span class="n">eat</span><span class="p">(</span><span class="n">food</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">giveFood</span><span class="p">(</span><span class="n">animal</span><span class="p">:</span><span class="w"> </span><span class="nc">Animal</span><span class="p">)(</span><span class="n">food</span><span class="p">:</span><span class="w"> </span><span class="n">animal</span><span class="p">.</span><span class="nc">Food</span><span class="p">):</span><span class="w"> </span><span class="nc">Animal</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">animal</span><span class="p">.</span><span class="n">eat</span><span class="p">(</span><span class="n">food</span><span class="p">)</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">test</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">cow1</span> <span class="o">=</span> <span class="nc">Cow</span><span class="p">(</span><span class="kc">false</span><span class="p">)</span>
-  <span class="kd">val</span> <span class="n">cow2</span> <span class="o">=</span> <span class="n">giveFood</span><span class="p">(</span><span class="n">cow1</span><span class="p">)(</span><span class="nc">Grass</span><span class="p">())</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">cow2</span><span class="p">.</span><span class="n">happy</span><span class="p">)</span> <span class="c1">// VALID</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">test</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">cow1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Cow</span><span class="p">(</span><span class="kc">false</span><span class="p">)</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">cow2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">giveFood</span><span class="p">(</span><span class="n">cow1</span><span class="p">)(</span><span class="nc">Grass</span><span class="p">())</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">cow2</span><span class="p">.</span><span class="n">happy</span><span class="p">)</span><span class="w"> </span><span class="c1">// VALID</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 </section>
 <section id="specifications">
-<h2>Specifications<a class="headerlink" href="#specifications" title="Permalink to this headline">¶</a></h2>
+<h2>Specifications<a class="headerlink" href="#specifications" title="Link to this heading">¶</a></h2>
 <p>Stainless supports three kinds of specifications to functions and methods:</p>
 <section id="preconditions">
-<h3>Preconditions<a class="headerlink" href="#preconditions" title="Permalink to this headline">¶</a></h3>
+<h3>Preconditions<a class="headerlink" href="#preconditions" title="Link to this heading">¶</a></h3>
 <p>Preconditions constraint the argument and is expressed using <cite>require</cite>. It should hold for all calls to the function.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foo</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">b</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">a</span> <span class="o">&gt;</span> <span class="n">b</span><span class="p">)</span>
-  <span class="p">...</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">foo</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">b</span><span class="p">)</span>
+<span class="w">  </span><span class="p">...</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="postconditions">
-<h3>Postconditions<a class="headerlink" href="#postconditions" title="Permalink to this headline">¶</a></h3>
+<h3>Postconditions<a class="headerlink" href="#postconditions" title="Link to this heading">¶</a></h3>
 <p>Postconditions constraint the resulting value, and is expressed using <cite>ensuring</cite>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foo</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">a</span> <span class="o">+</span> <span class="mi">1</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span> <span class="n">res</span> <span class="o">&gt;</span> <span class="n">a</span> <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">foo</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">a</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="body-assertions">
-<h3>Body Assertions<a class="headerlink" href="#body-assertions" title="Permalink to this headline">¶</a></h3>
+<h3>Body Assertions<a class="headerlink" href="#body-assertions" title="Link to this heading">¶</a></h3>
 <p>Assertions constrain intermediate expressions within the body of a function.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foo</span><span class="p">(</span><span class="n">a</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">b</span> <span class="o">=</span> <span class="o">-</span><span class="n">a</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">a</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="o">||</span> <span class="n">b</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">,</span> <span class="s">&quot;This will fail for -2^31&quot;</span><span class="p">)</span>
-  <span class="n">a</span> <span class="o">+</span> <span class="mi">1</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">foo</span><span class="p">(</span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="o">-</span><span class="n">a</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">,</span><span class="w"> </span><span class="s">&quot;This will fail for -2^31&quot;</span><span class="p">)</span>
+<span class="w">  </span><span class="n">a</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -555,46 +554,46 @@ <h3>Body Assertions<a class="headerlink" href="#body-assertions" title="Permalin
 </section>
 </section>
 <section id="expressions">
-<h2>Expressions<a class="headerlink" href="#expressions" title="Permalink to this headline">¶</a></h2>
+<h2>Expressions<a class="headerlink" href="#expressions" title="Link to this heading">¶</a></h2>
 <p>Stainless supports most purely-functional Scala expressions:</p>
 <section id="pattern-matching">
-<h3>Pattern matching<a class="headerlink" href="#pattern-matching" title="Permalink to this headline">¶</a></h3>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">expr</span> <span class="k">match</span> <span class="p">{</span>
-  <span class="c1">// Simple (nested) patterns:</span>
-  <span class="k">case</span> <span class="nc">CaseClass</span><span class="p">(</span> <span class="p">..</span> <span class="p">,</span> <span class="p">..</span> <span class="p">,</span> <span class="p">..)</span> <span class="o">=&gt;</span> <span class="p">...</span>
-  <span class="k">case</span> <span class="n">v</span> <span class="o">@</span> <span class="nc">CaseClass</span><span class="p">(</span> <span class="p">..</span> <span class="p">,</span> <span class="p">..</span> <span class="p">,</span> <span class="p">..)</span> <span class="o">=&gt;</span> <span class="p">...</span>
-  <span class="k">case</span> <span class="n">v</span> <span class="p">:</span> <span class="nc">CaseClass</span> <span class="o">=&gt;</span> <span class="p">...</span>
-  <span class="k">case</span> <span class="p">(</span><span class="n">t1</span><span class="p">,</span> <span class="n">t2</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="p">...</span>
-  <span class="k">case</span> <span class="mi">42</span> <span class="o">=&gt;</span> <span class="p">...</span>
-  <span class="k">case</span> <span class="n">_</span> <span class="o">=&gt;</span> <span class="p">...</span>
+<h3>Pattern matching<a class="headerlink" href="#pattern-matching" title="Link to this heading">¶</a></h3>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">expr</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="c1">// Simple (nested) patterns:</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">CaseClass</span><span class="p">(</span><span class="w"> </span><span class="p">..</span><span class="w"> </span><span class="p">,</span><span class="w"> </span><span class="p">..</span><span class="w"> </span><span class="p">,</span><span class="w"> </span><span class="p">..)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">...</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="n">v</span><span class="w"> </span><span class="o">@</span><span class="w"> </span><span class="nc">CaseClass</span><span class="p">(</span><span class="w"> </span><span class="p">..</span><span class="w"> </span><span class="p">,</span><span class="w"> </span><span class="p">..</span><span class="w"> </span><span class="p">,</span><span class="w"> </span><span class="p">..)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">...</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="n">v</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">CaseClass</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">...</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="p">(</span><span class="n">t1</span><span class="p">,</span><span class="w"> </span><span class="n">t2</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">...</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="mi">42</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">...</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="n">_</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">...</span>
 
-  <span class="c1">// can also be guarded, e.g.</span>
-  <span class="k">case</span> <span class="nc">CaseClass</span><span class="p">(</span><span class="n">a</span><span class="p">,</span> <span class="n">b</span><span class="p">,</span> <span class="n">c</span><span class="p">)</span> <span class="k">if</span> <span class="n">a</span> <span class="o">&gt;</span> <span class="n">b</span> <span class="o">=&gt;</span> <span class="p">...</span>
+<span class="w">  </span><span class="c1">// can also be guarded, e.g.</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">CaseClass</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">,</span><span class="w"> </span><span class="n">c</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">...</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>Custom pattern matching with <code class="docutils literal notranslate"><span class="pre">unapply</span></code> methods are also supported:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span> <span class="nc">::</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">unapply</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span> <span class="nc">Option</span><span class="p">[(</span><span class="nc">A</span><span class="p">,</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">])]</span> <span class="o">=</span> <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">=&gt;</span> <span class="nc">None</span><span class="p">()</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">Some</span><span class="p">((</span><span class="n">x</span><span class="p">,</span> <span class="n">xs</span><span class="p">))</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span><span class="w"> </span><span class="nc">::</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">unapply</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">]):</span><span class="w"> </span><span class="nc">Option</span><span class="p">[(</span><span class="nc">A</span><span class="p">,</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">])]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">None</span><span class="p">()</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Some</span><span class="p">((</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">xs</span><span class="p">))</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">empty</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">])</span> <span class="o">=</span> <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-  <span class="k">case</span> <span class="n">x</span> <span class="o">::</span> <span class="n">xs</span> <span class="o">=&gt;</span> <span class="kc">false</span>
-  <span class="k">case</span> <span class="nc">Nil</span><span class="p">()</span> <span class="o">=&gt;</span> <span class="kc">true</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">[</span><span class="nc">A</span><span class="p">](</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">[</span><span class="nc">A</span><span class="p">])</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">::</span><span class="w"> </span><span class="n">xs</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">false</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="p">()</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">true</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="values">
-<h3>Values<a class="headerlink" href="#values" title="Permalink to this headline">¶</a></h3>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span> <span class="n">x</span> <span class="o">=</span> <span class="p">...</span>
+<h3>Values<a class="headerlink" href="#values" title="Link to this heading">¶</a></h3>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">...</span>
 
-<span class="kd">val</span> <span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span> <span class="o">=</span> <span class="p">...</span>
+<span class="kd">val</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">...</span>
 
-<span class="kd">val</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">h</span><span class="p">,</span> <span class="n">_</span><span class="p">)</span> <span class="o">=</span> <span class="p">...</span>
+<span class="kd">val</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">h</span><span class="p">,</span><span class="w"> </span><span class="n">_</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">...</span>
 </pre></div>
 </div>
 <div class="admonition note">
@@ -603,31 +602,31 @@ <h3>Values<a class="headerlink" href="#values" title="Permalink to this headline
 </div>
 </section>
 <section id="inner-functions">
-<h3>Inner Functions<a class="headerlink" href="#inner-functions" title="Permalink to this headline">¶</a></h3>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">y</span> <span class="o">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
-  <span class="k">def</span> <span class="nf">bar</span><span class="p">(</span><span class="n">z</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-     <span class="n">z</span> <span class="o">+</span> <span class="n">y</span>
-  <span class="p">}</span>
-  <span class="n">bar</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span>
+<h3>Inner Functions<a class="headerlink" href="#inner-functions" title="Link to this heading">¶</a></h3>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">foo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">bar</span><span class="p">(</span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">     </span><span class="n">z</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span>
+<span class="w">  </span><span class="p">}</span>
+<span class="w">  </span><span class="n">bar</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="local-and-anonymous-classes">
-<h3>Local and Anonymous Classes<a class="headerlink" href="#local-and-anonymous-classes" title="Permalink to this headline">¶</a></h3>
+<h3>Local and Anonymous Classes<a class="headerlink" href="#local-and-anonymous-classes" title="Link to this heading">¶</a></h3>
 <p>Functions and methods can declare local classes, which can close over
 the fields of the enclosing class, as well as the parameters of the enclosing
 function or method.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">Foo</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">bar</span><span class="p">:</span> <span class="nc">Int</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Foo</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">bar</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">makeFoo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Foo</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="k">case</span> <span class="k">class</span> <span class="nc">Local</span><span class="p">()</span> <span class="k">extends</span> <span class="nc">Foo</span> <span class="p">{</span>
-    <span class="k">def</span> <span class="nf">bar</span><span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="n">x</span>
-  <span class="p">}</span>
-  <span class="nc">Local</span><span class="p">()</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">makeFoo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Foo</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Local</span><span class="p">()</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">Foo</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">def</span><span class="w"> </span><span class="nf">bar</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span>
+<span class="w">  </span><span class="p">}</span>
+<span class="w">  </span><span class="nc">Local</span><span class="p">()</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -639,12 +638,12 @@ <h3>Local and Anonymous Classes<a class="headerlink" href="#local-and-anonymous-
 currently unsupported.</p>
 </div>
 <p>Anonymous classes with an explicit parent are supported as well:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">Foo</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">bar</span><span class="p">:</span> <span class="nc">Int</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Foo</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">bar</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">makeFoo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Foo</span> <span class="o">=</span> <span class="k">new</span> <span class="nc">Foo</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">bar</span><span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="n">x</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">makeFoo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Foo</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="nc">Foo</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">bar</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -653,41 +652,41 @@ <h3>Local and Anonymous Classes<a class="headerlink" href="#local-and-anonymous-
 <p>Anonymous classes cannot declare more public members than their parent class,
 ie. the following is not supported:</p>
 </div>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">Foo</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">bar</span><span class="p">:</span> <span class="nc">Int</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Foo</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">bar</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">makeFoo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Foo</span> <span class="o">=</span> <span class="k">new</span> <span class="nc">Foo</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">bar</span><span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="n">x</span>
-  <span class="k">def</span> <span class="nf">hi</span><span class="p">:</span> <span class="nc">String</span> <span class="o">=</span> <span class="s">&quot;Hello, world&quot;</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">makeFoo</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Foo</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="k">new</span><span class="w"> </span><span class="nc">Foo</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">bar</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">hi</span><span class="p">:</span><span class="w"> </span><span class="nc">String</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="s">&quot;Hello, world&quot;</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 </section>
 <section id="predefined-types">
-<h2>Predefined Types<a class="headerlink" href="#predefined-types" title="Permalink to this headline">¶</a></h2>
+<h2>Predefined Types<a class="headerlink" href="#predefined-types" title="Link to this heading">¶</a></h2>
 <section id="tuplex">
-<h3>TupleX<a class="headerlink" href="#tuplex" title="Permalink to this headline">¶</a></h3>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span> <span class="n">x</span> <span class="o">=</span> <span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">)</span>
-<span class="kd">val</span> <span class="n">y</span> <span class="o">=</span> <span class="mi">1</span> <span class="o">-&gt;</span> <span class="mi">2</span> <span class="c1">// alternative Scala syntax for Tuple2</span>
-<span class="n">x</span><span class="p">.</span><span class="n">_1</span> <span class="c1">// == 1</span>
+<h3>TupleX<a class="headerlink" href="#tuplex" title="Link to this heading">¶</a></h3>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="c1">// alternative Scala syntax for Tuple2</span>
+<span class="n">x</span><span class="p">.</span><span class="n">_1</span><span class="w"> </span><span class="c1">// == 1</span>
 </pre></div>
 </div>
 </section>
 <section id="int">
-<h3>Int<a class="headerlink" href="#int" title="Permalink to this headline">¶</a></h3>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">a</span> <span class="o">+</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">-</span> <span class="n">b</span>
+<h3>Int<a class="headerlink" href="#int" title="Link to this heading">¶</a></h3>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">a</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">b</span>
 <span class="o">-</span><span class="n">a</span>
-<span class="n">a</span> <span class="o">*</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">/</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">%</span> <span class="n">b</span> <span class="c1">// a modulo b</span>
-<span class="n">a</span> <span class="o">&lt;</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">&lt;=</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">&gt;</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">&gt;=</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">==</span> <span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="c1">// a modulo b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">b</span>
 </pre></div>
 </div>
 <div class="admonition note">
@@ -696,21 +695,21 @@ <h3>Int<a class="headerlink" href="#int" title="Permalink to this headline">¶</
 </div>
 </section>
 <section id="bigint">
-<h3>BigInt<a class="headerlink" href="#bigint" title="Permalink to this headline">¶</a></h3>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span> <span class="n">a</span> <span class="o">=</span> <span class="nc">BigInt</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="kd">val</span> <span class="n">b</span> <span class="o">=</span> <span class="nc">BigInt</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
+<h3>BigInt<a class="headerlink" href="#bigint" title="Link to this heading">¶</a></h3>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
 
 <span class="o">-</span><span class="n">a</span>
-<span class="n">a</span> <span class="o">+</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">-</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">*</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">/</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">%</span> <span class="n">b</span> <span class="c1">// a modulo b</span>
-<span class="n">a</span> <span class="o">&lt;</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">&gt;</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">&lt;=</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">&gt;=</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">==</span> <span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="c1">// a modulo b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">b</span>
 </pre></div>
 </div>
 <div class="admonition note">
@@ -719,88 +718,88 @@ <h3>BigInt<a class="headerlink" href="#bigint" title="Permalink to this headline
 </div>
 </section>
 <section id="real">
-<h3>Real<a class="headerlink" href="#real" title="Permalink to this headline">¶</a></h3>
+<h3>Real<a class="headerlink" href="#real" title="Link to this heading">¶</a></h3>
 <p><code class="docutils literal notranslate"><span class="pre">Real</span></code> represents the mathematical real numbers (different from floating points). It is an
 extension to Scala which is meant to write programs closer to their true semantics.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span> <span class="n">a</span><span class="p">:</span> <span class="nc">Real</span> <span class="o">=</span> <span class="nc">Real</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="kd">val</span> <span class="n">b</span><span class="p">:</span> <span class="nc">Real</span> <span class="o">=</span> <span class="nc">Real</span><span class="p">(</span><span class="mi">3</span><span class="p">,</span> <span class="mi">5</span><span class="p">)</span> <span class="c1">// 3/5</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span><span class="w"> </span><span class="n">a</span><span class="p">:</span><span class="w"> </span><span class="nc">Real</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Real</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">b</span><span class="p">:</span><span class="w"> </span><span class="nc">Real</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Real</span><span class="p">(</span><span class="mi">3</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">)</span><span class="w"> </span><span class="c1">// 3/5</span>
 
 <span class="o">-</span><span class="n">a</span>
-<span class="n">a</span> <span class="o">+</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">-</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">*</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">/</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">&lt;</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">&gt;</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">&lt;=</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">&gt;=</span> <span class="n">b</span>
-<span class="n">a</span> <span class="o">==</span> <span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">/</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="n">b</span>
+<span class="n">a</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">b</span>
 </pre></div>
 </div>
 <div class="admonition note">
 <p class="admonition-title">Note</p>
 <p>Real have infinite precision, which means their properties differ from <code class="docutils literal notranslate"><span class="pre">Double</span></code>.
 For example, the following holds:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">associativity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Real</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Real</span><span class="p">,</span> <span class="n">z</span><span class="p">:</span> <span class="nc">Real</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="p">(</span><span class="n">x</span> <span class="o">+</span> <span class="n">y</span><span class="p">)</span> <span class="o">+</span> <span class="n">z</span> <span class="o">==</span> <span class="n">x</span> <span class="o">+</span> <span class="p">(</span><span class="n">y</span> <span class="o">+</span> <span class="n">z</span><span class="p">)</span>
-<span class="p">}</span> <span class="n">holds</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">associativity</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Real</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Real</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">Real</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">y</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">z</span><span class="p">)</span>
+<span class="p">}</span><span class="w"> </span><span class="n">holds</span>
 </pre></div>
 </div>
 <p>While it does not hold with floating point arithmetic.</p>
 </div>
 </section>
 <section id="set">
-<h3>Set<a class="headerlink" href="#set" title="Permalink to this headline">¶</a></h3>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nc">Set</span> <span class="c1">// Required to have support for Sets</span>
+<h3>Set<a class="headerlink" href="#set" title="Link to this heading">¶</a></h3>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nc">Set</span><span class="w"> </span><span class="c1">// Required to have support for Sets</span>
 
-<span class="kd">val</span> <span class="n">s1</span> <span class="o">=</span> <span class="nc">Set</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">1</span><span class="p">)</span>
-<span class="kd">val</span> <span class="n">s2</span> <span class="o">=</span> <span class="nc">Set</span><span class="p">[</span><span class="nc">Int</span><span class="p">]()</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">s1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Set</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">1</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">s2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Set</span><span class="p">[</span><span class="nc">Int</span><span class="p">]()</span>
 
-<span class="n">s1</span> <span class="o">++</span> <span class="n">s2</span> <span class="c1">// Set union</span>
-<span class="n">s1</span> <span class="n">&amp;</span> <span class="n">s2</span>  <span class="c1">// Set intersection</span>
-<span class="n">s1</span> <span class="o">--</span> <span class="n">s2</span> <span class="c1">// Set difference</span>
-<span class="n">s1</span> <span class="n">subsetOf</span> <span class="n">s2</span>
-<span class="n">s1</span> <span class="n">contains</span> <span class="mi">42</span>
+<span class="n">s1</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">s2</span><span class="w"> </span><span class="c1">// Set union</span>
+<span class="n">s1</span><span class="w"> </span><span class="n">&amp;</span><span class="w"> </span><span class="n">s2</span><span class="w">  </span><span class="c1">// Set intersection</span>
+<span class="n">s1</span><span class="w"> </span><span class="o">--</span><span class="w"> </span><span class="n">s2</span><span class="w"> </span><span class="c1">// Set difference</span>
+<span class="n">s1</span><span class="w"> </span><span class="n">subsetOf</span><span class="w"> </span><span class="n">s2</span>
+<span class="n">s1</span><span class="w"> </span><span class="n">contains</span><span class="w"> </span><span class="mi">42</span>
 </pre></div>
 </div>
 </section>
 <section id="functional-array">
-<h3>Functional Array<a class="headerlink" href="#functional-array" title="Permalink to this headline">¶</a></h3>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span> <span class="n">a</span> <span class="o">=</span> <span class="nc">Array</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">)</span>
+<h3>Functional Array<a class="headerlink" href="#functional-array" title="Link to this heading">¶</a></h3>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Array</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">)</span>
 
 <span class="n">a</span><span class="p">(</span><span class="n">index</span><span class="p">)</span>
-<span class="n">a</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="n">index</span><span class="p">,</span> <span class="n">value</span><span class="p">)</span>
+<span class="n">a</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="n">index</span><span class="p">,</span><span class="w"> </span><span class="n">value</span><span class="p">)</span>
 <span class="n">a</span><span class="p">.</span><span class="n">length</span>
 </pre></div>
 </div>
 </section>
 <section id="map">
-<h3>Map<a class="headerlink" href="#map" title="Permalink to this headline">¶</a></h3>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nc">Map</span> <span class="c1">// Required to have support for Maps</span>
+<h3>Map<a class="headerlink" href="#map" title="Link to this heading">¶</a></h3>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="nc">Map</span><span class="w"> </span><span class="c1">// Required to have support for Maps</span>
 
-<span class="kd">val</span>  <span class="n">m</span> <span class="o">=</span> <span class="nc">Map</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">Boolean</span><span class="p">](</span><span class="mi">42</span> <span class="o">-&gt;</span> <span class="kc">false</span><span class="p">)</span>
+<span class="kd">val</span><span class="w">  </span><span class="n">m</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">Map</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">Boolean</span><span class="p">](</span><span class="mi">42</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="kc">false</span><span class="p">)</span>
 
 <span class="n">m</span><span class="p">(</span><span class="n">index</span><span class="p">)</span>
-<span class="n">m</span> <span class="n">isDefinedAt</span> <span class="n">index</span>
-<span class="n">m</span> <span class="n">contains</span> <span class="n">index</span>
-<span class="n">m</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="n">index</span><span class="p">,</span> <span class="n">value</span><span class="p">)</span>
-<span class="n">m</span> <span class="o">+</span> <span class="p">(</span><span class="n">index</span> <span class="o">-&gt;</span> <span class="n">value</span><span class="p">)</span>
-<span class="n">m</span> <span class="o">+</span> <span class="p">(</span><span class="n">value</span><span class="p">,</span> <span class="n">index</span><span class="p">)</span>
+<span class="n">m</span><span class="w"> </span><span class="n">isDefinedAt</span><span class="w"> </span><span class="n">index</span>
+<span class="n">m</span><span class="w"> </span><span class="n">contains</span><span class="w"> </span><span class="n">index</span>
+<span class="n">m</span><span class="p">.</span><span class="n">updated</span><span class="p">(</span><span class="n">index</span><span class="p">,</span><span class="w"> </span><span class="n">value</span><span class="p">)</span>
+<span class="n">m</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">index</span><span class="w"> </span><span class="o">-&gt;</span><span class="w"> </span><span class="n">value</span><span class="p">)</span>
+<span class="n">m</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="p">(</span><span class="n">value</span><span class="p">,</span><span class="w"> </span><span class="n">index</span><span class="p">)</span>
 <span class="n">m</span><span class="p">.</span><span class="n">get</span><span class="p">(</span><span class="n">index</span><span class="p">)</span>
-<span class="n">m</span><span class="p">.</span><span class="n">getOrElse</span><span class="p">(</span><span class="n">index</span><span class="p">,</span> <span class="n">value2</span><span class="p">)</span>
+<span class="n">m</span><span class="p">.</span><span class="n">getOrElse</span><span class="p">(</span><span class="n">index</span><span class="p">,</span><span class="w"> </span><span class="n">value2</span><span class="p">)</span>
 </pre></div>
 </div>
 </section>
 <section id="function">
-<h3>Function<a class="headerlink" href="#function" title="Permalink to this headline">¶</a></h3>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span> <span class="n">f1</span> <span class="o">=</span> <span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>                 <span class="c1">// simple anonymous function</span>
+<h3>Function<a class="headerlink" href="#function" title="Link to this heading">¶</a></h3>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="kd">val</span><span class="w"> </span><span class="n">f1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="w">                 </span><span class="c1">// simple anonymous function</span>
 
-<span class="kd">val</span> <span class="n">y</span>  <span class="o">=</span> <span class="mi">2</span>
-<span class="kd">val</span> <span class="n">f2</span> <span class="o">=</span> <span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">f1</span><span class="p">(</span><span class="n">x</span><span class="p">)</span> <span class="o">+</span> <span class="n">y</span>             <span class="c1">// closes over `f1` and `y`</span>
-<span class="kd">val</span> <span class="n">f3</span> <span class="o">=</span> <span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="k">if</span> <span class="p">(</span><span class="n">x</span> <span class="o">&lt;</span> <span class="mi">0</span><span class="p">)</span> <span class="n">f1</span> <span class="k">else</span> <span class="n">f2</span> <span class="c1">// anonymous function returning another function</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">y</span><span class="w">  </span><span class="o">=</span><span class="w"> </span><span class="mi">2</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">f2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">f1</span><span class="p">(</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="w">             </span><span class="c1">// closes over `f1` and `y`</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">f3</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">f1</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="n">f2</span><span class="w"> </span><span class="c1">// anonymous function returning another function</span>
 
-<span class="n">list</span><span class="p">.</span><span class="n">map</span><span class="p">(</span><span class="n">f1</span><span class="p">)</span>      <span class="c1">// functions can be passed around ...</span>
-<span class="n">list</span><span class="p">.</span><span class="n">map</span><span class="p">(</span><span class="n">f3</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span> <span class="n">_</span><span class="p">)</span> <span class="c1">// ... and partially applied</span>
+<span class="n">list</span><span class="p">.</span><span class="n">map</span><span class="p">(</span><span class="n">f1</span><span class="p">)</span><span class="w">      </span><span class="c1">// functions can be passed around ...</span>
+<span class="n">list</span><span class="p">.</span><span class="n">map</span><span class="p">(</span><span class="n">f3</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="n">_</span><span class="p">)</span><span class="w"> </span><span class="c1">// ... and partially applied</span>
 </pre></div>
 </div>
 <div class="admonition note">
@@ -810,58 +809,58 @@ <h3>Function<a class="headerlink" href="#function" title="Permalink to this head
 </div>
 </section>
 <section id="bitvectors">
-<h3>Bitvectors<a class="headerlink" href="#bitvectors" title="Permalink to this headline">¶</a></h3>
+<h3>Bitvectors<a class="headerlink" href="#bitvectors" title="Link to this heading">¶</a></h3>
 <p>Bitvectors are currently only supported in GenC and for verification, but
 <a class="reference external" href="https://github.com/epfl-lara/stainless/issues/982">not for compilation</a>.</p>
 <p>These examples are taken from <a class="reference external" href="https://github.com/epfl-lara/stainless/blob/master/frontends/benchmarks/verification/valid/MicroTests/BitVectors3.scala">BitVectors3.scala</a>.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">math</span><span class="p">.</span><span class="nc">BitVectors</span><span class="p">.</span><span class="n">_</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">math</span><span class="p">.</span><span class="nc">BitVectors</span><span class="p">.</span><span class="n">_</span>
 
-<span class="kd">val</span> <span class="n">x1</span><span class="p">:</span> <span class="nc">UInt8</span> <span class="o">=</span> <span class="mi">145</span>
-<span class="kd">val</span> <span class="n">x2</span><span class="p">:</span> <span class="nc">Int8</span> <span class="o">=</span> <span class="n">x1</span><span class="p">.</span><span class="n">toSigned</span><span class="p">[</span><span class="nc">Int8</span><span class="p">]</span> <span class="c1">// conversion from unsigned to signed ints</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">x1</span><span class="p">:</span><span class="w"> </span><span class="nc">UInt8</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">145</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">x2</span><span class="p">:</span><span class="w"> </span><span class="nc">Int8</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x1</span><span class="p">.</span><span class="n">toSigned</span><span class="p">[</span><span class="nc">Int8</span><span class="p">]</span><span class="w"> </span><span class="c1">// conversion from unsigned to signed ints</span>
 
 <span class="c1">// Bitvectors can be compared to literal constants, which are encoded as a bitvector of the same</span>
 <span class="c1">// type as the left-hand-side bitvector.</span>
 <span class="c1">// In the line below, `-111` get encoded internally as an `Int8`.</span>
-<span class="n">assert</span><span class="p">(</span><span class="n">x2</span> <span class="o">==</span> <span class="o">-</span><span class="mi">111</span><span class="p">)</span>
+<span class="n">assert</span><span class="p">(</span><span class="n">x2</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="o">-</span><span class="mi">111</span><span class="p">)</span>
 
 <span class="c1">// In Stainless internals, `Int8` and `Byte` are the same type, but not for the surface language,</span>
 <span class="c1">// so `toByte` allows to go from `Int8` to `Byte`.</span>
 <span class="c1">// Similarly, we support `toShort`, `toInt`, `toLong` for conversions</span>
 <span class="c1">// respectively from `Int16` to `Short`, `Int32` to `Int`, `Int64` to `Long`,</span>
 <span class="c1">// and `fromByte`, `fromShort`, `fromInt`, `fromLong` for the other direction</span>
-<span class="kd">val</span> <span class="n">x3</span><span class="p">:</span> <span class="nc">Byte</span> <span class="o">=</span> <span class="n">x2</span><span class="p">.</span><span class="n">toByte</span>
-<span class="n">assert</span><span class="p">(</span><span class="n">x3</span> <span class="o">==</span> <span class="o">-</span><span class="mi">111</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">x3</span><span class="p">:</span><span class="w"> </span><span class="nc">Byte</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x2</span><span class="p">.</span><span class="n">toByte</span>
+<span class="n">assert</span><span class="p">(</span><span class="n">x3</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="o">-</span><span class="mi">111</span><span class="p">)</span>
 
 <span class="c1">// Unsigned ints can be cast to larger unsigned types</span>
-<span class="kd">val</span> <span class="n">x4</span><span class="p">:</span> <span class="nc">UInt12</span> <span class="o">=</span> <span class="n">x1</span><span class="p">.</span><span class="n">widen</span><span class="p">[</span><span class="nc">UInt12</span><span class="p">]</span>
-<span class="n">assert</span><span class="p">(</span><span class="n">x4</span> <span class="o">==</span> <span class="mi">145</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">x4</span><span class="p">:</span><span class="w"> </span><span class="nc">UInt12</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x1</span><span class="p">.</span><span class="n">widen</span><span class="p">[</span><span class="nc">UInt12</span><span class="p">]</span>
+<span class="n">assert</span><span class="p">(</span><span class="n">x4</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">145</span><span class="p">)</span>
 
 <span class="c1">// or truncated to smaller unsigned types.</span>
-<span class="kd">val</span> <span class="n">x5</span><span class="p">:</span> <span class="nc">UInt4</span> <span class="o">=</span> <span class="n">x1</span><span class="p">.</span><span class="n">narrow</span><span class="p">[</span><span class="nc">UInt4</span><span class="p">]</span>
-<span class="n">assert</span><span class="p">(</span><span class="n">x5</span> <span class="o">==</span> <span class="mi">1</span><span class="p">)</span> <span class="c1">// 145 % 2^4 == 1</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">x5</span><span class="p">:</span><span class="w"> </span><span class="nc">UInt4</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x1</span><span class="p">.</span><span class="n">narrow</span><span class="p">[</span><span class="nc">UInt4</span><span class="p">]</span>
+<span class="n">assert</span><span class="p">(</span><span class="n">x5</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"> </span><span class="c1">// 145 % 2^4 == 1</span>
 
 <span class="c1">// Signed ints can also be cast to larger signed types (using sign extension)</span>
-<span class="kd">val</span> <span class="n">x6</span><span class="p">:</span> <span class="nc">Int8</span> <span class="o">=</span> <span class="mi">120</span>
-<span class="kd">val</span> <span class="n">x7</span><span class="p">:</span> <span class="nc">Int12</span> <span class="o">=</span> <span class="n">x6</span><span class="p">.</span><span class="n">widen</span><span class="p">[</span><span class="nc">Int12</span><span class="p">]</span>
-<span class="n">assert</span><span class="p">(</span><span class="n">x7</span> <span class="o">==</span> <span class="mi">120</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">x6</span><span class="p">:</span><span class="w"> </span><span class="nc">Int8</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">120</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">x7</span><span class="p">:</span><span class="w"> </span><span class="nc">Int12</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x6</span><span class="p">.</span><span class="n">widen</span><span class="p">[</span><span class="nc">Int12</span><span class="p">]</span>
+<span class="n">assert</span><span class="p">(</span><span class="n">x7</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">120</span><span class="p">)</span>
 
 <span class="c1">// and cast to smaller signed types.</span>
 <span class="c1">// This corresponds to extracting the least significant bits of the representation</span>
 <span class="c1">// (see `extract` here http://smtlib.cs.uiowa.edu/logics-all.shtml).</span>
-<span class="kd">val</span> <span class="n">x8</span><span class="p">:</span> <span class="nc">Int4</span> <span class="o">=</span> <span class="n">x6</span><span class="p">.</span><span class="n">narrow</span><span class="p">[</span><span class="nc">Int4</span><span class="p">]</span>
-<span class="n">assert</span><span class="p">(</span><span class="n">x8</span> <span class="o">==</span> <span class="o">-</span><span class="mi">8</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">x8</span><span class="p">:</span><span class="w"> </span><span class="nc">Int4</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x6</span><span class="p">.</span><span class="n">narrow</span><span class="p">[</span><span class="nc">Int4</span><span class="p">]</span>
+<span class="n">assert</span><span class="p">(</span><span class="n">x8</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="o">-</span><span class="mi">8</span><span class="p">)</span>
 
 <span class="c1">// the `toByte`, `toShort`, `toInt`, and `toLong` methods described above</span>
 <span class="c1">// can be used on any bitvector type. For signed integers, this corresponds</span>
 <span class="c1">// to a narrowing or a widening operation depending on the bitvector size.</span>
 <span class="c1">// For unsigned integers, this corresponds to first doing a widening/narrowing</span>
 <span class="c1">// operation, and then applying `toSigned`</span>
-<span class="kd">val</span> <span class="n">x9</span><span class="p">:</span> <span class="nc">UInt2</span> <span class="o">=</span> <span class="mi">3</span>
-<span class="n">assert</span><span class="p">(</span><span class="n">x9</span><span class="p">.</span><span class="n">toInt</span> <span class="o">==</span> <span class="n">x9</span><span class="p">.</span><span class="n">widen</span><span class="p">[</span><span class="nc">UInt32</span><span class="p">].</span><span class="n">toSigned</span><span class="p">[</span><span class="nc">Int32</span><span class="p">].</span><span class="n">toInt</span><span class="p">)</span>
+<span class="kd">val</span><span class="w"> </span><span class="n">x9</span><span class="p">:</span><span class="w"> </span><span class="nc">UInt2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">3</span>
+<span class="n">assert</span><span class="p">(</span><span class="n">x9</span><span class="p">.</span><span class="n">toInt</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x9</span><span class="p">.</span><span class="n">widen</span><span class="p">[</span><span class="nc">UInt32</span><span class="p">].</span><span class="n">toSigned</span><span class="p">[</span><span class="nc">Int32</span><span class="p">].</span><span class="n">toInt</span><span class="p">)</span>
 
 <span class="c1">// The library also provide constants for maximum and minimum values.</span>
-<span class="n">assert</span><span class="p">(</span><span class="n">max</span><span class="p">[</span><span class="nc">Int8</span><span class="p">]</span> <span class="o">==</span> <span class="mi">127</span><span class="p">)</span>
-<span class="n">assert</span><span class="p">(</span><span class="n">min</span><span class="p">[</span><span class="nc">Int8</span><span class="p">]</span> <span class="o">==</span> <span class="o">-</span><span class="mi">128</span><span class="p">)</span>
+<span class="n">assert</span><span class="p">(</span><span class="n">max</span><span class="p">[</span><span class="nc">Int8</span><span class="p">]</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">127</span><span class="p">)</span>
+<span class="n">assert</span><span class="p">(</span><span class="n">min</span><span class="p">[</span><span class="nc">Int8</span><span class="p">]</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="o">-</span><span class="mi">128</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>Arrays, which are usually indexed using <code class="docutils literal notranslate"><span class="pre">Int</span></code>, may also be indexed using the bitvector types.
@@ -903,8 +902,7 @@ <h3>Bitvectors<a class="headerlink" href="#bitvectors" title="Permalink to this
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="wrap.html" class="btn btn-neutral float-left" title="Working With Existing Code" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="library.html" class="btn btn-neutral float-right" title="Stainless Library" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -913,7 +911,7 @@ <h3>Bitvectors<a class="headerlink" href="#bitvectors" title="Permalink to this
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -924,7 +922,7 @@ <h3>Bitvectors<a class="headerlink" href="#bitvectors" title="Permalink to this
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/references.html b/references.html
index 081251ddad..14fe57a3fc 100644
--- a/references.html
+++ b/references.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>References &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Stainless’ Internals" href="internals.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -76,20 +78,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>References</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">References</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/references.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -100,13 +99,13 @@
            <div itemprop="articleBody">
              
   <section id="references">
-<span id="id1"></span><h1>References<a class="headerlink" href="#references" title="Permalink to this headline">¶</a></h1>
+<span id="id1"></span><h1>References<a class="headerlink" href="#references" title="Link to this heading">¶</a></h1>
 <p>The Stainless/Inox stack has emerged as a cleaner and leaner version of the Leon
 synthesis and verification framework. Leon is documented in several
 papers and talks, which provide additional information on the algorithms
 and techniques we used in Leon (and now Stainless/Inox).</p>
 <section id="videos">
-<h2>Videos<a class="headerlink" href="#videos" title="Permalink to this headline">¶</a></h2>
+<h2>Videos<a class="headerlink" href="#videos" title="Link to this heading">¶</a></h2>
 <blockquote>
 <div><ul class="simple">
 <li><p><a class="reference external" href="http://video.itu.dk/video/10044793/icalp-2014-viktor-kuncak">Verifying and Synthesizing Software with Recursive Functions</a> (ICALP 2014)</p></li>
@@ -116,7 +115,7 @@ <h2>Videos<a class="headerlink" href="#videos" title="Permalink to this headline
 </div></blockquote>
 </section>
 <section id="papers">
-<h2>Papers<a class="headerlink" href="#papers" title="Permalink to this headline">¶</a></h2>
+<h2>Papers<a class="headerlink" href="#papers" title="Link to this heading">¶</a></h2>
 <blockquote>
 <div><ul class="simple">
 <li><p><a class="reference external" href="https://lara.epfl.ch/~kuncak/papers/HamzaETAL19SystemFR.pdf">System FR: Formalized Foundations for the Stainless Verifier</a>, by <em>Jad Hamza</em>, <em>Nicolas Voirol</em>, and <em>Viktor Kuncak</em>. Object-Oriented Programming, Systems, Languages &amp; Applications (OOPSLA), 2019.</p></li>
@@ -139,7 +138,7 @@ <h2>Papers<a class="headerlink" href="#papers" title="Permalink to this headline
 </div></blockquote>
 </section>
 <section id="books">
-<h2>Books<a class="headerlink" href="#books" title="Permalink to this headline">¶</a></h2>
+<h2>Books<a class="headerlink" href="#books" title="Link to this heading">¶</a></h2>
 <blockquote>
 <div><ul class="simple">
 <li><p><a class="reference external" href="http://www.concrete-semantics.org/">Concrete Semantics with Isabelle/HOL</a>, by <em>Tobias Nipkow</em> and <em>Gerwin Klein</em>.</p></li>
@@ -151,8 +150,7 @@ <h2>Books<a class="headerlink" href="#books" title="Permalink to this headline">
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="faq.html" class="btn btn-neutral float-left" title="FAQ: (Frequently) Asked Questions" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="internals.html" class="btn btn-neutral float-right" title="Stainless’ Internals" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -161,7 +159,7 @@ <h2>Books<a class="headerlink" href="#books" title="Permalink to this headline">
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -172,7 +170,7 @@ <h2>Books<a class="headerlink" href="#books" title="Permalink to this headline">
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/search.html b/search.html
index 541a8294c0..7c80b8144b 100644
--- a/search.html
+++ b/search.html
@@ -1,25 +1,24 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
   <meta charset="utf-8" />
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Search &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
     
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
-    <script type="text/javascript" src="_static/searchtools.js"></script>
-    <script type="text/javascript" src="_static/language_data.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
+    <script src="_static/searchtools.js"></script>
+    <script src="_static/language_data.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="#" /> 
 </head>
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="#" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul>
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -71,20 +73,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Search</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Search</li>
       <li class="wy-breadcrumbs-aside">
       </li>
   </ul>
@@ -114,7 +113,7 @@
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on May 09, 2024.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -125,16 +124,16 @@
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
   </script>
-  <script type="text/javascript">
+  <script>
     jQuery(function() { Search.loadIndex("searchindex.js"); });
   </script>
   
-  <script type="text/javascript" id="searchindexloader"></script>
+  <script id="searchindexloader"></script>
    
 
 
diff --git a/searchindex.js b/searchindex.js
index 7689d1a503..736a2e0aa7 100644
--- a/searchindex.js
+++ b/searchindex.js
@@ -1 +1 @@
-Search.setIndex({docnames:["casestudies","coq","equivalence","faq","genc","gettingstarted","ghost","imperative","index","installation","internals","intro","laws","library","limitations","neon","options","purescala","references","tutorial","verification","wrap"],envversion:{"sphinx.domains.c":2,"sphinx.domains.changeset":1,"sphinx.domains.citation":1,"sphinx.domains.cpp":4,"sphinx.domains.index":1,"sphinx.domains.javascript":2,"sphinx.domains.math":2,"sphinx.domains.python":3,"sphinx.domains.rst":2,"sphinx.domains.std":2,"sphinx.ext.todo":2,sphinx:56},filenames:["casestudies.rst","coq.rst","equivalence.rst","faq.rst","genc.rst","gettingstarted.rst","ghost.rst","imperative.rst","index.rst","installation.rst","internals.rst","intro.rst","laws.rst","library.rst","limitations.rst","neon.rst","options.rst","purescala.rst","references.rst","tutorial.rst","verification.rst","wrap.rst"],objects:{},objnames:{},objtypes:{},terms:{"0":[0,1,3,4,5,6,7,11,12,13,15,16,17,19,20,21],"018":21,"023":21,"029":12,"037":12,"052":12,"080":21,"095":21,"1":[1,3,4,5,7,8,11,12,13,15,16,17,19,20],"10":[7,8,11,19],"100":[4,11,20],"1000":[0,4],"101":11,"108":12,"1089455080":2,"109":12,"11":[1,11,12],"110":[12,21],"111":[12,17],"112":12,"113":12,"114":12,"115":12,"116":12,"117":12,"119":12,"12":[4,12,16,21],"120":[12,17],"1263292350":5,"127":17,"128":17,"13":[7,9,12,19],"1357890535":2,"1376322050":5,"14":[7,12],"145":17,"15":[5,9],"16":[4,5,19],"1639624704":19,"17":[4,5,9],"18":9,"1879048192":19,"19":5,"1989":12,"2":[1,2,3,5,7,12,15,16,17,19,20],"20":5,"200":21,"2010":18,"2011":18,"2012":18,"2013":18,"2014":18,"2015":18,"2016":18,"2019":18,"21":[5,9,17],"2147483647":19,"2147483648":19,"22":5,"24":[5,12],"25":[5,12],"256":17,"26":12,"27":[12,15],"28":[5,15],"29":[5,12],"3":[2,5,7,9,12,15,17,20],"30":12,"31":[3,15,17],"32":[3,4,19],"32bit":17,"33":5,"34":5,"35":5,"36":5,"37":5,"38":5,"398":21,"4":[7,12,15,17,21],"40":15,"42":[7,17,21],"44":5,"45":5,"46":21,"47":21,"48":21,"5":[4,5,9,12,15,16,17,19,21],"50":20,"500":0,"512":5,"56":21,"58":21,"59":21,"6":[4,5,9,12,15,19],"615":15,"616":15,"617":15,"618":15,"64":[4,9],"691483681":5,"7":[4,5,9,12,15,19],"729":12,"73":5,"77":12,"770374653":5,"771685886":5,"79":12,"8":[1,4,15,17],"80":12,"81":5,"82":12,"84":12,"85":12,"86":12,"87":12,"9":12,"91":11,"\u03c3":15,"abstract":[0,3,4,8,12,13,15,18,19,20],"boolean":[0,2,4,6,7,8,12,13,15,19,20,21],"break":[12,15],"byte":[4,17],"case":[2,3,4,5,7,8,9,11,12,13,14,15,16,19,20,21],"char":4,"class":[0,3,6,7,11,12,13,15,19,20,21],"czip\u00f3":1,"default":[4,7,9,11,14,15,16,19,20,21],"do":[0,3,4,7,9,11,12,13,14,15,16,17,19],"export":[8,16],"final":[0,2,4,7,9,12,15,16],"float":17,"function":[0,1,2,3,5,6,8,9,11,12,13,14,15,16,18,19,21],"import":[4,6,9,12,13,15,16,17,19,20,21],"int":[2,3,4,5,7,12,19,20,21],"k\u00f6ksal":18,"long":[3,4,7,9,17],"new":[0,6,7,9,12,13,15,17,21],"public":17,"r\u00e9gi":[7,18],"return":[0,1,4,8,11,13,14,15,16,17,19,20],"short":[4,13,16,17],"static":[3,11,18,19,20],"super":[12,17],"true":[0,1,2,4,5,6,7,9,12,13,14,15,16,17,19,20],"try":[3,5,7,9,11,12,13,14,15,16,19],"var":[0,4,6,7],"void":4,"while":[3,4,8,9,12,15,16,17,20,21],A:[0,4,6,7,8,9,11,12,14,17,19,20],And:[2,15,21],As:[1,6,11,12,13,15,19,20,21],At:[4,16],Being:8,But:[15,20],By:[14,16,19,21],For:[2,7,8,9,11,12,13,14,15,16,17,19,20],If:[3,6,9,11,12,13,15,16,19,20],In:[0,1,3,4,7,9,11,12,13,14,15,17,19,20,21],It:[0,3,4,5,7,9,11,12,15,17,19,20,21],Its:4,No:17,Not:8,On:[3,7,9,12],One:[3,6,12,13,15,17,19,20,21],Or:15,Such:[7,17,21],That:[0,9],The:[0,1,2,3,4,7,9,10,11,12,13,14,15,16,17,18,19,20,21],Their:[4,8],Then:[1,9,15],There:[4,7,12],These:[1,3,4,7,15,16,17],To:[2,3,4,5,7,9,11,12,13,15,16,19,20],With:[0,7,8,12,15,17],_1:17,_:[0,1,2,3,4,6,7,9,11,12,13,15,16,17,19,20,21],__function__:4,_build:9,_put:6,_take:6,a0:7,a1:7,a2:7,a_1:15,a_2:15,aaa:17,ab:17,abbrevi:19,abil:[3,7,11,13,17],abl:[3,9,11,12,15,20,21],abort:[6,16],about:[0,2,3,4,7,9,11,13,15,16,18,19,20,21],abov:[1,4,7,9,11,12,15,17,19,20,21],absenc:3,absinvalid:17,abundantli:15,acc:0,accept:[4,9,15],access:[0,4,8,13,16],accident:15,accompani:4,accord:4,accordingli:19,account:[17,19,20],achiev:[3,4,15],acl2:3,acm:18,act:15,actor:[8,9],actorcontext:0,actorlog:0,actorof:0,actorref:0,actorsystem:0,actorwrapp:0,actual:[7,12,14,15,17,20],ad:[6,7,9,12,15,17,20,21],adapt:9,add:[1,4,7,9,11,13,15,16,17,19],addfirst:6,addit:[3,6,7,8,9,11,12,17,18,19,20],addition:[4,13,15,16],additionali:2,address:0,adjoin:15,adt:[8,15,16,17],advanc:[3,15,16],advantag:15,affect:[4,7,15],after:[0,3,4,7,9,11,12,13,16,20],again:[12,15,19,21],against:[2,16],aid:18,aided:18,aim:[11,20],akin:15,akka:9,albeit:15,alert:19,algebra:[3,8,9,13,14,15,18,19],algebra_2:16,algorithm:[2,7,9,11,16,18,20,21],ali:18,alia:[4,7,15],alias:[4,5,8],all:[0,1,2,3,4,7,9,11,12,13,14,15,16,17,19,20],allevi:6,alllistsareempti:15,alloc:[4,14],allow:[3,4,7,9,12,13,17,19,20,21],along:[5,9,17,20],alreadi:[3,4,11,15,16,19,21],also:[0,3,4,5,7,9,11,12,13,14,15,16,17,19,20,21],altern:[17,19],although:15,altogeth:12,alwai:[7,11,12,13,15,16,19,20],amaz:3,ambigu:12,amend:12,among:[15,20],amount:3,an:[1,3,4,5,7,11,12,13,14,15,16,17,18,19,20,21],analog:9,analys:16,analysi:[3,15,16,18],analyz:19,ancestor:20,ani:[0,1,4,6,7,9,11,12,13,14,15,16,17,20,21],anim:17,annot:[0,4,8,12,15,16,17],anon:12,anonym:[7,13],anoth:[7,14,15,16,17,19,21],ansi:9,answer:[3,15],anti:[5,15],antireflex:15,antisymmetri:15,anyth:[7,15,19],anyv:[12,17],anywai:12,anywher:6,api:[0,8],appar:15,appear:3,append:[0,12,13,15],appendassoc:13,appendcont:15,appendindex:13,appli:[7,8,9,11,12,13,15,16,17,19,21],applic:[3,4,14,15,18],approach:[3,12],appropri:[0,9,12,13,21],approxim:11,apt:9,ar:[0,1,2,4,6,7,8,9,11,12,13,14,15,16,17,19,20,21],arbitrari:[7,15,17,19],arbitrarili:[3,14],architectur:[4,9,19],archiv:9,arg:[0,9],arguabl:15,argument:[1,4,6,7,9,15,16,17,19,21],aris:[12,15],arith:1,arithmet:[4,16,17,19],aritmet:16,arm:12,around:[3,7,11,13,17,21],arrai:[0,8,16],array_int32:4,arraydequ:6,ascend:[13,19],ascii:[4,9,16],ask:[8,9,15],aspect:[11,17,19],assembl:9,assert:[1,4,5,6,7,9,19,20,21],asset:9,assign:[4,6,7],assist:[3,15,17],associ:[0,8,11,15,17,19],associativityproperti:3,assum:[1,5,7,9,11,12,13,14,15,16,17,20,21],assumpt:[12,13,16],ast:12,asynchron:0,attempt:[0,9,11,12,16,19,20,21],attribut:15,author:3,autocomplet:9,autom:[2,3,4,11,13,15,18],automat:[1,2,3,4,7,9,11,12,15,16,19,20],auxiliari:6,avail:[4,5,7,9,13,14,15,16,17],avoid:[0,3,4,9,21],await:0,awar:14,b1:15,b2:15,b3:15,b:[0,1,4,6,7,8,12,15,16,17,19,20],back:[7,9,19],backbehav:0,backup:0,backupref:0,badli:15,badoverride1:17,badoverride2:17,badoverride3:17,bag:[16,19],bail:12,balanc:11,bar:17,base:[0,1,3,9,15,16,17,20],basecas:17,bash:9,basi:[12,15,16],basic:[3,12,15],batch:[7,9,16],bbb:17,bcdefghi:9,becam:12,becaus:[0,1,3,4,9,11,12,13,15,16,17,19,21],becom:[0,7,12,13,19],been:[1,3,12,13],befor:[7,9,11,15,16,20],begin:9,behav:[7,15,17],behavior:[12,19,20],behaviour:16,being:[0,15,19,20],believ:3,belong:17,below:[0,3,4,9,11,12,13,14,17,19],benc:1,benchmark:[1,2,3,5],best:[3,16],better:[3,12,16,19],between:[0,4,8,11,12,13,14,15,16,17,19],bigger:15,bigint:[0,1,3,5,6,7,9,11,12,13,14,15,19,20,21],bigintadditivemonoid:12,bigintaddmonoid:12,bigintord:12,bigintprodmonoid:12,bigintproductmonoid:12,bigintsummonoid:12,billion:3,bin:9,binari:[1,4,8,13],bind:[8,9],bintrai:16,bit:[3,4,9,15,17,19],bitvector:[3,16],bitvectors3:17,bitwis:4,blanc:[7,18],block:[7,15,17,19],blott:12,bodi:[5,6,7,8,9,12,13,15,16,19,21],bogu:15,book:8,bool:[1,4],boost:16,bootstrap:9,both:[0,2,3,4,9,12,13,15,19],bound:[4,14,16,18,19,20],boundari:3,box:[7,15],branch:[15,19],bridg:4,broken:20,brows:19,browser:9,buffer:9,bug:[3,19],buggi:19,buggysortedin:5,build:[3,8,11,13,15,16,19],built:[7,9,15,19],bundl:9,bytecod:8,c99:4,c:[1,3,6,8,15,16,17,20],cach:[5,9,12,16,21],cade:18,call:[4,6,7,9,11,12,13,15,16,17,19,20,21],came:3,can:[0,1,2,4,5,6,7,8,9,11,12,13,14,15,16,17,19,20,21],candid:[2,3],cannot:[4,7,11,12,13,15,16,17,19,20,21],cap:15,capabl:[15,16],captur:4,care:9,carri:[15,20],caseclass:17,cast:[4,17],categori:[2,4],caus:16,cav:18,ccode:[4,16],cd:9,certain:[11,12,15,19],certainli:15,cf0:7,cf1:7,cf:7,cfwhile:7,ch:[9,16],chain:15,chang:[4,7,15,17,19],channel:0,chapter:[15,20],char_bit:4,charact:[4,16],check:[3,4,7,8,9,11,13,16,17,18,19,20],checker:[1,2,11,15,16,20],chk:2,choic:1,choos:[3,8,13],chose:19,chosen:16,chunk:13,circuit:17,circumv:4,claim:[13,15],clariti:7,classif:2,claus:[3,7,17,19],cleaner:18,clear:[3,9,19],clearli:[12,15],click:9,clone:[1,9],close:[4,12,15,17],closer:[15,17],cluster:2,cmap:0,co:17,code:[0,3,5,6,8,12,13,15,16,17,19,20],codebas:21,codegen:16,coher:8,collect:[0,3,6,9,11,13,15,16,17,21],colno:9,colon:[4,15],color:[8,16],com:[3,9,17],combin:[4,7,11,12,15,20],come:[3,4,7,9,11,13,15,16,17],command:[1,2,5,9,13,16,19],comment:7,common:[9,12,15,16],comp:9,compact:16,compar:[8,9,17],comparefun:2,comparis:4,compat:[4,17],compil:[4,6,8,9,11,12,13,16,17,19,20],complain:21,complement:[7,11,17],complet:[7,15,18,19,20],complex:[3,8,20],complianc:4,compliant:4,complic:15,compon:[3,8,10],compos:12,comprehens:11,compromis:16,comput:[0,3,7,14,15,16,18,19],con:[0,2,3,5,6,9,12,13,15,17,19,20],concat:9,concaten:15,conceiv:3,concept:[11,20],conceptu:12,conclud:15,concret:[7,11,12,15,17,18,19],concrop:3,concurr:[0,11,21],cond:20,condit:[4,7,8,9,11,12,13,15,16,17,19],conf:[16,18],confer:18,config:16,configur:[1,8,9],conform:11,conjectur:17,conjunct:[4,15],connect:15,consequ:[15,19],consid:[1,2,3,4,7,9,15,16,19,20],consider:15,consist:[15,19],constant1:4,constant2:4,constant3:4,constant:[4,17],constitut:15,constrain:17,constraint:[3,12,17,18],construct:[3,7,11,13,15,16,17,19,20],constructor:[0,6,7,15,17],consult:[5,9,13],contact:3,contain:[1,4,9,13,15,16,17,19,20,21],containin:16,content:[5,6,8,13,15,16],context:[7,8,15,20],continu:15,contra:17,contract:[6,8,11,13,15,16,17,20],contracthyp4:1,contrari:15,contrarili:7,control:[7,9,18],controlflow2:7,controlflow:7,controversi:3,conveni:[4,11],convers:[7,8,17],convert:[4,13,16,17],copi:[7,9],coq:[3,8,11,16],coqc:1,core:[4,7,9,11,13,20],correct:[2,4,8,16,17,19,20],correctli:[3,7,13,15,19],correspond:[0,1,4,7,11,12,13,14,15,17,19,20],cost:[7,16],could:[3,7,12,14,15,19,20,21],count:13,countabl:15,counter:[3,5,15,16,18,19],counterexampl:[2,3,11,16,19,20],counterpart:15,cours:15,coursier:16,cover:[3,15,20],cow1:17,cow2:17,cow:17,cp:9,crash:[3,11,14,16],creat:[4,7,9,12,16,21],creation:4,critic:[9,14],crop:5,crucial:15,cs:17,ctx:0,cumul:13,cup:15,cur:[2,7],current:[0,4,5,7,9,11,15,16,17,21],custom:[8,16,17],cvc5:5,cvc:3,d1:16,d2:16,d:[9,15,17,19],dafni:3,dai:12,dash:16,data:[0,3,4,7,8,11,12,13,14,15,16,18,19,21],databas:16,dataflow:10,datatyp:[12,21],date:[13,16],deal:[4,12,15],debian:9,debug:[7,9,15,16,19,21],decent:15,decid:[13,19],decis:[12,18],declar:[4,7,12,17,19,20],decompos:15,decreas:[2,5,7,8,11,15,16],dedic:13,deduct:18,deem:12,deep:7,def:[0,1,2,3,4,6,7,9,11,12,13,15,17,19,20,21],defin:[0,1,2,3,4,7,8,12,13,14,15,16,17,20,21],definit:[0,1,4,7,8,12,13,15,19,20],defun:9,delic:[11,15],delimit:19,deliv:0,deliveri:0,delivermessag:0,delv:15,demo:18,demonstr:12,denomin:15,denot:[3,9,15,19],dep:16,depend:[3,4,5,8,12,15,16,17,20],deploi:3,deriv:[12,16,20],describ:[4,6,11,12,17,20],descript:[4,13,17,18,19],design:[3,11,18],desir:[4,19],despit:3,dest:0,destin:0,desugar:[7,12],detail:[4,15,16],determin:[0,16],determinist:[0,4],develop:[3,9,11,13],did:15,differ:[3,4,9,12,15,17,19,20,21],difficult:15,dir:16,direct:[13,17],directli:[3,4,15,16,19],directori:[1,9,13,15,16],disabl:16,disallow:12,discardold:0,discov:3,discrep:14,discret:[3,15],discuss:[15,20],disk:16,dispatch:0,displai:[7,16,19],disprov:[2,11,16,20],distinct:[15,19],distinguish:15,distribut:[5,13,15],doc:9,docker:5,document:[3,5,7,13,14,16,18,19],doe:[4,8,9,11,13,15,17,19,21],doesn:[4,15],domain:15,don:[3,13,16],done:[1,2,4,9,12],dotta:18,dotti:9,doubl:[16,17],doubleoverflow:19,doublesum:7,down:[5,9],download:9,drive:[0,16],drop:[0,4,13],dropvc:13,dscalaz3:9,dsl:15,due:[14,15,19],dummi:12,dump:16,duplic:[13,15],durat:0,dure:[3,7,9,12,13,16,21],dynam:[4,12],e:[3,4,5,7,9,11,12,13,15,16,17,19,20],each:[0,1,2,4,7,9,11,12,15,16,19,20],earli:[1,16],earlier:15,easi:[3,4,15],easier:[11,15],easili:[15,19],eat:17,editor:9,edu:17,educ:3,effect:[0,3,4,7,12,15],effici:[12,13,15,16],effort:3,eg:[9,12,13,17,19],either:[5,7,12,15,16],el:17,elem:17,element:[7,12,13,15,16,19],elementari:15,elimin:[7,8],els:[2,4,5,7,11,13,15,17,19],elsewher:15,emac:8,embrac:3,emerg:18,emit:[3,15,19,20],emmanouil:18,emploi:15,empti:[0,6,12,13,15,17,19,21],emptyset:15,enabl:[4,9,16,17],enableplugin:9,enclos:[13,17],encod:[1,3,11,12,13,17],encount:6,encourag:[11,13],end:[3,7,9,11,12,13,15],enforc:[7,12,14],enough:[8,13,14,15,21],ensur:[0,1,3,4,6,7,9,11,12,13,14,15,17,19,20,21],enter:[7,20],entir:[13,15],entri:21,enumer:[3,4],environ:[3,4],epfl:[7,9,16,17],eq:12,equal:[3,12,13,15,17,19],equat:[1,15],equival:[4,7,8,15],equivchk:2,erron:2,error:[3,7,8,9,11,12,15,16,17,20],especi:[3,15],essenti:[0,7,11,12,15],establish:[3,15],etc:16,etienn:18,eval:16,evalu:[4,11,13,15,17,19],even:[3,4,9,13,15,16,19,20],evensplit:13,eventu:20,ever:3,everi:[4,9,12,15],everyth:9,everywher:15,evidenc:12,evolv:4,exact:20,examin:[16,19],exampl:[1,3,4,7,8,9,11,12,13,14,16,17,18,19,20,21],excel:3,except:[4,13,15],exclus:4,execut:[0,1,3,4,7,8,9,14,16,18,19,20],executor:[5,9],exempt:4,exercis:[12,15],exhaust:[5,8,9,15],exist:[0,3,4,5,8,11,13,14,15,17,20],exit:[7,16,20],exp:15,expand:15,expect:[3,4,6,11,12,15,19],expens:15,experi:[3,9],experiment:[1,15],explain:[1,2,4,16,19],explicit:[12,15,16,17,20],explor:[3,15],expmultcommut:15,exponenti:15,expos:5,expr:[17,20],express:[4,7,8,11,12,13,15,19,20,21],extend:[0,3,4,7,12,13,15,17,19,20],extens:[7,12,17],extern:[0,3,4,6,8,11,13,16,17,19],externfield:21,extra:[1,4,9,15,16],extract:[9,12,13,16,17,20,21],extractionsuit:9,extrem:3,f1:[16,17],f2:[15,16,17],f3:[9,17],f7:9,f8:9,f:[7,12,13,15,17,20],face:15,facil:4,fact:[12,15,19,20,21],factor:[15,16],factori:11,fail:[1,6,11,15,16,17,19,21],fair:16,fairli:[12,15,19],fall:9,fals:[0,1,2,4,6,7,9,13,16,17,19,20],famili:4,familiar:[11,15],fan:13,faq:8,far:15,fashion:15,faster:18,favorit:9,fearlessli:12,featur:[7,8,11,12,15],fed:4,feedback:15,feel:16,fetch:16,few:[7,12,15,17,20],field:[0,4,6,7,13,16,17,21],file:[1,4,5,8,9,17],fileinputstream:4,filenam:9,fileoutputstream:4,fill:4,filter:13,find:[3,9,11,13,15,16,19,20],finish:[9,14],finit:[15,17,19],first:[0,1,4,7,11,12,13,15,16,17,19,21],fit:[11,16],fix:[4,15],flag:[4,9,12,16,21],flatmap:13,flatten:13,flight:0,flip:9,flow:7,focu:3,fold:[12,15],folder:9,foldleft:[0,13,15],foldmap:12,foldright:[12,13,15],follow:[1,2,4,6,7,9,11,12,13,15,16,17,19,20,21],foo:[7,15,17],food:17,footnot:15,foral:[0,3,13,15,20,21],forev:20,form:[3,7,9,11,12,13,15,16,17],formal:[3,15,18,20],format:[4,9],formula:[3,15,20],forward:21,found:[2,4,5,9,13,14,15,16,19],foundat:18,four:15,fr:[16,18],fraction:3,fragment:[11,13,21],framework:[0,11,18],free:[3,20],freeli:21,frequent:8,from:[0,2,4,5,6,7,8,12,13,15,16,17,19,20,21],frombyt:17,fromint:17,fromlong:17,fromshort:17,front:[7,9,11],frontend:[1,2,5,9,13,16],fsinsert:19,fulfil:15,full:[13,15,16],fulli:[4,9,12],fun:1,further:[12,15,16],furthermor:[4,9],futur:[3,11,17],fuzz:8,fuzzer:3,g8:17,g:[3,4,9,11,12,13,15,16,17],genc:[4,16,17],gener:[1,2,3,7,8,11,12,13,15,19,20],geq:15,gerwin:18,get:[2,4,5,7,9,12,13,15,17],gethead:20,getorels:[6,17],getter:7,gh:9,ghost:[0,4,7,8,13],git:9,github:[5,9,17],give:[3,13,15,17,20],givefood:17,given:[0,2,3,4,9,11,12,14,15,16,17,19,20],global:[8,9],globalextern:4,globalst:4,globaluniniti:4,go:[4,7,12,13,15,16,17,19],goal:[14,15],goe:[4,12],good:[3,12,15],govern:12,granular:15,grass:17,greater:17,group:[15,16,17],grow:[13,15],gs:4,gtb:1,guarante:[3,11,15,20],guard:[17,20],guess:15,guid:15,guidelin:[4,19],h:[4,9,13,15,16,17],ha:[0,3,4,7,12,13,15,16,18,19,20,21],had:[3,15],halv:13,hamza:18,hand:[3,4,11,15,17],handi:15,handl:[0,7,11,13,16,20],handler:0,happen:[11,15,16,20,21],happi:17,happili:15,hard:[11,13,15,16],hardwar:4,hash:9,haskel:[11,12],have:[0,1,3,4,7,9,12,13,14,15,16,17,19,20],hd:17,he:15,head:[0,2,3,5,9,13,19,20],header1:16,header2:16,header:[4,16],headless:9,headopt:[6,13],headwai:15,heap:[11,14],hello:[6,17,21],hellostainless:9,help:[3,5,9,11,12,15,16,19],helper:[12,15],henc:[4,15,20],henceforth:5,here:[0,1,4,7,9,12,13,15,17,19],heurist:16,hi:[4,17],hide:[4,13],hierarchi:[3,4,12,16],higher:[3,4,12,15,16,18],highli:9,hindlei:12,hint1:15,hint2:15,hint:15,hitch:12,hoc:12,hocon:16,hol4:3,hol:[3,18],hold:[0,3,4,7,11,12,13,14,15,16,17,19,20],hood:8,how:[0,4,8,12,15,17,19,20],howev:[4,7,9,11,13,15,19,20],html:9,http:[3,9,13,16,17],huge:19,human:[9,15],hupel:18,hybrid:17,hypothesi:15,i1:7,i2:7,i:[7,8,13,15,17,19],icalp:18,id:[7,8,16,17],idea:15,ident:[12,15,17],identifi:[3,4,7,12,15,17],idiomat:[0,4],ie:[12,16,17],ifthenels:1,ignor:[0,13,16],ijcar:18,illeg:7,illustr:[3,7,8,19],imagin:12,immut:[0,17],immutablebox:7,imper:[4,8,11,20],implement:[2,3,7,9,11,12,13,15,17,18,19,20,21],impli:[0,4,15,16,20],implic:[4,17],implicit:[0,4,7,11,12,20],implicitli:15,impos:4,improv:[9,15],inbox:0,inc:[0,7],includ:[3,4,9,12,13,14,15,16,17,20],incoher:12,incom:0,incomplet:20,incorrect:2,increas:[3,9],increment:[0,9,17],inde:[4,7,12,15,19,21],independ:[3,9],indetermin:15,index:[9,13,17,20],indic:[7,16],individu:20,induct:[0,2,3,7,12,13,16,19,20],industri:8,inequ:15,infer:[11,15,16,17,18,20],infinit:[11,14,17],inflat:9,info:[0,2,5,9,15,17,19],inform:[0,2,5,9,13,15,18,20],infrequ:9,inhabit:15,inherit:[4,8,17],init:13,initcount:0,initi:[0,1,4,7,20],initialbehavior:0,initialinv:0,initialsystem:0,inject:[7,13,15],inlin:[0,4,12,13,19,20],inlineinvari:20,inlineonc:[12,13],inox:[1,3,11,18],input:[2,3,4,11,15,16,17,19,20],inputfilesandopt:9,insert:[8,13,15,21],insertat:13,insertionsort:[3,5],insid:[9,13,15,16,17,19,20],insight:3,inspect:[7,17,19,21],inspir:16,inssort:13,instal:[1,5,8,11],instanc:[0,4,7,9,12,13,16,17],instanti:[6,12,15],instead:[3,4,7,9,13,15,16,19],instruct:[9,13,21],instrument:16,int12:17,int16:[4,17],int16_t:4,int32:[4,17],int32_t:4,int4:17,int64:[4,17],int64_t:4,int8:[4,17],int8_t:4,integ:[3,4,12,13,15,17,19],integr:[3,18],intend:11,intention:15,interact:[4,9,11,15,16],interchang:17,interest:[3,12,15,19,21],interfac:[12,16,18,19],interleav:15,intermedi:[15,17],intern:[7,8,11,12,16,17,18,20],interoper:3,interpret:[16,17,18],intersect:17,interv:17,inti:17,introduc:[3,6,7,9,11,12,15,19],introduct:8,inttyp:4,intuit:15,intx:17,inv:[0,20],invalid:[3,5,7,9,11,12,15,16,19,21],invari:[3,4,7,8,13,17],invariantfunct:7,invers:12,invest:3,invit:18,invoc:19,invok:[0,2,9,11,13,14,16,17],involv:[0,3,12,15,20],io:[4,9,16],isabel:[3,11,16,18],isdefin:6,isdefinedat:17,isempti:[0,2,6,13,15],isinstanceof:[5,9,20],isiz:19,ismeasur:15,isn:15,isnonzero:15,isol:9,isposit:[15,17],israt:15,issort:[2,5,6,13,19],issorteda:2,issortedb:2,issortedc:2,issortedr:2,issu:[6,7,9,12,15,20],iter:[2,20],its:[0,3,4,7,9,10,11,12,13,15,16,17,19,20],itself:[0,3,12,13,15,20,21],ivan:18,ivi:16,j:9,jacob:18,jad:18,jar:[9,16],java:[6,8,9,12,13,21],jdk:13,joint:18,jre:9,json:16,jump:9,just:[3,9,11,12,15,16,17],jvm:[3,9,16,19],k:21,keep:[13,15,20],kei:[9,21],kept:17,keyword:[8,13,15,17,20],kill:15,kind:[12,17],klein:18,kneuss:18,know:[11,15,20,21],knowledg:[3,12,15],known:[4,12,20],koukouto:18,kuncak:18,kuraj:18,l1:[13,15],l2:[13,15],l3:13,l:[2,3,5,6,13,15,17,19,20],lambda:16,land:20,lang:[0,6,7,13,15,16,17,21],languag:[3,4,7,9,11,12,13,15,17,18,20],lar:18,lara:[9,16,17],larg:[3,13,14,19],larger:[17,19],last:[13,15,17,19],lastopt:13,later:[9,15],latest:[9,16],latter:[0,9,12,17,20],law:12,law_associ:12,law_leftident:12,law_rightident:12,layer:17,lazi:[9,17],lead:[11,12,15],leaf:4,leak:4,lean:3,leaner:18,learn:[3,4,11,13,15,19],least:[3,9,11,17,19],leav:15,left:[4,13,15,17],leftunitappend:15,lemma:[2,6,12,15,19],lemma_associativity_plu:12,lemma_rightidentity_plu:12,length:[0,4,7,17,20],leon:[3,4,18],leq:2,less:[12,13,15],lessthan:12,lessthaneq:12,let:[4,7,9,12,15,16,19,20,21],level:[0,3,7,8,9,11,12,15,17],leverag:7,lib:[1,9,13,16],libfil:16,libgomp1:9,librari:[0,3,4,5,8,9,11,12,15,17,19,21],library_2:9,librarydepend:9,lift:17,like:[3,5,9,11,12,13,15,16,17,19,20,21],limit:[3,4,8,17],line:[5,7,9,13,16,17,19],lineno:9,link:[9,12],linux:8,list:[0,2,3,4,5,6,8,9,11,12,15,17,20],listop:13,listoper:3,listspec:13,liter:[4,17],littl:19,live:[4,9,15],ll:15,ln:9,load:[9,16],local:[4,7,9,13,15,16],locat:[9,15],log:0,logic:[3,15,17],longer:[13,15],longest:13,look:[12,13,15,19,21],loop:[2,3,4,8,9,11],loos:0,lose:15,lot:21,low:[3,8],lower:9,ls:13,lucki:16,m:[0,11,12,15,17],machin:3,maco:8,made:4,madhavan:18,magic:7,magnitud:18,mai:[3,5,7,9,11,14,15,16,17,19],main:[0,4,5,9,10],maintain:[0,7,9,17],major:15,make:[1,3,4,7,9,12,15,16,17,19,20],makefil:9,makefoo:17,malloc:4,manag:[9,11,15],mandatori:4,mangl:4,mani:[2,3,12,15,16,19,20],manipul:[3,4,14,16],mano:18,manual:[4,11,12,15,16],map1:13,map:[4,8,12,15,16,21],mark:[0,4,7,12,17,21],mash:12,master:4,match:[0,2,3,4,5,6,7,8,9,12,13,15,16,19],math:[11,16,17,19],mathbb:15,mathcal:15,mathemat:[3,13,15,16,17,20],mavencentr:16,max:[8,11,16,17],max_lemma:19,maximum:[14,17,19],maxvalu:[3,19],mayb:11,mayer:18,mbox:20,mc1:7,mc2:7,mc:7,mccarthi:11,md:1,me:0,mea:15,mean:[3,7,11,12,13,15,17,19,20],meant:[4,16,17],measur:[5,8,11,16,20],mechan:[12,13,15,16],meet:20,member:4,memori:[0,4,8,16,20],mention:[4,15,21],merg:12,messag:[9,16],messagequeu:6,meta:21,method:[0,3,4,6,8,13,15,16,19,20],metric:11,might:[0,4,9,11,12,15,19],mikael:18,milli:0,milner:12,min:17,mind:[13,15],minim:15,minimum:[3,17],minor:9,minuscul:3,minut:9,minvalu:3,mirco:18,mismatch:4,misra:4,miss:[9,15],mkdir:9,ml:11,mode:[9,17],model:[2,4,12,16,18,20],modern:[0,12],modif:[7,11,12],modifi:[7,9,15,19],modul:[3,9,12,17,19,20],modular:[3,15],modulo:[17,18],moment:4,monad:11,monoid:12,more:[0,3,5,9,11,12,13,16,17,19],moreov:11,most:[4,5,7,9,13,15,16,17,19,20],mostli:[15,19],move:[4,9,19],msg:[0,6],msgqueue:6,mu:15,much:[3,12,13,17],multipl:[3,4,9,12,13,15,17,19,20],multipli:12,multiset:19,must:[3,4,7,9,12,13,15,16,17,20],mutabl:[0,4,8,11],mutablebox:7,mutableclass:7,mutablemap:16,mutat:[7,21],mutual:13,my:3,mycase1:17,mycase2:17,mycon:17,myempti:17,myfil:[4,9],myfile1:9,myfile2:9,mylist:17,mymainclass:9,myprint:4,myproject:9,mytail:9,mytyp:17,n:[0,7,9,11,12,15,16,17],name:[0,2,4,7,9,12,13,15,16,19,20,21],name_scalavers:16,nanosecond:3,narrow:17,nat:[12,16],natadditivemonoid:12,nativ:16,nativez3:[9,12,16],natur:[7,12,15],navig:9,necessari:15,need:[0,3,4,6,7,9,12,13,14,15,16,17,19,20],neg:[5,17,19,20],negat:[7,20],neither:[2,3,11],nest:[4,7,17],never:[6,11],newbehavior:0,newidentifi:17,newinbox:0,newli:12,newsystem:0,newvalu:7,next:[0,1,2,9,12,16,19],nextbehavior:0,nice:15,nicola:18,nil:[0,2,3,5,6,12,13,15,17,19,20],nipkow:18,non:[0,2,3,4,5,7,8,16,17,19],none:[7,17],nonempti:[9,13],nonetheless:12,nor:[2,3,11,15],noreturninvari:20,normal:[7,15],nosend:0,notabl:3,notat:[3,17],note:[0,3,4,7,9,13,15,16,17,19],noth:17,notic:15,notwellfound:15,now:[9,11,12,15,16,18,19,21],number:[3,9,12,13,15,16,17,19,20],numer:[3,15,20],object:[0,3,4,6,8,9,12,13,15,18,19,20,21],oblig:1,obtain:[2,3,9,15,19],occur:[11,13,19],occurr:13,odd:15,offend:19,offer:[9,13],offici:9,often:[6,7,11,12,15,19,21],ok:[7,17],old:[6,7,9,16],omit:15,onc:[2,12,13,15,19,21],one:[0,2,3,4,6,7,9,11,12,15,16,17,19,20,21],ones:[4,15],onli:[0,4,6,7,12,13,14,15,16,17,19,20],onlin:13,oopsla:18,op:15,opam:1,opaqu:[13,21],open:[9,20],openjdk:9,oper:[0,7,9,12,15,16,17,19],opt:[16,19],optim:[4,15],option:[2,4,5,6,7,8,13,15,17],ord:12,order:[0,2,3,4,7,9,12,13,15,16,18,19,21],ordinari:13,org:[9,13,16],organ:[9,16],orient:[3,18],origin:[1,3,4,7,9,11,12,15],oss:16,other:[0,4,8,9,11,12,13,15,16,17,20,21],otherwis:[3,4,17,19,21],our:[0,2,3,12,15,19,21],out:[2,8,9,12,15,19,20],outcom:9,output:[2,3,4,5,7,9,12,15,16,20],outsid:[4,6,7,15,17,20],over:[0,4,9,11,12,15,17,20],overal:15,overflow:[14,16,17,19],overlap:12,overload:[4,12],overrid:[0,12,13],overridden:[0,7,12,13,17],overview:18,own:[0,3,4,12,13,15,19,20],p:[0,2,9,13,15,19],packag:[4,9,13,15,16,17],packagebin:9,pad:13,page:[8,9,13],pair:[7,15],paper:[2,8,13],paradigm:11,paragraph:4,parallel:16,paramet:[4,6,7,11,12,15,20],parameterless:[16,19],parametr:19,parent:17,pars:13,part:[3,4,6,11,12,15,20,21],partial:[4,7,12,13,17],partialev:13,partialfunct:[0,8],particular:[7,11,15,20],partli:7,pass:[4,7,9,11,13,16,17,19,20],past:[3,9],path:[0,1,2,5,9,16,17,20],pattern:[4,8,13,15,19],pc:20,per:[3,4,16],perfectli:7,perform:[0,3,7,9,15,17],perhap:[15,21],persist:[0,16],phase:[4,7,12,21],phd:7,philipp:18,phillipp:18,pick:[0,9,12,16],piec:21,pin:19,pipelin:[5,6,9,10,16],piskac:18,place:[15,17,19],plai:15,platform:9,pldi:18,pleas:[4,9,13,16],plenti:15,plu:[12,19],plugin:[5,6,9],plusassoc:15,pluscomm:15,po:13,point:[0,3,7,9,12,15,17,19,20,21],pointer:7,pollfirst:6,polymorph:12,pool:16,popl:18,portfolio:9,posit:[9,13,15,17,19,20],positiverequirefordefault:17,positiveshort:15,possibl:[3,4,7,9,11,12,15,17,19,20],post:[3,4,7,16,20],postcondit:[1,5,7,8,11,12,13,14,16,19,21],potenti:[11,12,15],power:[15,18],practic:[3,8,20],pre:[4,7,11,13,15,17],prec:20,precis:[14,15,17],precond:[15,21],precondit:[1,4,7,8,11,13,14,15,19],predefin:[1,8],predic:[11,12,13,15,19],prefer:15,prefix:[1,13],prepar:3,prepend:[13,15],preprocess:7,presenc:[3,15],present:[11,15,16,17,20],preserv:[11,15],pretti:[12,19],prev:12,previou:[6,9,12,15,17],previous:15,prii32:4,primari:0,primaryref:0,primbehav:0,princess:[3,9,16],principl:[15,18],print:[2,4,7,16],printf:4,println:4,prior:7,priori:15,privat:[0,6],probabl:15,problem:[7,11,12,15,19,20],proce:[6,7,15],procedur:[7,18],proceedvalu:7,process:[0,2,3,9,13,16],processmsg:0,produc:[3,4,9,13,15],product:[3,12,15],program:[0,2,6,8,9,12,14,15,16,17,18,19,20],programm:12,project:[1,3,17],proof:[0,2,3,4,8,12,16,17],prop1:21,prop2:21,prop:[0,17],proper:[9,15,20],properli:15,properti:[0,6,7,8,9,11,14,15,17,18,20],propertli:16,propos:7,proposit:[8,17],propositionallog:3,provabl:[2,9],prove:[2,6,7,8,9,11,12,16,19,20],proven:[12,13,14,15,16,19],prover:[11,15],provid:[0,4,7,9,11,12,13,14,15,16,17,18,19,20],pull:[16,21],pure:[0,4,6,7,8,11,13,20,21],purescala:[7,21],puriti:[7,8],purpos:[3,14,19],put:[6,9,13],python:9,q:9,q_n:9,qed:15,quadrupl:7,qualifi:[9,16],quantifi:3,queri:3,question:[8,15,19],queue:6,quick:[8,13],quickli:[9,15],quit:[15,17],r:[12,13,15,20],random:16,rang:17,rather:[15,21],ravichandhran:18,raw:4,re:[5,6,7,11,12,15,16,17,19,21],read:[4,9,11,12,15,19],readabl:[7,9,12,15],reader:[13,15],readm:1,real:[15,16],realli:15,reason:[2,3,11,12,13,16,18,19,21],recal:15,recap:8,receiv:[0,4],recent:9,recogn:[15,16],recommend:[5,8,16],recompil:9,recoveri:21,recurs:[2,3,4,7,11,12,13,14,15,16,18,19],redefin:12,reduc:[3,15,16],reduct:18,redund:15,ref:0,refactor:9,refer:[2,4,6,7,8,9,12,13,17,19,21],refin:[1,12,17],refinelaw:12,reflect:4,reflex:15,refus:13,region:3,regress:3,regular:[17,20,21],reject:[12,17],rel:[9,15,16],relat:[1,9,13,16,19,20],relationship:[12,15],releas:8,relev:[11,12,20],reli:[7,12,13,15,20],reload:9,remain:[15,16],remark:17,remedi:21,rememb:15,reminisc:15,remot:7,remov:[13,15,17],renam:[4,7,9],repair:[4,16,18],repeat:19,replac:[1,3,9,13,15,16,21],replaceat:13,report:[1,2,3,4,9,11,15,16],repositori:[1,5,9,16],repres:[0,4,12,15,17],represent:[15,17],reproduc:9,requir:[0,7,8,11,12,13,15,17,19,20,21],research:13,resembl:15,resid:9,resolv:[9,16],resort:14,resourc:[4,18],respect:[4,12,17,20],respons:[3,4],rest:[16,17,19],restart:16,restrict:[4,7,19,20],restructur:9,result:[0,1,2,3,4,5,6,7,9,12,13,15,16,17,19,21],ret:7,returnelimin:7,returninwhil:7,returninwhile3:20,returnn:7,returnnwhil:7,returnwhil:7,retvalu:7,reus:[2,15],reusabl:18,reveal:19,revers:[13,15],reverseappend:15,reverseindex:13,reverserevers:[13,15],revert:16,revisit:15,rewrit:[3,7],rewritten:[12,15],rich:13,right:[4,12,13,15,20],rightarrow:15,rightfulli:12,rightunitappend:15,rise:17,risk:15,rmax:19,role:15,root:[9,17],rotat:13,roughli:15,rsize:19,rst:9,rule:[15,19],run:[1,3,5,7,8,11,14,15,16,19,21],runner:5,runtim:[4,14,18],rust:8,ruzica:18,rv:18,s1:[16,17],s2:[16,17],s:[0,4,9,11,12,13,15,16,17,19,20,21],sa:18,safe:8,safer:20,safeti:[8,11,14,17],sai:[0,9,12,15,19,21],sake:12,same:[4,7,9,12,15,17],sampl:3,satisfi:[4,6,11,12,13,17,18,19,20],save:16,saw:15,sbt:[5,6,9,16],scala2:9,scala:[0,1,2,3,4,5,7,8,9,12,13,15,16,18,19,20,21],scala_object:9,scalac:[1,3,9,16,17],scaladoc:13,scanleft:13,scanright:13,scanvsfoldright:13,scenario:3,schedul:0,scienc:3,scope:[4,7,12,20],scratch:21,script:[5,9,16],scrut:9,seal:[0,3,7,12,13,15,17,19,20],search:[3,8,15,16],sec:16,second:[4,9,15,17,19,21],section:[0,3,4,6,9,11,12,13,15,16,17,20],secur:3,see:[0,3,4,5,7,9,13,15,16,17,19,20,21],seem:[15,19],seemingli:15,seen:[0,12,15,17],select:[6,13,16,17],self:[0,15,17],semant:[4,7,11,12,14,16,17,18,19],semigroup:12,send:0,sendunderli:0,sens:[15,19,20],sent:0,sep:13,separ:[4,13,15,17],seq:9,sequel:19,sequenc:[4,7],serv:[11,15],servic:[5,9],set:[4,5,8,9,11,12,14,15,16,19],setexist:13,setforal:13,setq:9,setter:7,settolist:13,setup:[17,19],sever:[4,9,14,17,18],shape:[4,15],share:[7,8,11],shell:[5,9],shortcom:15,shorten:[15,16],shorthand:17,should:[0,3,4,6,7,9,11,15,16,17,19,20,21],show:[0,9,15,19,20],shown:[3,4,11,12,20],shtml:17,shut:[5,9],side:[4,7,15,16,17],sign:[4,12,17,19],signatur:[2,4,12,13],signific:[11,17],significantli:16,sigplan:18,silent:[12,16],similar:[7,15,17,19],similarli:[4,7,15,16,17],simpl:[9,11,12,17],simpler:[15,19],simpli:[4,7,15,16,19],simplic:11,simplif:16,simplifi:[9,15,20],simul:[4,7],sinan:18,sinc:[4,12,15],singl:[0,3,9,13,15,16,17,19,20],singleton:17,sinsert:19,site:[4,7,11,13,20],situat:[4,15],size:[2,5,6,8,13,14,16,17],skill:3,skip:4,slc:1,slice:13,slightli:12,slower:13,small:[3,11,16,19],smaller:[11,17,19,20],smartphon:3,smt:[5,8,9,13,14,15,16,18,21],smtlib:17,snapshot:[7,16],snippet:7,snocafterappend:[13,15],snocfoldright:15,snocindex:13,snocisappend:13,snocrevers:[13,15],so:[3,4,7,9,12,14,15,16,17,19,20],soft:9,softwar:[8,9,18,20],solv:[1,3,9,12,18,19],solver:[5,8,13,14,15,18],some:[0,3,4,5,6,7,9,11,12,13,15,16,17,19,20,21],someproof:12,someth:[5,7,9,15],sometim:[7,11,12,15],somewhat:[3,9,15],sonatyp:16,soon:16,sort:[2,6,8,13,15],sound:[9,11,13,16,18],sourc:[5,8,13,15,16,20],space:[3,14,15],spec:17,special:[3,4,7,13,15,16],specialis:4,specif:[3,4,7,8,11,12,13,15,16,18],specifi:[0,2,4,6,8,9,11,13,15,17,19,20],speed:[3,16],sphinx:9,split:[9,13,15],splitat:13,src:9,stabl:[4,16],stack:[4,14,16,18],stackoverflow:3,stage:[1,9],stainless:[0,2,4,5,6,7,12,14,15,17,18,19,20,21],stainlessen:9,stainlessextradep:9,stainlessplugin:9,stand:15,standalon:[8,12],standard:[1,4,9,13,17,19],start:[3,5,9,13,15,16,19],startup:16,state:[0,2,7,8,15,16,19],statement:[1,4,15,16,19],staticcheck:[6,7,16],statu:1,stdin:[4,16],stdio:4,stdout:4,stem:[12,21],step:[0,9,12,15],still:[3,11,12,15],store:[4,9,16],straightforward:[12,15],strang:7,strategi:15,stream:4,strength:19,strengthen:19,strict:[4,16,17],strictli:[19,20],strike:11,string:[0,4,6,9,17,21],stronger:[7,15,19],strongli:[13,16],struct:4,structur:[3,4,7,9,12,14,15,17,18,19,20,21],stub:12,stuck:15,studi:8,style:0,sub:[7,9,15],subclass:[0,12,13,15,17],subdirectori:13,subgoal:16,subject:17,sublist:13,subpackag:17,subsect:15,subsequ:[0,2,12,15,17],subset:[4,9,11,13,15,17,20,21],subseteq:15,subsetof:17,substitut:[3,9,20],subtract:[17,19],succ:12,succe:[1,3,6,9],success:[3,11],successfulli:[4,9,15,21],sudo:9,suffic:9,suffix:[15,16],sugar:[11,15,17],suggest:[9,14,15],suit:9,sum:[7,12],sumbigint:12,summar:[15,20],summari:[5,9,12,13,16,21],superclass:17,superflu:12,suppli:21,support:[3,7,8,9,11,13,15,16,17,20,21],suppos:3,sure:[4,9,17,20],surfac:17,surprisingli:[15,21],suter:18,swap:7,swen:18,symbol:[3,12,18,20],symmetr:15,symmetri:15,symposium:18,syntact:[11,15,17],syntax:[3,4,7,11,17],synthes:18,synthesi:[4,18],system:[3,4,8,9,12,16,18],t1:[4,17],t2:17,t:[3,4,7,8,12,15,16,17,19],tactic:[1,13],tag:[3,4,9],tail:[2,3,5,13,14,19,20],tailopt:6,take:[0,4,6,7,9,12,13,15,16,17,19,20],taken:[7,17],takewhil:13,talk:[7,18,19],target:[4,9],tautolog:15,technic:7,techniqu:[3,8,18],tell:[7,15,19,21],templat:16,tend:19,term:[3,9,15,17],termin:[7,8,9,17],test1:[7,19],test2:[7,19],test3:19,test4:19,test:[1,3,6,8,12,13,15,17,19],testcas:[15,17],testgen:16,testmax:19,testonli:9,text:9,texttt:0,than:[3,9,11,13,15,16,17,19,20],thank:[1,11,15],thei:[3,4,7,9,11,12,13,15,17,19,20],them:[0,3,7,11,12,13,15,17,19],themap:21,themselv:20,theorem:[0,3,8,11,17,20],theoret:15,theori:[13,15],therefor:[4,11,15],thesi:[4,7],thi:[0,1,2,3,4,5,6,7,9,11,12,13,14,15,16,17,19,20,21],thing:[12,15],third:[12,19],those:[4,11,12,15,16,17,19],though:[3,9,11,15,19],three:[2,7,15,17,19],through:[0,9,11,12,13,15,16,19],throughout:2,thu:[0,4,9,11,12,13,14,15,19,20,21],thumb:15,time:[0,2,4,5,9,11,12,14,15,16,17,19,21],timeout:[2,9,11,15,16,20],timer:16,tl:17,tmp:1,tn:4,tobia:18,tobyt:17,togeth:[12,13,20],toint:[4,17],token:4,tolong:17,too:[7,9,20],tool:[5,8,18,19,20],toolkit:9,top:[4,7,8,9,11,12,13,15,17],tosend:0,toshort:17,tosign:17,total:[5,9,12,14,16,21],tounsign:17,trait:[8,12],transform:[4,7,11,13,16,17],transit:[15,16],translat:[3,8,11,16,18],transpar:9,travers:16,treat:[2,7,13,17,21],treatment:[7,16],tree:[3,4,7,9,12,13,16],tri:15,triemap:8,triemapwrapp:21,trigger:4,tripl:7,trivial:[3,5,8,9],troubl:15,truncat:17,truth:17,tupl:17,tuple2:17,tuplen:4,ture:20,turn:[12,15,20],tutori:[8,11],twice:21,two:[0,3,4,7,9,12,13,15,16,17,19,21],txt:16,type:[0,1,3,6,8,9,11,12,13,14,15,16,18,19,20,21],typeclass:8,typedef:4,typer:16,typesaf:9,typic:[3,4,9,15,17,19,20],u:[5,21],ub:9,ubuntu:9,uint12:17,uint16:4,uint16_t:4,uint2:17,uint32:[4,17],uint32_t:4,uint4:17,uint64:4,uint64_t:4,uint8:[4,17],uint8_t:4,uinti:17,uintx:17,uiowa:17,unabl:[11,15],unaffect:7,unambigu:12,unappli:[4,17],unari:4,unbound:[3,14,19],undecid:20,under:[3,4,8,9,11,15,19],underflow:16,undergradu:3,underli:[0,2,7,15,16,17],understand:[11,13,15],understood:[13,17],unfold:[13,15,16,19],unfortun:[15,21],unifi:15,unintend:16,union:[4,17],uniqu:[4,7,11,13],unit:[0,4,6,7,13,15,21],univers:[3,9,15],unknown:[2,5,9,11,12,15,16,21],unless:[15,17],unlik:17,unopt:13,unoptcas:13,unreach:7,unrol:[15,20],unrollz3:16,unsat:16,unsealedtrait:7,unsign:[4,17],unstabl:16,unsupport:17,until:[2,11,15],untouch:7,unus:9,unverifi:13,unzip:9,up:[3,8,9,13,16,21],updat:[0,7,9,17,20,21],updatea:7,updatearrai:7,upon:[0,16],url:16,us:[0,1,2,4,5,7,8,11,12,13,14,17,18,20,21],usag:[4,8],user:[4,7,9,11,12,13,15,16,20,21],usr:9,usual:[4,7,11,12,17,19],ut:7,util:[6,16],v:[1,13,17,21],val:[0,4,5,6,7,9,12,15,17,19,20,21],valensur:20,valid:[4,5,7,9,11,12,15,16,17,20,21],validref:0,valu:[0,4,6,7,12,13,14,15,16,19,20],value2:17,value_:7,variabl:[4,6,8,12,15,17,19,20],variant:[4,17,19],variou:[9,12,15],vast:15,vc:[5,9,15,16,19,20],ve:15,verbos:15,veri:[9,11,12,19],verif:[1,4,5,6,7,8,9,12,13,15,17,18,19],verifi:[0,3,4,6,7,8,9,11,13,14,15,17,18,19,20,21],versa:4,version:[9,13,15,16,18],vertic:9,via:[5,7,9,12,16],vice:4,video:8,view:[9,21],viktor:18,violat:[11,19],viper:3,visibl:[7,15],vital:15,vmcai:18,voirol:18,vulner:3,vvvvvvvvvvv:17,w:[4,12,15],wa:[3,4,9,11,15,20],wadler:12,wai:[0,3,4,7,12,13,15,17,19,20],walk:16,want:[0,9,12,15,17],warm:8,warn:[5,9,15,16,19,20],wasn:15,watch:[9,16],wb89:12,we:[0,2,3,4,7,9,12,13,14,15,17,18,19,20,21],weak:[7,19],weaken:12,weaker:15,web:[9,19],weight:15,well:[0,3,4,7,9,11,12,14,15,16,17,19,20],were:[7,12,17],what:[0,8,13,15,19,21],when:[0,1,2,3,4,6,7,9,11,12,13,14,15,16,17,19,20,21],whenev:20,whengiven:0,where:[3,4,6,7,9,11,14,15,16,17,19,20],wherea:[3,16,19],whether:[2,3,7,13,15,16,20,21],which:[0,1,3,4,5,7,8,9,11,12,13,15,17,18,19,20,21],whole:[0,4,13,20],whose:[4,6,12,13,19],why:[3,11,15],widen:17,wildcard:16,window:8,wish:[3,5,14,15,19],wit:20,within:[7,12,13,16,17,20],without:[4,12,13,15,16,17,20],word:0,work:[0,3,7,8,9,11,12,13,15,16,17,19],workaround:[4,14],workshop:18,world:[6,12,17],worth:15,would:[3,7,9,11,12,15,17,20,21],wrap:[3,7,12,19,21],wrapper:[4,8,12,16],write:[3,4,12,14,15,17,19,20,21],writeoncebox:7,written:[3,5,7,13,15],wrong:[2,3,19],wrote:15,wsl:9,www:[9,13],x1:[6,15,17,19],x2:[6,15,17,19],x3:17,x4:17,x5:17,x6:17,x7:17,x8:17,x9:17,x:[2,4,5,7,9,12,13,15,17,19,20],x___1:1,xmx6g:9,xn:15,xs:[2,5,6,9,12,13,15,17],y:[4,7,9,12,15,17,19],ybrows:16,ye:16,year:3,yet:[9,12,15],yield:15,you:[3,4,5,7,9,11,13,14,15,16,17,20],your:[1,4,5,7,9,11,13,14,15,16],ys:[12,15],z3:[3,5,16,18,21],z3prover:9,z:[1,9,12,13,15,17,19],zero:[12,19],zip:[5,9,13]},titles:["Case Studies","Translation from Stainless to Coq","Equivalence Checking","FAQ: (Frequently) Asked Questions","Generating C Code","Verifying and Compiling Examples","Ghost Context","Imperative","Stainless documentation","Installing Stainless","Stainless\u2019 Internals","Introduction","Specifying Algebraic Properties","Stainless Library","Limitations of Verification","Proving Theorems","Specifying Options","Pure Scala","References","Tutorial: Sorting","Verification conditions","Working With Existing Code"],titleterms:{"0":9,"1":[0,9],"10":9,"12":9,"2":9,"4":9,"8":9,"abstract":[7,17],"boolean":17,"case":[0,6,17],"class":[4,17],"default":17,"export":4,"function":[4,7,17,20],"import":0,"int":17,"return":7,"while":7,A:[13,15,21],Being:19,For:4,Not:19,Their:19,With:21,access:20,actor:0,addit:[13,15,16],adt:20,akka:0,algebra:[12,17],alias:[7,17],an:[0,9],annot:[6,7,13,20,21],anonym:17,api:[4,13],appli:3,approach:15,ar:3,arrai:[4,7,17,20],ask:3,assert:[15,17],associ:12,b:13,behavior:0,between:20,bigint:17,binari:9,bind:20,bitvector:17,bodi:[17,20],book:18,build:[0,9],bytecod:3,c:4,can:3,chang:16,check:[2,6,15],choos:16,code:[4,7,9,21],coher:12,color:9,compar:3,compil:[3,5],complex:15,compon:16,condit:[3,20],configur:16,conquer:15,construct:4,content:19,context:[0,6],contract:21,control:15,convers:4,copi:17,coq:1,correct:6,counter:0,custom:4,cvc5:[9,16],data:17,decreas:20,defin:19,definit:17,depend:9,divid:15,document:[8,9],doe:3,elimin:6,emac:9,enough:19,equival:2,error:14,evalu:16,exampl:[2,5,15],execut:5,exhaust:20,exist:[9,21],express:[6,17],extern:[7,9,21],faq:3,featur:[4,16],file:16,frequent:3,from:[1,9],fuzz:3,gener:[4,9,16,17],ghost:6,global:4,hof:15,hood:12,how:3,i:[3,4],id:9,ignor:4,illustr:9,imper:7,implement:[0,4],induct:15,industri:3,inherit:12,initi:17,inner:17,insert:19,instal:9,intern:10,introduct:[6,11,12,15],invari:[0,20],java:3,keyword:7,level:[4,16],librari:[13,16],limit:[14,15],linux:9,list:[13,16,19],local:17,loop:[7,20],low:4,maco:9,map:[13,17],match:[17,20],max:19,measur:15,member:17,memori:14,messag:0,method:[7,12,17,21],model:0,more:15,mutabl:7,non:15,object:[7,17],oper:[4,13],option:[1,9,16],os:4,other:3,out:14,overrid:17,paper:18,paramet:17,partialfunct:13,pattern:[17,20],postcondit:[15,17,20],practic:15,precondit:[17,20],predefin:17,preserv:0,program:[3,4,7,11],project:9,proof:15,properti:[3,12,19],proposit:15,prove:[0,3,15],pure:17,puriti:21,purpos:16,quantifi:15,question:3,quick:15,ration:15,real:17,reason:15,recap:15,recommend:9,refer:[0,18],relat:15,releas:9,replic:0,requir:[1,3,4,9],run:[0,2,9],rust:3,safe:4,safeti:20,scala:[11,17],set:[13,17],share:20,simpl:15,size:[3,19],slightli:15,smt:3,softwar:[3,11],solver:[3,9,16],sort:19,sourc:9,specif:[17,19,20],specifi:[12,16],stainless:[1,3,8,9,10,11,13,16],standalon:9,state:4,studi:[0,6],support:4,system:0,t:13,techniqu:15,termin:[11,15,16],test:[9,16],theorem:[13,15],tool:3,top:16,trait:7,translat:[1,4],triemap:21,trivial:15,tupl:4,tuplex:17,tutori:19,type:[4,17],typeclass:12,under:12,unrol:16,up:19,us:[3,9,15,16,19],usag:[1,9],valu:17,variabl:7,verif:[3,11,14,16,20],verifi:5,video:18,warm:19,what:3,which:16,window:9,within:9,work:21,wrapper:21,z3:9}})
\ No newline at end of file
+Search.setIndex({"alltitles": {"A complex example: additivity of measures": [[15, "a-complex-example-additivity-of-measures"]], "A practical introduction to proofs": [[15, "a-practical-introduction-to-proofs"]], "A wrapper for TrieMap": [[21, "a-wrapper-for-triemap"]], "ADT invariants": [[20, "adt-invariants"]], "API For Safe Low Level Programs": [[4, "api-for-safe-low-level-programs"]], "Abstract Classes": [[17, "abstract-classes"]], "Actor Context": [[0, "actor-context"]], "Actor System": [[0, "actor-system"]], "Actor reference": [[0, "actor-reference"]], "Actor system implementation": [[0, "actor-system-implementation"]], "Actor system model": [[0, "actor-system-model"]], "Additional Options (by component)": [[16, "additional-options-by-component"]], "Additional operations on Lists": [[13, "additional-operations-on-lists"]], "Additional top-level options": [[16, "additional-top-level-options"]], "Algebraic Data Types": [[17, "algebraic-data-types"]], "Aliasing": [[7, "aliasing"]], "Annotations": [[13, "annotations"]], "Annotations for Imperative Programming": [[7, "annotations-for-imperative-programming"]], "Array access safety": [[20, "array-access-safety"]], "Arrays": [[4, "arrays"], [7, "arrays"]], "Associated methods": [[12, "associated-methods"]], "Behavior": [[0, "behavior"]], "Being Sorted is Not Enough": [[19, "being-sorted-is-not-enough"]], "BigInt": [[17, "bigint"]], "Bitvectors": [[17, "bitvectors"]], "Body Assertions": [[17, "body-assertions"]], "Books": [[18, "books"]], "Booleans": [[17, "booleans"]], "Build from Source on Linux & macOS": [[9, "build-from-source-on-linux-macos"]], "Build from Source on Windows 10": [[9, "build-from-source-on-windows-10"]], "Building Stainless Documentation": [[9, "building-stainless-documentation"]], "Building a replicated counter": [[0, "building-a-replicated-counter"]], "Can I use Stainless with Java?": [[3, "can-i-use-stainless-with-java"]], "Can I use Stainless with Rust?": [[3, "can-i-use-stainless-with-rust"]], "Case Classes": [[17, "case-classes"]], "Case Objects": [[17, "case-objects"]], "Case Studies": [[0, null]], "Case Study #1: Proving invariants of actor systems": [[0, "case-study-1-proving-invariants-of-actor-systems"]], "Case study": [[6, "case-study"]], "Changing the list of library files": [[16, "changing-the-list-of-library-files"]], "Choosing which Stainless feature to use": [[16, "choosing-which-stainless-feature-to-use"]], "Classes": [[4, "classes"]], "Coherence": [[12, "coherence"]], "Compiling Stainless programs to bytecode": [[3, "compiling-stainless-programs-to-bytecode"]], "Compiling and Executing Examples": [[5, "compiling-and-executing-examples"]], "Configuration File": [[16, "configuration-file"]], "Constructs": [[4, "constructs"]], "Contracts": [[21, "contracts"]], "Copy Method": [[17, "copy-method"]], "Correctness check": [[6, "correctness-check"]], "Custom Conversion": [[4, "custom-conversion"]], "Custom Function Implementation": [[4, "custom-function-implementation"]], "Custom Type Translation": [[4, "custom-type-translation"]], "Decrease annotation in loops": [[20, "decrease-annotation-in-loops"]], "Default Parameters": [[17, "default-parameters"]], "Defining Lists and Their Properties": [[19, "defining-lists-and-their-properties"]], "Divide and Conquer": [[15, "divide-and-conquer"]], "Does Stainless use SMT solvers?": [[3, "does-stainless-use-smt-solvers"]], "Equivalence Checking": [[2, null]], "Evaluators": [[16, "evaluators"]], "Example run": [[2, "example-run"]], "Export": [[4, "export"]], "Expressions": [[17, "expressions"]], "Extern functions and abstract methods": [[7, "extern-functions-and-abstract-methods"]], "Extern methods": [[21, "extern-methods"]], "External Solver Binaries": [[9, "external-solver-binaries"]], "FAQ: (Frequently) Asked Questions": [[3, null]], "Function": [[17, "function"]], "Functional Array": [[17, "functional-array"]], "Functions": [[4, "functions"]], "General Requirement": [[9, "general-requirement"]], "Generating C Code": [[4, null]], "Generics": [[17, "generics"]], "Ghost Context": [[6, null]], "Ghost annotation": [[6, "ghost-annotation"]], "Ghost expression elimination": [[6, "ghost-expression-elimination"]], "Global State": [[4, "global-state"]], "How does Stainless compare to fuzzing tools?": [[3, "how-does-stainless-compare-to-fuzzing-tools"]], "How does Stainless compare to other verification tools?": [[3, "how-does-stainless-compare-to-other-verification-tools"]], "I/Os": [[4, "i-os"]], "Ignore Function or Type": [[4, "ignore-function-or-type"]], "Imperative": [[7, null]], "Imperative Code": [[7, "imperative-code"]], "Imports": [[0, "imports"]], "Induction": [[15, "induction"]], "Initialization": [[17, "initialization"]], "Inner Functions": [[17, "inner-functions"]], "Insertion into Sorted List": [[19, "insertion-into-sorted-list"]], "Install Z3 4.12.2": [[9, "install-z3-4-12-2"]], "Install cvc5 1.0.8": [[9, "install-cvc5-1-0-8"]], "Installing Stainless": [[9, null]], "Int": [[17, "int"]], "Introduction": [[6, "introduction"], [11, null], [12, "introduction"]], "Library Files": [[16, "library-files"]], "Limitations of Verification": [[14, null]], "Limits of the approach: HOFs, quantifiers and termination": [[15, "limits-of-the-approach-hofs-quantifiers-and-termination"]], "List API": [[13, "list-api"]], "List[T]": [[13, "list-t"]], "Lists": [[19, "lists"]], "Local and Anonymous Classes": [[17, "local-and-anonymous-classes"]], "Loop invariants": [[20, "loop-invariants"]], "Map": [[17, "map"]], "Measures: a slightly more complex example": [[15, "measures-a-slightly-more-complex-example"]], "Message": [[0, "message"]], "Methods": [[17, "methods"]], "Mutable Objects": [[7, "mutable-objects"]], "Operators": [[4, "operators"]], "Out of Memory Errors": [[14, "out-of-memory-errors"]], "Overriding": [[17, "overriding"]], "Papers": [[18, "papers"]], "PartialFunction[A, B]": [[13, "partialfunction-a-b"]], "Pattern matching": [[17, "pattern-matching"]], "Pattern matching exhaustiveness": [[20, "pattern-matching-exhaustiveness"]], "Postconditions": [[17, "postconditions"], [20, "postconditions"]], "Preconditions": [[17, "preconditions"], [20, "preconditions"]], "Predefined Types": [[17, "predefined-types"]], "Program Termination": [[11, "program-termination"]], "Proof control using assert and check": [[15, "proof-control-using-assert-and-check"]], "Proving Theorems": [[15, null]], "Proving preservation of an invariant": [[0, "proving-preservation-of-an-invariant"]], "Proving properties of size": [[3, "proving-properties-of-size"]], "Pure Scala": [[17, null]], "Purity annotations": [[21, "purity-annotations"]], "Purpose of library files": [[16, "purpose-of-library-files"]], "Quick Recap": [[15, "quick-recap"]], "Rationals: a simple example": [[15, "rationals-a-simple-example"]], "Real": [[17, "real"]], "References": [[18, null]], "Relational reasoning": [[15, "relational-reasoning"]], "Requirements": [[1, "requirements"], [4, "requirements"]], "Return keyword": [[7, "return-keyword"]], "Running Code with Stainless dependencies": [[9, "running-code-with-stainless-dependencies"]], "Running Tests": [[9, "running-tests"]], "Running the system with Akka": [[0, "running-the-system-with-akka"]], "Set": [[17, "set"]], "Set[T], Map[T]": [[13, "set-t-map-t"]], "Sharing bindings between specifications and function body": [[20, "sharing-bindings-between-specifications-and-function-body"]], "Size of a List": [[19, "size-of-a-list"]], "Software Verification": [[11, "software-verification"]], "Sorted Lists": [[19, "sorted-lists"]], "Specifications": [[17, "specifications"]], "Specifying Algebraic Properties": [[12, null]], "Specifying Options": [[16, null]], "Stainless Library": [[13, null]], "Stainless and Scala": [[11, "stainless-and-scala"]], "Stainless documentation": [[8, null]], "Stainless\u2019 Internals": [[10, null]], "Supported Features": [[4, "supported-features"]], "Techniques for proving non-trivial postconditions": [[15, "techniques-for-proving-non-trivial-postconditions"]], "Techniques for proving non-trivial propositions": [[15, "techniques-for-proving-non-trivial-propositions"]], "Termination": [[16, "termination"]], "Tests generation": [[16, "tests-generation"]], "Theorems on Lists": [[13, "theorems-on-lists"]], "Trait Variables": [[7, "trait-variables"]], "Translation from Stainless to Coq": [[1, null]], "TupleX": [[17, "tuplex"]], "Tuples": [[4, "tuples"]], "Tutorial: Sorting": [[19, null]], "Type Aliases": [[17, "type-aliases"]], "Type Definitions": [[17, "type-definitions"]], "Type Members": [[17, "type-members"]], "Typeclass inheritance": [[12, "typeclass-inheritance"]], "Typeclasses": [[12, "typeclasses"]], "Types": [[4, "types"]], "Under the hood": [[12, "under-the-hood"]], "Unrolling Solver": [[16, "unrolling-solver"]], "Usage Within An Existing Project": [[9, "usage-within-an-existing-project"]], "Usage of the Coq option": [[1, "usage-of-the-coq-option"]], "Use Standalone Release (recommended)": [[9, "use-standalone-release-recommended"]], "Using Content in Specification": [[19, "using-content-in-specification"]], "Using IDEs with \u2013no-colors option. Emacs illustration": [[9, "using-ides-with-no-colors-option-emacs-illustration"]], "Using Size in Specification": [[19, "using-size-in-specification"]], "Value Classes": [[17, "value-classes"]], "Values": [[17, "values"]], "Verification": [[16, "verification"]], "Verification conditions": [[20, null]], "Verifying Examples": [[5, "verifying-examples"]], "Verifying and Compiling Examples": [[5, null]], "Videos": [[18, "videos"]], "Warm-up: Max": [[19, "warm-up-max"]], "What are the conditions required for Stainless to be applied to industry software?": [[3, "what-are-the-conditions-required-for-stainless-to-be-applied-to-industry-software"]], "While loops": [[7, "while-loops"]], "Working With Existing Code": [[21, null]], "cvc5 Solver": [[16, "cvc5-solver"]]}, "docnames": ["casestudies", "coq", "equivalence", "faq", "genc", "gettingstarted", "ghost", "imperative", "index", "installation", "internals", "intro", "laws", "library", "limitations", "neon", "options", "purescala", "references", "tutorial", "verification", "wrap"], "envversion": {"sphinx": 62, "sphinx.domains.c": 3, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 9, "sphinx.domains.index": 1, "sphinx.domains.javascript": 3, "sphinx.domains.math": 2, "sphinx.domains.python": 4, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinx.ext.todo": 2}, "filenames": ["casestudies.rst", "coq.rst", "equivalence.rst", "faq.rst", "genc.rst", "gettingstarted.rst", "ghost.rst", "imperative.rst", "index.rst", "installation.rst", "internals.rst", "intro.rst", "laws.rst", "library.rst", "limitations.rst", "neon.rst", "options.rst", "purescala.rst", "references.rst", "tutorial.rst", "verification.rst", "wrap.rst"], "indexentries": {}, "objects": {}, "objnames": {}, "objtypes": {}, "terms": {"": [0, 4, 9, 11, 12, 13, 15, 16, 17, 19, 20, 21], "0": [0, 1, 3, 4, 5, 6, 7, 11, 12, 13, 15, 16, 17, 19, 20, 21], "018": 21, "023": 21, "029": 12, "037": 12, "052": 12, "080": 21, "095": 21, "1": [1, 3, 4, 5, 7, 8, 11, 12, 13, 15, 16, 17, 19, 20], "10": [7, 8, 11, 19], "100": [4, 11, 20], "1000": [0, 4], "101": 11, "108": 12, "1089455080": 2, "109": 12, "11": [1, 11, 12], "110": [12, 21], "111": [12, 17], "112": 12, "113": 12, "114": 12, "115": 12, "116": 12, "117": 12, "119": 12, "12": [4, 12, 16, 21], "120": [12, 17], "1263292350": 5, "127": 17, "128": 17, "13": [7, 12, 19], "1357890535": 2, "1376322050": 5, "14": [7, 12], "145": 17, "15": [5, 9], "16": [4, 5, 19], "1639624704": 19, "17": [4, 5, 9], "18": 9, "1879048192": 19, "19": 5, "1989": 12, "2": [1, 2, 3, 5, 7, 12, 15, 16, 17, 19, 20], "20": 5, "200": 21, "2010": 18, "2011": 18, "2012": 18, "2013": 18, "2014": 18, "2015": 18, "2016": 18, "2019": 18, "21": [5, 9, 17], "2147483647": 19, "2147483648": 19, "22": 5, "24": [5, 12], "25": [5, 12], "256": 17, "26": 12, "27": [12, 15], "28": [5, 15], "29": [5, 12], "3": [2, 5, 7, 9, 12, 15, 17, 20], "30": 12, "31": [3, 15, 17], "32": [3, 4, 19], "32bit": 17, "33": 5, "34": 5, "35": 5, "36": 5, "37": 5, "38": 5, "398": 21, "4": [7, 12, 15, 17, 21], "40": 15, "42": [7, 17, 21], "44": 5, "45": 5, "46": 21, "47": 21, "48": 21, "5": [4, 5, 9, 12, 15, 16, 17, 19, 21], "50": 20, "500": 0, "512": 5, "56": 21, "58": 21, "59": 21, "6": [4, 5, 9, 12, 15, 19], "615": 15, "616": 15, "617": 15, "618": 15, "64": [4, 9], "691483681": 5, "7": [4, 5, 9, 12, 15, 19], "729": 12, "73": 5, "77": 12, "770374653": 5, "771685886": 5, "79": 12, "8": [1, 4, 15, 17], "80": 12, "81": 5, "82": 12, "84": 12, "85": 12, "86": 12, "87": 12, "9": 12, "91": 11, "A": [0, 4, 6, 7, 8, 9, 11, 12, 14, 17, 19, 20], "And": [2, 15, 21], "As": [1, 6, 11, 12, 13, 15, 19, 20, 21], "At": [4, 16], "Being": 8, "But": [15, 20], "By": [14, 16, 19, 21], "For": [2, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 19, 20], "If": [3, 6, 9, 11, 12, 13, 15, 16, 19, 20], "In": [0, 1, 3, 4, 7, 9, 11, 12, 13, 14, 15, 17, 19, 20, 21], "It": [0, 3, 4, 5, 7, 9, 11, 12, 15, 17, 19, 20, 21], "Its": 4, "No": 17, "Not": 8, "On": [3, 7, 9, 12], "One": [3, 6, 12, 13, 15, 17, 19, 20, 21], "Or": 15, "Such": [7, 17, 21], "That": [0, 9], "The": [0, 1, 2, 3, 4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21], "Their": [4, 8], "Then": [1, 9, 15], "There": [4, 7, 12], "These": [1, 3, 4, 7, 15, 16, 17], "To": [2, 3, 4, 5, 7, 9, 11, 12, 13, 15, 16, 19, 20], "With": [0, 7, 8, 12, 15, 17], "_": [0, 1, 2, 3, 4, 6, 7, 9, 11, 12, 13, 15, 16, 17, 19, 20, 21], "_1": 17, "__function__": 4, "_build": 9, "_put": 6, "_take": 6, "a0": 7, "a1": 7, "a2": 7, "a_1": 15, "a_2": 15, "aaa": 17, "ab": 17, "abbrevi": 19, "abil": [3, 7, 11, 13, 17], "abl": [3, 9, 11, 12, 15, 20, 21], "abort": [6, 16], "about": [0, 2, 3, 4, 7, 9, 11, 13, 15, 16, 18, 19, 20, 21], "abov": [1, 4, 7, 9, 11, 12, 15, 17, 19, 20, 21], "absenc": 3, "absinvalid": 17, "abstract": [0, 3, 4, 8, 12, 13, 15, 18, 19, 20], "abundantli": 15, "acc": 0, "accept": [4, 9, 15], "access": [0, 4, 8, 13, 16], "accident": 15, "accompani": 4, "accord": 4, "accordingli": 19, "account": [17, 19, 20], "achiev": [3, 4, 15], "acl2": 3, "acm": 18, "act": 15, "actor": [8, 9], "actorcontext": 0, "actorlog": 0, "actorof": 0, "actorref": 0, "actorsystem": 0, "actorwrapp": 0, "actual": [7, 12, 14, 15, 17, 20], "ad": [6, 7, 9, 12, 15, 17, 20, 21], "adapt": 9, "add": [1, 4, 7, 9, 11, 13, 15, 16, 17, 19], "addfirst": 6, "addit": [3, 6, 7, 8, 9, 11, 12, 17, 18, 19, 20], "addition": [4, 13, 15, 16], "additionali": 2, "address": 0, "adjoin": 15, "adt": [8, 15, 16, 17], "advanc": [3, 15, 16], "advantag": 15, "affect": [4, 7, 15], "after": [0, 3, 4, 7, 9, 11, 12, 13, 16, 20], "again": [12, 15, 19, 21], "against": [2, 16], "aid": 18, "aided": 18, "aim": [11, 20], "akin": 15, "akka": 9, "albeit": 15, "alert": 19, "algebra": [3, 8, 9, 13, 14, 15, 18, 19], "algebra_2": 16, "algorithm": [2, 7, 9, 11, 16, 18, 20, 21], "ali": 18, "alia": [4, 7, 15], "alias": [4, 5, 8], "all": [0, 1, 2, 3, 4, 7, 9, 11, 12, 13, 14, 15, 16, 17, 19, 20], "allevi": 6, "alllistsareempti": 15, "alloc": [4, 14], "allow": [3, 4, 7, 9, 12, 13, 17, 19, 20, 21], "along": [5, 9, 17, 20], "alreadi": [3, 4, 11, 15, 16, 19, 21], "also": [0, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21], "altern": [17, 19], "although": 15, "altogeth": 12, "alwai": [7, 11, 12, 13, 15, 16, 19, 20], "amaz": 3, "ambigu": 12, "amend": 12, "among": [15, 20], "amount": 3, "an": [1, 3, 4, 5, 7, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21], "analog": 9, "analys": 16, "analysi": [3, 15, 16, 18], "analyz": 19, "ancestor": 20, "ani": [0, 1, 4, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17, 20, 21], "anim": 17, "annot": [0, 4, 8, 12, 15, 16, 17], "anon": 12, "anonym": [7, 13], "anoth": [7, 14, 15, 16, 17, 19, 21], "ansi": 9, "answer": [3, 15], "anti": [5, 15], "antireflex": 15, "antisymmetri": 15, "anyth": [7, 15, 19], "anyv": [12, 17], "anywai": 12, "anywher": 6, "api": [0, 8], "appar": 15, "appear": 3, "append": [0, 12, 13, 15], "appendassoc": 13, "appendcont": 15, "appendindex": 13, "appli": [7, 8, 9, 11, 12, 13, 15, 16, 17, 19, 21], "applic": [3, 4, 14, 15, 18], "approach": [3, 12], "appropri": [0, 9, 12, 13, 21], "approxim": 11, "apt": 9, "ar": [0, 1, 2, 4, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21], "arbitrari": [7, 15, 17, 19], "arbitrarili": [3, 14], "architectur": [4, 9, 19], "archiv": 9, "arg": [0, 9], "arguabl": 15, "argument": [1, 4, 6, 7, 9, 15, 16, 17, 19, 21], "aris": [12, 15], "arith": 1, "arithmet": [4, 16, 17, 19], "aritmet": 16, "arm": 12, "around": [3, 7, 9, 11, 13, 17, 21], "arrai": [0, 8, 16], "array_int32": 4, "arraydequ": 6, "ascend": [13, 19], "ascii": [4, 9, 16], "ask": [8, 9, 15], "aspect": [11, 17, 19], "assembli": 9, "assert": [1, 4, 5, 6, 7, 9, 19, 20, 21], "asset": 9, "assign": [4, 6, 7], "assist": [3, 15, 17], "associ": [0, 8, 11, 15, 17, 19], "associativityproperti": 3, "assum": [1, 5, 7, 9, 11, 12, 13, 14, 15, 16, 17, 20, 21], "assumpt": [12, 13, 16], "ast": 12, "asynchron": 0, "attempt": [0, 9, 11, 12, 16, 19, 20, 21], "attribut": 15, "author": 3, "autocomplet": 9, "autom": [2, 3, 4, 11, 13, 15, 18], "automat": [1, 2, 3, 4, 7, 9, 11, 12, 15, 16, 19, 20], "auxiliari": 6, "avail": [4, 5, 7, 9, 13, 14, 15, 16, 17], "avoid": [0, 3, 4, 21], "await": 0, "awar": 14, "b": [0, 1, 4, 6, 7, 8, 12, 15, 16, 17, 19, 20], "b1": 15, "b2": 15, "b3": 15, "back": [7, 9, 19], "backbehav": 0, "backup": 0, "backupref": 0, "badli": 15, "badoverride1": 17, "badoverride2": 17, "badoverride3": 17, "bag": [16, 19], "bail": 12, "balanc": 11, "bar": 17, "base": [0, 1, 3, 9, 15, 16, 17, 20], "basecas": 17, "bash": 9, "basi": [12, 15, 16], "basic": [3, 12, 15], "batch": [7, 9, 16], "bbb": 17, "bcdefghi": 9, "becam": 12, "becaus": [0, 1, 3, 4, 9, 11, 12, 13, 15, 16, 17, 19, 21], "becom": [0, 7, 12, 13, 19], "been": [1, 3, 12, 13], "befor": [7, 9, 11, 15, 16, 20], "begin": 9, "behav": [7, 15, 17], "behavior": [12, 19, 20], "behaviour": 16, "being": [0, 15, 19, 20], "believ": 3, "belong": 17, "below": [0, 3, 4, 9, 11, 12, 13, 14, 17, 19], "benc": 1, "benchmark": [1, 2, 3, 5], "best": [3, 16], "better": [3, 12, 16, 19], "between": [0, 4, 8, 11, 12, 13, 14, 15, 16, 17, 19], "bigger": 15, "bigint": [0, 1, 3, 5, 6, 7, 9, 11, 12, 13, 14, 15, 19, 20, 21], "bigintadditivemonoid": 12, "bigintaddmonoid": 12, "bigintord": 12, "bigintprodmonoid": 12, "bigintproductmonoid": 12, "bigintsummonoid": 12, "billion": 3, "bin": 9, "binari": [1, 4, 8, 13], "bind": [8, 9], "bintrai": 16, "bit": [3, 4, 9, 15, 17, 19], "bitvector": [3, 16], "bitvectors3": 17, "bitwis": 4, "blanc": [7, 18], "block": [7, 15, 17, 19], "blott": 12, "bodi": [5, 6, 7, 8, 9, 12, 13, 15, 16, 19, 21], "bogu": 15, "book": 8, "bool": [1, 4], "boolean": [0, 2, 4, 6, 7, 8, 12, 13, 15, 19, 20, 21], "boost": 16, "bootstrap": 9, "both": [0, 2, 3, 4, 9, 12, 13, 15, 19], "bound": [4, 14, 16, 18, 19, 20], "boundari": 3, "box": [7, 15], "branch": [15, 19], "break": [12, 15], "bridg": 4, "broken": 20, "brows": 19, "browser": 9, "buffer": 9, "bug": [3, 19], "buggi": 19, "buggysortedin": 5, "build": [3, 8, 11, 13, 15, 16, 19], "built": [7, 9, 15, 19], "bundl": 9, "byte": [4, 17], "bytecod": 8, "c": [1, 3, 6, 8, 15, 16, 17, 20], "c99": 4, "cach": [5, 9, 12, 16, 21], "cade": 18, "call": [4, 6, 7, 9, 11, 12, 13, 15, 16, 17, 19, 20, 21], "came": 3, "can": [0, 1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21], "candid": [2, 3], "cannot": [4, 7, 11, 12, 13, 15, 16, 17, 19, 20, 21], "cap": 15, "capabl": [15, 16], "captur": 4, "care": 9, "carri": [15, 20], "case": [2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 14, 15, 16, 19, 20, 21], "caseclass": 17, "cast": [4, 17], "categori": [2, 4], "caus": 16, "cav": 18, "ccode": [4, 16], "cd": 9, "certain": [11, 12, 15, 19], "certainli": 15, "cf": 7, "cf0": 7, "cf1": 7, "cfwhile": 7, "ch": [9, 16], "chain": 15, "chang": [4, 7, 15, 17, 19], "channel": 0, "chapter": [15, 20], "char": 4, "char_bit": 4, "charact": [4, 16], "check": [3, 4, 7, 8, 9, 11, 13, 16, 17, 18, 19, 20], "checker": [1, 2, 11, 15, 16, 20], "chk": 2, "choic": 1, "choos": [3, 8, 13], "chose": 19, "chosen": 16, "chunk": 13, "circuit": 17, "circumv": 4, "claim": [13, 15], "clariti": 7, "class": [0, 3, 6, 7, 11, 12, 13, 15, 19, 20, 21], "classif": 2, "claus": [3, 7, 17, 19], "cleaner": 18, "clear": [3, 9, 19], "clearli": [12, 15], "cli": 9, "click": 9, "clone": [1, 9], "close": [4, 12, 15, 17], "closer": [15, 17], "cluster": 2, "cmap": 0, "co": 17, "code": [0, 3, 5, 6, 8, 12, 13, 15, 16, 17, 19, 20], "codebas": 21, "codegen": 16, "coher": 8, "collect": [0, 3, 6, 9, 11, 13, 15, 16, 17, 21], "colno": 9, "colon": [4, 15], "color": [8, 16], "com": [3, 9, 17], "combin": [4, 7, 11, 12, 15, 20], "come": [3, 4, 7, 9, 11, 13, 15, 16, 17], "command": [1, 2, 5, 9, 13, 16, 19], "comment": 7, "common": [9, 12, 15, 16], "comp": 9, "compact": 16, "compar": [8, 9, 17], "comparefun": 2, "comparis": 4, "compat": [4, 17], "compil": [4, 6, 8, 9, 11, 12, 13, 16, 17, 19, 20], "complain": 21, "complement": [7, 11, 17], "complet": [7, 15, 18, 19, 20], "complex": [3, 8, 20], "complianc": 4, "compliant": 4, "complic": 15, "compon": [3, 8, 10], "compos": 12, "comprehens": 11, "compromis": 16, "comput": [0, 3, 7, 14, 15, 16, 18, 19], "con": [0, 2, 3, 5, 6, 9, 12, 13, 15, 17, 19, 20], "concat": 9, "concaten": 15, "conceiv": 3, "concept": [11, 20], "conceptu": 12, "conclud": 15, "concret": [7, 11, 12, 15, 17, 18, 19], "concrop": 3, "concurr": [0, 11, 21], "cond": 20, "condit": [4, 7, 8, 9, 11, 12, 13, 15, 16, 17, 19], "conf": [16, 18], "confer": 18, "config": 16, "configur": [1, 8, 9], "conform": 11, "conjectur": 17, "conjunct": [4, 15], "connect": 15, "consequ": [15, 19], "consid": [1, 2, 3, 4, 7, 9, 15, 16, 19, 20], "consider": 15, "consist": [15, 19], "constant": [4, 17], "constant1": 4, "constant2": 4, "constant3": 4, "constitut": 15, "constrain": 17, "constraint": [3, 12, 17, 18], "construct": [3, 7, 11, 13, 15, 16, 17, 19, 20], "constructor": [0, 6, 7, 15, 17], "consult": [5, 9, 13], "contact": 3, "contain": [1, 4, 9, 13, 15, 16, 17, 19, 20, 21], "containin": 16, "content": [5, 6, 8, 13, 15, 16], "context": [7, 8, 15, 20], "continu": 15, "contra": 17, "contract": [6, 8, 11, 13, 15, 16, 17, 20], "contracthyp4": 1, "contrari": 15, "contrarili": 7, "control": [7, 9, 18], "controlflow": 7, "controlflow2": 7, "controversi": 3, "conveni": [4, 11], "convers": [7, 8, 17], "convert": [4, 13, 16, 17], "copi": [7, 9], "coq": [3, 8, 11, 16], "coqc": 1, "core": [4, 7, 9, 11, 13, 20], "correct": [2, 4, 8, 16, 17, 19, 20], "correctli": [3, 7, 13, 15, 19], "correspond": [0, 1, 4, 7, 11, 12, 13, 14, 15, 17, 19, 20], "cost": [7, 16], "could": [3, 7, 12, 14, 15, 19, 20, 21], "count": 13, "countabl": 15, "counter": [3, 5, 15, 16, 18, 19], "counterexampl": [2, 3, 11, 16, 19, 20], "counterpart": 15, "cours": 15, "coursier": 16, "cover": [3, 15, 20], "cow": 17, "cow1": 17, "cow2": 17, "cp": 9, "crash": [3, 11, 14, 16], "creat": [4, 7, 9, 12, 16, 21], "creation": 4, "critic": [9, 14], "crop": 5, "crucial": 15, "ctx": 0, "cumul": 13, "cup": 15, "cur": [2, 7], "current": [0, 4, 5, 7, 9, 11, 15, 16, 17, 21], "custom": [8, 16, 17], "cvc": 3, "cvc5": 5, "czip\u00f3": 1, "d": [9, 15, 17, 19], "d1": 16, "d2": 16, "dafni": 3, "dai": 12, "dash": 16, "data": [0, 3, 4, 7, 8, 11, 12, 13, 14, 15, 16, 18, 19, 21], "databas": 16, "dataflow": 10, "datatyp": [12, 21], "date": [13, 16], "deal": [4, 12, 15], "debian": 9, "debug": [7, 9, 15, 16, 19, 21], "decent": 15, "decid": [13, 19], "decis": [12, 18], "declar": [4, 7, 12, 17, 19, 20], "decompos": 15, "decreas": [2, 5, 7, 8, 11, 15, 16], "dedic": 13, "deduct": 18, "deem": 12, "deep": 7, "def": [0, 1, 2, 3, 4, 6, 7, 9, 11, 12, 13, 15, 17, 19, 20, 21], "default": [4, 7, 9, 11, 14, 15, 16, 19, 20, 21], "defin": [0, 1, 2, 3, 4, 7, 8, 12, 13, 14, 15, 16, 17, 20, 21], "definit": [0, 1, 4, 7, 8, 12, 13, 15, 19, 20], "defun": 9, "delic": [11, 15], "delimit": 19, "deliv": 0, "deliveri": 0, "delivermessag": 0, "delv": 15, "demo": 18, "demonstr": 12, "denomin": 15, "denot": [3, 9, 15, 19], "dep": 16, "depend": [3, 4, 5, 8, 12, 15, 16, 17, 20], "deploi": 3, "deriv": [12, 16, 20], "describ": [4, 6, 11, 12, 17, 20], "descript": [4, 13, 17, 18, 19], "design": [3, 11, 18], "desir": [4, 19], "despit": 3, "dest": 0, "destin": 0, "desugar": [7, 12], "detail": [4, 15, 16], "determin": [0, 16], "determinist": [0, 4], "develop": [3, 9, 11, 13], "did": 15, "differ": [3, 4, 9, 12, 15, 17, 19, 20, 21], "difficult": 15, "dir": 16, "direct": [13, 17], "directli": [3, 4, 15, 16, 19], "directori": [1, 9, 13, 15, 16], "disabl": 16, "disallow": 12, "discardold": 0, "discov": 3, "discrep": 14, "discret": [3, 15], "discuss": [15, 20], "disk": 16, "dispatch": 0, "displai": [7, 16, 19], "disprov": [2, 11, 16, 20], "distinct": [15, 19], "distinguish": 15, "distribut": [5, 13, 15], "do": [0, 3, 4, 7, 9, 11, 12, 13, 14, 15, 16, 17, 19], "doc": 9, "docker": 5, "document": [3, 5, 7, 13, 14, 16, 18, 19], "doe": [4, 8, 9, 11, 13, 15, 17, 19, 21], "doesn": [4, 15], "domain": 15, "don": [3, 13, 16], "done": [1, 2, 4, 9, 12], "dotta": 18, "dotti": 9, "doubl": [16, 17], "doubleoverflow": 19, "doublesum": 7, "down": [5, 9], "download": 9, "drive": [0, 16], "drop": [0, 4, 13], "dropvc": 13, "dscalaz3": 9, "dsl": 15, "due": [14, 15, 19], "dummi": 12, "dump": 16, "duplic": [13, 15], "durat": 0, "dure": [3, 7, 9, 12, 13, 16, 21], "dynam": [4, 12], "e": [3, 4, 5, 7, 9, 11, 12, 13, 15, 16, 17, 19, 20], "each": [0, 1, 2, 4, 7, 9, 11, 12, 15, 16, 19, 20], "earli": [1, 16], "earlier": 15, "easi": [3, 4, 15], "easier": [11, 15], "easili": [15, 19], "eat": 17, "editor": 9, "edu": 17, "educ": 3, "effect": [0, 3, 4, 7, 12, 15], "effici": [12, 13, 15, 16], "effort": 3, "eg": [9, 12, 13, 17, 19], "either": [5, 7, 12, 15, 16], "el": 17, "elem": 17, "element": [7, 12, 13, 15, 16, 19], "elementari": 15, "elimin": [7, 8], "els": [2, 4, 5, 7, 11, 13, 15, 17, 19], "elsewher": 15, "emac": 8, "embrac": 3, "emerg": 18, "emit": [3, 15, 19, 20], "emmanouil": 18, "emploi": 15, "empti": [0, 6, 12, 13, 15, 17, 19, 21], "emptyset": 15, "enabl": [4, 9, 16, 17], "enableplugin": 9, "enclos": [13, 17], "encod": [1, 3, 11, 12, 13, 17], "encount": 6, "encourag": [11, 13], "end": [3, 7, 9, 11, 12, 13, 15], "enforc": [7, 12, 14], "enough": [8, 13, 14, 15, 21], "ensur": [0, 1, 3, 4, 6, 7, 9, 11, 12, 13, 14, 15, 17, 19, 20, 21], "enter": [7, 20], "entir": [13, 15], "entri": 21, "enumer": [3, 4], "environ": [3, 4], "epfl": [7, 9, 16, 17], "eq": 12, "equal": [3, 12, 13, 15, 17, 19], "equat": [1, 15], "equival": [4, 7, 8, 15], "equivchk": 2, "erron": 2, "error": [3, 7, 8, 9, 11, 12, 15, 16, 17, 20], "especi": [3, 15], "essenti": [0, 7, 11, 12, 15], "establish": [3, 15], "etc": 16, "etienn": 18, "eval": 16, "evalu": [4, 11, 13, 15, 17, 19], "even": [3, 4, 9, 13, 15, 16, 19, 20], "evensplit": 13, "eventu": 20, "ever": 3, "everi": [4, 9, 12, 15], "everyth": 9, "everywher": 15, "evidenc": 12, "evolv": 4, "exact": 20, "examin": [16, 19], "exampl": [1, 3, 4, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21], "excel": 3, "except": [4, 13, 15], "exclus": 4, "execut": [0, 1, 3, 4, 7, 8, 9, 14, 16, 18, 19, 20], "executor": [5, 9], "exempt": 4, "exercis": [12, 15], "exhaust": [5, 8, 9, 15], "exist": [0, 3, 4, 5, 8, 11, 13, 14, 15, 17, 20], "exit": [7, 16, 20], "exp": 15, "expand": 15, "expect": [3, 4, 6, 11, 12, 15, 19], "expens": 15, "experi": [3, 9], "experiment": [1, 15], "explain": [1, 2, 4, 16, 19], "explicit": [12, 15, 16, 17, 20], "explor": [3, 15], "expmultcommut": 15, "exponenti": 15, "export": [8, 16], "expos": 5, "expr": [17, 20], "express": [4, 7, 8, 11, 12, 13, 15, 19, 20, 21], "extend": [0, 3, 4, 7, 12, 13, 15, 17, 19, 20], "extens": [7, 12, 17], "extern": [0, 3, 4, 6, 8, 11, 13, 16, 17, 19], "externfield": 21, "extra": [1, 4, 9, 15, 16], "extract": [9, 12, 13, 16, 17, 20, 21], "extractionsuit": 9, "extrem": 3, "f": [7, 12, 13, 15, 17, 20], "f1": [16, 17], "f2": [15, 16, 17], "f3": [9, 17], "f7": 9, "f8": 9, "face": 15, "facil": 4, "fact": [12, 15, 19, 20, 21], "factor": [15, 16], "factori": 11, "fail": [1, 6, 11, 15, 16, 17, 19, 21], "fair": 16, "fairli": [12, 15, 19], "fall": 9, "fals": [0, 1, 2, 4, 6, 7, 9, 13, 16, 17, 19, 20], "famili": 4, "familiar": [11, 15], "fan": 13, "faq": 8, "far": 15, "fashion": 15, "faster": 18, "favorit": 9, "fearlessli": 12, "featur": [7, 8, 11, 12, 15], "fed": 4, "feedback": 15, "feel": 16, "fetch": 16, "few": [7, 12, 15, 17, 20], "field": [0, 4, 6, 7, 13, 16, 17, 21], "file": [1, 4, 5, 8, 9, 17], "fileinputstream": 4, "filenam": 9, "fileoutputstream": 4, "fill": 4, "filter": 13, "final": [0, 2, 4, 7, 9, 12, 15, 16], "find": [3, 9, 11, 13, 15, 16, 19, 20], "finish": [9, 14], "finit": [15, 17, 19], "first": [0, 1, 4, 7, 11, 12, 13, 15, 16, 17, 19, 21], "fit": [11, 16], "fix": [4, 15], "flag": [4, 9, 12, 16, 21], "flatmap": 13, "flatten": 13, "flight": 0, "flip": 9, "float": 17, "flow": 7, "focu": 3, "fold": [12, 15], "folder": 9, "foldleft": [0, 13, 15], "foldmap": 12, "foldright": [12, 13, 15], "follow": [1, 2, 4, 6, 7, 9, 11, 12, 13, 15, 16, 17, 19, 20, 21], "foo": [7, 15, 17], "food": 17, "footnot": 15, "foral": [0, 3, 13, 15, 20, 21], "forev": 20, "form": [3, 7, 9, 11, 12, 13, 15, 16, 17], "formal": [3, 15, 18, 20], "format": [4, 9], "formula": [3, 15, 20], "forward": 21, "found": [2, 4, 5, 9, 13, 14, 15, 16, 19], "foundat": 18, "four": 15, "fr": [16, 18], "fraction": 3, "fragment": [11, 13, 21], "framework": [0, 11, 18], "free": [3, 20], "freeli": 21, "frequent": 8, "from": [0, 2, 4, 5, 6, 7, 8, 12, 13, 15, 16, 17, 19, 20, 21], "frombyt": 17, "fromint": 17, "fromlong": 17, "fromshort": 17, "front": [7, 9, 11], "frontend": [1, 2, 5, 9, 13, 16], "fsinsert": 19, "fulfil": 15, "full": [13, 15, 16], "fulli": [4, 9, 12], "fun": 1, "function": [0, 1, 2, 3, 5, 6, 8, 9, 11, 12, 13, 14, 15, 16, 18, 19, 21], "further": [12, 15, 16], "furthermor": [4, 9], "futur": [3, 11, 17], "fuzz": 8, "fuzzer": 3, "g": [3, 4, 9, 11, 12, 13, 15, 16, 17], "g8": 17, "genc": [4, 16, 17], "gener": [1, 2, 3, 7, 8, 11, 12, 13, 15, 19, 20], "geq": 15, "gerwin": 18, "get": [2, 4, 5, 7, 9, 12, 13, 15, 17], "gethead": 20, "getorels": [6, 17], "getter": 7, "gh": 9, "ghost": [0, 4, 7, 8, 13], "git": 9, "github": [5, 9, 17], "give": [3, 13, 15, 17, 20], "givefood": 17, "given": [0, 2, 3, 4, 9, 11, 12, 14, 15, 16, 17, 19, 20], "global": [8, 9], "globalextern": 4, "globalst": 4, "globaluniniti": 4, "go": [4, 7, 12, 13, 15, 16, 17, 19], "goal": [14, 15], "goe": [4, 12], "good": [3, 12, 15], "govern": 12, "granular": 15, "grass": 17, "greater": 17, "group": [15, 16, 17], "grow": [13, 15], "gtb": 1, "guarante": [3, 11, 15, 20], "guard": [17, 20], "guess": 15, "guid": 15, "guidelin": [4, 19], "h": [4, 9, 13, 15, 16, 17], "ha": [0, 3, 4, 7, 12, 13, 15, 16, 18, 19, 20, 21], "had": [3, 15], "halv": 13, "hamza": 18, "hand": [3, 4, 11, 15, 17], "handi": 15, "handl": [0, 7, 11, 13, 16, 20], "handler": 0, "happen": [11, 15, 16, 20, 21], "happi": 17, "happili": 15, "hard": [11, 13, 15, 16], "hardwar": 4, "hash": 9, "haskel": [11, 12], "have": [0, 1, 3, 4, 7, 9, 12, 13, 14, 15, 16, 17, 19, 20], "hd": 17, "he": 15, "head": [0, 2, 3, 5, 9, 13, 19, 20], "header": [4, 16], "header1": 16, "header2": 16, "headless": 9, "headopt": [6, 13], "headwai": 15, "heap": [11, 14], "hello": [6, 17, 21], "hellostainless": 9, "help": [3, 5, 9, 11, 12, 15, 16, 19], "helper": [12, 15], "henc": [4, 15, 20], "henceforth": 5, "here": [0, 1, 4, 7, 9, 12, 13, 15, 17, 19], "heurist": 16, "hi": [4, 17], "hide": [4, 13], "hierarchi": [3, 4, 12, 16], "higher": [3, 4, 12, 15, 16, 18], "highli": 9, "hindlei": 12, "hint": 15, "hint1": 15, "hint2": 15, "hitch": 12, "hoc": 12, "hocon": 16, "hol": [3, 18], "hol4": 3, "hold": [0, 3, 4, 7, 11, 12, 13, 14, 15, 16, 17, 19, 20], "hood": 8, "how": [0, 4, 8, 12, 15, 17, 19, 20], "howev": [4, 7, 9, 11, 13, 15, 19, 20], "html": 9, "http": [3, 9, 13, 16, 17], "huge": 19, "human": [9, 15], "hupel": 18, "hybrid": 17, "hypothesi": 15, "i": [0, 1, 2, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 20, 21], "i1": 7, "i2": 7, "icalp": 18, "id": [7, 8, 16, 17], "idea": 15, "ident": [12, 15, 17], "identifi": [3, 4, 7, 12, 15, 17], "idiomat": [0, 4], "ie": [12, 16, 17], "ifthenels": 1, "ignor": [0, 13, 16], "ijcar": 18, "illeg": 7, "illustr": [3, 7, 8, 19], "imagin": 12, "immut": [0, 17], "immutablebox": 7, "imper": [4, 8, 11, 20], "implement": [2, 3, 7, 9, 11, 12, 13, 15, 17, 18, 19, 20, 21], "impli": [0, 4, 15, 16, 20], "implic": [4, 17], "implicit": [0, 4, 7, 11, 12, 20], "implicitli": 15, "import": [4, 6, 9, 12, 13, 15, 16, 17, 19, 20, 21], "impos": 4, "improv": [9, 15], "inbox": 0, "inc": [0, 7], "includ": [3, 4, 9, 12, 13, 14, 15, 16, 17, 20], "incoher": 12, "incom": 0, "incomplet": 20, "incorrect": 2, "increas": [3, 9], "increment": [0, 9, 17], "inde": [4, 7, 12, 15, 19, 21], "independ": [3, 9], "indetermin": 15, "index": [9, 13, 17, 20], "indic": [7, 16], "individu": 20, "induct": [0, 2, 3, 7, 12, 13, 16, 19, 20], "industri": 8, "inequ": 15, "infer": [11, 15, 16, 17, 18, 20], "infinit": [11, 14, 17], "inflat": 9, "info": [0, 2, 5, 9, 15, 17, 19], "inform": [0, 2, 5, 9, 13, 15, 18, 20], "infrequ": 9, "inhabit": 15, "inherit": [4, 8, 17], "init": [9, 13], "initcount": 0, "initi": [0, 1, 4, 7, 20], "initialbehavior": 0, "initialinv": 0, "initialsystem": 0, "inject": [7, 13, 15], "inlin": [0, 4, 12, 13, 19, 20], "inlineinvari": 20, "inlineonc": [12, 13], "inox": [1, 3, 11, 18], "input": [2, 3, 4, 11, 15, 16, 17, 19, 20], "inputfilesandopt": 9, "insert": [8, 13, 15, 21], "insertat": 13, "insertionsort": [3, 5], "insid": [9, 13, 15, 16, 17, 19, 20], "insight": 3, "inspect": [7, 17, 19, 21], "inspir": 16, "inssort": 13, "instal": [1, 5, 8, 11], "instanc": [0, 4, 7, 9, 12, 13, 16, 17], "instanti": [6, 12, 15], "instead": [3, 4, 7, 9, 13, 15, 16, 19], "instruct": [9, 13, 21], "instrument": 16, "int": [2, 3, 4, 5, 7, 12, 19, 20, 21], "int12": 17, "int16": [4, 17], "int16_t": 4, "int32": [4, 17], "int32_t": 4, "int4": 17, "int64": [4, 17], "int64_t": 4, "int8": [4, 17], "int8_t": 4, "integ": [3, 4, 12, 13, 15, 17, 19], "integr": [3, 18], "intend": 11, "intention": 15, "interact": [4, 9, 11, 15, 16], "interchang": 17, "interest": [3, 12, 15, 19, 21], "interfac": [12, 16, 18, 19], "interleav": 15, "intermedi": [15, 17], "intern": [7, 8, 11, 12, 16, 17, 18, 20], "interoper": 3, "interpret": [16, 17, 18], "intersect": 17, "interv": 17, "inti": 17, "introduc": [3, 6, 7, 9, 11, 12, 15, 19], "introduct": 8, "inttyp": 4, "intuit": 15, "intx": 17, "inv": [0, 20], "invalid": [3, 5, 7, 9, 11, 12, 15, 16, 19, 21], "invari": [3, 4, 7, 8, 13, 17], "invariantfunct": 7, "invers": 12, "invest": 3, "invit": 18, "invoc": 19, "invok": [0, 2, 9, 11, 13, 14, 16, 17], "involv": [0, 3, 12, 15, 20], "io": [4, 9, 16], "isabel": [3, 11, 16, 18], "isdefin": 6, "isdefinedat": 17, "isempti": [0, 2, 6, 13, 15], "isinstanceof": [5, 9, 20], "isiz": 19, "ismeasur": 15, "isn": 15, "isnonzero": 15, "isol": 9, "isposit": [15, 17], "israt": 15, "issort": [2, 5, 6, 13, 19], "issorteda": 2, "issortedb": 2, "issortedc": 2, "issortedr": 2, "issu": [6, 7, 9, 12, 15, 20], "iter": [2, 20], "its": [0, 3, 4, 7, 9, 10, 11, 12, 13, 15, 16, 17, 19, 20], "itself": [0, 3, 12, 13, 15, 20, 21], "ivan": 18, "ivi": 16, "j": 9, "jacob": 18, "jad": 18, "jar": [9, 16], "java": [6, 8, 9, 12, 13, 21], "jdk": 13, "joint": 18, "jre": 9, "json": 16, "jump": 9, "just": [3, 9, 11, 12, 15, 16, 17], "jvm": [3, 9, 16, 19], "k": 21, "keep": [13, 15, 20], "kei": [9, 21], "kept": 17, "keyword": [8, 13, 15, 17, 20], "kill": 15, "kind": [12, 17], "klein": 18, "kneuss": 18, "know": [11, 15, 20, 21], "knowledg": [3, 12, 15], "known": [4, 12, 20], "koukouto": 18, "kuncak": 18, "kuraj": 18, "k\u00f6ksal": 18, "l": [2, 3, 5, 6, 13, 15, 17, 19, 20], "l1": [13, 15], "l2": [13, 15], "l3": 13, "lambda": 16, "land": 20, "lang": [0, 6, 7, 13, 15, 16, 17, 21], "languag": [3, 4, 7, 9, 11, 12, 13, 15, 17, 18, 20], "lar": 18, "lara": [9, 16, 17], "larg": [3, 13, 14, 19], "larger": [17, 19], "last": [13, 15, 17, 19], "lastopt": 13, "later": [9, 15], "latest": [9, 16], "latter": [0, 9, 12, 17, 20], "law": 12, "law_associ": 12, "law_leftident": 12, "law_rightident": 12, "layer": 17, "lazi": [9, 17], "lead": [11, 12, 15], "leaf": 4, "leak": 4, "lean": 3, "leaner": 18, "learn": [3, 4, 11, 13, 15, 19], "least": [3, 9, 11, 17, 19], "leav": 15, "left": [4, 13, 15, 17], "leftunitappend": 15, "lemma": [2, 6, 12, 15, 19], "lemma_associativity_plu": 12, "lemma_rightidentity_plu": 12, "length": [0, 4, 7, 17, 20], "leon": [3, 4, 18], "leq": 2, "less": [12, 13, 15], "lessthan": 12, "lessthaneq": 12, "let": [4, 7, 9, 12, 15, 16, 19, 20, 21], "level": [0, 3, 7, 8, 9, 11, 12, 15, 17], "leverag": 7, "lib": [1, 9, 13, 16], "libfil": 16, "libgomp1": 9, "librari": [0, 3, 4, 5, 8, 9, 11, 12, 15, 17, 19, 21], "library_3": 9, "librarydepend": 9, "lift": 17, "like": [3, 5, 9, 11, 12, 13, 15, 16, 17, 19, 20, 21], "limit": [3, 4, 8, 17], "line": [5, 7, 9, 13, 16, 17, 19], "lineno": 9, "link": [9, 12], "linux": 8, "list": [0, 2, 3, 4, 5, 6, 8, 9, 11, 12, 15, 17, 20], "listop": 13, "listoper": 3, "listspec": 13, "liter": [4, 17], "littl": 19, "live": [4, 9, 15], "ll": 15, "ln": 9, "load": [9, 16], "local": [4, 7, 9, 13, 15, 16], "locat": [9, 15], "log": 0, "logic": [3, 15, 17], "long": [3, 4, 7, 9, 17], "longer": [13, 15], "longest": 13, "look": [12, 13, 15, 19, 21], "loop": [2, 3, 4, 8, 9, 11], "loos": 0, "lose": 15, "lot": 21, "low": [3, 8], "lower": 9, "lucki": 16, "m": [0, 11, 12, 15, 17], "machin": 3, "maco": 8, "made": 4, "madhavan": 18, "magic": 7, "magnitud": 18, "mai": [3, 5, 7, 9, 11, 14, 15, 16, 17, 19], "main": [0, 4, 5, 9, 10], "maintain": [0, 7, 9, 17], "major": 15, "make": [1, 3, 4, 7, 9, 12, 15, 16, 17, 19, 20], "makefil": 9, "makefoo": 17, "malloc": 4, "manag": [9, 11, 15], "mandatori": 4, "mangl": 4, "mani": [2, 3, 12, 15, 16, 19, 20], "manipul": [3, 4, 14, 16], "mano": 18, "manual": [4, 11, 12, 15, 16], "map": [4, 8, 12, 15, 16, 21], "map1": 13, "mark": [0, 4, 7, 12, 17, 21], "mash": 12, "master": 4, "match": [0, 2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 15, 16, 19], "math": [11, 16, 17, 19], "mathbb": 15, "mathcal": 15, "mathemat": [3, 13, 15, 16, 17, 20], "mavencentr": 16, "max": [8, 11, 16, 17], "max_lemma": 19, "maximum": [14, 17, 19], "maxvalu": [3, 19], "mayb": 11, "mayer": 18, "mbox": 20, "mc": 7, "mc1": 7, "mc2": 7, "mccarthi": 11, "md": 1, "me": 0, "mea": 15, "mean": [3, 7, 11, 12, 13, 15, 17, 19, 20], "meant": [4, 16, 17], "measur": [5, 8, 11, 16, 20], "mechan": [12, 13, 15, 16], "meet": 20, "member": 4, "memori": [0, 4, 8, 16, 20], "mention": [4, 15, 21], "merg": 12, "messag": [9, 16], "messagequeu": 6, "meta": 21, "method": [0, 3, 4, 6, 8, 13, 15, 16, 19, 20], "metric": 11, "might": [0, 4, 9, 11, 12, 15, 19], "mikael": 18, "milli": 0, "milner": 12, "min": 17, "mind": [13, 15], "minim": 15, "minimum": [3, 17], "minor": 9, "minuscul": 3, "minut": 9, "minvalu": 3, "mirco": 18, "mismatch": 4, "misra": 4, "miss": [9, 15], "mkdir": 9, "ml": 11, "mode": [9, 17], "model": [2, 4, 12, 16, 18, 20], "modern": [0, 12], "modif": [7, 11, 12], "modifi": [7, 9, 15, 19], "modul": [3, 9, 12, 17, 19, 20], "modular": [3, 15], "modulo": [17, 18], "moment": 4, "monad": 11, "monoid": 12, "more": [0, 3, 5, 9, 11, 12, 13, 16, 17, 19], "moreov": 11, "most": [4, 5, 7, 9, 13, 15, 16, 17, 19, 20], "mostli": [15, 19], "move": [4, 9, 19], "msg": [0, 6], "msgqueue": 6, "mu": 15, "much": [3, 12, 13, 17], "multipl": [3, 4, 9, 12, 13, 15, 17, 19, 20], "multipli": 12, "multiset": 19, "must": [3, 4, 7, 9, 12, 13, 15, 16, 17, 20], "mutabl": [0, 4, 8, 11], "mutablebox": 7, "mutableclass": 7, "mutablemap": 16, "mutat": [7, 21], "mutual": 13, "my": 3, "mycase1": 17, "mycase2": 17, "mycon": 17, "myempti": 17, "myfil": [4, 9], "myfile1": 9, "myfile2": 9, "mylist": 17, "mymainclass": 9, "myprint": 4, "myproject": 9, "mytail": 9, "mytyp": 17, "n": [0, 7, 9, 11, 12, 15, 16, 17], "name": [0, 2, 4, 7, 9, 12, 13, 15, 16, 19, 20, 21], "name_scalavers": 16, "nanosecond": 3, "narrow": 17, "nat": [12, 16], "natadditivemonoid": 12, "nativ": 16, "nativez3": [9, 12, 16], "natur": [7, 12, 15], "navig": 9, "necessari": 15, "need": [0, 3, 4, 6, 7, 9, 12, 13, 14, 15, 16, 17, 19, 20], "neg": [5, 17, 19, 20], "negat": [7, 20], "neither": [2, 3, 11], "nest": [4, 7, 17], "never": [6, 11], "new": [0, 6, 7, 9, 12, 13, 15, 17, 21], "newbehavior": 0, "newidentifi": 17, "newinbox": 0, "newli": 12, "newsystem": 0, "newvalu": 7, "next": [0, 1, 2, 9, 12, 16, 19], "nextbehavior": 0, "nice": 15, "nicola": 18, "nil": [0, 2, 3, 5, 6, 12, 13, 15, 17, 19, 20], "nipkow": 18, "non": [0, 2, 3, 4, 5, 7, 8, 16, 17, 19], "none": [7, 17], "nonempti": [9, 13], "nonetheless": 12, "nor": [2, 3, 11, 15], "noreturninvari": 20, "normal": [7, 15], "nosend": 0, "notabl": 3, "notat": [3, 17], "note": [0, 3, 4, 7, 9, 13, 15, 16, 17, 19], "noth": 17, "notic": 15, "notwellfound": 15, "now": [9, 11, 12, 15, 16, 18, 19, 21], "number": [3, 9, 12, 13, 15, 16, 17, 19, 20], "numer": [3, 15, 20], "object": [0, 3, 4, 6, 8, 9, 12, 13, 15, 18, 19, 20, 21], "oblig": 1, "obtain": [2, 3, 9, 15, 19], "occur": [11, 13, 19], "occurr": 13, "odd": 15, "offend": 19, "offer": [9, 13], "offici": 9, "often": [6, 7, 11, 12, 15, 19, 21], "ok": [7, 17], "old": [6, 7, 16], "omit": 15, "onc": [2, 12, 13, 15, 19, 21], "one": [0, 2, 3, 4, 6, 7, 9, 11, 12, 15, 16, 17, 19, 20, 21], "ones": [4, 15], "onli": [0, 4, 6, 7, 12, 13, 14, 15, 16, 17, 19, 20], "onlin": 13, "oopsla": 18, "op": 15, "opam": 1, "opaqu": [13, 21], "open": [9, 20], "openjdk": 9, "oper": [0, 7, 9, 12, 15, 16, 17, 19], "opt": [16, 19], "optim": [4, 15], "option": [2, 4, 5, 6, 7, 8, 13, 15, 17], "ord": 12, "order": [0, 2, 3, 4, 7, 9, 12, 13, 15, 16, 18, 19, 21], "ordinari": 13, "org": [9, 13, 16], "organ": [9, 16], "orient": [3, 18], "origin": [1, 3, 4, 7, 9, 11, 12, 15], "oss": 16, "other": [0, 4, 8, 9, 11, 12, 13, 15, 16, 17, 20, 21], "otherwis": [3, 4, 17, 19, 21], "our": [0, 2, 3, 12, 15, 19, 21], "out": [2, 8, 9, 12, 15, 19, 20], "outcom": 9, "output": [2, 3, 4, 5, 7, 9, 12, 15, 16, 20], "outsid": [4, 6, 7, 15, 17, 20], "over": [0, 4, 9, 11, 12, 15, 17, 20], "overal": 15, "overflow": [14, 16, 17, 19], "overlap": 12, "overload": [4, 12], "overrid": [0, 12, 13], "overridden": [0, 7, 12, 13, 17], "overview": 18, "own": [0, 3, 4, 12, 13, 15, 19, 20], "p": [0, 2, 9, 13, 15, 19], "packag": [4, 9, 13, 15, 16, 17], "packagebin": 9, "pad": 13, "page": [8, 9, 13], "pair": [7, 15], "paper": [2, 8, 13], "paradigm": 11, "paragraph": 4, "parallel": 16, "paramet": [4, 6, 7, 11, 12, 15, 20], "parameterless": [16, 19], "parametr": 19, "parent": 17, "pars": 13, "part": [3, 4, 6, 11, 12, 15, 20, 21], "partial": [4, 7, 12, 13, 17], "partialev": 13, "partialfunct": [0, 8], "particular": [7, 11, 15, 20], "partli": 7, "pass": [4, 7, 9, 11, 13, 16, 17, 19, 20], "past": [3, 9], "path": [0, 1, 2, 5, 9, 16, 17, 20], "pattern": [4, 8, 13, 15, 19], "pc": 20, "per": [3, 4, 16], "perfectli": 7, "perform": [0, 3, 7, 9, 15, 17], "perhap": [15, 21], "persist": [0, 16], "phase": [4, 7, 12, 21], "phd": 7, "philipp": 18, "phillipp": 18, "pick": [0, 9, 12, 16], "piec": 21, "pin": 19, "pipelin": [5, 6, 9, 10, 16], "piskac": 18, "place": [15, 17, 19], "plai": 15, "platform": 9, "pldi": 18, "pleas": [4, 9, 13, 16], "plenti": 15, "plu": [12, 19], "plugin": [5, 6, 9], "plusassoc": 15, "pluscomm": 15, "po": 13, "point": [0, 3, 7, 9, 12, 15, 17, 19, 20, 21], "pointer": 7, "pollfirst": 6, "polymorph": 12, "pool": 16, "popl": 18, "portfolio": 9, "posit": [9, 13, 15, 17, 19, 20], "positiverequirefordefault": 17, "positiveshort": 15, "possibl": [3, 4, 7, 9, 11, 12, 15, 17, 20], "possibli": 19, "post": [3, 4, 7, 16, 20], "postcondit": [1, 5, 7, 8, 11, 12, 13, 14, 16, 19, 21], "potenti": [11, 12, 15], "power": [15, 18], "practic": [3, 8, 20], "pre": [4, 7, 11, 13, 15, 17], "prec": 20, "precis": [14, 15, 17], "precond": [15, 21], "precondit": [1, 4, 7, 8, 11, 13, 14, 15, 19], "predefin": [1, 8], "predic": [11, 12, 13, 15, 19], "prefer": 15, "prefix": [1, 13], "prepar": 3, "prepend": [13, 15], "preprocess": 7, "presenc": [3, 15], "present": [11, 15, 16, 17, 20], "preserv": [11, 15], "pretti": [12, 19], "prev": 12, "previou": [6, 9, 12, 15, 17], "previous": 15, "prii32": 4, "primari": 0, "primaryref": 0, "primbehav": 0, "princess": [3, 9, 16], "principl": [15, 18], "print": [2, 4, 7, 16], "printf": 4, "println": 4, "prior": 7, "priori": 15, "privat": [0, 6], "probabl": 15, "problem": [7, 11, 12, 15, 19, 20], "proce": [6, 7, 15], "procedur": [7, 18], "proceedvalu": 7, "process": [0, 2, 3, 9, 13, 16], "processmsg": 0, "produc": [3, 4, 9, 13, 15], "product": [3, 12, 15], "program": [0, 2, 6, 8, 9, 12, 14, 15, 16, 17, 18, 19, 20], "programm": 12, "project": [1, 3, 17], "proof": [0, 2, 3, 4, 8, 12, 16, 17], "prop": [0, 17], "prop1": 21, "prop2": 21, "proper": [9, 15, 20], "properli": 15, "properti": [0, 6, 7, 8, 9, 11, 14, 15, 17, 18, 20], "propertli": 16, "propos": 7, "proposit": [8, 17], "propositionallog": 3, "provabl": [2, 9], "prove": [2, 6, 7, 8, 9, 11, 12, 16, 19, 20], "proven": [12, 13, 14, 15, 16, 19], "prover": [11, 15], "provid": [0, 4, 7, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20], "public": 17, "pull": [16, 21], "pure": [0, 4, 6, 7, 8, 11, 13, 20, 21], "purescala": [7, 21], "puriti": [7, 8], "purpos": [3, 14, 19], "put": [6, 9, 13], "python": 9, "q": 9, "q_n": 9, "qed": 15, "quadrupl": 7, "qualifi": [9, 16], "quantifi": 3, "queri": 3, "question": [8, 15, 19], "queue": 6, "quick": [8, 13], "quickli": [9, 15], "quit": [15, 17], "r": [12, 13, 15, 20], "random": 16, "rang": 17, "rather": [15, 21], "ravichandhran": 18, "raw": 4, "re": [5, 6, 7, 11, 12, 15, 16, 17, 19, 21], "read": [4, 9, 11, 12, 15, 19], "readabl": [7, 9, 12, 15], "reader": [13, 15], "readm": 1, "real": [15, 16], "realli": 15, "reason": [2, 3, 11, 12, 13, 16, 18, 19, 21], "recal": 15, "recap": 8, "receiv": [0, 4], "recent": 9, "recogn": [15, 16], "recommend": [5, 8, 16], "recompil": 9, "recoveri": 21, "recurs": [2, 3, 4, 7, 9, 11, 12, 13, 14, 15, 16, 18, 19], "redefin": 12, "reduc": [3, 15, 16], "reduct": 18, "redund": 15, "ref": 0, "refactor": 9, "refer": [2, 4, 6, 7, 8, 9, 12, 13, 17, 19, 21], "refin": [1, 12, 17], "refinelaw": 12, "reflect": 4, "reflex": 15, "refus": 13, "region": 3, "regress": 3, "regular": [17, 20, 21], "reject": [12, 17], "rel": [9, 15, 16], "relat": [1, 9, 13, 16, 19, 20], "relationship": [12, 15], "releas": 8, "relev": [11, 12, 20], "reli": [7, 12, 13, 15, 20], "reload": 9, "remain": [15, 16], "remark": 17, "remedi": 21, "rememb": 15, "reminisc": 15, "remot": 7, "remov": [13, 15, 17], "renam": [4, 7, 9], "repair": [4, 16, 18], "repeat": 19, "replac": [1, 3, 9, 13, 15, 16, 21], "replaceat": 13, "report": [1, 2, 3, 4, 9, 11, 15, 16], "repositori": [1, 5, 9, 16], "repres": [0, 4, 12, 15, 17], "represent": [15, 17], "reproduc": 9, "requir": [0, 7, 8, 11, 12, 13, 15, 17, 19, 20, 21], "research": 13, "resembl": 15, "resid": 9, "resolv": [9, 16], "resort": 14, "resourc": [4, 18], "respect": [4, 12, 17, 20], "respons": [3, 4], "rest": [16, 17, 19], "restart": 16, "restrict": [4, 7, 19, 20], "restructur": 9, "result": [0, 1, 2, 3, 4, 5, 6, 7, 9, 12, 13, 15, 16, 17, 19, 21], "ret": 7, "return": [0, 1, 4, 8, 11, 13, 14, 15, 16, 17, 19, 20], "returnelimin": 7, "returninwhil": 7, "returninwhile3": 20, "returnn": 7, "returnnwhil": 7, "returnwhil": 7, "retvalu": 7, "reus": [2, 15], "reusabl": 18, "reveal": 19, "revers": [13, 15], "reverseappend": 15, "reverseindex": 13, "reverserevers": [13, 15], "revert": 16, "revisit": 15, "rewrit": [3, 7], "rewritten": [12, 15], "rich": 13, "right": [4, 12, 13, 15, 20], "rightarrow": 15, "rightfulli": 12, "rightunitappend": 15, "rise": 17, "risk": 15, "rmax": 19, "role": 15, "root": [9, 17], "rotat": 13, "roughli": 15, "rsize": 19, "rst": 9, "rule": [15, 19], "run": [1, 3, 5, 7, 8, 11, 14, 15, 16, 19, 21], "runner": 5, "runtim": [4, 14, 18], "rust": 8, "ruzica": 18, "rv": 18, "r\u00e9gi": [7, 18], "s1": [16, 17], "s2": [16, 17], "sa": 18, "safe": 8, "safer": 20, "safeti": [8, 11, 14, 17], "sai": [0, 9, 12, 15, 19, 21], "sake": 12, "same": [4, 7, 9, 12, 15, 17], "sampl": 3, "satisfi": [4, 6, 11, 12, 13, 17, 18, 19, 20], "save": 16, "saw": 15, "sbt": [5, 6, 9, 16], "scala": [0, 1, 2, 3, 4, 5, 7, 8, 9, 12, 13, 15, 16, 18, 19, 20, 21], "scala_object": 9, "scalac": [1, 3, 9, 16, 17], "scaladoc": 13, "scanleft": 13, "scanright": 13, "scanvsfoldright": 13, "scenario": 3, "schedul": 0, "scienc": 3, "scope": [4, 7, 12, 20], "scratch": 21, "script": [5, 9, 16], "scrut": 9, "seal": [0, 3, 7, 12, 13, 15, 17, 19, 20], "search": [3, 8, 15, 16], "sec": 16, "second": [4, 9, 15, 17, 19, 21], "section": [0, 3, 4, 6, 9, 11, 12, 13, 15, 16, 17, 20], "secur": 3, "see": [0, 3, 4, 5, 7, 9, 13, 15, 16, 17, 19, 20, 21], "seem": [15, 19], "seemingli": 15, "seen": [0, 12, 15, 17], "select": [6, 13, 16, 17], "self": [0, 15, 17], "semant": [4, 7, 11, 12, 14, 16, 17, 18, 19], "semigroup": 12, "send": 0, "sendunderli": 0, "sens": [15, 19, 20], "sent": 0, "sep": 13, "separ": [4, 13, 15, 17], "seq": 9, "sequel": 19, "sequenc": [4, 7], "serv": [11, 15], "servic": [5, 9], "set": [4, 5, 8, 9, 11, 12, 14, 15, 16, 19], "setexist": 13, "setforal": 13, "setq": 9, "setter": 7, "settolist": 13, "setup": [17, 19], "sever": [4, 9, 14, 17, 18], "shape": [4, 15], "share": [7, 8, 11], "shell": [5, 9], "short": [4, 13, 16, 17], "shortcom": 15, "shorten": [15, 16], "shorthand": 17, "should": [0, 3, 4, 6, 7, 9, 11, 15, 16, 17, 19, 20, 21], "show": [0, 9, 15, 19, 20], "shown": [3, 4, 11, 12, 20], "shtml": 17, "shut": [5, 9], "side": [4, 7, 15, 16, 17], "sign": [4, 12, 17, 19], "signatur": [2, 4, 12, 13], "signific": [11, 17], "significantli": 16, "sigplan": 18, "silent": [12, 16], "similar": [7, 15, 17, 19], "similarli": [4, 7, 15, 16, 17], "simpl": [9, 11, 12, 17], "simpler": [15, 19], "simplest": 9, "simpli": [4, 7, 15, 16, 19], "simplic": 11, "simplif": 16, "simplifi": [9, 15, 20], "simul": [4, 7], "sinan": 18, "sinc": [4, 12, 15], "singl": [0, 3, 9, 13, 15, 16, 17, 19, 20], "singleton": 17, "sinsert": 19, "site": [4, 7, 11, 13, 20], "situat": [4, 15], "size": [2, 5, 6, 8, 13, 14, 16, 17], "skill": 3, "skip": 4, "slc": 1, "slice": 13, "slightli": 12, "slower": 13, "small": [3, 11, 16, 19], "smaller": [11, 17, 19, 20], "smartphon": 3, "smt": [5, 8, 9, 13, 14, 15, 16, 18, 21], "smtlib": 17, "snapshot": [7, 16], "snippet": 7, "snocafterappend": [13, 15], "snocfoldright": 15, "snocindex": 13, "snocisappend": 13, "snocrevers": [13, 15], "so": [3, 4, 7, 9, 12, 14, 15, 16, 17, 19, 20], "soft": 9, "softwar": [8, 9, 18, 20], "solv": [1, 3, 9, 12, 18, 19], "solver": [5, 8, 13, 14, 15, 18], "some": [0, 3, 4, 5, 6, 7, 9, 11, 12, 13, 15, 16, 17, 19, 20, 21], "someproof": 12, "someth": [5, 7, 9, 15], "sometim": [7, 11, 12, 15], "somewhat": [3, 9, 15], "sonatyp": 16, "soon": 16, "sort": [2, 6, 8, 13, 15], "sound": [9, 11, 13, 16, 18], "sourc": [5, 8, 13, 15, 16, 20], "space": [3, 14, 15], "spec": 17, "special": [3, 4, 7, 13, 15, 16], "specialis": 4, "specif": [3, 4, 7, 8, 11, 12, 13, 15, 16, 18], "specifi": [0, 2, 4, 6, 8, 9, 11, 13, 15, 17, 19, 20], "speed": [3, 16], "sphinx": 9, "split": [9, 13, 15], "splitat": 13, "src": 9, "stabl": [4, 16], "stack": [4, 14, 16, 18], "stackoverflow": 3, "stage": [1, 9], "stainless": [0, 2, 4, 5, 6, 7, 12, 14, 15, 17, 18, 19, 20, 21], "stainlessen": 9, "stainlessextradep": 9, "stainlessplugin": 9, "stand": 15, "standalon": [8, 12], "standard": [1, 4, 9, 13, 17, 19], "start": [3, 5, 9, 13, 15, 16, 19], "startup": 16, "state": [0, 2, 7, 8, 15, 16, 19], "statement": [1, 4, 15, 16, 19], "static": [3, 11, 18, 19, 20], "staticcheck": [6, 7, 16], "statu": 1, "stdin": [4, 16], "stdio": 4, "stdout": 4, "stem": [12, 21], "step": [0, 9, 12, 15], "still": [3, 11, 12, 15], "store": [4, 9, 16], "straightforward": [12, 15], "strang": 7, "strategi": 15, "stream": 4, "strength": 19, "strengthen": 19, "strict": [4, 16, 17], "strictli": [19, 20], "strike": 11, "string": [0, 4, 6, 9, 17, 21], "stronger": [7, 15, 19], "strongli": [13, 16], "struct": 4, "structur": [3, 4, 7, 9, 12, 14, 15, 17, 18, 19, 20, 21], "stub": 12, "stuck": 15, "studi": 8, "style": 0, "sub": [7, 9, 15], "subclass": [0, 12, 13, 15, 17], "subdirectori": 13, "subgoal": 16, "subject": 17, "sublist": 13, "submodul": 9, "subpackag": 17, "subsect": 15, "subsequ": [0, 2, 12, 15, 17], "subset": [4, 9, 11, 13, 15, 17, 20, 21], "subseteq": 15, "subsetof": 17, "substitut": [3, 9, 20], "subtract": [17, 19], "succ": 12, "succe": [1, 3, 6, 9], "success": [3, 11], "successfulli": [4, 9, 15, 21], "sudo": 9, "suffic": 9, "suffix": [15, 16], "sugar": [11, 15, 17], "suggest": [9, 14, 15], "suit": 9, "sum": [7, 12], "sumbigint": 12, "summar": [15, 20], "summari": [5, 9, 12, 13, 16, 21], "super": [12, 17], "superclass": 17, "superflu": 12, "suppli": 21, "support": [3, 7, 8, 9, 11, 13, 15, 16, 17, 20, 21], "suppos": 3, "sure": [4, 9, 17, 20], "surfac": 17, "surprisingli": [15, 21], "suter": 18, "swap": 7, "swen": 18, "symbol": [3, 12, 18, 20], "symmetr": 15, "symmetri": 15, "symposium": 18, "syntact": [11, 15, 17], "syntax": [3, 4, 7, 11, 17], "synthes": 18, "synthesi": [4, 18], "system": [3, 4, 8, 9, 12, 16, 18], "t": [3, 4, 7, 8, 12, 15, 16, 17, 19], "t1": [4, 17], "t2": 17, "tactic": [1, 13], "tag": [3, 4, 9], "tail": [2, 3, 5, 13, 14, 19, 20], "tailopt": 6, "take": [0, 4, 6, 7, 9, 12, 13, 15, 16, 17, 19, 20], "taken": [7, 17], "takewhil": 13, "talk": [7, 18, 19], "target": [4, 9], "tautologi": 15, "technic": 7, "techniqu": [3, 8, 18], "tell": [7, 15, 19, 21], "templat": 16, "tend": 19, "term": [3, 9, 15, 17], "termin": [7, 8, 9, 17], "test": [1, 3, 6, 8, 12, 13, 15, 17, 19], "test1": [7, 19], "test2": [7, 19], "test3": 19, "test4": 19, "testcas": [15, 17], "testgen": 16, "testmax": 19, "testonli": 9, "text": 9, "texttt": 0, "than": [3, 9, 11, 13, 15, 16, 17, 19, 20], "thank": [1, 11, 15], "thei": [3, 4, 7, 9, 11, 12, 13, 15, 17, 19, 20], "them": [0, 3, 7, 11, 12, 13, 15, 17, 19], "themap": 21, "themselv": 20, "theorem": [0, 3, 8, 11, 17, 20], "theoret": 15, "theori": [13, 15], "therefor": [4, 11, 15], "thesi": [4, 7], "thi": [0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21], "thing": [12, 15], "third": [12, 19], "those": [4, 11, 12, 15, 16, 17, 19], "though": [3, 9, 11, 15, 19], "three": [2, 7, 15, 17, 19], "through": [0, 9, 11, 12, 13, 15, 16, 19], "throughout": 2, "thu": [0, 4, 9, 11, 12, 13, 14, 15, 19, 20, 21], "thumb": 15, "time": [0, 2, 4, 5, 9, 11, 12, 14, 15, 16, 17, 19, 21], "timeout": [2, 9, 11, 15, 16, 20], "timer": 16, "tl": 17, "tmp": 1, "tn": 4, "tobia": 18, "tobyt": 17, "togeth": [12, 13, 20], "toint": [4, 17], "token": 4, "tolong": 17, "too": [7, 9, 20], "tool": [5, 8, 18, 19, 20], "toolkit": 9, "top": [4, 7, 8, 9, 11, 12, 13, 15, 17], "tosend": 0, "toshort": 17, "tosign": 17, "total": [5, 9, 12, 14, 16, 21], "tounsign": 17, "trait": [8, 12], "transform": [4, 7, 11, 13, 16, 17], "transit": [15, 16], "translat": [3, 8, 11, 16, 18], "transpar": 9, "travers": 16, "treat": [2, 7, 13, 17, 21], "treatment": [7, 16], "tree": [3, 4, 7, 9, 12, 13, 16], "tri": 15, "triemap": 8, "triemapwrapp": 21, "trigger": 4, "tripl": 7, "trivial": [3, 5, 8, 9], "troubl": 15, "true": [0, 1, 2, 4, 5, 6, 7, 9, 12, 13, 14, 15, 16, 17, 19, 20], "truncat": 17, "truth": 17, "try": [3, 5, 7, 9, 11, 12, 13, 14, 15, 16, 19], "tupl": 17, "tuple2": 17, "tuplen": 4, "ture": 20, "turn": [12, 15, 20], "tutori": [8, 11], "twice": 21, "two": [0, 3, 4, 7, 9, 12, 13, 15, 16, 17, 19, 21], "txt": 16, "type": [0, 1, 3, 6, 8, 9, 11, 12, 13, 14, 15, 16, 18, 19, 20, 21], "typeclass": 8, "typedef": 4, "typer": 16, "typesaf": 9, "typic": [3, 4, 9, 15, 17, 19, 20], "u": [5, 15, 19, 20, 21], "ub": 9, "ubuntu": 9, "uint12": 17, "uint16": 4, "uint16_t": 4, "uint2": 17, "uint32": [4, 17], "uint32_t": 4, "uint4": 17, "uint64": 4, "uint64_t": 4, "uint8": [4, 17], "uint8_t": 4, "uinti": 17, "uintx": 17, "uiowa": 17, "unabl": [11, 15], "unaffect": 7, "unambigu": 12, "unappli": [4, 17], "unari": 4, "unbound": [3, 14, 19], "undecid": 20, "under": [3, 4, 8, 9, 11, 15, 19], "underflow": 16, "undergradu": 3, "underli": [0, 2, 7, 15, 16, 17], "understand": [11, 13, 15], "understood": [13, 17], "unfold": [13, 15, 16, 19], "unfortun": [15, 21], "unifi": 15, "unintend": 16, "union": [4, 17], "uniqu": [4, 7, 11, 13], "unit": [0, 4, 6, 7, 13, 15, 21], "univers": [3, 9, 15], "unknown": [2, 5, 9, 11, 12, 15, 16, 21], "unless": [15, 17], "unlik": 17, "unopt": 13, "unoptcas": 13, "unreach": 7, "unrol": [15, 20], "unrollz3": 16, "unsat": 16, "unsealedtrait": 7, "unsign": [4, 17], "unstabl": 16, "unsupport": 17, "until": [2, 11, 15], "untouch": 7, "unus": 9, "unverifi": 13, "unzip": 9, "up": [3, 8, 9, 13, 16, 21], "updat": [0, 7, 9, 17, 20, 21], "updatea": 7, "updatearrai": 7, "upon": [0, 16], "url": 16, "us": [0, 1, 2, 4, 5, 7, 8, 11, 12, 13, 14, 17, 18, 20, 21], "usag": [4, 8], "user": [4, 7, 9, 11, 12, 13, 15, 16, 20, 21], "usr": 9, "usual": [4, 7, 11, 12, 17, 19], "ut": 7, "util": [6, 16], "v": [1, 13, 17, 21], "val": [0, 4, 5, 6, 7, 9, 12, 15, 17, 19, 20, 21], "valensur": 20, "valid": [4, 5, 7, 9, 11, 12, 15, 16, 17, 20, 21], "validref": 0, "valu": [0, 4, 6, 7, 12, 13, 14, 15, 16, 19, 20], "value2": 17, "value_": 7, "var": [0, 4, 6, 7], "variabl": [4, 6, 8, 12, 15, 17, 19, 20], "variant": [4, 17, 19], "variou": [9, 12, 15], "vast": 15, "vc": [5, 9, 15, 16, 19, 20], "ve": 15, "verbos": 15, "veri": [9, 11, 12, 19], "verif": [1, 4, 5, 6, 7, 8, 9, 12, 13, 15, 17, 18, 19], "verifi": [0, 3, 4, 6, 7, 8, 9, 11, 13, 14, 15, 17, 18, 19, 20, 21], "versa": 4, "version": [9, 13, 15, 16, 18], "vertic": 9, "via": [5, 7, 9, 12, 16], "vice": 4, "video": 8, "view": [9, 21], "viktor": 18, "violat": [11, 19], "viper": 3, "visibl": [7, 9, 15], "vital": 15, "vmcai": 18, "void": 4, "voirol": 18, "vulner": 3, "vvvvvvvvvvv": 17, "w": [4, 12, 15], "wa": [3, 4, 9, 11, 15, 20], "wadler": 12, "wai": [0, 3, 4, 7, 9, 12, 13, 15, 17, 19, 20], "walk": 16, "want": [0, 9, 12, 15, 17], "warm": 8, "warn": [5, 9, 15, 16, 19, 20], "wasn": 15, "watch": [9, 16], "wb89": 12, "we": [0, 2, 3, 4, 7, 9, 12, 13, 14, 15, 17, 18, 19, 20, 21], "weak": [7, 19], "weaken": 12, "weaker": 15, "web": [9, 19], "weight": 15, "well": [0, 3, 4, 7, 9, 11, 12, 14, 15, 16, 17, 19, 20], "were": [7, 12, 17], "what": [0, 8, 13, 15, 19, 21], "when": [0, 1, 2, 3, 4, 6, 7, 9, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21], "whenev": 20, "whengiven": 0, "where": [3, 4, 6, 7, 9, 11, 14, 15, 16, 17, 19, 20], "wherea": [3, 16, 19], "whether": [2, 3, 7, 13, 15, 16, 20, 21], "which": [0, 1, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 17, 18, 19, 20, 21], "while": [3, 4, 8, 9, 12, 15, 16, 17, 20, 21], "whole": [0, 4, 13, 20], "whose": [4, 6, 12, 13, 19], "why": [3, 11, 15], "widen": 17, "wildcard": 16, "window": 8, "wish": [3, 5, 14, 15, 19], "wit": 20, "within": [7, 12, 13, 16, 17, 20], "without": [4, 12, 13, 15, 16, 17, 20], "word": 0, "work": [0, 3, 7, 8, 9, 11, 12, 13, 15, 16, 17, 19], "workaround": [4, 14], "workflow": 9, "workshop": 18, "world": [6, 12, 17], "worth": 15, "would": [3, 7, 9, 11, 12, 15, 17, 20, 21], "wrap": [3, 7, 12, 19, 21], "wrapper": [4, 8, 9, 12, 16], "write": [3, 4, 12, 14, 15, 17, 19, 20, 21], "writeoncebox": 7, "written": [3, 5, 7, 13, 15], "wrong": [2, 3, 19], "wrote": 15, "wsl2": 9, "www": [9, 13], "x": [2, 4, 5, 6, 7, 9, 12, 13, 15, 17, 19, 20], "x1": [6, 15, 17, 19], "x2": [6, 15, 17, 19], "x3": 17, "x4": 17, "x5": 17, "x6": 17, "x7": 17, "x8": 17, "x9": 17, "x___1": 1, "xmx6g": 9, "xn": 15, "y": [4, 7, 9, 12, 15, 17, 19], "ybrows": 16, "ye": 16, "year": 3, "yet": [9, 12, 15], "yield": 15, "you": [3, 4, 5, 7, 9, 11, 13, 14, 15, 16, 17, 20], "your": [1, 4, 5, 7, 9, 11, 13, 14, 15, 16], "z": [1, 9, 12, 13, 15, 17, 19], "z3": [3, 5, 16, 18, 21], "z3prover": 9, "zero": [12, 19], "zip": [5, 9, 13], "\u03c3": 15}, "titles": ["Case Studies", "Translation from Stainless to Coq", "Equivalence Checking", "FAQ: (Frequently) Asked Questions", "Generating C Code", "Verifying and Compiling Examples", "Ghost Context", "Imperative", "Stainless documentation", "Installing Stainless", "Stainless\u2019 Internals", "Introduction", "Specifying Algebraic Properties", "Stainless Library", "Limitations of Verification", "Proving Theorems", "Specifying Options", "Pure Scala", "References", "Tutorial: Sorting", "Verification conditions", "Working With Existing Code"], "titleterms": {"0": 9, "1": [0, 9], "10": 9, "12": 9, "2": 9, "4": 9, "8": 9, "A": [13, 15, 21], "Being": 19, "For": 4, "Not": 19, "Their": 19, "With": 21, "abstract": [7, 17], "access": 20, "actor": 0, "addit": [13, 15, 16], "adt": 20, "akka": 0, "algebra": [12, 17], "alias": [7, 17], "an": [0, 9], "annot": [6, 7, 13, 20, 21], "anonym": 17, "api": [4, 13], "appli": 3, "approach": 15, "ar": 3, "arrai": [4, 7, 17, 20], "ask": 3, "assert": [15, 17], "associ": 12, "b": 13, "behavior": 0, "between": 20, "bigint": 17, "binari": 9, "bind": 20, "bitvector": 17, "bodi": [17, 20], "book": 18, "boolean": 17, "build": [0, 9], "bytecod": 3, "c": 4, "can": 3, "case": [0, 6, 17], "chang": 16, "check": [2, 6, 15], "choos": 16, "class": [4, 17], "code": [4, 7, 9, 21], "coher": 12, "color": 9, "compar": 3, "compil": [3, 5], "complex": 15, "compon": 16, "condit": [3, 20], "configur": 16, "conquer": 15, "construct": 4, "content": 19, "context": [0, 6], "contract": 21, "control": 15, "convers": 4, "copi": 17, "coq": 1, "correct": 6, "counter": 0, "custom": 4, "cvc5": [9, 16], "data": 17, "decreas": 20, "default": 17, "defin": 19, "definit": 17, "depend": 9, "divid": 15, "document": [8, 9], "doe": 3, "elimin": 6, "emac": 9, "enough": 19, "equival": 2, "error": 14, "evalu": 16, "exampl": [2, 5, 15], "execut": 5, "exhaust": 20, "exist": [9, 21], "export": 4, "express": [6, 17], "extern": [7, 9, 21], "faq": 3, "featur": [4, 16], "file": 16, "frequent": 3, "from": [1, 9], "function": [4, 7, 17, 20], "fuzz": 3, "gener": [4, 9, 16, 17], "ghost": 6, "global": 4, "hof": 15, "hood": 12, "how": 3, "i": [3, 4, 19], "id": 9, "ignor": 4, "illustr": 9, "imper": 7, "implement": [0, 4], "import": 0, "induct": 15, "industri": 3, "inherit": 12, "initi": 17, "inner": 17, "insert": 19, "instal": 9, "int": 17, "intern": 10, "introduct": [6, 11, 12, 15], "invari": [0, 20], "java": 3, "keyword": 7, "level": [4, 16], "librari": [13, 16], "limit": [14, 15], "linux": 9, "list": [13, 16, 19], "local": 17, "loop": [7, 20], "low": 4, "maco": 9, "map": [13, 17], "match": [17, 20], "max": 19, "measur": 15, "member": 17, "memori": 14, "messag": 0, "method": [7, 12, 17, 21], "model": 0, "more": 15, "mutabl": 7, "non": 15, "o": 4, "object": [7, 17], "oper": [4, 13], "option": [1, 9, 16], "other": 3, "out": 14, "overrid": 17, "paper": 18, "paramet": 17, "partialfunct": 13, "pattern": [17, 20], "postcondit": [15, 17, 20], "practic": 15, "precondit": [17, 20], "predefin": 17, "preserv": 0, "program": [3, 4, 7, 11], "project": 9, "proof": 15, "properti": [3, 12, 19], "proposit": 15, "prove": [0, 3, 15], "pure": 17, "puriti": 21, "purpos": 16, "quantifi": 15, "question": 3, "quick": 15, "ration": 15, "real": 17, "reason": 15, "recap": 15, "recommend": 9, "refer": [0, 18], "relat": 15, "releas": 9, "replic": 0, "requir": [1, 3, 4, 9], "return": 7, "run": [0, 2, 9], "rust": 3, "safe": 4, "safeti": 20, "scala": [11, 17], "set": [13, 17], "share": 20, "simpl": 15, "size": [3, 19], "slightli": 15, "smt": 3, "softwar": [3, 11], "solver": [3, 9, 16], "sort": 19, "sourc": 9, "specif": [17, 19, 20], "specifi": [12, 16], "stainless": [1, 3, 8, 9, 10, 11, 13, 16], "standalon": 9, "state": 4, "studi": [0, 6], "support": 4, "system": 0, "t": 13, "techniqu": 15, "termin": [11, 15, 16], "test": [9, 16], "theorem": [13, 15], "tool": 3, "top": 16, "trait": 7, "translat": [1, 4], "triemap": 21, "trivial": 15, "tupl": 4, "tuplex": 17, "tutori": 19, "type": [4, 17], "typeclass": 12, "under": 12, "unrol": 16, "up": 19, "us": [3, 9, 15, 16, 19], "usag": [1, 9], "valu": 17, "variabl": 7, "verif": [3, 11, 14, 16, 20], "verifi": 5, "video": 18, "warm": 19, "what": 3, "which": 16, "while": 7, "window": 9, "within": 9, "work": 21, "wrapper": 21, "z3": 9}})
\ No newline at end of file
diff --git a/static/invalid/AbstractRefinementMap.scala b/static/invalid/AbstractRefinementMap.scala
index d11db628b1..45bae7c9b2 100644
--- a/static/invalid/AbstractRefinementMap.scala
+++ b/static/invalid/AbstractRefinementMap.scala
@@ -12,7 +12,7 @@ object AbstractRefinementMap {
     def apply(x: A): B = {
       require(f.pre(x))
       f(x)
-    } ensuring(ens)
+   }.ensuring(ens)
   }
 
   def map[A, B](l: List[A], f: A ~> B): List[B] = {
@@ -21,6 +21,6 @@ object AbstractRefinementMap {
       case Cons(x, xs) => Cons[B](f(x), map(xs, f))
       case Nil() => Nil[B]()
     }
-  } ensuring { res => forall((x: B) => res.contains(x) ==> f.ens(x)) }
+ }.ensuring { res => forall((x: B) => res.contains(x) ==> f.ens(x)) }
 }
 
diff --git a/static/invalid/BadConcRope.scala b/static/invalid/BadConcRope.scala
index dfff26ec5b..e050ac93bc 100644
--- a/static/invalid/BadConcRope.scala
+++ b/static/invalid/BadConcRope.scala
@@ -84,7 +84,7 @@ object BadConcRope {
         case Append(l, r) =>
           1 + max(l.level, r.level)
       }): BigInt
-    } ensuring (_ >= 0)
+   }.ensuring(_ >= 0)
 
     val size: BigInt = {
       (this match {
@@ -95,7 +95,7 @@ object BadConcRope {
         case Append(l, r) =>
           l.size + r.size
       }): BigInt
-    } ensuring (_ >= 0)
+   }.ensuring(_ >= 0)
 
     def toList: List[T] = {
       this match {
@@ -106,7 +106,7 @@ object BadConcRope {
         case Append(l, r) =>
           l.toList ++ r.toList
       }
-    } ensuring (res => res.size == this.size)
+   }.ensuring(res => res.size == this.size)
   }
 
   case class Empty[T]() extends Conc[T]
@@ -125,7 +125,7 @@ object BadConcRope {
         if (i < l.size) lookup(l, i)
         else lookup(r, i - l.size)
     }
-  } ensuring (res =>  instAppendIndexAxiom(xs, i) &&  // an auxiliary axiom instantiation that required for the proof
+ }.ensuring(res =>  instAppendIndexAxiom(xs, i) &&  // an auxiliary axiom instantiation that required for the proof
     res == xs.toList(i)) // correctness
 
 
@@ -150,7 +150,7 @@ object BadConcRope {
       case Append(l, r) =>
         Append(update(l, i, y), r)
     }
-  } ensuring (res => instAppendUpdateAxiom(xs, i, y) && // an auxiliary axiom instantiation
+ }.ensuring(res => instAppendUpdateAxiom(xs, i, y) && // an auxiliary axiom instantiation
     res.level == xs.level && // heights of the input and output trees are equal
     res.valid && // tree invariants are preserved
     res.toList == xs.toList.updated(i, y) && // correctness
@@ -188,7 +188,7 @@ object BadConcRope {
       case _ =>
         concatNonEmpty(xs, ys)
     }
-  } ensuring (res => res.valid && // tree invariants
+ }.ensuring(res => res.valid && // tree invariants
     res.level <= max(xs.level, ys.level) + 1 && // height invariants
     res.level >= max(xs.level, ys.level) &&
     (res.toList == xs.toList ++ ys.toList) && // correctness
@@ -239,7 +239,7 @@ object BadConcRope {
           }
       }
     }
-  } ensuring (res =>
+ }.ensuring(res =>
     appendAssocInst(xs, ys) && // instantiation of an axiom
     res.level <= max(xs.level, ys.level) + 1 && // height invariants
     res.level >= max(xs.level, ys.level) &&
@@ -291,7 +291,7 @@ object BadConcRope {
       case CC(l, r) =>
        concatNonEmpty(l, insert(r, i - l.size, y))
     }
-  } ensuring (res => insertAppendAxiomInst(xs, i, y) && // instantiation of an axiom
+ }.ensuring(res => insertAppendAxiomInst(xs, i, y) && // instantiation of an axiom
     res.valid && res.isNormalized && // tree invariants
     res.level - xs.level <= 1 && res.level >= xs.level && // height of the output tree is at most 1 greater than that of the input tree
     res.toList == insertAtIndex(xs.toList, i, y) // correctness
@@ -356,7 +356,7 @@ object BadConcRope {
           (l, r)
         }
     }
-  } ensuring (res  => instSplitAxiom(xs, n) && // instantiation of an axiom
+ }.ensuring(res  => instSplitAxiom(xs, n) && // instantiation of an axiom
     res._1.valid && res._2.valid && // tree invariants are preserved
     res._1.isNormalized && res._2.isNormalized &&
     xs.level >= res._1.level && xs.level >= res._2.level && // height bounds of the resulting tree
@@ -382,7 +382,7 @@ object BadConcRope {
       case Empty() => ys
       case Single(_) => CC(xs, ys)
     }
-  } ensuring (res => res.valid && //conctree invariants
+ }.ensuring(res => res.valid && //conctree invariants
     res.toList == xs.toList ++ Cons(x, Nil[T]()) && //correctness
     res.level <= xs.level + 1
   )
@@ -408,7 +408,7 @@ object BadConcRope {
           Append(l, zs)
       }
     }
-  } ensuring (res => appendAssocInst2(xs, ys) &&
+ }.ensuring(res => appendAssocInst2(xs, ys) &&
     res.valid && //conc tree invariants
     res.toList == xs.toList ++ ys.toList && //correctness invariants
     res.level <= xs.level + 1 )
@@ -428,7 +428,7 @@ object BadConcRope {
       case Append(l, r) => numTrees(l) + 1
       case _ => BigInt(1)
     }
-  } ensuring (res => res >= 0)
+ }.ensuring(res => res >= 0)
 
   def normalize[T](t: Conc[T]): Conc[T] = {
     require(t.valid)
@@ -439,7 +439,7 @@ object BadConcRope {
         concatNormalized(l, r)
       case _ => t
     }
-  } ensuring (res => res.valid &&
+ }.ensuring(res => res.valid &&
     res.isNormalized &&
     res.toList == t.toList && //correctness
     res.size == t.size && res.level <= t.level //normalize preserves level and size
@@ -454,7 +454,7 @@ object BadConcRope {
       case l =>
         concatNormalized(l, nr)
     }
-  } ensuring (res =>
+ }.ensuring(res =>
     appendAssocInst2(xs, ys) && //some lemma instantiations
     res.valid &&
     res.isNormalized &&
diff --git a/static/invalid/BraunTree.scala b/static/invalid/BraunTree.scala
index 7733dcd0ec..a2986c5d42 100644
--- a/static/invalid/BraunTree.scala
+++ b/static/invalid/BraunTree.scala
@@ -14,7 +14,7 @@ object BraunTree {
         Node(value, insert(left, x), right)
       case Leaf() => Node(x, Leaf(), Leaf())
     }
-  } ensuring { res => isBraun(res) }
+ }.ensuring { res => isBraun(res) }
 
   def height(tree: Tree): Int = {
     tree match {
diff --git a/static/invalid/Choose.scala b/static/invalid/Choose.scala
index 7508725001..8bb0bb0726 100644
--- a/static/invalid/Choose.scala
+++ b/static/invalid/Choose.scala
@@ -11,7 +11,7 @@ object Choose1 {
     def size(l: List) : BigInt = (l match {
         case Nil() => BigInt(0)
         case Cons(_, t) => 1 + size(t)
-    }) ensuring(res => res >= 0)
+    }).ensuring(res => res >= 0)
 
     def content(l: List) : Set[Int] = l match {
       case Nil() => Set.empty[Int]
@@ -26,7 +26,7 @@ object Choose1 {
       } else {
         choose[List] { (res: List) => size(res) == i-1 }
       }
-    } ensuring ( size(_) == i )
+   }.ensuring( size(_) == i )
 
 
     def listOfSize2(i: BigInt): List = {
@@ -37,5 +37,5 @@ object Choose1 {
       } else {
         Nil()
       }
-    } ensuring ( size(_) == i )
+   }.ensuring( size(_) == i )
 }
diff --git a/static/invalid/InsertionSort.scala b/static/invalid/InsertionSort.scala
index 98aa2325d1..d54d68943e 100644
--- a/static/invalid/InsertionSort.scala
+++ b/static/invalid/InsertionSort.scala
@@ -15,7 +15,7 @@ object InsertionSort {
   def size(l : List) : BigInt = (l match {
     case Nil() => BigInt(0)
     case Cons(_, xs) => 1 + size(xs)
-  }) ensuring(_ >= 0)
+  }).ensuring(_ >= 0)
 
   def contents(l: List): Set[Int] = l match {
     case Nil() => Set.empty
@@ -36,7 +36,7 @@ object InsertionSort {
       case Nil() => Cons(e,Nil())
       case Cons(x,xs) => if (x <= e) Cons(x,buggySortedIns(e, xs)) else Cons(e, l)
     } 
-  } ensuring(res => contents(res) == contents(l) ++ Set(e) 
+ }.ensuring(res => contents(res) == contents(l) ++ Set(e) 
                     && isSorted(res)
                     && size(res) == size(l) + 1
             )
diff --git a/static/invalid/ListOperations.scala b/static/invalid/ListOperations.scala
index 7ba835b52d..76a1601293 100644
--- a/static/invalid/ListOperations.scala
+++ b/static/invalid/ListOperations.scala
@@ -18,12 +18,12 @@ object ListOperations {
     def size(l: List) : BigInt = (l match {
         case Nil() => BigInt(0)
         case Cons(_, t) => 1 + size(t)
-    }) ensuring(res => res >= 0)
+    }).ensuring(res => res >= 0)
 
     def iplSize(l: IntPairList) : BigInt = (l match {
       case IPNil() => BigInt(0)
       case IPCons(_, xs) => 1 + iplSize(xs)
-    }) ensuring(_ >= 0)
+    }).ensuring(_ >= 0)
 
     def zip(l1: List, l2: List) : IntPairList = {
       // try to uncomment this and see how pattern-matching becomes exhaustive
@@ -35,7 +35,7 @@ object ListOperations {
           case Cons(y, ys) => IPCons(IP(x, y), zip(xs, ys))
         }
       }
-    } ensuring(iplSize(_) == size(l1))
+   }.ensuring(iplSize(_) == size(l1))
 
     def sizeTailRec(l: List) : BigInt = sizeTailRecAcc(l, 0)
     def sizeTailRecAcc(l: List, acc: BigInt) : BigInt = {
@@ -44,7 +44,7 @@ object ListOperations {
        case Nil() => acc
        case Cons(_, xs) => sizeTailRecAcc(xs, acc+1)
      }
-    } ensuring(res => res == size(l) + acc)
+   }.ensuring(res => res == size(l) + acc)
 
     def sizesAreEquiv(l: List) : Boolean = {
       size(l) == sizeTailRec(l)
@@ -62,18 +62,18 @@ object ListOperations {
     def drunk(l : List) : List = (l match {
       case Nil() => Nil()
       case Cons(x,l1) => Cons(x,Cons(x,drunk(l1)))
-    }) ensuring (size(_) == 2 * size(l))
+    }).ensuring (size(_) == 2 * size(l))
 
-    def reverse(l: List) : List = reverse0(l, Nil()) ensuring(content(_) == content(l))
+    def reverse(l: List) : List = reverse0(l, Nil()).ensuring(content(_) == content(l))
     def reverse0(l1: List, l2: List) : List = (l1 match {
       case Nil() => l2
       case Cons(x, xs) => reverse0(xs, Cons(x, l2))
-    }) ensuring(content(_) == content(l1) ++ content(l2))
+    }).ensuring(content(_) == content(l1) ++ content(l2))
 
     def append(l1 : List, l2 : List) : List = (l1 match {
       case Nil() => l2
       case Cons(x,xs) => Cons(x, append(xs, l2))
-    }) ensuring(content(_) == content(l1) ++ content(l2))
+    }).ensuring(content(_) == content(l1) ++ content(l2))
 
     @induct
     def nilAppend(l : List) : Boolean = (append(l, Nil()) == l).holds
@@ -92,7 +92,7 @@ object ListOperations {
 
     @induct
     def concat(l1: List, l2: List) : List =
-      concat0(l1, l2, Nil()) ensuring(content(_) == content(l1) ++ content(l2))
+      concat0(l1, l2, Nil()).ensuring(content(_) == content(l1) ++ content(l2))
 
     @induct
     def concat0(l1: List, l2: List, l3: List) : List = (l1 match {
@@ -103,5 +103,5 @@ object ListOperations {
         }
       }
       case Cons(x, xs) => concat0(xs, l2, Cons(x, l3))
-    }) ensuring(content(_) == content(l1) ++ content(l2) ++ content(l3))
+    }).ensuring(content(_) == content(l1) ++ content(l2) ++ content(l3))
 }
diff --git a/static/invalid/Mean.scala b/static/invalid/Mean.scala
index c79ad49794..282386cbe4 100644
--- a/static/invalid/Mean.scala
+++ b/static/invalid/Mean.scala
@@ -8,6 +8,6 @@ object Mean {
   def meanOverflow(x: Int, y: Int): Int = {
     require(x <= y && x >= 0 && y >= 0)
     (x + y)/2
-  } ensuring(m => m >= x && m <= y)
+ }.ensuring(m => m >= x && m <= y)
 
 }
diff --git a/static/invalid/PropositionalLogic.scala b/static/invalid/PropositionalLogic.scala
index 654a28d303..450778ee85 100644
--- a/static/invalid/PropositionalLogic.scala
+++ b/static/invalid/PropositionalLogic.scala
@@ -15,7 +15,7 @@ object PropositionalLogic {
   def simplify(f: Formula): Formula = (f match {
     case Implies(lhs, rhs) => Or(Not(simplify(lhs)), simplify(rhs))
     case _ => f
-  }) ensuring(isSimplified(_))
+  }).ensuring(isSimplified(_))
 
   def isSimplified(f: Formula): Boolean = f match {
     case And(lhs, rhs) => isSimplified(lhs) && isSimplified(rhs)
diff --git a/static/invalid/RedBlackTree2.scala b/static/invalid/RedBlackTree2.scala
index 6fc4b6cf74..0afb0fc766 100644
--- a/static/invalid/RedBlackTree2.scala
+++ b/static/invalid/RedBlackTree2.scala
@@ -24,7 +24,7 @@ object RedBlackTree2 {
   def size(t: Tree) : BigInt = (t match {
     case Empty() => BigInt(0)
     case Node(_, l, v, r) => size(l) + 1 + size(r)
-  }) ensuring(_ >= 0)
+  }).ensuring(_ >= 0)
 
   def isBlack(t: Tree) : Boolean = t match {
     case Empty() => true
@@ -63,7 +63,7 @@ object RedBlackTree2 {
         else if (x == y) Node(c,a,y,b)
         else             balance(c,a,y,ins(x, b))
     }
-  } ensuring (res => content(res) == content(t) ++ Set(x) 
+ }.ensuring(res => content(res) == content(t) ++ Set(x) 
                    && size(t) <= size(res) && size(res) <= size(t) + 1
                    && redDescHaveBlackChildren(res)
                    && blackBalanced(res))
@@ -80,10 +80,10 @@ object RedBlackTree2 {
         Node(Red(),Node(Black(),a,xV,b),yV,Node(Black(),c,zV,d))
       case Node(c,a,xV,b) => Node(c,a,xV,b)
     }
-  } ensuring (res => content(res) == content(Node(c,a,x,b)))// && redDescHaveBlackChildren(res))
+ }.ensuring(res => content(res) == content(Node(c,a,x,b)))// && redDescHaveBlackChildren(res))
 
   def buggyAdd(x: Int, t: Tree): Tree = {
     require(redNodesHaveBlackChildren(t))
     ins(x, t)
-  } ensuring (res => content(res) == content(t) ++ Set(x) && redNodesHaveBlackChildren(res))
+ }.ensuring(res => content(res) == content(t) ++ Set(x) && redNodesHaveBlackChildren(res))
 }
diff --git a/static/invalid/SpecWithExtern.scala b/static/invalid/SpecWithExtern.scala
index 4480b715f1..f5884cf7f4 100644
--- a/static/invalid/SpecWithExtern.scala
+++ b/static/invalid/SpecWithExtern.scala
@@ -11,12 +11,12 @@ object SpecWithExtern {
   def randomBetween(l: Int, h: Int): Int = {
     require(l <= h)
     l
-  } ensuring(res => (res >= l && res <= h))
+ }.ensuring(res => (res >= l && res <= h))
 
   //postcondition is wrong, but if stainless considers 
   //actual body of randomBetween it would be correct
   def wrongProp(): Int = {
     randomBetween(0, 10)
-  } ensuring(res => res >= 0 && res < 10)
+ }.ensuring(res => res >= 0 && res < 10)
 
 }
diff --git a/static/valid/AbstractRefinementMap.scala b/static/valid/AbstractRefinementMap.scala
index 48cb2ec848..3299b699e9 100644
--- a/static/valid/AbstractRefinementMap.scala
+++ b/static/valid/AbstractRefinementMap.scala
@@ -12,7 +12,7 @@ object AbstractRefinementMap {
     def apply(x: A): B = {
       require(f.pre(x))
       f(x)
-    } ensuring(ens)
+   }.ensuring(ens)
   }
 
   def map[A, B](l: List[A], f: A ~> B): List[B] = {
@@ -21,6 +21,6 @@ object AbstractRefinementMap {
       case Cons(x, xs) => Cons[B](f(x), map(xs, f))
       case Nil() => Nil[B]()
     }
-  } ensuring { res => forall((x: B) => res.contains(x) ==> f.ens(x)) }
+ }.ensuring { res => forall((x: B) => res.contains(x) ==> f.ens(x)) }
 }
 
diff --git a/static/valid/AddingPositiveNumbers.scala b/static/valid/AddingPositiveNumbers.scala
index 84fca5dc63..5452a5811b 100644
--- a/static/valid/AddingPositiveNumbers.scala
+++ b/static/valid/AddingPositiveNumbers.scala
@@ -6,6 +6,6 @@ object AddingPositiveNumbers {
   def additionSound(x: BigInt, y: BigInt): BigInt = {
     require(x >= 0 && y >= 0)
     x + y
-  } ensuring(_ >= 0)
+ }.ensuring(_ >= 0)
 
 }
diff --git a/static/valid/AssociativeList.scala b/static/valid/AssociativeList.scala
index 45ac711a12..0ac55c0d90 100644
--- a/static/valid/AssociativeList.scala
+++ b/static/valid/AssociativeList.scala
@@ -33,14 +33,14 @@ object AssociativeList {
   def updateAll(l1: List, l2: List): List = (l2 match {
     case Nil() => l1
     case Cons(x, xs) => updateAll(updateElem(l1, x), xs)
-  }) ensuring(domain(_) == domain(l1) ++ domain(l2))
+  }).ensuring(domain(_) == domain(l1) ++ domain(l2))
 
   def updateElem(l: List, e: KeyValuePairAbs): List = (l match {
     case Nil() => Cons(e, Nil())
     case Cons(KeyValuePair(k, v), xs) => e match {
       case KeyValuePair(ek, ev) => if (ek == k) Cons(KeyValuePair(ek, ev), xs) else Cons(KeyValuePair(k, v), updateElem(xs, e))
     }
-  }) ensuring(res => e match {
+  }).ensuring(res => e match {
     case KeyValuePair(k, v) => domain(res) == domain(l) ++ Set[Int](k)
   })
 
diff --git a/static/valid/BinarySearchTreeQuant.scala b/static/valid/BinarySearchTreeQuant.scala
index 36f80d7d8b..638b3652cd 100644
--- a/static/valid/BinarySearchTreeQuant.scala
+++ b/static/valid/BinarySearchTreeQuant.scala
@@ -36,9 +36,9 @@ object BSTSimpler {
         Node(l, v, r)
       })
     }
-  } ensuring(res => isBST(res) && content(res) == content(tree) ++ Set(value))
+ }.ensuring(res => isBST(res) && content(res) == content(tree) ++ Set(value))
 
   def createRoot(v: BigInt): Node = {
     Node(Leaf(), v, Leaf())
-  } ensuring (content(_) == Set(v))
+ }.ensuring(content(_) == Set(v))
 }
diff --git a/static/valid/ChooseWithWitness.scala b/static/valid/ChooseWithWitness.scala
index 3d6c1c1d31..57df8db6bd 100644
--- a/static/valid/ChooseWithWitness.scala
+++ b/static/valid/ChooseWithWitness.scala
@@ -11,7 +11,7 @@ object ChooseWithWitness {
     def size(l: List) : BigInt = (l match {
         case Nil() => BigInt(0)
         case Cons(_, t) => 1 + size(t)
-    }) ensuring(res => res >= 0)
+    }).ensuring(res => res >= 0)
 
     def content(l: List) : Set[Int] = l match {
       case Nil() => Set.empty[Int]
@@ -26,7 +26,7 @@ object ChooseWithWitness {
       } else {
         Cons(0, createListOfSize(i - 1))
       }
-    } ensuring ( size(_) == i )
+   }.ensuring( size(_) == i )
 
     def listOfSize(i: BigInt): List = {
       require(i >= 0)
@@ -37,7 +37,7 @@ object ChooseWithWitness {
         assert(size(createListOfSize(i)) == i) // provides choose quantification with a matcher
         choose[List] { (res: List) => size(res) == i }
       }
-    } ensuring ( size(_) == i )
+   }.ensuring( size(_) == i )
 
     def listOfSize2(i: BigInt): List = {
       require(i >= 0)
@@ -47,5 +47,5 @@ object ChooseWithWitness {
       } else {
         Nil()
       }
-    } ensuring ( size(_) == i )
+   }.ensuring( size(_) == i )
 }
diff --git a/static/valid/ConcRope.scala b/static/valid/ConcRope.scala
index 932bd11494..79606df433 100644
--- a/static/valid/ConcRope.scala
+++ b/static/valid/ConcRope.scala
@@ -84,7 +84,7 @@ object ConcRope {
         case Append(l, r) =>
           1 + max(l.level, r.level)
       }): BigInt
-    } ensuring (_ >= 0)
+   }.ensuring(_ >= 0)
 
     val size: BigInt = {
       (this match {
@@ -95,7 +95,7 @@ object ConcRope {
         case Append(l, r) =>
           l.size + r.size
       }): BigInt
-    } ensuring (_ >= 0)
+   }.ensuring(_ >= 0)
 
     def toList: List[T] = {
       this match {
@@ -106,7 +106,7 @@ object ConcRope {
         case Append(l, r) =>
           l.toList ++ r.toList
       }
-    } ensuring (res => res.size == this.size)
+   }.ensuring(res => res.size == this.size)
   }
 
   case class Empty[T]() extends Conc[T]
@@ -125,7 +125,7 @@ object ConcRope {
         if (i < l.size) lookup(l, i)
         else lookup(r, i - l.size)          
     }
-  } ensuring (res =>  instAppendIndexAxiom(xs, i) &&  // an auxiliary axiom instantiation that required for the proof
+ }.ensuring(res =>  instAppendIndexAxiom(xs, i) &&  // an auxiliary axiom instantiation that required for the proof
     res == xs.toList(i)) // correctness
     
 
@@ -153,7 +153,7 @@ object ConcRope {
         } else         
           Append(l, update(r, i - l.size, y))
     }
-  } ensuring (res => instAppendUpdateAxiom(xs, i, y) && // an auxiliary axiom instantiation
+ }.ensuring(res => instAppendUpdateAxiom(xs, i, y) && // an auxiliary axiom instantiation
     res.level == xs.level && // heights of the input and output trees are equal
     res.valid && // tree invariants are preserved    
     res.toList == xs.toList.updated(i, y) && // correctness
@@ -191,7 +191,7 @@ object ConcRope {
       case _ =>
         concatNonEmpty(xs, ys)
     }
-  } ensuring (res => res.valid && // tree invariants
+ }.ensuring(res => res.valid && // tree invariants
     res.level <= max(xs.level, ys.level) + 1 && // height invariants
     res.level >= max(xs.level, ys.level) &&
     (res.toList == xs.toList ++ ys.toList) && // correctness
@@ -242,7 +242,7 @@ object ConcRope {
           }
       }
     }
-  } ensuring (res =>  
+ }.ensuring(res =>  
     appendAssocInst(xs, ys) && // instantiation of an axiom
     res.level <= max(xs.level, ys.level) + 1 && // height invariants
     res.level >= max(xs.level, ys.level) &&
@@ -294,7 +294,7 @@ object ConcRope {
       case CC(l, r) =>
        concatNonEmpty(l, insert(r, i - l.size, y))      
     }
-  } ensuring (res => insertAppendAxiomInst(xs, i, y) && // instantiation of an axiom 
+ }.ensuring(res => insertAppendAxiomInst(xs, i, y) && // instantiation of an axiom 
     res.valid && res.isNormalized && // tree invariants            
     res.level - xs.level <= 1 && res.level >= xs.level && // height of the output tree is at most 1 greater than that of the input tree    
     res.toList == insertAtIndex(xs.toList, i, y) // correctness    
@@ -359,7 +359,7 @@ object ConcRope {
           (l, r)
         }
     }
-  } ensuring (res  => instSplitAxiom(xs, n) && // instantiation of an axiom     
+ }.ensuring(res  => instSplitAxiom(xs, n) && // instantiation of an axiom     
     res._1.valid && res._2.valid && // tree invariants are preserved
     res._1.isNormalized && res._2.isNormalized &&
     xs.level >= res._1.level && xs.level >= res._2.level && // height bounds of the resulting tree
@@ -385,7 +385,7 @@ object ConcRope {
       case Empty() => ys
       case Single(_) => CC(xs, ys)
     }
-  } ensuring (res => res.valid && //conctree invariants
+ }.ensuring(res => res.valid && //conctree invariants
     res.toList == xs.toList ++ Cons(x, Nil[T]()) && //correctness
     res.level <= xs.level + 1 
   )
@@ -411,7 +411,7 @@ object ConcRope {
           Append(l, zs)
       }
     }
-  } ensuring (res => appendAssocInst2(xs, ys) && 
+ }.ensuring(res => appendAssocInst2(xs, ys) && 
     res.valid && //conc tree invariants
     res.toList == xs.toList ++ ys.toList && //correctness invariants
     res.level <= xs.level + 1 )
@@ -431,7 +431,7 @@ object ConcRope {
       case Append(l, r) => numTrees(l) + 1
       case _ => BigInt(1)
     }
-  } ensuring (res => res >= 0)
+ }.ensuring(res => res >= 0)
 
   def normalize[T](t: Conc[T]): Conc[T] = {
     require(t.valid)
@@ -442,7 +442,7 @@ object ConcRope {
         concatNormalized(l, r)
       case _ => t
     }
-  } ensuring (res => res.valid &&
+ }.ensuring(res => res.valid &&
     res.isNormalized &&
     res.toList == t.toList && //correctness
     res.size == t.size && res.level <= t.level //normalize preserves level and size  
@@ -457,7 +457,7 @@ object ConcRope {
       case l =>
         concatNormalized(l, nr)        
     }
-  } ensuring (res => 
+ }.ensuring(res => 
     appendAssocInst2(xs, ys) && //some lemma instantiations   
     res.valid &&
     res.isNormalized &&
diff --git a/static/valid/Formulas.scala b/static/valid/Formulas.scala
index a5a350d827..4c011e4373 100644
--- a/static/valid/Formulas.scala
+++ b/static/valid/Formulas.scala
@@ -45,7 +45,7 @@ object Formulas {
       case Not(e) => Not(desugar(e))
       case e => e
     }
-  } ensuring { out =>
+ }.ensuring { out =>
     !existsImplies(out) &&
     !exists(out, f => f.isInstanceOf[Implies])
   }
diff --git a/static/valid/FunctionCaching.scala b/static/valid/FunctionCaching.scala
index 5e0984b3aa..3d089e4599 100644
--- a/static/valid/FunctionCaching.scala
+++ b/static/valid/FunctionCaching.scala
@@ -14,7 +14,7 @@ object FunctionCaching {
       case Some(cached) =>
         cached
     }
-  } ensuring(res => old(funCache).cached.get(x) match {
+ }.ensuring(res => old(funCache).cached.get(x) match {
     case None() => true
     case Some(v) => v == res
   })
@@ -35,6 +35,6 @@ object FunctionCaching {
         fun(y)
         multipleCalls(ys, x)
     }
-  } ensuring(_ => funCache.cached.get(x).forall(_ == 2*x + 42))
+ }.ensuring(_ => funCache.cached.get(x).forall(_ == 2*x + 42))
 
 }
diff --git a/static/valid/Heaps.scala b/static/valid/Heaps.scala
index b16418adb3..5f65056b88 100644
--- a/static/valid/Heaps.scala
+++ b/static/valid/Heaps.scala
@@ -36,7 +36,7 @@ object Heaps {
   private def reverse0(h : Heap, acc : Heap) : Heap = (h match {
     case Empty => acc
     case Nodes(n, ns) => reverse0(ns, Nodes(n, acc))
-  }) ensuring(res => heapContent(res) == heapContent(h) ++ heapContent(acc))
+  }).ensuring(res => heapContent(res) == heapContent(h) ++ heapContent(acc))
   
   private def link(t1 : Node, t2 : Node) = (t1, t2) match {
     case (Node(r, e1, ns1), Node(_, e2, ns2)) =>
@@ -55,7 +55,7 @@ object Heaps {
       } else {
         insertNode(link(t, t2), h2)
       }
-  }) ensuring(res => heapContent(res) == nodeContent(t) ++ heapContent(h))
+  }).ensuring(res => heapContent(res) == nodeContent(t) ++ heapContent(h))
   
   private def getMin(h : Heap) : (Node, Heap) = {
     require(h != Empty)
@@ -69,7 +69,7 @@ object Heaps {
           (t0, Nodes(t, ts0))
         }
     }
-  } ensuring(_ match {
+ }.ensuring(_ match {
     case (n,h2) => nodeContent(n) ++ heapContent(h2) == heapContent(h)
   })
   
@@ -78,15 +78,15 @@ object Heaps {
   /*~~~~~~~~~~~~~~~~*/
   def empty() : Heap = {
     Empty
-  } ensuring(res => heapContent(res) == Set.empty[Int])
+ }.ensuring(res => heapContent(res) == Set.empty[Int])
   
   def isEmpty(h : Heap) : Boolean = {
     (h == Empty)
-  } ensuring(res => res == (heapContent(h) == Set.empty[Int]))
+ }.ensuring(res => res == (heapContent(h) == Set.empty[Int]))
   
   def insert(e : Int, h : Heap) : Heap = {
     insertNode(Node(0, e, Empty), h)
-  } ensuring(res => heapContent(res) == heapContent(h) ++ Set(e))
+ }.ensuring(res => heapContent(res) == heapContent(h) ++ Set(e))
   
   def merge(h1 : Heap, h2 : Heap) : Heap = ((h1,h2) match {
     case (_, Empty) => h1
@@ -99,7 +99,7 @@ object Heaps {
       } else {
         insertNode(link(t1, t2), merge(ts1, ts2))
       }
-  }) ensuring(res => heapContent(res) == heapContent(h1) ++ heapContent(h2))
+  }).ensuring(res => heapContent(res) == heapContent(h1) ++ heapContent(h2))
   
   def findMin(h : Heap) : OptInt = (h match {
     case Empty => None
@@ -108,7 +108,7 @@ object Heaps {
         case None => Some(e)
         case Some(e2) => Some(if(e < e2) e else e2)
       }
-  }) ensuring(_ match {
+  }).ensuring(_ match {
     case None => isEmpty(h)
     case Some(v) => heapContent(h).contains(v)
   })
@@ -118,7 +118,7 @@ object Heaps {
     case ts : Nodes =>
       val (Node(_, e, ns1), ns2) = getMin(ts)
       merge(reverse(ns1), ns2)
-  }) ensuring(res => heapContent(res).subsetOf(heapContent(h)))
+  }).ensuring(res => heapContent(res).subsetOf(heapContent(h)))
   
   def sanity0() : Boolean = {
     val h0 : Heap = Empty
diff --git a/static/valid/InsertionSort.scala b/static/valid/InsertionSort.scala
index 0acab72588..bed8b1d5fa 100644
--- a/static/valid/InsertionSort.scala
+++ b/static/valid/InsertionSort.scala
@@ -15,7 +15,7 @@ object InsertionSort {
   def size(l : List) : BigInt = (l match {
     case Nil() => BigInt(0)
     case Cons(_, xs) => 1 + size(xs)
-  }) ensuring(_ >= 0)
+  }).ensuring(_ >= 0)
 
   def contents(l: List): Set[Int] = l match {
     case Nil() => Set.empty
@@ -44,7 +44,7 @@ object InsertionSort {
       case Nil() => Cons(e,Nil())
       case Cons(x,xs) => if (x <= e) Cons(x,sortedIns(e, xs)) else Cons(e, l)
     }
-  } ensuring(res => contents(res) == contents(l) ++ Set(e)
+ }.ensuring(res => contents(res) == contents(l) ++ Set(e)
                     && isSorted(res)
                     && size(res) == size(l) + 1
             )
@@ -54,7 +54,7 @@ object InsertionSort {
   def sort(l: List): List = (l match {
     case Nil() => Nil()
     case Cons(x,xs) => sortedIns(x, sort(xs))
-  }) ensuring(res => contents(res) == contents(l)
+  }).ensuring(res => contents(res) == contents(l)
                      && isSorted(res)
                      && size(res) == size(l)
              )
diff --git a/static/valid/ListOperations.scala b/static/valid/ListOperations.scala
index 3a4383cc9b..aafe68ea7e 100644
--- a/static/valid/ListOperations.scala
+++ b/static/valid/ListOperations.scala
@@ -18,12 +18,12 @@ object ListOperations {
     def size(l: List) : BigInt = (l match {
         case Nil() => BigInt(0)
         case Cons(_, t) => 1 + size(t)
-    }) ensuring(res => res >= 0)
+    }).ensuring(res => res >= 0)
 
     def iplSize(l: IntPairList) : BigInt = (l match {
       case IPNil() => BigInt(0)
       case IPCons(_, xs) => 1 + iplSize(xs)
-    }) ensuring(_ >= 0)
+    }).ensuring(_ >= 0)
 
     def zip(l1: List, l2: List) : IntPairList = {
       // try to comment this and see how pattern-matching becomes
@@ -36,7 +36,7 @@ object ListOperations {
           case Cons(y, ys) => IPCons(IP(x, y), zip(xs, ys))
         }
       }
-    } ensuring(iplSize(_) == size(l1))
+   }.ensuring(iplSize(_) == size(l1))
 
     def sizeTailRec(l: List) : BigInt = sizeTailRecAcc(l, 0)
     def sizeTailRecAcc(l: List, acc: BigInt) : BigInt = {
@@ -45,7 +45,7 @@ object ListOperations {
        case Nil() => acc
        case Cons(_, xs) => sizeTailRecAcc(xs, acc+1)
      }
-    } ensuring(res => res == size(l) + acc)
+   }.ensuring(res => res == size(l) + acc)
 
     def sizesAreEquiv(l: List) : Boolean = {
       size(l) == sizeTailRec(l)
@@ -63,18 +63,18 @@ object ListOperations {
     def drunk(l : List) : List = (l match {
       case Nil() => Nil()
       case Cons(x,l1) => Cons(x,Cons(x,drunk(l1)))
-    }) ensuring (size(_) == 2 * size(l))
+    }).ensuring (size(_) == 2 * size(l))
 
-    def reverse(l: List) : List = reverse0(l, Nil()) ensuring(content(_) == content(l))
+    def reverse(l: List) : List = reverse0(l, Nil()).ensuring(content(_) == content(l))
     def reverse0(l1: List, l2: List) : List = (l1 match {
       case Nil() => l2
       case Cons(x, xs) => reverse0(xs, Cons(x, l2))
-    }) ensuring(content(_) == content(l1) ++ content(l2))
+    }).ensuring(content(_) == content(l1) ++ content(l2))
 
     def append(l1 : List, l2 : List) : List = (l1 match {
       case Nil() => l2
       case Cons(x,xs) => Cons(x, append(xs, l2))
-    }) ensuring(content(_) == content(l1) ++ content(l2))
+    }).ensuring(content(_) == content(l1) ++ content(l2))
 
     @induct
     def nilAppend(l : List) : Boolean = (append(l, Nil()) == l).holds
@@ -89,7 +89,7 @@ object ListOperations {
 
     @induct
     def concat(l1: List, l2: List) : List = 
-      concat0(l1, l2, Nil()) ensuring(content(_) == content(l1) ++ content(l2))
+      concat0(l1, l2, Nil()).ensuring(content(_) == content(l1) ++ content(l2))
 
     @induct
     def concat0(l1: List, l2: List, l3: List) : List = (l1 match {
@@ -100,5 +100,5 @@ object ListOperations {
         }
       }
       case Cons(x, xs) => concat0(xs, l2, Cons(x, l3))
-    }) ensuring(content(_) == content(l1) ++ content(l2) ++ content(l3))
+    }).ensuring(content(_) == content(l1) ++ content(l2) ++ content(l3))
 }
diff --git a/static/valid/Mean.scala b/static/valid/Mean.scala
index ec1108f4e5..85b229498c 100644
--- a/static/valid/Mean.scala
+++ b/static/valid/Mean.scala
@@ -8,6 +8,6 @@ object Mean {
   def mean(x: Int, y: Int): Int = {
     require(x <= y && x >= 0 && y >= 0)
     x + (y - x)/2
-  } ensuring(m => m >= x && m <= y)
+ }.ensuring(m => m >= x && m <= y)
 
 }
diff --git a/static/valid/MergeSort.scala b/static/valid/MergeSort.scala
index b4cd205689..dbcdf93a91 100644
--- a/static/valid/MergeSort.scala
+++ b/static/valid/MergeSort.scala
@@ -26,7 +26,7 @@ object MergeSort {
   def size(list : List) : BigInt = (list match {
     case Nil() => BigInt(0)
     case Cons(_, xs) => 1 + size(xs)
-  }) ensuring(_ >= 0)
+  }).ensuring(_ >= 0)
 
   def isSorted(list : List) : Boolean = list match {
     case Nil() => true
@@ -42,7 +42,7 @@ object MergeSort {
 
   def abs(i : BigInt) : BigInt = {
     if(i < 0) -i else i
-  } ensuring(_ >= 0)
+ }.ensuring(_ >= 0)
 
   def mergeSpec(list1 : List, list2 : List, res : List) : Boolean = {
     isSorted(res) && content(res) == content(list1) ++ content(list2)
@@ -61,7 +61,7 @@ object MergeSort {
           Cons(y, mergeFast(list1, ys))
         }
     }
-  } ensuring(res => mergeSpec(list1, list2, res))
+ }.ensuring(res => mergeSpec(list1, list2, res))
 
   def splitSpec(list : List, res : (List,List)) : Boolean = {
     val s1 = size(res._1)
@@ -76,7 +76,7 @@ object MergeSort {
     case Cons(x1, Cons(x2, xs)) =>
       val (s1,s2) = split(xs)
       (Cons(x1, s1), Cons(x2, s2))
-  }) ensuring(res => splitSpec(list, res))
+  }).ensuring(res => splitSpec(list, res))
 
   def sortSpec(in : List, out : List) : Boolean = {
     content(out) == content(in) && isSorted(out)
@@ -94,12 +94,12 @@ object MergeSort {
         val (s1,s2) = split(in)
         mergeFast(weirdSort(size(s1), s1), weirdSort(size(s2), s2))
     }
-  } ensuring(res => sortSpec(in, res))
+ }.ensuring(res => sortSpec(in, res))
 
   def toLList(list : List) : LList = (list match {
     case Nil() => LNil()
     case Cons(x, xs) => LCons(Cons(x, Nil()), toLList(xs))
-  }) ensuring(res => lContent(res) == content(list) && lIsSorted(res))
+  }).ensuring(res => lContent(res) == content(list) && lIsSorted(res))
 
   def mergeMap(llist : LList) : LList = {
     require(lIsSorted(llist))
@@ -109,7 +109,7 @@ object MergeSort {
       case o @ LCons(x, LNil()) => o
       case LCons(x, LCons(y, ys)) => LCons(mergeFast(x, y), mergeMap(ys))
     }
-  } ensuring(res => lContent(res) == lContent(llist) && lIsSorted(res))
+ }.ensuring(res => lContent(res) == lContent(llist) && lIsSorted(res))
 
   def mergeReduce(llist : LList) : List = {
     require(lIsSorted(llist))
@@ -119,9 +119,9 @@ object MergeSort {
       case LCons(x, LNil()) => x
       case _ => mergeReduce(mergeMap(llist))
     }
-  } ensuring(res => content(res) == lContent(llist) && isSorted(res))
+ }.ensuring(res => content(res) == lContent(llist) && isSorted(res))
 
   def mergeSort(in : List) : List = {
     mergeReduce(toLList(in))
-  } ensuring(res => sortSpec(in, res))
+ }.ensuring(res => sortSpec(in, res))
 }
diff --git a/static/valid/PropositionalLogic.scala b/static/valid/PropositionalLogic.scala
index d1a4a4a460..aab240a9b0 100644
--- a/static/valid/PropositionalLogic.scala
+++ b/static/valid/PropositionalLogic.scala
@@ -18,7 +18,7 @@ object PropositionalLogic {
     case Implies(lhs, rhs) => Or(Not(simplify(lhs)), simplify(rhs))
     case Not(f) => Not(simplify(f))
     case Literal(_) => f
-  }) ensuring(isSimplified(_))
+  }).ensuring(isSimplified(_))
 
   def isSimplified(f: Formula): Boolean = f match {
     case And(lhs, rhs) => isSimplified(lhs) && isSimplified(rhs)
@@ -38,7 +38,7 @@ object PropositionalLogic {
     case Not(Not(f)) => nnf(f)
     case Not(Literal(_)) => formula
     case Literal(_) => formula
-  }) ensuring(isNNF(_))
+  }).ensuring(isNNF(_))
 
   def isNNF(f: Formula): Boolean = f match {
     case And(lhs, rhs) => isNNF(lhs) && isNNF(rhs)
diff --git a/static/valid/QuickSort.scala b/static/valid/QuickSort.scala
index 9cd49876e8..46bfd9f4a6 100644
--- a/static/valid/QuickSort.scala
+++ b/static/valid/QuickSort.scala
@@ -17,7 +17,7 @@ object QuickSort {
       case Nil() => l2
       case Cons(x, xs) => Cons(x, appendSorted(xs, l2))
     }
-  } ensuring { res =>
+ }.ensuring { res =>
     isSorted(res) &&
     res.content == l1.content ++ l2.content
   }
@@ -28,7 +28,7 @@ object QuickSort {
       case Nil() => Nil[BigInt]()
       case Cons(x, xs) => par(x, Nil(), Nil(), xs)
     }
-  } ensuring { res =>
+ }.ensuring { res =>
     isSorted(res) &&
     res.content == list.content
   }
@@ -44,7 +44,7 @@ object QuickSort {
       case Nil() => appendSorted(quickSort(l), Cons(x, quickSort(r)))
       case Cons(x2, xs2) => if (x2 <= x) par(x, Cons(x2, l), r, xs2) else par(x, l, Cons(x2, r), xs2)
     }
-  } ensuring { res =>
+ }.ensuring { res =>
     isSorted(res) &&
     res.content == l.content ++ r.content ++ ls.content + x
   }
diff --git a/static/valid/RedBlackTree.scala b/static/valid/RedBlackTree.scala
index 94577704d6..4b7fab2dc6 100644
--- a/static/valid/RedBlackTree.scala
+++ b/static/valid/RedBlackTree.scala
@@ -24,7 +24,7 @@ object RedBlackTree {
   def size(t: Tree) : BigInt = (t match {
     case Empty() => BigInt(0)
     case Node(_, l, v, r) => size(l) + 1 + size(r)
-  }) ensuring(_ >= 0)
+  }).ensuring(_ >= 0)
 
   /* We consider leaves to be black by definition */
   def isBlack(t: Tree) : Boolean = t match {
@@ -65,7 +65,7 @@ object RedBlackTree {
         else if (x == y) Node(c,a,y,b)
         else             balance(c,a,y,ins(x, b))
     }
-  } ensuring (res => content(res) == content(t) ++ Set(x) 
+ }.ensuring(res => content(res) == content(t) ++ Set(x) 
                    && size(t) <= size(res) && size(res) <= size(t) + 1
                    && redDescHaveBlackChildren(res)
                    && blackBalanced(res))
@@ -76,12 +76,12 @@ object RedBlackTree {
       case Node(Red(),l,v,r) => Node(Black(),l,v,r)
       case _ => n
     }
-  } ensuring(res => redNodesHaveBlackChildren(res) && blackBalanced(res))
+ }.ensuring(res => redNodesHaveBlackChildren(res) && blackBalanced(res))
 
   def add(x: BigInt, t: Tree): Tree = {
     require(redNodesHaveBlackChildren(t) && blackBalanced(t))
     makeBlack(ins(x, t))
-  } ensuring (res => content(res) == content(t) ++ Set(x) && redNodesHaveBlackChildren(res) && blackBalanced(res))
+ }.ensuring(res => content(res) == content(t) ++ Set(x) && redNodesHaveBlackChildren(res) && blackBalanced(res))
 
   def balance(c: Color, a: Tree, x: BigInt, b: Tree): Tree = {
     Node(c,a,x,b) match {
@@ -95,5 +95,5 @@ object RedBlackTree {
         Node(Red(),Node(Black(),a,xV,b),yV,Node(Black(),c,zV,d))
       case Node(c,a,xV,b) => Node(c,a,xV,b)
     }
-  } ensuring (res => content(res) == content(Node(c,a,x,b)))// && redDescHaveBlackChildren(res))
+ }.ensuring(res => content(res) == content(Node(c,a,x,b)))// && redDescHaveBlackChildren(res))
 }
diff --git a/static/valid/StableSorter.scala b/static/valid/StableSorter.scala
index 699b853cf3..1f07d89860 100644
--- a/static/valid/StableSorter.scala
+++ b/static/valid/StableSorter.scala
@@ -12,7 +12,7 @@ object StableSorter {
       case Cons(hd, tl) if key(t) <= key(hd) => t :: l
       case Cons(hd, tl) => hd :: insert(t, tl, key)
     }
-  } ensuring { res => res.content == Set(t) ++ l.content && res.length == 1 + l.length }
+ }.ensuring { res => res.content == Set(t) ++ l.content && res.length == 1 + l.length }
 
   // Sorting a list preserves the content and preserves the length
   def sort[T](l: List[T], key: T => BigInt): List[T] = { l match {
@@ -21,7 +21,7 @@ object StableSorter {
       val tlSorted = sort(tl, key)
       insert(hd, tlSorted, key)
     }
-  }} ensuring { res => res.content == l.content && res.length == l.length }
+  }}.ensuring { res => res.content == l.content && res.length == l.length }
 
   // To define stability, we first annotate the input list with the initial indices...
   def annotateList[T](l: List[T], n: BigInt): List[(T, BigInt)] = {
@@ -32,7 +32,7 @@ object StableSorter {
         hint((hd, n) :: tlAnn, trivProp2(annotateList(tl, n + 1), n))
       }
     }
-  } ensuring { res => l2AtLeast(res, n) }
+ }.ensuring { res => l2AtLeast(res, n) }
 
   // ... where:
   def l2AtLeast[T](l: List[(T, BigInt)], n: BigInt): Boolean = l match {
diff --git a/tutorial.html b/tutorial.html
index 8d22ac420f..27ffe0b96f 100644
--- a/tutorial.html
+++ b/tutorial.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Tutorial: Sorting &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Specifying Options" href="options.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -84,20 +86,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Tutorial: Sorting</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Tutorial: Sorting</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/tutorial.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -108,7 +107,7 @@
            <div itemprop="articleBody">
              
   <section id="tutorial-sorting">
-<span id="tutorial"></span><h1>Tutorial: Sorting<a class="headerlink" href="#tutorial-sorting" title="Permalink to this headline">¶</a></h1>
+<span id="tutorial"></span><h1>Tutorial: Sorting<a class="headerlink" href="#tutorial-sorting" title="Link to this heading">¶</a></h1>
 <p>This tutorial shows how to:</p>
 <blockquote>
 <div><ul class="simple">
@@ -121,7 +120,7 @@
 <p>See <a class="reference internal" href="gettingstarted.html"><span class="doc">Verifying and Compiling Examples</span></a> about how to setup the command line
 tool.</p>
 <section id="warm-up-max">
-<h2>Warm-up: Max<a class="headerlink" href="#warm-up-max" title="Permalink to this headline">¶</a></h2>
+<h2>Warm-up: Max<a class="headerlink" href="#warm-up-max" title="Link to this heading">¶</a></h2>
 <p>As a warm-up illustrating verification, we define and debug a <cite>max</cite> function
 and specify its properties. Stainless uses Scala constructs
 <cite>require</cite> and <cite>ensuring</cite> to document preconditions and
@@ -131,13 +130,13 @@ <h2>Warm-up: Max<a class="headerlink" href="#warm-up-max" title="Permalink to th
 prove them for <em>all</em> executions, or, if they are wrong, automatically find
 inputs for which the conditions fail.</p>
 <p>Consider the following definition inside of an object <cite>TestMax</cite>.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span> <span class="nc">TestMax</span> <span class="p">{</span>
-  <span class="k">def</span> <span class="nf">max</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="kd">val</span> <span class="n">d</span> <span class="o">=</span> <span class="n">x</span> <span class="o">-</span> <span class="n">y</span>
-    <span class="k">if</span> <span class="p">(</span><span class="n">d</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">)</span> <span class="n">x</span>
-    <span class="k">else</span> <span class="n">y</span>
-  <span class="p">}</span> <span class="n">ensuring</span><span class="p">(</span><span class="n">res</span> <span class="o">=&gt;</span>
-    <span class="n">x</span> <span class="o">&lt;=</span> <span class="n">res</span> <span class="o">&amp;&amp;</span> <span class="n">y</span> <span class="o">&lt;=</span> <span class="n">res</span> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="n">res</span> <span class="o">==</span> <span class="n">x</span> <span class="o">||</span> <span class="n">res</span> <span class="o">==</span> <span class="n">y</span><span class="p">))</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span><span class="w"> </span><span class="nc">TestMax</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">max</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">y</span>
+<span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">d</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">x</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="n">y</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">y</span><span class="p">))</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -157,9 +156,9 @@ <h2>Warm-up: Max<a class="headerlink" href="#warm-up-max" title="Permalink to th
 <p>We can evaluate this code on some values by writing
 parameterless functions and inspecting what they evaluate
 to. The web interface will display these results for us.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">test1</span> <span class="o">=</span> <span class="n">max</span><span class="p">(</span><span class="mi">10</span><span class="p">,</span> <span class="mi">5</span><span class="p">)</span>
-<span class="k">def</span> <span class="nf">test2</span> <span class="o">=</span> <span class="n">max</span><span class="p">(</span><span class="o">-</span><span class="mi">5</span><span class="p">,</span> <span class="mi">5</span><span class="p">)</span>
-<span class="k">def</span> <span class="nf">test3</span> <span class="o">=</span> <span class="n">max</span><span class="p">(</span><span class="o">-</span><span class="mi">5</span><span class="p">,</span> <span class="o">-</span><span class="mi">7</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">test1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">max</span><span class="p">(</span><span class="mi">10</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">test2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">max</span><span class="p">(</span><span class="o">-</span><span class="mi">5</span><span class="p">,</span><span class="w"> </span><span class="mi">5</span><span class="p">)</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">test3</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">max</span><span class="p">(</span><span class="o">-</span><span class="mi">5</span><span class="p">,</span><span class="w"> </span><span class="o">-</span><span class="mi">7</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>The code seems to work correctly on the example values.
@@ -206,7 +205,7 @@ <h2>Warm-up: Max<a class="headerlink" href="#warm-up-max" title="Permalink to th
 <p>Stainless tells us that it found two input for which the <code class="docutils literal notranslate"><span class="pre">ensuring</span></code> clause of the
 <code class="docutils literal notranslate"><span class="pre">max</span></code> function evaluates to <code class="docutils literal notranslate"><span class="pre">false</span></code>. The second verification is similar.</p>
 <p>We may wish to define a test method</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">test4</span> <span class="o">=</span> <span class="n">max</span><span class="p">(</span><span class="o">-</span><span class="mi">1639624704</span><span class="p">,</span> <span class="mi">1879048192</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">test4</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">max</span><span class="p">(</span><span class="o">-</span><span class="mi">1639624704</span><span class="p">,</span><span class="w"> </span><span class="mi">1879048192</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>whose evaluation indeed results in <code class="docutils literal notranslate"><span class="pre">ensuring</span></code> condition being violated.
@@ -223,23 +222,23 @@ <h2>Warm-up: Max<a class="headerlink" href="#warm-up-max" title="Permalink to th
 <p>To use unbounded integers, we simply change the types to
 <cite>BigInt</cite>, obtaining a program that verifies (and, as
 expected, passes all the test cases).</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">max</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">d</span> <span class="o">=</span> <span class="n">x</span> <span class="o">-</span> <span class="n">y</span>
-  <span class="k">if</span> <span class="p">(</span><span class="n">d</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">)</span> <span class="n">x</span>
-  <span class="k">else</span> <span class="n">y</span>
-<span class="p">}</span> <span class="n">ensuring</span><span class="p">(</span><span class="n">res</span> <span class="o">=&gt;</span>
-  <span class="n">x</span> <span class="o">&lt;=</span> <span class="n">res</span> <span class="o">&amp;&amp;</span> <span class="n">y</span> <span class="o">&lt;=</span> <span class="n">res</span> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="n">res</span> <span class="o">==</span> <span class="n">x</span> <span class="o">||</span> <span class="n">res</span> <span class="o">==</span> <span class="n">y</span><span class="p">))</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">max</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="kd">val</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">y</span>
+<span class="w">   </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">d</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">x</span>
+<span class="w">   </span><span class="k">else</span><span class="w"> </span><span class="n">y</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">   </span><span class="n">x</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">y</span><span class="p">))</span>
 </pre></div>
 </div>
 <p>As a possibly simpler specification, we could have also
 defined the reference implementation</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">rmax</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="k">if</span> <span class="p">(</span><span class="n">x</span> <span class="o">&lt;=</span> <span class="n">y</span><span class="p">)</span> <span class="n">y</span> <span class="k">else</span> <span class="n">x</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">rmax</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="k">else</span><span class="w"> </span><span class="n">x</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>and then used as the postcondition of <cite>max</cite> simply</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">ensuring</span> <span class="p">(</span><span class="n">res</span> <span class="o">=&gt;</span>  <span class="n">res</span> <span class="o">==</span> <span class="n">rmax</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">))</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">ensuring</span><span class="w"> </span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span><span class="w">  </span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">rmax</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">))</span>
 </pre></div>
 </div>
 <p>In general, Stainless uses both function body and function
@@ -252,18 +251,18 @@ <h2>Warm-up: Max<a class="headerlink" href="#warm-up-max" title="Permalink to th
 and postconditions allows us to state fairly general
 properties. For example, the following lemma verifies
 a number of algebraic properties of <cite>max</cite>.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">max_lemma</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">z</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">max</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">x</span><span class="p">)</span> <span class="o">==</span> <span class="n">x</span> <span class="o">&amp;&amp;</span>
-  <span class="n">max</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">)</span> <span class="o">==</span> <span class="n">max</span><span class="p">(</span><span class="n">y</span><span class="p">,</span><span class="n">x</span><span class="p">)</span> <span class="o">&amp;&amp;</span>
-  <span class="n">max</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">max</span><span class="p">(</span><span class="n">y</span><span class="p">,</span><span class="n">z</span><span class="p">))</span> <span class="o">==</span> <span class="n">max</span><span class="p">(</span><span class="n">max</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">),</span> <span class="n">z</span><span class="p">)</span> <span class="o">&amp;&amp;</span>
-  <span class="n">max</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">)</span> <span class="o">+</span> <span class="n">z</span> <span class="o">==</span> <span class="n">max</span><span class="p">(</span><span class="n">x</span> <span class="o">+</span> <span class="n">z</span><span class="p">,</span> <span class="n">y</span> <span class="o">+</span> <span class="n">z</span><span class="p">)</span>
-<span class="p">}</span> <span class="n">holds</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">max_lemma</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">z</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">max</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">  </span><span class="n">max</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">max</span><span class="p">(</span><span class="n">y</span><span class="p">,</span><span class="n">x</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">  </span><span class="n">max</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">max</span><span class="p">(</span><span class="n">y</span><span class="p">,</span><span class="n">z</span><span class="p">))</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">max</span><span class="p">(</span><span class="n">max</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">),</span><span class="w"> </span><span class="n">z</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">  </span><span class="n">max</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">max</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">z</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">z</span><span class="p">)</span>
+<span class="p">}</span><span class="w"> </span><span class="n">holds</span>
 </pre></div>
 </div>
 <p>Here <cite>holds</cite> operator on the function body is an
 abbreviation for the postcondition stating that the returned
 result is always true, that is, for</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">ensuring</span><span class="p">(</span><span class="n">res</span> <span class="o">=&gt;</span> <span class="n">res</span><span class="o">==</span><span class="kc">true</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">ensuring</span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res</span><span class="o">==</span><span class="kc">true</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>As a guideline, we typically use <cite>holds</cite> to express such
@@ -277,13 +276,13 @@ <h2>Warm-up: Max<a class="headerlink" href="#warm-up-max" title="Permalink to th
 the method should only be used under certain conditions,
 such as <cite>x</cite> and <cite>y</cite> being non-negative. To specify the
 conditions on input, we use the <cite>require</cite> clause.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">max</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">y</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">x</span> <span class="o">&amp;&amp;</span> <span class="mi">0</span> <span class="o">&lt;=</span> <span class="n">y</span><span class="p">)</span>
-  <span class="kd">val</span> <span class="n">d</span> <span class="o">=</span> <span class="n">x</span> <span class="o">-</span> <span class="n">y</span>
-  <span class="k">if</span> <span class="p">(</span><span class="n">d</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">)</span> <span class="n">x</span>
-  <span class="k">else</span> <span class="n">y</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">(</span><span class="n">res</span> <span class="o">=&gt;</span>
-  <span class="n">x</span> <span class="o">&lt;=</span> <span class="n">res</span> <span class="o">&amp;&amp;</span> <span class="n">y</span> <span class="o">&lt;=</span> <span class="n">res</span> <span class="o">&amp;&amp;</span> <span class="p">(</span><span class="n">res</span> <span class="o">==</span> <span class="n">x</span> <span class="o">||</span> <span class="n">res</span> <span class="o">==</span> <span class="n">y</span><span class="p">))</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">max</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="mi">0</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">y</span><span class="p">)</span>
+<span class="w">   </span><span class="kd">val</span><span class="w"> </span><span class="n">d</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">y</span>
+<span class="w">   </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">d</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span><span class="w"> </span><span class="n">x</span>
+<span class="w">   </span><span class="k">else</span><span class="w"> </span><span class="n">y</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">   </span><span class="n">x</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">||</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">y</span><span class="p">))</span>
 </pre></div>
 </div>
 <p>This program verifies and indeed works correctly on
@@ -299,10 +298,10 @@ <h2>Warm-up: Max<a class="headerlink" href="#warm-up-max" title="Permalink to th
 <cite>Int</cite> cannot overflow. To opt-out of this behavior, eg. when
 such wrapping semantics are desired, one can wrap the offending
 expression in a call to <cite>stainless.math.wrapping</cite>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">math</span><span class="p">.</span><span class="n">wrapping</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">math</span><span class="p">.</span><span class="n">wrapping</span>
 
-<span class="k">def</span> <span class="nf">doubleOverflow</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">Int</span><span class="p">):</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-   <span class="n">wrapping</span> <span class="p">{</span> <span class="n">x</span> <span class="o">+</span> <span class="n">x</span> <span class="p">}</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">doubleOverflow</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">wrapping</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -310,19 +309,19 @@ <h2>Warm-up: Max<a class="headerlink" href="#warm-up-max" title="Permalink to th
 <p>In the sequel, we will mostly use <cite>BigInt</cite> types.</p>
 </section>
 <section id="defining-lists-and-their-properties">
-<h2>Defining Lists and Their Properties<a class="headerlink" href="#defining-lists-and-their-properties" title="Permalink to this headline">¶</a></h2>
+<h2>Defining Lists and Their Properties<a class="headerlink" href="#defining-lists-and-their-properties" title="Link to this heading">¶</a></h2>
 <p>We next consider sorting an unbounded number of elements.
 For this purpose, we define a data structure for lists of
 integers.  Stainless has a built-in data type of parametric
 lists, see <a class="reference internal" href="library.html"><span class="doc">Stainless Library</span></a>, but here we define
 our own variant instead.</p>
 <section id="lists">
-<h3>Lists<a class="headerlink" href="#lists" title="Permalink to this headline">¶</a></h3>
+<h3>Lists<a class="headerlink" href="#lists" title="Link to this heading">¶</a></h3>
 <p>We use a recursive algebraic data type
 definition, expressed using Scala’s <strong>case classes</strong>.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">List</span>
-<span class="k">case</span> <span class="k">object</span> <span class="nc">Nil</span> <span class="k">extends</span> <span class="nc">List</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">head</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">tail</span><span class="p">:</span> <span class="nc">List</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">List</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">List</span>
+<span class="k">case</span><span class="w"> </span><span class="k">object</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">head</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">tail</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span>
 </pre></div>
 </div>
 <p>We can read the definition as follows: the set of lists is
@@ -337,7 +336,7 @@ <h3>Lists<a class="headerlink" href="#lists" title="Permalink to this headline">
 <p>Each list is constructed by applying the above two rules
 finitely many times.  A concrete list containing elements 5,
 2, and 7, in that order, is denoted</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nc">Cons</span><span class="p">(</span><span class="mi">5</span><span class="p">,</span> <span class="nc">Cons</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="nc">Cons</span><span class="p">(</span><span class="mi">7</span><span class="p">,</span> <span class="nc">Nil</span><span class="p">)))</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="nc">Cons</span><span class="p">(</span><span class="mi">5</span><span class="p">,</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="mi">7</span><span class="p">,</span><span class="w"> </span><span class="nc">Nil</span><span class="p">)))</span>
 </pre></div>
 </div>
 <p>Having defined the structure of lists, we can move on to
@@ -346,11 +345,11 @@ <h3>Lists<a class="headerlink" href="#lists" title="Permalink to this headline">
 defined on lists.</p>
 </section>
 <section id="size-of-a-list">
-<h3>Size of a List<a class="headerlink" href="#size-of-a-list" title="Permalink to this headline">¶</a></h3>
+<h3>Size of a List<a class="headerlink" href="#size-of-a-list" title="Link to this heading">¶</a></h3>
 <p>As the starting point, we define the size of a list.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">size</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">)</span> <span class="p">:</span> <span class="nc">BigInt</span> <span class="o">=</span> <span class="p">(</span><span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Nil</span> <span class="o">=&gt;</span> <span class="mi">0</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">rest</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">size</span><span class="p">(</span><span class="n">rest</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">size</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">rest</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">rest</span><span class="p">)</span>
 <span class="p">})</span>
 </pre></div>
 </div>
@@ -370,27 +369,27 @@ <h3>Size of a List<a class="headerlink" href="#size-of-a-list" title="Permalink
 and the property of size being non-negative is not revealed
 by such unfolding. Once specified, the non-negativity is
 easily proven and Stainless will make use of it.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">isize</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">)</span> <span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">(</span><span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-  <span class="k">case</span> <span class="nc">Nil</span> <span class="o">=&gt;</span> <span class="mi">0</span>
-  <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">rest</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="p">{</span>
-    <span class="kd">val</span> <span class="n">rSize</span> <span class="o">=</span> <span class="n">isize</span><span class="p">(</span><span class="n">rest</span><span class="p">)</span>
-    <span class="k">if</span> <span class="p">(</span><span class="n">rSize</span> <span class="o">==</span> <span class="nc">Int</span><span class="p">.</span><span class="nc">MaxValue</span><span class="p">)</span> <span class="n">rSize</span>
-    <span class="k">else</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">rSize</span>
-  <span class="p">}</span>
-<span class="p">}).</span><span class="n">ensuring</span><span class="p">(</span><span class="n">res</span> <span class="o">=&gt;</span> <span class="n">res</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">isize</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">rest</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="kd">val</span><span class="w"> </span><span class="n">rSize</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">isize</span><span class="p">(</span><span class="n">rest</span><span class="p">)</span>
+<span class="w">    </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">rSize</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="nc">Int</span><span class="p">.</span><span class="nc">MaxValue</span><span class="p">)</span><span class="w"> </span><span class="n">rSize</span>
+<span class="w">    </span><span class="k">else</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">rSize</span>
+<span class="w">  </span><span class="p">}</span>
+<span class="p">}).</span><span class="n">ensuring</span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>In some cases, it may be helpful to define a size function
 that returns a bounded integer type, such as the 32-bit signed integer <code class="docutils literal notranslate"><span class="pre">`Int</span></code>.
 One useful way to do this is to define function as follows:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">isize</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">)</span> <span class="p">:</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">(</span><span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Nil</span> <span class="o">=&gt;</span> <span class="mi">0</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">rest</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="p">{</span>
-      <span class="kd">val</span> <span class="n">rSize</span> <span class="o">=</span> <span class="n">isize</span><span class="p">(</span><span class="n">rest</span><span class="p">)</span>
-      <span class="k">if</span> <span class="p">(</span><span class="n">rSize</span> <span class="o">==</span> <span class="nc">Int</span><span class="p">.</span><span class="nc">Max</span><span class="p">)</span> <span class="n">rSize</span>
-      <span class="k">else</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">rSize</span>
-    <span class="p">}</span>
-<span class="p">})</span> <span class="n">ensuring</span><span class="p">(</span><span class="n">res</span> <span class="o">=&gt;</span> <span class="n">res</span> <span class="o">&gt;=</span> <span class="mi">0</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">isize</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">(</span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="mi">0</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">rest</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="p">{</span>
+<span class="w">      </span><span class="kd">val</span><span class="w"> </span><span class="n">rSize</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">isize</span><span class="p">(</span><span class="n">rest</span><span class="p">)</span>
+<span class="w">      </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">rSize</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="nc">Int</span><span class="p">.</span><span class="nc">Max</span><span class="p">)</span><span class="w"> </span><span class="n">rSize</span>
+<span class="w">      </span><span class="k">else</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">rSize</span>
+<span class="w">    </span><span class="p">}</span>
+<span class="p">}).</span><span class="n">ensuring</span><span class="p">(</span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>The above <code class="docutils literal notranslate"><span class="pre">isize</span></code> function satisfies the usual recursive definition for all but a huge
@@ -398,34 +397,34 @@ <h3>Size of a List<a class="headerlink" href="#size-of-a-list" title="Permalink
 number, then the list is indeed small.</p>
 </section>
 <section id="sorted-lists">
-<h3>Sorted Lists<a class="headerlink" href="#sorted-lists" title="Permalink to this headline">¶</a></h3>
+<h3>Sorted Lists<a class="headerlink" href="#sorted-lists" title="Link to this heading">¶</a></h3>
 <p>We define properties of values simply as executable
 predicates that check if the property holds. The following
 is a property that a list is sorted in a strictly ascending
 order.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">isSorted</span><span class="p">(</span><span class="n">l</span> <span class="p">:</span> <span class="nc">List</span><span class="p">)</span> <span class="p">:</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-  <span class="k">case</span> <span class="nc">Nil</span> <span class="o">=&gt;</span> <span class="kc">true</span>
-  <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">_</span><span class="p">,</span><span class="nc">Nil</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="kc">true</span>
-  <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x2</span><span class="p">,</span> <span class="n">rest</span><span class="p">))</span> <span class="o">=&gt;</span>
-    <span class="n">x1</span> <span class="o">&lt;</span> <span class="n">x2</span> <span class="o">&amp;&amp;</span> <span class="n">isSorted</span><span class="p">(</span><span class="nc">Cons</span><span class="p">(</span><span class="n">x2</span><span class="p">,</span><span class="n">rest</span><span class="p">))</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">isSorted</span><span class="p">(</span><span class="n">l</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">_</span><span class="p">,</span><span class="nc">Nil</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="kc">true</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x1</span><span class="p">,</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x2</span><span class="p">,</span><span class="w"> </span><span class="n">rest</span><span class="p">))</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">    </span><span class="n">x1</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">x2</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">isSorted</span><span class="p">(</span><span class="nc">Cons</span><span class="p">(</span><span class="n">x2</span><span class="p">,</span><span class="n">rest</span><span class="p">))</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 </section>
 <section id="insertion-into-sorted-list">
-<h2>Insertion into Sorted List<a class="headerlink" href="#insertion-into-sorted-list" title="Permalink to this headline">¶</a></h2>
+<h2>Insertion into Sorted List<a class="headerlink" href="#insertion-into-sorted-list" title="Link to this heading">¶</a></h2>
 <p>Consider the following specification of insertion into a sorted list. It’s a
 building block for an insertion sort.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">sInsert</span><span class="p">(</span><span class="n">x</span> <span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">l</span> <span class="p">:</span> <span class="nc">List</span><span class="p">)</span> <span class="p">:</span> <span class="nc">List</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">isSorted</span><span class="p">(</span><span class="n">l</span><span class="p">))</span>
-  <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Nil</span> <span class="o">=&gt;</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="nc">Nil</span><span class="p">)</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span> <span class="n">rest</span><span class="p">)</span> <span class="k">if</span> <span class="p">(</span><span class="n">x</span> <span class="o">==</span> <span class="n">e</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">l</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span> <span class="n">rest</span><span class="p">)</span> <span class="k">if</span> <span class="p">(</span><span class="n">x</span> <span class="o">&lt;</span> <span class="n">e</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="n">rest</span><span class="p">))</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span> <span class="n">rest</span><span class="p">)</span> <span class="k">if</span> <span class="p">(</span><span class="n">x</span> <span class="o">&gt;</span> <span class="n">e</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span> <span class="n">sInsert</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">rest</span><span class="p">))</span>
-  <span class="p">}</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{(</span><span class="n">res</span><span class="p">:</span><span class="nc">List</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">isSorted</span><span class="p">(</span><span class="n">res</span><span class="p">)}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">sInsert</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="n">isSorted</span><span class="p">(</span><span class="n">l</span><span class="p">))</span>
+<span class="w">   </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="nc">Nil</span><span class="p">)</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">rest</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">e</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">l</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">rest</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">e</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="n">rest</span><span class="p">))</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">rest</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">e</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">sInsert</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">rest</span><span class="p">))</span>
+<span class="w">   </span><span class="p">}</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{(</span><span class="n">res</span><span class="p">:</span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">isSorted</span><span class="p">(</span><span class="n">res</span><span class="p">)}</span>
 </pre></div>
 </div>
 <p>Stainless verifies that the returned list is indeed sorted. Note
@@ -435,52 +434,52 @@ <h2>Insertion into Sorted List<a class="headerlink" href="#insertion-into-sorted
 finds.</p>
 </section>
 <section id="being-sorted-is-not-enough">
-<h2>Being Sorted is Not Enough<a class="headerlink" href="#being-sorted-is-not-enough" title="Permalink to this headline">¶</a></h2>
+<h2>Being Sorted is Not Enough<a class="headerlink" href="#being-sorted-is-not-enough" title="Link to this heading">¶</a></h2>
 <p>Note, however, that a function such as this one is also correct.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">fsInsert</span><span class="p">(</span><span class="n">x</span> <span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">l</span> <span class="p">:</span> <span class="nc">List</span><span class="p">)</span> <span class="p">:</span> <span class="nc">List</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">isSorted</span><span class="p">(</span><span class="n">l</span><span class="p">))</span>
-  <span class="nc">Nil</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{(</span><span class="n">res</span><span class="p">:</span><span class="nc">List</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">isSorted</span><span class="p">(</span><span class="n">res</span><span class="p">)}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">fsInsert</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="n">isSorted</span><span class="p">(</span><span class="n">l</span><span class="p">))</span>
+<span class="w">   </span><span class="nc">Nil</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{(</span><span class="n">res</span><span class="p">:</span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">isSorted</span><span class="p">(</span><span class="n">res</span><span class="p">)}</span>
 </pre></div>
 </div>
 <p>So, our specification may be considered weak, because it does
 not say anything about the elements.</p>
 </section>
 <section id="using-size-in-specification">
-<h2>Using Size in Specification<a class="headerlink" href="#using-size-in-specification" title="Permalink to this headline">¶</a></h2>
+<h2>Using Size in Specification<a class="headerlink" href="#using-size-in-specification" title="Link to this heading">¶</a></h2>
 <p>Consider a stronger additional postcondition property:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">size</span><span class="p">(</span><span class="n">res</span><span class="p">)</span> <span class="o">==</span> <span class="n">size</span><span class="p">(</span><span class="n">l</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">size</span><span class="p">(</span><span class="n">res</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">l</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
 </pre></div>
 </div>
 <p>Does it hold? If we try to add it, we obtain a counterexample.
 A correct strengthening, taking into account that the element
 may or may not already be in the list, is the following.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">size</span><span class="p">(</span><span class="n">l</span><span class="p">)</span> <span class="o">&lt;=</span> <span class="n">size</span><span class="p">(</span><span class="n">res</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">size</span><span class="p">(</span><span class="n">res</span><span class="p">)</span> <span class="o">&lt;=</span> <span class="n">size</span><span class="p">(</span><span class="n">l</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="n">size</span><span class="p">(</span><span class="n">l</span><span class="p">)</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">res</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">res</span><span class="p">)</span><span class="w"> </span><span class="o">&lt;=</span><span class="w"> </span><span class="n">size</span><span class="p">(</span><span class="n">l</span><span class="p">)</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span>
 </pre></div>
 </div>
 </section>
 <section id="using-content-in-specification">
-<h2>Using Content in Specification<a class="headerlink" href="#using-content-in-specification" title="Permalink to this headline">¶</a></h2>
+<h2>Using Content in Specification<a class="headerlink" href="#using-content-in-specification" title="Link to this heading">¶</a></h2>
 <p>A stronger specification needs to talk about the <cite>content</cite>
 of the list.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">sInsert</span><span class="p">(</span><span class="n">x</span> <span class="p">:</span> <span class="nc">BigInt</span><span class="p">,</span> <span class="n">l</span> <span class="p">:</span> <span class="nc">List</span><span class="p">)</span> <span class="p">:</span> <span class="nc">List</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">isSorted</span><span class="p">(</span><span class="n">l</span><span class="p">))</span>
-  <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Nil</span> <span class="o">=&gt;</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="nc">Nil</span><span class="p">)</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span> <span class="n">rest</span><span class="p">)</span> <span class="k">if</span> <span class="p">(</span><span class="n">x</span> <span class="o">==</span> <span class="n">e</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">l</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span> <span class="n">rest</span><span class="p">)</span> <span class="k">if</span> <span class="p">(</span><span class="n">x</span> <span class="o">&lt;</span> <span class="n">e</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="n">rest</span><span class="p">))</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span> <span class="n">rest</span><span class="p">)</span> <span class="k">if</span> <span class="p">(</span><span class="n">x</span> <span class="o">&gt;</span> <span class="n">e</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span> <span class="n">sInsert</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">rest</span><span class="p">))</span>
-  <span class="p">}</span>
-<span class="p">}</span> <span class="n">ensuring</span> <span class="p">{(</span><span class="n">res</span><span class="p">:</span><span class="nc">List</span><span class="p">)</span> <span class="o">=&gt;</span>
-   <span class="n">isSorted</span><span class="p">(</span><span class="n">res</span><span class="p">)</span> <span class="o">&amp;&amp;</span> <span class="n">content</span><span class="p">(</span><span class="n">res</span><span class="p">)</span> <span class="o">==</span> <span class="n">content</span><span class="p">(</span><span class="n">l</span><span class="p">)</span> <span class="o">++</span> <span class="nc">Set</span><span class="p">(</span><span class="n">x</span><span class="p">)}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">sInsert</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="n">isSorted</span><span class="p">(</span><span class="n">l</span><span class="p">))</span>
+<span class="w">   </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="nc">Nil</span><span class="p">)</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">rest</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">e</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">l</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">rest</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">e</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="n">rest</span><span class="p">))</span>
+<span class="w">     </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">rest</span><span class="p">)</span><span class="w"> </span><span class="k">if</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="n">e</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">e</span><span class="p">,</span><span class="w"> </span><span class="n">sInsert</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">rest</span><span class="p">))</span>
+<span class="w">   </span><span class="p">}</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{(</span><span class="n">res</span><span class="p">:</span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">    </span><span class="n">isSorted</span><span class="p">(</span><span class="n">res</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">content</span><span class="p">(</span><span class="n">res</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">content</span><span class="p">(</span><span class="n">l</span><span class="p">)</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="nc">Set</span><span class="p">(</span><span class="n">x</span><span class="p">)}</span>
 </pre></div>
 </div>
 <p>To compute <cite>content</cite>, in this example we use sets (even
 though in general, it might be better to use bags
 i.e. multisets).</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">content</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">):</span> <span class="nc">Set</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span> <span class="o">=</span> <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-  <span class="k">case</span> <span class="nc">Nil</span> <span class="o">=&gt;</span> <span class="nc">Set</span><span class="p">()</span>
-  <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="n">t</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="nc">Set</span><span class="p">(</span><span class="n">i</span><span class="p">)</span> <span class="o">++</span> <span class="n">content</span><span class="p">(</span><span class="n">t</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">content</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">):</span><span class="w"> </span><span class="nc">Set</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Set</span><span class="p">()</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="w"> </span><span class="n">t</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="nc">Set</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="w"> </span><span class="o">++</span><span class="w"> </span><span class="n">content</span><span class="p">(</span><span class="n">t</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -492,8 +491,7 @@ <h2>Using Content in Specification<a class="headerlink" href="#using-content-in-
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="gettingstarted.html" class="btn btn-neutral float-left" title="Verifying and Compiling Examples" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="options.html" class="btn btn-neutral float-right" title="Specifying Options" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -502,7 +500,7 @@ <h2>Using Content in Specification<a class="headerlink" href="#using-content-in-
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -513,7 +511,7 @@ <h2>Using Content in Specification<a class="headerlink" href="#using-content-in-
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/verification.html b/verification.html
index 83c37db34f..5a1130e65b 100644
--- a/verification.html
+++ b/verification.html
@@ -1,24 +1,23 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Verification conditions &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
         <script async="async" src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Specifying Algebraic Properties" href="laws.html" />
@@ -30,20 +29,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -82,20 +84,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Verification conditions</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Verification conditions</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/verification.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -106,7 +105,7 @@
            <div itemprop="articleBody">
              
   <section id="verification-conditions">
-<span id="verification"></span><h1>Verification conditions<a class="headerlink" href="#verification-conditions" title="Permalink to this headline">¶</a></h1>
+<span id="verification"></span><h1>Verification conditions<a class="headerlink" href="#verification-conditions" title="Link to this heading">¶</a></h1>
 <p>Software verification aims at making software safer. In its typical use case,
 it is a tool that takes as input the source code of a program with
 specifications as annotations and attempt to prove — or disprove — their
@@ -135,17 +134,17 @@
 information provided by (explicit or implicit) preconditions to the <code class="docutils literal notranslate"><span class="pre">match</span></code>
 expression.</p>
 <section id="postconditions">
-<h2>Postconditions<a class="headerlink" href="#postconditions" title="Permalink to this headline">¶</a></h2>
+<h2>Postconditions<a class="headerlink" href="#postconditions" title="Link to this heading">¶</a></h2>
 <p>One core concept in verification is to check the contract of functions. The most
 important part of a contract is the postcondition. The postcondition specifies
 the behavior of the function. It takes into account the precondition and only
 asserts the property of the output when the input satisfies the precondition.</p>
 <p>Formally, we consider a function with a single parameter (one can generalize
 the following for any number of parameters):</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">f</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">B</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">prec</span><span class="p">)</span>
-  <span class="n">body</span>
-<span class="p">}</span> <span class="n">ensuring</span><span class="p">(</span><span class="n">r</span> <span class="o">=&gt;</span> <span class="n">post</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="w"> </span><span class="k">def</span><span class="w"> </span><span class="nf">f</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">B</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">   </span><span class="n">require</span><span class="p">(</span><span class="n">prec</span><span class="p">)</span>
+<span class="w">   </span><span class="n">body</span>
+<span class="p">}.</span><span class="n">ensuring</span><span class="p">(</span><span class="n">r</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">post</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>where, <span class="math notranslate nohighlight">\(\mbox{prec}(x)\)</span> is a Boolean expression with free variables
@@ -179,15 +178,15 @@ <h2>Postconditions<a class="headerlink" href="#postconditions" title="Permalink
 chapter on Stainless’s algorithms.</p>
 </section>
 <section id="preconditions">
-<h2>Preconditions<a class="headerlink" href="#preconditions" title="Permalink to this headline">¶</a></h2>
+<h2>Preconditions<a class="headerlink" href="#preconditions" title="Link to this heading">¶</a></h2>
 <p>Preconditions are used as part of the contract of functions. They are a way to
 restrict the input to only relevant inputs, without having to implement guards
 and error handling in the functions themselves.</p>
 <p>Preconditions are contracts that the call sites should respect, and thus are
 not checked as part of verifying the function. Given the following definition:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">f</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">A</span><span class="p">):</span> <span class="nc">B</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="n">prec</span><span class="p">)</span>
-  <span class="n">body</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">f</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">A</span><span class="p">):</span><span class="w"> </span><span class="nc">B</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="n">prec</span><span class="p">)</span>
+<span class="w">  </span><span class="n">body</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -202,8 +201,8 @@ <h2>Preconditions<a class="headerlink" href="#preconditions" title="Permalink to
 at that program point as <span class="math notranslate nohighlight">\(\mbox{pc}(x)\)</span>. The path condition is a formula that
 summarizes the facts known about <span class="math notranslate nohighlight">\(x\)</span> at that call site. A typical example is
 when the call site is inside an if expression:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">if</span><span class="p">(</span><span class="n">x</span> <span class="o">&gt;</span> <span class="mi">0</span><span class="p">)</span>
-  <span class="n">f</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">if</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">&gt;</span><span class="w"> </span><span class="mi">0</span><span class="p">)</span>
+<span class="w">  </span><span class="n">f</span><span class="p">(</span><span class="n">x</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>The path condition on <span class="math notranslate nohighlight">\(x\)</span> would include the fact that <span class="math notranslate nohighlight">\(x &gt; 0\)</span>. This
@@ -225,20 +224,20 @@ <h2>Preconditions<a class="headerlink" href="#preconditions" title="Permalink to
 </div>
 </section>
 <section id="sharing-bindings-between-specifications-and-function-body">
-<h2>Sharing bindings between specifications and function body<a class="headerlink" href="#sharing-bindings-between-specifications-and-function-body" title="Permalink to this headline">¶</a></h2>
+<h2>Sharing bindings between specifications and function body<a class="headerlink" href="#sharing-bindings-between-specifications-and-function-body" title="Link to this heading">¶</a></h2>
 <p>The example <a class="reference external" href="https://github.com/epfl-lara/stainless/blob/master/frontends/benchmarks/verification/valid/MicroTests/ValEnsuring.scala">ValEnsuring</a>
 shows that Stainless supports multiple <code class="docutils literal notranslate"><span class="pre">require</span></code>’s (in functions, but not for ADT invariants), and
 shows how to share a <cite>val</cite> binding between precondition, postcondition, and function body.</p>
 </section>
 <section id="loop-invariants">
-<h2>Loop invariants<a class="headerlink" href="#loop-invariants" title="Permalink to this headline">¶</a></h2>
+<h2>Loop invariants<a class="headerlink" href="#loop-invariants" title="Link to this heading">¶</a></h2>
 <p>Stainless supports annotations for loop invariants in <a class="reference internal" href="imperative.html"><span class="doc">Imperative</span></a>. To
 simplify the presentation we will assume a single variable <span class="math notranslate nohighlight">\(x\)</span> is in
 scope, but the definitions generalize to any number of variables. Given the
 following program:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="k">while</span><span class="p">(</span><span class="n">cond</span><span class="p">)</span> <span class="p">{</span>
-  <span class="n">body</span>
-<span class="p">})</span> <span class="n">invariant</span><span class="p">(</span><span class="n">inv</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="k">while</span><span class="p">(</span><span class="n">cond</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">body</span>
+<span class="p">})</span><span class="w"> </span><span class="n">invariant</span><span class="p">(</span><span class="n">inv</span><span class="p">)</span>
 </pre></div>
 </div>
 <p>where the Boolean expression <span class="math notranslate nohighlight">\(\mbox{cond}(x)\)</span> is over the free variable
@@ -260,12 +259,12 @@ <h2>Loop invariants<a class="headerlink" href="#loop-invariants" title="Permalin
 after a <a class="reference internal" href="imperative.html"><span class="doc">return</span></a> (can be combined with <code class="docutils literal notranslate"><span class="pre">invariant</span></code>).</p>
 </section>
 <section id="decrease-annotation-in-loops">
-<h2>Decrease annotation in loops<a class="headerlink" href="#decrease-annotation-in-loops" title="Permalink to this headline">¶</a></h2>
+<h2>Decrease annotation in loops<a class="headerlink" href="#decrease-annotation-in-loops" title="Link to this heading">¶</a></h2>
 <p>One can also specify that the value of a given expression of numerical type decreases
 at each loop iteration by adding a <code class="docutils literal notranslate"><span class="pre">decreases</span></code> measure within the loop body:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">while</span><span class="p">(</span><span class="n">cond</span><span class="p">)</span> <span class="p">{</span>
-  <span class="n">decreases</span><span class="p">(</span><span class="n">expr</span><span class="p">)</span>
-  <span class="n">body</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">while</span><span class="p">(</span><span class="n">cond</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">decreases</span><span class="p">(</span><span class="n">expr</span><span class="p">)</span>
+<span class="w">  </span><span class="n">body</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -273,7 +272,7 @@ <h2>Decrease annotation in loops<a class="headerlink" href="#decrease-annotation
 is strictly positive and decreases at each iteration.</p>
 </section>
 <section id="array-access-safety">
-<h2>Array access safety<a class="headerlink" href="#array-access-safety" title="Permalink to this headline">¶</a></h2>
+<h2>Array access safety<a class="headerlink" href="#array-access-safety" title="Link to this heading">¶</a></h2>
 <p>Stainless generates verification conditions for the safety of array accesses. For
 each array variable, Stainless carries along a symbolic information on its length.
 This information is used to prove that each expression used as an index in the
@@ -281,7 +280,7 @@ <h2>Array access safety<a class="headerlink" href="#array-access-safety" title="
 be positive.</p>
 </section>
 <section id="adt-invariants">
-<h2>ADT invariants<a class="headerlink" href="#adt-invariants" title="Permalink to this headline">¶</a></h2>
+<h2>ADT invariants<a class="headerlink" href="#adt-invariants" title="Link to this heading">¶</a></h2>
 <p>Stainless lets the user write ADT invariants with the <code class="docutils literal notranslate"><span class="pre">require</span></code> keyword.
 Internally, such invariants are extracted as methods (named <code class="docutils literal notranslate"><span class="pre">inv</span></code>). Whenever,
 an ADT is constructed, and to make sure that the invariant is true, a
@@ -291,44 +290,44 @@ <h2>ADT invariants<a class="headerlink" href="#adt-invariants" title="Permalink
 ancestors can be used to inline the call to <code class="docutils literal notranslate"><span class="pre">inv</span></code> in the verification
 condition, as shown in the following example. This annotation is only
 supported when <code class="docutils literal notranslate"><span class="pre">--type-checker=true</span></code> (which is the case by default).</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
 
-<span class="k">object</span> <span class="nc">InlineInvariant</span> <span class="p">{</span>
-  <span class="k">sealed</span> <span class="k">abstract</span> <span class="k">class</span> <span class="nc">A</span>
+<span class="k">object</span><span class="w"> </span><span class="nc">InlineInvariant</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="k">sealed</span><span class="w"> </span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">A</span>
 
-  <span class="k">case</span> <span class="k">class</span> <span class="nc">B</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">A</span> <span class="p">{</span>
-    <span class="n">require</span><span class="p">(</span><span class="n">x</span> <span class="o">&gt;=</span> <span class="mi">50</span><span class="p">)</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">B</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">A</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">require</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">50</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="nd">@inlineInvariant</span>
-  <span class="k">case</span> <span class="k">class</span> <span class="nc">C</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nc">BigInt</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">A</span> <span class="p">{</span>
-    <span class="n">require</span><span class="p">(</span><span class="n">x</span> <span class="o">&gt;=</span> <span class="mi">50</span><span class="p">)</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="nd">@inlineInvariant</span>
+<span class="w">  </span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">C</span><span class="p">(</span><span class="n">x</span><span class="p">:</span><span class="w"> </span><span class="nc">BigInt</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">A</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">require</span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">50</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 
-  <span class="k">def</span> <span class="nf">f</span><span class="p">():</span> <span class="nc">A</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="nc">B</span><span class="p">(</span><span class="mi">100</span><span class="p">)</span> <span class="c1">// VC: inv(B(100))</span>
-    <span class="n">c</span><span class="p">(</span><span class="mi">100</span><span class="p">)</span> <span class="c1">// VC: 100 &gt;= 50 (call to `inv` was inlined)</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">f</span><span class="p">():</span><span class="w"> </span><span class="nc">A</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="nc">B</span><span class="p">(</span><span class="mi">100</span><span class="p">)</span><span class="w"> </span><span class="c1">// VC: inv(B(100))</span>
+<span class="w">    </span><span class="n">c</span><span class="p">(</span><span class="mi">100</span><span class="p">)</span><span class="w"> </span><span class="c1">// VC: 100 &gt;= 50 (call to `inv` was inlined)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 </section>
 <section id="pattern-matching-exhaustiveness">
-<h2>Pattern matching exhaustiveness<a class="headerlink" href="#pattern-matching-exhaustiveness" title="Permalink to this headline">¶</a></h2>
+<h2>Pattern matching exhaustiveness<a class="headerlink" href="#pattern-matching-exhaustiveness" title="Link to this heading">¶</a></h2>
 <p>Stainless verifies that pattern matching is exhaustive. The regular Scala compiler
 only considers the types of expression involved in pattern matching, but Stainless
 will consider information such as precondition to formally prove the
 exhaustiveness of pattern matching.</p>
 <p>As an example, the following code should issue a warning with Scala:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span> <span class="k">class</span> <span class="nc">List</span>
-<span class="k">case</span> <span class="k">class</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">head</span><span class="p">:</span> <span class="nc">Int</span><span class="p">,</span> <span class="n">tail</span><span class="p">:</span> <span class="nc">List</span><span class="p">)</span> <span class="k">extends</span> <span class="nc">List</span>
-<span class="k">case</span> <span class="k">object</span> <span class="nc">Nil</span> <span class="k">extends</span> <span class="nc">List</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">abstract</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">List</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">head</span><span class="p">:</span><span class="w"> </span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="n">tail</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">)</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span>
+<span class="k">case</span><span class="w"> </span><span class="k">object</span><span class="w"> </span><span class="nc">Nil</span><span class="w"> </span><span class="k">extends</span><span class="w"> </span><span class="nc">List</span>
 
-<span class="k">def</span> <span class="nf">getHead</span><span class="p">(</span><span class="n">l</span><span class="p">:</span> <span class="nc">List</span><span class="p">):</span> <span class="nc">Int</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="n">require</span><span class="p">(</span><span class="o">!</span><span class="n">l</span><span class="p">.</span><span class="k">isInstanceOf</span><span class="p">[</span><span class="nc">Nil</span><span class="p">])</span>
-  <span class="n">l</span> <span class="k">match</span> <span class="p">{</span>
-    <span class="k">case</span> <span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">_</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="n">x</span>
-  <span class="p">}</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">getHead</span><span class="p">(</span><span class="n">l</span><span class="p">:</span><span class="w"> </span><span class="nc">List</span><span class="p">):</span><span class="w"> </span><span class="nc">Int</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="n">require</span><span class="p">(</span><span class="o">!</span><span class="n">l</span><span class="p">.</span><span class="k">isInstanceOf</span><span class="p">[</span><span class="nc">Nil</span><span class="p">])</span>
+<span class="w">  </span><span class="n">l</span><span class="w"> </span><span class="k">match</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="k">case</span><span class="w"> </span><span class="nc">Cons</span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">_</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="n">x</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -340,8 +339,7 @@ <h2>Pattern matching exhaustiveness<a class="headerlink" href="#pattern-matching
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="options.html" class="btn btn-neutral float-left" title="Specifying Options" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="laws.html" class="btn btn-neutral float-right" title="Specifying Algebraic Properties" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -350,7 +348,7 @@ <h2>Pattern matching exhaustiveness<a class="headerlink" href="#pattern-matching
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -361,7 +359,7 @@ <h2>Pattern matching exhaustiveness<a class="headerlink" href="#pattern-matching
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });
diff --git a/wrap.html b/wrap.html
index d3cafecb27..a963331e31 100644
--- a/wrap.html
+++ b/wrap.html
@@ -1,23 +1,22 @@
 <!DOCTYPE html>
-<html class="writer-html5" lang="en" >
+<html class="writer-html5" lang="en" data-content_root="./">
 <head>
-  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+  <meta charset="utf-8" /><meta name="viewport" content="width=device-width, initial-scale=1" />
 
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Working With Existing Code &mdash; Stainless 0.9.1 documentation</title>
-  <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
-  <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
-      <link rel="stylesheet" href="_static/css/theme.css" type="text/css" />
+      <link rel="stylesheet" type="text/css" href="_static/pygments.css?v=80d5e7a1" />
+      <link rel="stylesheet" type="text/css" href="_static/css/theme.css?v=19f00094" />
+
+  
   <!--[if lt IE 9]>
     <script src="_static/js/html5shiv.min.js"></script>
   <![endif]-->
-  <script type="text/javascript" id="documentation_options" data-url_root="./" src="_static/documentation_options.js"></script>
-        <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
-        <script src="_static/jquery.js"></script>
-        <script src="_static/underscore.js"></script>
-        <script src="_static/doctools.js"></script>
-    <script type="text/javascript" src="_static/js/theme.js"></script>
+  
+        <script src="_static/documentation_options.js?v=9dc39874"></script>
+        <script src="_static/doctools.js?v=9a2dae69"></script>
+        <script src="_static/sphinx_highlight.js?v=dc90522c"></script>
+    <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
     <link rel="search" title="Search" href="search.html" />
     <link rel="next" title="Pure Scala" href="purescala.html" />
@@ -29,20 +28,23 @@
     <nav data-toggle="wy-nav-shift" class="wy-nav-side">
       <div class="wy-side-scroll">
         <div class="wy-side-nav-search" >
-            <a href="index.html" class="icon icon-home"> Stainless
+
+          
+          
+          <a href="index.html" class="icon icon-home">
+            Stainless
           </a>
               <div class="version">
                 0.9
               </div>
 <div role="search">
   <form id="rtd-search-form" class="wy-form" action="search.html" method="get">
-    <input type="text" name="q" placeholder="Search docs" />
+    <input type="text" name="q" placeholder="Search docs" aria-label="Search docs" />
     <input type="hidden" name="check_keywords" value="yes" />
     <input type="hidden" name="area" value="default" />
   </form>
 </div>
-        </div>
-        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Main">
+        </div><div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="Navigation menu">
               <ul class="current">
 <li class="toctree-l1"><a class="reference internal" href="intro.html">Introduction</a></li>
 <li class="toctree-l1"><a class="reference internal" href="installation.html">Installing Stainless</a></li>
@@ -77,20 +79,17 @@
       </div>
     </nav>
 
-    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">
-      <nav class="wy-nav-top" aria-label="Top" >
+    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap"><nav class="wy-nav-top" aria-label="Mobile navigation menu" >
           <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
           <a href="index.html">Stainless</a>
       </nav>
 
       <div class="wy-nav-content">
         <div class="rst-content">
-          
-
-<div role="navigation" aria-label="Breadcrumbs">
+          <div role="navigation" aria-label="Page navigation">
   <ul class="wy-breadcrumbs">
-      <li><a href="index.html" class="icon icon-home"></a> &raquo;</li>
-      <li>Working With Existing Code</li>
+      <li><a href="index.html" class="icon icon-home" aria-label="Home"></a></li>
+      <li class="breadcrumb-item active">Working With Existing Code</li>
       <li class="wy-breadcrumbs-aside">
             <a href="_sources/wrap.rst.txt" rel="nofollow"> View page source</a>
       </li>
@@ -101,69 +100,69 @@
            <div itemprop="articleBody">
              
   <section id="working-with-existing-code">
-<span id="wrap"></span><h1>Working With Existing Code<a class="headerlink" href="#working-with-existing-code" title="Permalink to this headline">¶</a></h1>
+<span id="wrap"></span><h1>Working With Existing Code<a class="headerlink" href="#working-with-existing-code" title="Link to this heading">¶</a></h1>
 <p>While the subset of Scala (namely, PureScala) that is currently supported by Stainless
 is already expressive enough to implement a lot of different data structures and algorithms,
 it is often the case that one would like to avoid re-implementing a piece of code from scratch
 in this fragment, but rather re-use some existing code, whether it is part of the codebase or
 pulled in from a Java or Scala library.</p>
 <section id="a-wrapper-for-triemap">
-<h2>A wrapper for TrieMap<a class="headerlink" href="#a-wrapper-for-triemap" title="Permalink to this headline">¶</a></h2>
+<h2>A wrapper for TrieMap<a class="headerlink" href="#a-wrapper-for-triemap" title="Link to this heading">¶</a></h2>
 <p>As a running example, let’s write a wrapper for the <code class="docutils literal notranslate"><span class="pre">scala.collection.concurrent.TrieMap</span></code> class.
 A first attempt to wrap it in a regular Stainless datatype could look like the following:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
 
-<span class="k">import</span> <span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">](</span><span class="n">theMap</span><span class="p">:</span> <span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">])</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">](</span><span class="n">theMap</span><span class="p">:</span><span class="w"> </span><span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">])</span>
 </pre></div>
 </div>
 <p>Unfortunately, this will not work as Stainless will complain that it does not
 know about the <code class="docutils literal notranslate"><span class="pre">TrieMap</span></code> type. In order to work around this, one can annotate
 the field with the <code class="docutils literal notranslate"><span class="pre">&#64;extern</span></code> annotation, which tells Stainless that the type
 should be treated as opaque.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
 
-<span class="k">import</span> <span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
-<span class="k">import</span> <span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">](</span><span class="nd">@extern</span> <span class="n">theMap</span><span class="p">:</span> <span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">])</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">](</span><span class="nd">@extern</span><span class="w"> </span><span class="n">theMap</span><span class="p">:</span><span class="w"> </span><span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">])</span>
 </pre></div>
 </div>
 </section>
 <section id="extern-methods">
-<h2>Extern methods<a class="headerlink" href="#extern-methods" title="Permalink to this headline">¶</a></h2>
+<h2>Extern methods<a class="headerlink" href="#extern-methods" title="Link to this heading">¶</a></h2>
 <p>Let’s now define a forwarding method for the <code class="docutils literal notranslate"><span class="pre">contains</span></code> method of <code class="docutils literal notranslate"><span class="pre">TrieMap</span></code>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
 
-<span class="k">import</span> <span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
-<span class="k">import</span> <span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">](</span><span class="nd">@extern</span> <span class="n">theMap</span><span class="p">:</span> <span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">])</span> <span class="p">{</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">](</span><span class="nd">@extern</span><span class="w"> </span><span class="n">theMap</span><span class="p">:</span><span class="w"> </span><span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">])</span><span class="w"> </span><span class="p">{</span>
 
-  <span class="k">def</span> <span class="nf">contains</span><span class="p">(</span><span class="n">k</span><span class="p">:</span> <span class="nc">K</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">theMap</span> <span class="n">contains</span> <span class="n">k</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">contains</span><span class="p">(</span><span class="n">k</span><span class="p">:</span><span class="w"> </span><span class="nc">K</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">theMap</span><span class="w"> </span><span class="n">contains</span><span class="w"> </span><span class="n">k</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>Once again, this will fail because, from Stainless’ point of view, <code class="docutils literal notranslate"><span class="pre">theMap</span></code> has an opaque type
 and thus has no <code class="docutils literal notranslate"><span class="pre">contains</span></code> method. By annotating the method itself with <code class="docutils literal notranslate"><span class="pre">&#64;extern</span></code>, Stainless will
 not attempt to extract the method’s body, and we can thus freely refer to any of <code class="docutils literal notranslate"><span class="pre">TrieMap</span></code>’s methods:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
 
-<span class="k">import</span> <span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
 
-<span class="k">case</span> <span class="k">class</span> <span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">](</span><span class="nd">@extern</span> <span class="n">theMap</span><span class="p">:</span> <span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">])</span> <span class="p">{</span>
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">](</span><span class="nd">@extern</span><span class="w"> </span><span class="n">theMap</span><span class="p">:</span><span class="w"> </span><span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">])</span><span class="w"> </span><span class="p">{</span>
 
-  <span class="nd">@extern</span>
-  <span class="k">def</span> <span class="nf">contains</span><span class="p">(</span><span class="n">k</span><span class="p">:</span> <span class="nc">K</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">theMap</span> <span class="n">contains</span> <span class="n">k</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="nd">@extern</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">contains</span><span class="p">(</span><span class="n">k</span><span class="p">:</span><span class="w"> </span><span class="nc">K</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">theMap</span><span class="w"> </span><span class="n">contains</span><span class="w"> </span><span class="n">k</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -175,18 +174,18 @@ <h2>Extern methods<a class="headerlink" href="#extern-methods" title="Permalink
 </div>
 </section>
 <section id="contracts">
-<h2>Contracts<a class="headerlink" href="#contracts" title="Permalink to this headline">¶</a></h2>
+<h2>Contracts<a class="headerlink" href="#contracts" title="Link to this heading">¶</a></h2>
 <p>Let’s also define another extern function, which creates a new empty map:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span> <span class="nc">TrieMapWrapper</span> <span class="p">{</span>
-  <span class="nd">@extern</span>
-  <span class="k">def</span> <span class="nf">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">]:</span> <span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="nc">TrieMapWrapper</span><span class="p">(</span><span class="nc">TrieMap</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">])</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="nd">@extern</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">]:</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="nc">TrieMapWrapper</span><span class="p">(</span><span class="nc">TrieMap</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">])</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">def</span> <span class="nf">prop1</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">wrapper</span> <span class="o">=</span> <span class="nc">TrieMapWrapper</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">String</span><span class="p">]</span>
-  <span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">wrapper</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">))</span> <span class="c1">// invalid</span>
+<span class="k">def</span><span class="w"> </span><span class="nf">prop1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">wrapper</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">String</span><span class="p">]</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">wrapper</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">))</span><span class="w"> </span><span class="c1">// invalid</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -194,25 +193,25 @@ <h2>Contracts<a class="headerlink" href="#contracts" title="Permalink to this he
 by itself that the result of <code class="docutils literal notranslate"><span class="pre">TrieMapWrapper.empty</span></code> does not contain any entries.</p>
 <p>We can remedy to that by adding a postcondition to the <code class="docutils literal notranslate"><span class="pre">empty</span></code> function which says that,
 for any key <code class="docutils literal notranslate"><span class="pre">k</span></code> of type <code class="docutils literal notranslate"><span class="pre">K</span></code>, the result of <code class="docutils literal notranslate"><span class="pre">TrieMapWrapper.empty</span></code> does not contain the key <code class="docutils literal notranslate"><span class="pre">k</span></code>.</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span> <span class="nc">TrieMapWrapper</span> <span class="p">{</span>
-  <span class="nd">@extern</span>
-  <span class="k">def</span> <span class="nf">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">]:</span> <span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="nc">TrieMapWrapper</span><span class="p">(</span><span class="nc">TrieMap</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">])</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span>
-    <span class="n">forall</span><span class="p">((</span><span class="n">k</span><span class="p">:</span> <span class="nc">K</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="o">!</span><span class="n">res</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="n">k</span><span class="p">))</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">object</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="nd">@extern</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">]:</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="nc">TrieMapWrapper</span><span class="p">(</span><span class="nc">TrieMap</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">])</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">    </span><span class="n">forall</span><span class="p">((</span><span class="n">k</span><span class="p">:</span><span class="w"> </span><span class="nc">K</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="o">!</span><span class="n">res</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="n">k</span><span class="p">))</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>The assertion above now verifies successfully.</p>
 </section>
 <section id="purity-annotations">
-<h2>Purity annotations<a class="headerlink" href="#purity-annotations" title="Permalink to this headline">¶</a></h2>
+<h2>Purity annotations<a class="headerlink" href="#purity-annotations" title="Link to this heading">¶</a></h2>
 <p>Let’s now see what happens when we call <code class="docutils literal notranslate"><span class="pre">contains</span></code> twice:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">prop1</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">wrapper</span> <span class="o">=</span> <span class="nc">TrieMapWrapper</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span> <span class="nc">String</span><span class="p">]</span>
-  <span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">wrapper</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">))</span>
-  <span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">wrapper</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">))</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">prop1</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">wrapper</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">Int</span><span class="p">,</span><span class="w"> </span><span class="nc">String</span><span class="p">]</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">wrapper</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">))</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">wrapper</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">))</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -228,12 +227,12 @@ <h2>Purity annotations<a class="headerlink" href="#purity-annotations" title="Pe
 by default that extern functions and methods mutate their arguments. Indeed, because Stainless
 does not know about the body of such methods, it cannot know whether such a function is pure or not.
 It is thus up to the user to instruct Stainless otherwise, by annotating the function with <code class="docutils literal notranslate"><span class="pre">&#64;pure</span></code>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span> <span class="k">class</span> <span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">](</span><span class="nd">@extern</span> <span class="n">theMap</span><span class="p">:</span> <span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">])</span> <span class="p">{</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">](</span><span class="nd">@extern</span><span class="w"> </span><span class="n">theMap</span><span class="p">:</span><span class="w"> </span><span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">])</span><span class="w"> </span><span class="p">{</span>
 
-  <span class="nd">@extern</span> <span class="nd">@pure</span>
-  <span class="k">def</span> <span class="nf">contains</span><span class="p">(</span><span class="n">k</span><span class="p">:</span> <span class="nc">K</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">theMap</span> <span class="n">contains</span> <span class="n">k</span>
-  <span class="p">}</span>
+<span class="w">  </span><span class="nd">@extern</span><span class="w"> </span><span class="nd">@pure</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">contains</span><span class="p">(</span><span class="n">k</span><span class="p">:</span><span class="w"> </span><span class="nc">K</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">theMap</span><span class="w"> </span><span class="n">contains</span><span class="w"> </span><span class="n">k</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -247,54 +246,54 @@ <h2>Purity annotations<a class="headerlink" href="#purity-annotations" title="Pe
 </pre></div>
 </div>
 <p>We can now define the other methods of interest, with their appropriate contract:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
-<span class="k">import</span> <span class="nn">scala</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="nn">meta</span><span class="p">.</span><span class="n">field</span>
-
-<span class="k">import</span> <span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
-
-<span class="k">case</span> <span class="k">class</span> <span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">](</span>
-  <span class="nd">@extern</span>
-  <span class="n">theMap</span><span class="p">:</span> <span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">]</span>
-<span class="p">)</span> <span class="p">{</span>
-
-  <span class="nd">@extern</span> <span class="nd">@pure</span>
-  <span class="k">def</span> <span class="nf">contains</span><span class="p">(</span><span class="n">k</span><span class="p">:</span> <span class="nc">K</span><span class="p">):</span> <span class="nc">Boolean</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">theMap</span> <span class="n">contains</span> <span class="n">k</span>
-  <span class="p">}</span>
-
-  <span class="nd">@extern</span>
-  <span class="k">def</span> <span class="nf">insert</span><span class="p">(</span><span class="n">k</span><span class="p">:</span> <span class="nc">K</span><span class="p">,</span> <span class="n">v</span><span class="p">:</span> <span class="nc">V</span><span class="p">):</span> <span class="nc">Unit</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">theMap</span><span class="p">.</span><span class="n">update</span><span class="p">(</span><span class="n">k</span><span class="p">,</span> <span class="n">v</span><span class="p">)</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span>
-    <span class="bp">this</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="n">k</span><span class="p">)</span> <span class="o">&amp;&amp;</span>
-    <span class="bp">this</span><span class="p">.</span><span class="n">apply</span><span class="p">(</span><span class="n">k</span><span class="p">)</span> <span class="o">==</span> <span class="n">v</span>
-  <span class="p">}</span>
-
-  <span class="nd">@extern</span> <span class="nd">@pure</span>
-  <span class="k">def</span> <span class="nf">apply</span><span class="p">(</span><span class="n">k</span><span class="p">:</span> <span class="nc">K</span><span class="p">):</span> <span class="nc">V</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="n">require</span><span class="p">(</span><span class="n">contains</span><span class="p">(</span><span class="n">k</span><span class="p">))</span>
-    <span class="n">theMap</span><span class="p">(</span><span class="n">k</span><span class="p">)</span>
-  <span class="p">}</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">lang</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">stainless</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="n">_</span>
+<span class="k">import</span><span class="w"> </span><span class="nn">scala</span><span class="p">.</span><span class="nn">annotation</span><span class="p">.</span><span class="nn">meta</span><span class="p">.</span><span class="n">field</span>
+
+<span class="k">import</span><span class="w"> </span><span class="nn">scala</span><span class="p">.</span><span class="nn">collection</span><span class="p">.</span><span class="nn">concurrent</span><span class="p">.</span><span class="nc">TrieMap</span>
+
+<span class="k">case</span><span class="w"> </span><span class="k">class</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">](</span>
+<span class="w">  </span><span class="nd">@extern</span>
+<span class="w">  </span><span class="n">theMap</span><span class="p">:</span><span class="w"> </span><span class="nc">TrieMap</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">]</span>
+<span class="p">)</span><span class="w"> </span><span class="p">{</span>
+
+<span class="w">  </span><span class="nd">@extern</span><span class="w"> </span><span class="nd">@pure</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">contains</span><span class="p">(</span><span class="n">k</span><span class="p">:</span><span class="w"> </span><span class="nc">K</span><span class="p">):</span><span class="w"> </span><span class="nc">Boolean</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">theMap</span><span class="w"> </span><span class="n">contains</span><span class="w"> </span><span class="n">k</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="nd">@extern</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">insert</span><span class="p">(</span><span class="n">k</span><span class="p">:</span><span class="w"> </span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="n">v</span><span class="p">:</span><span class="w"> </span><span class="nc">V</span><span class="p">):</span><span class="w"> </span><span class="nc">Unit</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">theMap</span><span class="p">.</span><span class="n">update</span><span class="p">(</span><span class="n">k</span><span class="p">,</span><span class="w"> </span><span class="n">v</span><span class="p">)</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="bp">this</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="n">k</span><span class="p">)</span><span class="w"> </span><span class="o">&amp;&amp;</span>
+<span class="w">    </span><span class="bp">this</span><span class="p">.</span><span class="n">apply</span><span class="p">(</span><span class="n">k</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="n">v</span>
+<span class="w">  </span><span class="p">}</span>
+
+<span class="w">  </span><span class="nd">@extern</span><span class="w"> </span><span class="nd">@pure</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">apply</span><span class="p">(</span><span class="n">k</span><span class="p">:</span><span class="w"> </span><span class="nc">K</span><span class="p">):</span><span class="w"> </span><span class="nc">V</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="n">require</span><span class="p">(</span><span class="n">contains</span><span class="p">(</span><span class="n">k</span><span class="p">))</span>
+<span class="w">    </span><span class="n">theMap</span><span class="p">(</span><span class="n">k</span><span class="p">)</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 
-<span class="k">object</span> <span class="nc">TrieMapWrapper</span> <span class="p">{</span>
-  <span class="nd">@extern</span> <span class="nd">@pure</span>
-  <span class="k">def</span> <span class="nf">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">]:</span> <span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span>
-    <span class="nc">TrieMapWrapper</span><span class="p">(</span><span class="nc">TrieMap</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span> <span class="nc">V</span><span class="p">])</span>
-  <span class="p">}</span> <span class="n">ensuring</span> <span class="p">{</span> <span class="n">res</span> <span class="o">=&gt;</span>
-    <span class="n">forall</span><span class="p">((</span><span class="n">k</span><span class="p">:</span> <span class="nc">K</span><span class="p">)</span> <span class="o">=&gt;</span> <span class="o">!</span><span class="n">res</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="n">k</span><span class="p">))</span>
-  <span class="p">}</span>
+<span class="k">object</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="nd">@extern</span><span class="w"> </span><span class="nd">@pure</span>
+<span class="w">  </span><span class="k">def</span><span class="w"> </span><span class="nf">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">]:</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">]</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">    </span><span class="nc">TrieMapWrapper</span><span class="p">(</span><span class="nc">TrieMap</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">K</span><span class="p">,</span><span class="w"> </span><span class="nc">V</span><span class="p">])</span>
+<span class="w"> </span><span class="p">}.</span><span class="n">ensuring</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">res</span><span class="w"> </span><span class="o">=&gt;</span>
+<span class="w">    </span><span class="n">forall</span><span class="p">((</span><span class="n">k</span><span class="p">:</span><span class="w"> </span><span class="nc">K</span><span class="p">)</span><span class="w"> </span><span class="o">=&gt;</span><span class="w"> </span><span class="o">!</span><span class="n">res</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="n">k</span><span class="p">))</span>
+<span class="w">  </span><span class="p">}</span>
 <span class="p">}</span>
 </pre></div>
 </div>
 <p>And we can now reason about our wrapper for <code class="docutils literal notranslate"><span class="pre">TrieMap</span></code>:</p>
-<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">prop2</span> <span class="o">=</span> <span class="p">{</span>
-  <span class="kd">val</span> <span class="n">wrapper</span> <span class="o">=</span> <span class="nc">TrieMapWrapper</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span> <span class="nc">String</span><span class="p">]</span>
-  <span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">wrapper</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">))</span>
-  <span class="n">wrapper</span><span class="p">.</span><span class="n">insert</span><span class="p">(</span><span class="mi">42</span><span class="p">,</span> <span class="s">&quot;Hello&quot;</span><span class="p">)</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">wrapper</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">))</span>
-  <span class="n">assert</span><span class="p">(</span><span class="n">wrapper</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span> <span class="o">==</span> <span class="s">&quot;Hello&quot;</span><span class="p">)</span>
+<div class="highlight-scala notranslate"><div class="highlight"><pre><span></span><span class="k">def</span><span class="w"> </span><span class="nf">prop2</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="p">{</span>
+<span class="w">  </span><span class="kd">val</span><span class="w"> </span><span class="n">wrapper</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="nc">TrieMapWrapper</span><span class="p">.</span><span class="n">empty</span><span class="p">[</span><span class="nc">BigInt</span><span class="p">,</span><span class="w"> </span><span class="nc">String</span><span class="p">]</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="o">!</span><span class="n">wrapper</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">))</span>
+<span class="w">  </span><span class="n">wrapper</span><span class="p">.</span><span class="n">insert</span><span class="p">(</span><span class="mi">42</span><span class="p">,</span><span class="w"> </span><span class="s">&quot;Hello&quot;</span><span class="p">)</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">wrapper</span><span class="p">.</span><span class="n">contains</span><span class="p">(</span><span class="mi">42</span><span class="p">))</span>
+<span class="w">  </span><span class="n">assert</span><span class="p">(</span><span class="n">wrapper</span><span class="p">(</span><span class="mi">42</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="s">&quot;Hello&quot;</span><span class="p">)</span>
 <span class="p">}</span>
 </pre></div>
 </div>
@@ -316,8 +315,7 @@ <h2>Purity annotations<a class="headerlink" href="#purity-annotations" title="Pe
 
            </div>
           </div>
-          <footer>
-    <div class="rst-footer-buttons" role="navigation" aria-label="Footer">
+          <footer><div class="rst-footer-buttons" role="navigation" aria-label="Footer">
         <a href="ghost.html" class="btn btn-neutral float-left" title="Ghost Context" accesskey="p" rel="prev"><span class="fa fa-arrow-circle-left" aria-hidden="true"></span> Previous</a>
         <a href="purescala.html" class="btn btn-neutral float-right" title="Pure Scala" accesskey="n" rel="next">Next <span class="fa fa-arrow-circle-right" aria-hidden="true"></span></a>
     </div>
@@ -326,7 +324,7 @@ <h2>Purity annotations<a class="headerlink" href="#purity-annotations" title="Pe
 
   <div role="contentinfo">
     <p>&#169; Copyright 2009-2021 EPFL, Lausanne.
-      <span class="lastupdated">Last updated on Dec 17, 2023.
+      <span class="lastupdated">Last updated on Aug 22, 2024.
       </span></p>
   </div>
 
@@ -337,7 +335,7 @@ <h2>Purity annotations<a class="headerlink" href="#purity-annotations" title="Pe
       </div>
     </section>
   </div>
-  <script type="text/javascript">
+  <script>
       jQuery(function () {
           SphinxRtdTheme.Navigation.enable(true);
       });