1. 02 Apr, 2015 1 commit
  2. 29 Mar, 2015 1 commit
  3. 26 Mar, 2015 1 commit
  4. 25 Mar, 2015 2 commits
  5. 20 Mar, 2015 1 commit
  6. 04 Mar, 2015 1 commit
  7. 27 Feb, 2015 1 commit
  8. 21 Feb, 2015 1 commit
  9. 20 Feb, 2015 1 commit
  10. 08 Jan, 2015 1 commit
  11. 19 Dec, 2014 2 commits
  12. 18 Dec, 2014 1 commit
  13. 16 Dec, 2014 4 commits
  14. 06 Dec, 2014 2 commits
  15. 01 Dec, 2014 1 commit
    • Kim Nguyễn's avatar
      Improve the complexity of constraint normalisation by using a hash · 7932c071
      Kim Nguyễn authored
      table instead of a 'recursion set' like in the paper.  The hash table
      is tricky:
      
       - its keys should be both the type we are normalizing and
      delta
      
       - we should store a flag together with the constraint set, indicating
      whether the computation of the normalization for the corresponding
      type has finished. If it has, we can use the associated constraint set
      instead of CS.sat and stop recursion. If it has not, we can return
      CS.sat (like the previous base case).
      
      We also update the test case files to check that everything is in order:
      
      - part2.cd has been rewritten to make use of the new syntax and remove
        the red-black trees examples that are now in a separate file
      
      - red-black.cd is a fully typechecking file
      - rb-fail.cd has the type definition and the wrong balance function.
      7932c071
  16. 27 Oct, 2014 2 commits
  17. 19 Sep, 2014 6 commits
  18. 18 Sep, 2014 3 commits
  19. 16 Sep, 2014 1 commit
  20. 12 Sep, 2014 2 commits
  21. 10 Sep, 2014 3 commits
  22. 31 Aug, 2014 2 commits