1. 15 Jun, 2018 1 commit
  2. 23 Mar, 2016 1 commit
  3. 03 Feb, 2014 1 commit
  4. 18 Dec, 2013 1 commit
  5. 07 Apr, 2013 1 commit
  6. 19 Mar, 2013 1 commit
  7. 13 Mar, 2013 1 commit
  8. 30 Jan, 2013 1 commit
    • Andrei Paskevich's avatar
      reorganize examples/ · 4b1bc2b0
      Andrei Paskevich authored
      - all programs with sessions are in examples/
      - all programs without sessions are in examples/in_progress/
        (if you have private sessions for those, just move them there)
      - all pure logical problems are in logic/
        (to simplify bench scripts and gallery building; they are few anyway)
      - all OCaml programs are in examples/use_api/
      - all strange stuff is in examples/misc/
        (most of it should probably go)
      - Claude's solutions for Foveoos 2011 are in examples/foveoos11-cm/
        (why do we need two sets of solutions for quite simple problems?)
      - hoare_logic, bitvectors, vacid_0_binary_heaps are in examples/
      
      Bench scripts and documentation are updated.
      Also, bench/bench is simplified a little bit.
      4b1bc2b0
  9. 12 Oct, 2012 1 commit
  10. 30 Jun, 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. 20 May, 2011 1 commit
  13. 16 May, 2011 1 commit
  14. 13 May, 2011 1 commit
  15. 28 Apr, 2011 1 commit
  16. 02 Jan, 2011 1 commit
  17. 30 Dec, 2010 1 commit
  18. 29 Dec, 2010 1 commit
  19. 28 Oct, 2010 1 commit
  20. 26 Oct, 2010 1 commit
  21. 12 Oct, 2010 1 commit
  22. 20 Sep, 2010 1 commit
  23. 07 Jul, 2010 1 commit
  24. 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
  25. 21 Jun, 2010 2 commits
  26. 18 Jun, 2010 2 commits
  27. 17 Jun, 2010 4 commits