simplify the Term again

src/GF/Compile/Concrete/Compute.hs

@@ -132,8 +132,6 @@ computeTermOpt rec gr = comput True where
 
          _   -> returnC $ P t' l
 
-     PI t l i -> comp g $ P t l -----
-
      S t v -> do
        t' <- compTable g t
        v' <- comp g v

src/GF/Compile/Concrete/TypeCheck.hs

@@ -131,7 +131,6 @@ inferLType gr g trm = case trm of
                        Just x  -> return x
        _          -> checkError (text "record type expected for:" <+> ppTerm Unqualified 0 t $$
                                  text " instead of the inferred:" <+> ppTerm Unqualified 0 ty')
-   PI t i _ -> inferLType gr g $ P t i
 
    R r -> do
      let (ls,fs) = unzip r

src/GF/Compile/GrammarToGFCC.hs

@@ -436,7 +436,6 @@ term2term fun cgr env@(labels,untyps,typs) tr = case tr of
   R rs    -> R [(mkLab i, (Nothing, t2t t)) | 
                  (i,(l,(_,t))) <- zip [0..] (GM.sortRec (unlock rs))]
   P  t l   -> r2r tr
-  PI t l i -> EInt $ toInteger i
 
   T (TWild _) _ -> error $ (render (text "wild" <+> ppTerm Qualified 0 tr))
   T (TComp  ty) cs  -> t2t $ V ty $ map snd cs ---- should be elim'ed in tc