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