1. 15 Mar, 2016 2 commits
  2. 20 Mar, 2015 1 commit
  3. 19 Mar, 2015 1 commit
  4. 22 Oct, 2014 1 commit
  5. 14 Mar, 2014 1 commit
  6. 20 Jan, 2014 1 commit
    • Andrei Paskevich's avatar
      WhyML: add "diverges", "reads {}", and "writes {}" effect clauses · 83858597
      Andrei Paskevich authored
      - "diverges" states that the computation may not terminate (which
        does not mean that is always diverges: just as any other effect
        annotation, this clause states a possibility of a side effect).
      
      - "reads {}" states that the computation does not access any variable
        except those that are listed elsewhere in the specification (or the
        proper function arguments, if "reads" is in a function spec).
      
      - "writes {}" states that the computation does not modify any mutable
        value.
      
      - If a function definition or an abstract computation may diverge,
        but there is no "diverges" clause in the specification, a warning
        is produced. If a function definition or an abstract computation
        always terminates, but there is a "diverges" clause in the spec,
        an error is produced.
      
      - If there is a "reads" or a "writes" clause in a function definition
        or an abstract computation, then every modified value must be listed
        in "writes" and every accessed external variable not mentioned in
        the spec must be listed in "reads". (Notice that this is a stricter
        requirement than before, when the presence of a "writes" clause
        did not require to specify "reads".) However, one does not have to
        write "reads {}" or "writes {}" if the corresponding lists are empty.
      83858597
  7. 25 Nov, 2013 1 commit
    • Andrei Paskevich's avatar
      WhyML: generalize in let-in (value restriction) · 07d793f0
      Andrei Paskevich authored
      Up to now, WhyML managed without generalization in let-in,
      since we only generalized function definitions in Erec.
      This patch adds generalization of arrow-types values,
      such as effectless Eany (= abstract local functions),
      anonymous functions and psymbols.
      07d793f0
  8. 24 Nov, 2013 1 commit
  9. 19 Nov, 2013 5 commits
  10. 11 Nov, 2013 2 commits
  11. 09 Nov, 2013 1 commit
  12. 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
  13. 26 Oct, 2013 1 commit
  14. 24 Oct, 2013 1 commit
  15. 23 Oct, 2013 1 commit
  16. 22 Oct, 2013 1 commit