1. 16 Nov, 2010 4 commits
  2. 13 Nov, 2010 1 commit
  3. 12 Nov, 2010 4 commits
  4. 10 Nov, 2010 1 commit
  5. 09 Nov, 2010 6 commits
  6. 08 Nov, 2010 1 commit
  7. 04 Nov, 2010 1 commit
  8. 03 Nov, 2010 2 commits
  9. 02 Nov, 2010 1 commit
  10. 01 Nov, 2010 1 commit
  11. 29 Oct, 2010 11 commits
  12. 28 Oct, 2010 5 commits
  13. 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