All Versions
32
Latest Version
Avg Release Cycle
66 days
Latest Release
1508 days ago

Changelog History
Page 3

  • v0.4.3 Changes

    July 18, 2016
    • 🛠 Fixes bugs:
      • False positive: "f :: (CLog 2 (2 ^ n) ~ n, (1 <=? n) ~ True) => Proxy n -> Proxy (n+d)"

  • v0.4.2 Changes

    July 08, 2016
    • Find more unifications:
      • (2*e ^ d) ~ (2*e*a*c) ==> [a*c := 2*e ^ (d-1)]
      • a^d * a^e ~ a^c ==> [c := d + e]
      • x+5 ~ y ==> [x := y - 5], but only when x+5 ~ y is a given constraint

  • v0.4.1 Changes

    February 04, 2016
    • Find more unifications:
      • F x y k z ~ F x y (k-1+1) z ==> [k := k], where F can be any type function

  • v0.4 Changes

    January 19, 2016
    • Stop using 'provenance' hack to create conditional evidence (GHC 8.0+ only)
    • Find more unifications:
      • F x + 2 - 1 - 1 ~ F x ==> [F x := F x], where F can be any type function with result Nat.

  • v0.3.2 Changes

    • Find more unifications:
      • (z ^ a) ~ (z ^ b) ==> [a := b]
      • (i ^ a) ~ j ==> [a := round (logBase i j)], when i and j are integers, and ceiling (logBase i j) == floor (logBase i j).

  • v0.3.1 Changes

    October 19, 2015
    • Find more unifications:
      • (i * a) ~ j ==> [a := div j i], when i and j are integers, and mod j i == 0.
      • (i * a) + j ~ k ==> [a := div (k-j) i], when i, j, and k are integers, and k-j >= 0 and mod (k-j) i == 0.

  • v0.3 Changes

    June 03, 2015
    • Find more unifications:
      • <TyApp xs> + x ~ 2 + x ==> [<TyApp xs> ~ 2]
    • 🛠 Fixes bugs:
      • Unifying a*b ~ b now returns [a ~ 1]; before it erroneously returned [a ~ ], which is interpred as [a ~ 0]...
      • Unifying a+b ~ b now returns [a ~ 0]; before it returned the undesirable, though equal, [a ~ ]

  • v0.2.1 Changes

    May 06, 2015
    • ⚡️ Update Eq instance of SOP: Empty SOP is equal to 0

  • v0.2 Changes

    April 22, 2015
    • Finds more unifications:
      • (2 + a) ~ 5 ==> [a := 3]
      • (3 * a) ~ 0 ==> [a := 0]

  • v0.1.2 Changes

    April 21, 2015
    • Don't simplify expressions with negative exponents