1. 11 Apr, 2016 1 commit
  2. 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
  3. 12 Oct, 2012 1 commit
  4. 01 Feb, 2012 1 commit
  5. 05 Aug, 2011 1 commit
  6. 01 Aug, 2011 1 commit
  7. 06 Jul, 2011 1 commit
  8. 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
  9. 20 May, 2011 1 commit
  10. 16 May, 2011 1 commit
  11. 08 Apr, 2011 1 commit
  12. 03 Apr, 2011 1 commit
  13. 30 Dec, 2010 1 commit
  14. 29 Dec, 2010 1 commit
  15. 09 Nov, 2010 1 commit
  16. 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
    • Jean-Christophe Filliâtre's avatar
      programs: as a side-effect of the new for loop, the syntax 'variant {t} for R'... · 872879a7
      Jean-Christophe Filliâtre authored
      programs: as a side-effect of the new for loop, the syntax 'variant {t} for R' is changed into 'variant {t} with R' (no big deal, it is rarely used)
      872879a7
  17. 25 Jun, 2010 3 commits