1. 03 Mar, 2011 1 commit
  2. 02 Mar, 2011 1 commit
  3. 25 Feb, 2011 1 commit
  4. 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
  5. 21 Feb, 2011 1 commit
  6. 14 Jan, 2011 1 commit
  7. 29 Dec, 2010 2 commits
  8. 14 Dec, 2010 1 commit
  9. 13 Dec, 2010 1 commit
  10. 23 Oct, 2010 1 commit
  11. 02 Oct, 2010 1 commit
  12. 25 Sep, 2010 1 commit
  13. 22 Sep, 2010 1 commit
  14. 20 Sep, 2010 3 commits
  15. 16 Sep, 2010 1 commit
  16. 26 Aug, 2010 4 commits
  17. 25 Aug, 2010 1 commit
  18. 17 Aug, 2010 1 commit
  19. 16 Aug, 2010 1 commit
  20. 21 Jul, 2010 1 commit
  21. 20 Jul, 2010 1 commit
  22. 17 Jul, 2010 1 commit
  23. 09 Jul, 2010 1 commit
  24. 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
  25. 29 Jun, 2010 1 commit
  26. 25 Jun, 2010 1 commit
  27. 24 Jun, 2010 1 commit
    • Andrei Paskevich's avatar
      - Convert the syntax of prototype declarations and type expressions · ddfa942e
      Andrei Paskevich authored
        in the logic language into (more or less) higher-order style.
        For example,
      
          logic func (x : int, y : int, 'a list) : (int, 'a) map list
      
          logic pred (bool, int * real)
      
        is now written:
          
          logic func (x y : int) (list 'a) : list (map int 'a)
      
          logic pred bool (int, real)
      
        Note that types use prefix notation (as in Coq) and the types
        of tuples are now written as (type1, type2, ..., typeN).
      
      - Use the same syntax of type expressions in the program language.
      
      - Allow binders of the form (x y:int) in the program language.
        
      ddfa942e
  28. 22 Jun, 2010 1 commit
  29. 17 Jun, 2010 1 commit
  30. 21 May, 2010 3 commits
  31. 07 May, 2010 1 commit