1. 09 May, 2011 1 commit
  2. 30 Dec, 2010 2 commits
  3. 29 Dec, 2010 1 commit
  4. 24 Jun, 2010 2 commits
    • 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.
    • Jean-Christophe Filliâtre's avatar
      programs: lazy operators · 3167cf1f
      Jean-Christophe Filliâtre authored