1. 16 Nov, 2010 2 commits
  2. 10 Nov, 2010 1 commit
  3. 09 Nov, 2010 1 commit
  4. 29 Oct, 2010 1 commit
  5. 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
  6. 27 Sep, 2010 1 commit
  7. 25 Aug, 2010 1 commit
  8. 18 Aug, 2010 1 commit
  9. 17 Aug, 2010 1 commit
  10. 21 Jul, 2010 1 commit
  11. 17 Jul, 2010 1 commit
  12. 15 Jul, 2010 3 commits
  13. 07 Jul, 2010 2 commits
    • Andrei Paskevich's avatar
      Reworking tags and transformations, stage 2: · 157f4a5c
      Andrei Paskevich authored
      - dependent transformations (ones that depend on cloning history
        and/or metaproperties) have now the same type Trans.trans and
        can be registered via Trans, too.
      - load_driver accumulates appropriate tdecls to be appended to
        tasks before transformation/printing.
      
      At this moment, we have almost everything in place and are ready
      to remove Register module (subsumed by Trans and Printer in core/)
      and Prover module (its functions will move to Driver), and convert
      all printers and transformations to use the new infrastructure. 
      
      Not implemented yet:
      - appending driver-imposed tdecls to tasks - when and where?
      - metas-options - what is the best way to implement them?
      - syntax/typing for metas in theories and drivers.
      157f4a5c
    • Francois Bobot's avatar
      print-namespace : print the kind of the lemmas · 2185d5bd
      Francois Bobot authored
      completion : complete theories and goals
      2185d5bd
  14. 04 Jul, 2010 1 commit
    • Andrei Paskevich's avatar
      reworking tags and transformations, stage 1: · 18a0e0b0
      Andrei Paskevich authored
      - introduce a new Theory.tdecl "Meta" to be used for tags
      - simplify cloning procedure, get rid of the th_clone field
      - when a goal proposition is discarded during cloning, 
        it's still keeped in the theory as a "skip proposition",
        this is needed to preserve/clone every local identifier.
        Skip propositions are eliminated during task formation.
      - get rid of a separate Task.tdecl type
      - reorganize the Task.task_hd record:
        * use/clone history is cached in a theory-keyed map;
        * meta-properties are cached in a tagname-keyed map.
        This is done to simplify the fine-grained configuration
        of transformations.
      18a0e0b0
  15. 02 Jul, 2010 1 commit
  16. 25 Jun, 2010 1 commit
  17. 17 Jun, 2010 2 commits
  18. 28 May, 2010 1 commit
  19. 28 Apr, 2010 1 commit
  20. 19 Apr, 2010 1 commit
  21. 28 Mar, 2010 1 commit
  22. 27 Mar, 2010 1 commit
  23. 26 Mar, 2010 1 commit
  24. 23 Mar, 2010 2 commits
  25. 22 Mar, 2010 2 commits
  26. 21 Mar, 2010 2 commits
  27. 19 Mar, 2010 3 commits
  28. 18 Mar, 2010 2 commits
  29. 17 Mar, 2010 1 commit