Attention une mise à jour du service Gitlab va être effectuée le mardi 30 novembre entre 17h30 et 18h00. Cette mise à jour va générer une interruption du service dont nous ne maîtrisons pas complètement la durée mais qui ne devrait pas excéder quelques minutes. Cette mise à jour intermédiaire en version 14.0.12 nous permettra de rapidement pouvoir mettre à votre disposition une version plus récente.

  1. 07 Jul, 2010 1 commit
  2. 06 Jul, 2010 11 commits
  3. 05 Jul, 2010 11 commits
  4. 04 Jul, 2010 2 commits
    • 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.
    • Jean-Christophe Filliâtre's avatar
      programs: examples · f288825a
      Jean-Christophe Filliâtre authored
  5. 02 Jul, 2010 4 commits
  6. 01 Jul, 2010 1 commit
  7. 29 Jun, 2010 1 commit
  8. 28 Jun, 2010 1 commit
  9. 26 Jun, 2010 1 commit
  10. 25 Jun, 2010 6 commits
  11. 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.