1. 15 Jun, 2018 1 commit
  2. 14 Jun, 2018 1 commit
  3. 01 Jun, 2018 1 commit
  4. 31 May, 2018 1 commit
    • Jean-Christophe Filliatre's avatar
      new VC to prove well-foundedness of user-provided variants · 4af9081d
      Jean-Christophe Filliatre authored
      fixes issue #57
      
      a new theory relations.WellFounded is introduced for this purpose
      (and must be imported whenever one wants to make use of a custom
      relation for a variant)
      
      it defines, inductively, a notion of accessibility for a given
      predicate R (x is accessible whenever all elements smaller than x for R
      are alreay accessible)
      
      whenever one has to prove that a variant decreases, a new VC is also
      generated, to show that the old value of the variant is accessible
      for the order relation
      
      note: accessibility being defined inductively, proving well-foundedness
      is out of reach of SMT solvers; but at least this is sound now
      4af9081d
  5. 22 Dec, 2017 1 commit
  6. 15 Dec, 2017 1 commit
  7. 03 Sep, 2014 1 commit
  8. 21 Aug, 2014 1 commit
  9. 20 Aug, 2014 2 commits
  10. 07 Apr, 2014 1 commit
  11. 31 Mar, 2014 1 commit
  12. 12 Oct, 2012 1 commit
  13. 07 May, 2012 1 commit
  14. 22 Apr, 2012 1 commit
  15. 19 Sep, 2011 1 commit
  16. 22 Aug, 2011 1 commit
  17. 29 Jun, 2011 1 commit
    • Andrei Paskevich's avatar
      several changes in syntax · aa2c430e
      Andrei Paskevich authored
      - No more "and", "or", "implies", "iff", and "~".
        Use "/\", "\/", "->", "<->", and "not" instead.
      
      - No more "logic". Use "function" or "predicate".
      aa2c430e
  18. 25 Jun, 2010 2 commits
  19. 24 Jun, 2010 1 commit
    • Andrei Paskevich's avatar
      - Convert the syntax of prototype declarations and type expressions · ddfa942e
      Andrei Paskevich authored
        in the logic language into (more or less) higher-order style.
        For example,
      
          logic func (x : int, y : int, 'a list) : (int, 'a) map list
      
          logic pred (bool, int * real)
      
        is now written:
          
          logic func (x y : int) (list 'a) : list (map int 'a)
      
          logic pred bool (int, real)
      
        Note that types use prefix notation (as in Coq) and the types
        of tuples are now written as (type1, type2, ..., typeN).
      
      - Use the same syntax of type expressions in the program language.
      
      - Allow binders of the form (x y:int) in the program language.
        
      ddfa942e
  20. 21 Jun, 2010 2 commits
  21. 02 Apr, 2010 1 commit
  22. 30 Mar, 2010 2 commits
  23. 25 Mar, 2010 1 commit