1. 27 Oct, 2012 1 commit
  2. 25 Oct, 2012 4 commits
  3. 23 Oct, 2012 1 commit
  4. 21 Oct, 2012 1 commit
  5. 19 Oct, 2012 1 commit
  6. 16 Oct, 2012 2 commits
  7. 15 Oct, 2012 2 commits
  8. 04 Oct, 2012 2 commits
  9. 03 Oct, 2012 1 commit
  10. 29 Sep, 2012 1 commit
    • Iavor S. Diatchki's avatar
      Add unary natural numbers to experiment on matching with literals. · 02998bd6
      Iavor S. Diatchki authored
      The idea is that when we want to match on type level nats, we should
      use `Nat1`, and use the `FromNat1` function to switch between the
      structured and unstructured representation of numbers.
      
      A bit of custom machinery is needed for this to work properly,
      because to go back (i.e., to solve FromNat1 x ~ 3) GHC needs to know
      that FromNat1 is an injective function.
      02998bd6
  11. 23 Sep, 2012 2 commits
  12. 21 Sep, 2012 1 commit
  13. 20 Sep, 2012 4 commits
  14. 17 Sep, 2012 1 commit
  15. 13 Sep, 2012 1 commit
  16. 09 Sep, 2012 1 commit
  17. 28 Aug, 2012 1 commit
  18. 24 Aug, 2012 1 commit
  19. 21 Aug, 2012 2 commits
  20. 20 Aug, 2012 1 commit
    • pcapriotti's avatar
      Improve definition of forever (#5205) · b3ef6457
      pcapriotti authored
      The previous implementation was:
      
          forever a = a >> forever a
      
      which can create a space leak in some cases, even with optimizations.
      The current implementation:
      
          forever a = let a' = a >> a' in a'
      
      prevents repeated thunk allocations by creating a single thunk for the
      final result, even without optimizations.
      b3ef6457
  21. 15 Aug, 2012 1 commit
  22. 13 Aug, 2012 1 commit
  23. 10 Aug, 2012 2 commits
  24. 08 Aug, 2012 1 commit
  25. 05 Aug, 2012 1 commit
  26. 02 Aug, 2012 1 commit
  27. 25 Jul, 2012 2 commits