1. 01 Sep, 2012 1 commit
  2. 18 May, 2012 1 commit
  3. 22 Apr, 2012 2 commits
  4. 20 Apr, 2012 1 commit
  5. 19 Apr, 2012 1 commit
  6. 06 Feb, 2012 1 commit
  7. 14 Dec, 2011 1 commit
  8. 05 Sep, 2011 1 commit
  9. 04 Sep, 2011 1 commit
  10. 01 Jul, 2011 2 commits
  11. 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
  12. 21 Jun, 2011 1 commit
  13. 16 Jun, 2011 1 commit
  14. 09 May, 2011 1 commit
  15. 08 Apr, 2011 1 commit
  16. 26 Oct, 2010 1 commit
  17. 25 Oct, 2010 1 commit
  18. 19 Oct, 2010 1 commit
  19. 09 Jul, 2010 1 commit
  20. 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
  21. 21 Jun, 2010 2 commits
  22. 24 Mar, 2010 1 commit
  23. 23 Mar, 2010 1 commit