1. 01 Nov, 2017 1 commit
    • Robbert Krebbers's avatar
      Add an `AsVal` type class. · b2ed0162
      Robbert Krebbers authored
      This class, in combination with `TCForall`, turns out the useful in
      LambdaRust to express that lists of expressions are values.
      b2ed0162
  2. 29 Oct, 2017 2 commits
  3. 04 Oct, 2017 1 commit
  4. 25 Sep, 2017 2 commits
  5. 24 Sep, 2017 1 commit
  6. 20 Sep, 2017 1 commit
  7. 14 Mar, 2017 1 commit
  8. 05 Jan, 2017 1 commit
  9. 04 Jan, 2017 1 commit
  10. 03 Jan, 2017 1 commit
  11. 09 Dec, 2016 1 commit
  12. 06 Dec, 2016 2 commits
  13. 22 Nov, 2016 1 commit
  14. 25 Aug, 2016 1 commit
  15. 08 Aug, 2016 1 commit
  16. 20 Jul, 2016 1 commit
  17. 19 Jul, 2016 1 commit
    • Robbert Krebbers's avatar
      Solve atomic also using reification/vm_compute. · 2966b4da
      Robbert Krebbers authored
      I also reverted 7952bca4 since there is no need for atomic to be a
      boolean predicate anymore. Moreover, I introduced a hint database
      fsaV for solving side-conditions related to FSAs, in particular,
      side-conditions related to expressions being atomic.
      2966b4da
  18. 19 Apr, 2016 1 commit
  19. 07 Apr, 2016 1 commit
  20. 18 Mar, 2016 1 commit
  21. 10 Mar, 2016 1 commit
  22. 02 Mar, 2016 2 commits
  23. 13 Feb, 2016 1 commit
  24. 11 Feb, 2016 1 commit
  25. 04 Feb, 2016 1 commit
  26. 02 Feb, 2016 3 commits
    • Ralf Jung's avatar
      reduce imports of language.v · 114b46c7
      Ralf Jung authored
      114b46c7
    • Ralf Jung's avatar
    • Robbert Krebbers's avatar
      Clean up heap_lang and remove some FIXMEs. · 15058014
      Robbert Krebbers authored
      Notable changes:
      * I am now using the same names for the fields of the language record and the
        instances in heap_lang. In order to deal with shadowing, I have put all
        definitions in heap_lang.v in a module.
      * Instead of defining evaluation contexts recursively, these are now defined
        using lists. This way we can easily reuse operations on lists. For example,
        composition of evaluation contexts is just appending lists. Also, it allowed
        me to simplify the rather complicated proof of step_by_val as induction on
        the shape of contexts no longer results in a blow-up of the number of cases.
      * Use better automation to prove all lemmas of heap_lang.
      * I have introduced tactics to invert steps and to do steps. These tactics
        greatly helped simplifying boring parts of lifting lemmas.
      15058014
  27. 01 Feb, 2016 2 commits
  28. 21 Jan, 2016 1 commit
  29. 19 Jan, 2016 3 commits
  30. 17 Jan, 2016 2 commits