1. 11 Jan, 2018 1 commit
  2. 15 Dec, 2017 1 commit
  3. 12 Apr, 2017 1 commit
  4. 15 Mar, 2016 3 commits
  5. 20 Mar, 2015 1 commit
  6. 19 Mar, 2015 1 commit
  7. 14 Mar, 2014 1 commit
  8. 14 Jan, 2014 1 commit
  9. 06 Mar, 2013 1 commit
  10. 06 Nov, 2012 1 commit
  11. 31 Oct, 2012 2 commits
  12. 20 Oct, 2012 1 commit
    • Andrei Paskevich's avatar
      simplify copyright headers · 11598d2b
      Andrei Paskevich authored
      + create AUTHORS file
      + fix the linking exception in LICENSE
      + update the "About" in IDE
      + remove the trailing whitespace
      + inflate my scores at Ohloh
      11598d2b
  13. 14 May, 2012 1 commit
  14. 09 May, 2012 1 commit
  15. 21 Apr, 2012 1 commit
  16. 19 Apr, 2012 2 commits
  17. 16 Apr, 2012 1 commit
  18. 09 Apr, 2012 1 commit
  19. 02 Jul, 2011 1 commit
  20. 01 Jul, 2011 2 commits
  21. 24 May, 2011 1 commit
  22. 16 May, 2011 1 commit
  23. 15 May, 2011 1 commit
  24. 05 Mar, 2011 1 commit
    • Andrei Paskevich's avatar
      store locations in term/formulas, not in labels · f530689a
      Andrei Paskevich authored
      - the new syntax for localisation "labels" in Why is as follows:
      
          goal Toto #"file" line bchar echar#     - after an ident
          #"file" line bchar echar" (A and B)     - before a term/fmla
      
      - the new syntax for buffer relocation is as follows:
      
          ##"file" line char##
      f530689a
  25. 14 Jan, 2011 1 commit
  26. 29 Dec, 2010 1 commit
  27. 26 Dec, 2010 1 commit
  28. 25 Dec, 2010 1 commit
  29. 13 Dec, 2010 1 commit
  30. 04 Dec, 2010 1 commit
  31. 17 Nov, 2010 1 commit
  32. 29 Oct, 2010 1 commit
  33. 26 Oct, 2010 1 commit
    • 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
  34. 11 Oct, 2010 1 commit
  35. 02 Oct, 2010 1 commit