anchor.diff:  //
   //parse_as_infix("<>",(12,"right"));;
   //parse_as_infix("+",(1,"left"));;
  -//
  -//parse_term "x < x + 1";;
  -//
   
   //parse_as_infix("+",(16,"right"));;
positive.code: open NHol.canon
  open NHol.meson
  open NHol.quot
  
  // Modules Evaluation
  BETA_RULE;;         // forces equal module evaluation: maybe not needed
  mk_iff;;            // forces bool module evaluation
  MK_CONJ;;           // forces drule module evaluation
  _FALSITY_;;         // forces tactics module evaluation
  ITAUT_TAC;;         // forces itab module evaluation: maybe not needd
  mk_rewrites;;       // forces simp module evaluation
  EQ_REFL;;           // forces theorems module evaluation
  EXISTS_EQUATION;;   // forces ind_defs module evaluation
  ETA_AX;;            // forces class module evaluation
  o_DEF;;             // forces trivia module evaluation
  CONJ_ACI_RULE;;     // forces canon module evaluation
  ASM_MESON_TAC;;     // forces meson module evaluation
  lift_function;;     // forces quot module evaluation
  
  // Exception
  parse_term @"~(p /\ q) <=> ~p \/ ~q";;
  
negative.code: parse_term @"p \/ ~p";;
  ASSUME <| parse_term @"p /\ q";;
  
  parse_term @"x < 1 ==> p";;
  
  parse_term "x < x + 1";;
  
  // from this point we have to check
  
  ////ARITH_RULE <| parse_term "x < y \/ y <= x";;
  //
  //get_infix_status "==>";;
  