1. 03 Jun, 2011 3 commits
  2. 02 Jun, 2011 1 commit
  3. 31 May, 2011 1 commit
  4. 24 May, 2011 1 commit
  5. 20 May, 2011 1 commit
  6. 16 May, 2011 1 commit
  7. 15 May, 2011 5 commits
  8. 27 Apr, 2011 1 commit
  9. 23 Feb, 2011 2 commits
    • Andrei Paskevich's avatar
    • Andrei Paskevich's avatar
      be more stricte in accepting inductives and algebraics · efaf0dc2
      Andrei Paskevich authored
      1. We only accept an algebraic type declaration
      
          T 'a1 ... 'aN
      
      whenever every constructor has ls_value = Some (T 'a1 ... 'aN),
      no type variable renaming is allowed.
      
      2. We only accept an inductive predicate declaration
      
          P (_x1 : T1) ... (_xN : TN)
      
      whenever every inductive clause has a conclusion of the form
      (P (t1 : T1) ... (tN : TN)), no type variable renaming is allowed.
      
      3. To this purpose, we must typecheck the whole (mutual) inductive
      declaration group in the same denv. This must be ok, since user-named
      type variables cannot be destructively instantiated anyway. However,
      I'd like Jean-Christoph to check my changes in Typing.add_inductives.
      efaf0dc2
  10. 12 Jan, 2011 1 commit
  11. 26 Dec, 2010 1 commit
  12. 25 Dec, 2010 1 commit
  13. 13 Dec, 2010 1 commit
  14. 09 Dec, 2010 1 commit
    • Andrei Paskevich's avatar
      add inline_goal to transform/inlining · 349a0eb4
      Andrei Paskevich authored
      + change inline_trivial: now we only inline right-linear
      definitions where no variable occurs deeper than level 1.
      
      Attention: this inlines definitions with arbitrarily complex
      ground terms on the right-hand side - which might be a BAD IDEA,
      but I still want to give it a try.
      
      + add find_logic_definition to Decl
      349a0eb4
  15. 26 Nov, 2010 1 commit
  16. 16 Nov, 2010 3 commits
  17. 10 Nov, 2010 1 commit
  18. 09 Nov, 2010 1 commit
  19. 29 Oct, 2010 1 commit
  20. 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
  21. 27 Sep, 2010 1 commit
  22. 25 Aug, 2010 1 commit
  23. 18 Aug, 2010 1 commit
  24. 17 Aug, 2010 1 commit
  25. 21 Jul, 2010 1 commit
  26. 17 Jul, 2010 1 commit
  27. 15 Jul, 2010 3 commits
  28. 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