1. 26 Nov, 2011 1 commit
  2. 28 Sep, 2011 1 commit
  3. 23 Sep, 2011 1 commit
  4. 18 Sep, 2011 1 commit
  5. 08 Sep, 2011 1 commit
  6. 05 Sep, 2011 1 commit
  7. 04 Sep, 2011 1 commit
  8. 05 Aug, 2011 2 commits
  9. 03 Aug, 2011 1 commit
  10. 01 Aug, 2011 1 commit
  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. 18 Apr, 2011 1 commit
  15. 10 Apr, 2011 1 commit
  16. 08 Apr, 2011 1 commit
  17. 06 Apr, 2011 1 commit
  18. 04 Apr, 2011 1 commit
  19. 16 Mar, 2011 1 commit
  20. 25 Jan, 2011 1 commit
  21. 24 Jan, 2011 1 commit
  22. 29 Oct, 2010 1 commit
  23. 26 Oct, 2010 2 commits
    • Andrei Paskevich's avatar
      verify termination (à la Fixpoint) of recursive logic definitions · f92739a1
      Andrei Paskevich authored
      the verification algorithm must always terminate and be reasonably
      performant in practice, but its worst-case complexity is unknown
      and probably exponential. What is quite easy when there is only
      one recursive definition, becomes difficult when there is a group
      of mutually recursive definitions. An educated discussion would
      be highly appreciated.
      
      BTW, I had to convert a couple of recursive "logic"s on integers
      into an abstract "logic" + axiom. Pretty much all of them supposed
      that the argument was non-negative, and thus were non-terminating!
      f92739a1
    • Andrei Paskevich's avatar
      efcc1da1
  24. 25 Oct, 2010 1 commit
  25. 19 Oct, 2010 1 commit
  26. 07 Oct, 2010 1 commit
  27. 18 Aug, 2010 1 commit
  28. 05 Jul, 2010 1 commit
  29. 04 Jul, 2010 1 commit
  30. 25 Jun, 2010 2 commits
  31. 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
  32. 21 Jun, 2010 2 commits
  33. 26 May, 2010 1 commit
  34. 05 May, 2010 1 commit
  35. 27 Apr, 2010 1 commit
  36. 02 Apr, 2010 1 commit