1. 02 May, 2018 1 commit
    • Dan Frumin's avatar
      Simplify the Treiber stack refinement · bf38948f
      Dan Frumin authored
      The simplification is acheieved by removing the stackUR workaround.
      That RA was used to enusure that the nodes that were parts of the
      stack do not change themselves -- this is crucial for the safety of
      pop and iter operations.
      
      Now this is achieved by using duplicable propositions (∃ q, n ↦ᵢ{q} v)
      to ensure that the node are still alive/not freed.
      bf38948f
  2. 31 Jan, 2018 2 commits
  3. 28 Jan, 2018 1 commit
  4. 07 Dec, 2017 1 commit
  5. 27 Nov, 2017 1 commit
  6. 13 Sep, 2017 2 commits
  7. 12 Sep, 2017 1 commit