1. 19 Nov, 2013 5 commits
  2. 11 Nov, 2013 2 commits
  3. 09 Nov, 2013 1 commit
  4. 27 Oct, 2013 1 commit
    • Andrei Paskevich's avatar
      Dexpr: polymorphic recursion only for fully specified functions · f26c42c4
      Andrei Paskevich authored
      If we generalize on varible-by-variable basis, then the following
      letrecs are not the same:
      
        let rec f (x:'a) y = (x = y) and g (z:int) = f z z  // typechecks
        let rec g (z:int) = f z z and f (x:'a) y = (x = y)  // does not
      
      In the first case, we unify the type of y with 'a, and thus
      f is fully generalized in the definition of g. In the second
      case, we unify the non-generazled second argument of f with int,
      and the definition of f does not typecheck.
      
      Also: accept implicit type variables in programs.
      f26c42c4
  5. 26 Oct, 2013 1 commit
  6. 24 Oct, 2013 1 commit
  7. 23 Oct, 2013 1 commit
  8. 22 Oct, 2013 1 commit