checkpoint before case

src/Lib/Check.idr

@@ -168,7 +168,15 @@ infer : Context -> Raw  -> M  (Tm, Val)
 
 export
 check : Context -> Raw -> Val  -> M  Tm
+
+
+
+checkAlt : Context -> CaseAlt -> M ()
+
 check ctx tm ty = case (tm, !(forceType ty)) of
+  (RCase rsc alts, ty) => do
+    (sc, scty) <- infer ctx rsc
+    error [DS "implement check RCase sctype \{show scty}"]
   (RSrcPos x tm, ty) => check ({pos := x} ctx) tm ty
   -- Document a hole, pretend it's implemented
   (RHole, ty) => do
@@ -298,6 +306,7 @@ infer ctx tm = error [DS "Implement infer \{show tm}"]
 -- infer ctx (RLit (LInt i)) = ?rhs_11
 -- infer ctx (RLit (LBool x)) = ?rhs_12
 -- infer ctx (RCase tm xs) = ?rhs_9
--- infer ctx RImplicit = ?todo_meta2
+
 -- The idea here is to insert a hole for a parse error
+-- but the parser doesn't emit this yet.
 -- infer ctx (RParseError str) = ?todo_insert_meta

src/Lib/Parser.idr

@@ -149,7 +149,7 @@ pPattern
 
 caseAlt : Parser CaseAlt
 caseAlt = do
-  pat <- pPattern -- term and sort it out later?
+  pat <- parseOp -- pPattern -- term and sort it out later?
   keyword "=>"
   commit
   t <- term

src/Lib/ProcessDecl.idr

@@ -20,7 +20,6 @@ processDecl (TypeSig nm tm) = do
   putStrLn "got \{pprint [] ty'}"
   modify $ claim nm ty'
 
--- FIXME - this should be in another file
 processDecl (Def nm raw) = do
   putStrLn "-----"
   putStrLn "def \{show nm}"
@@ -43,6 +42,7 @@ processDecl (Def nm raw) = do
   for_ mc.metas $ \case
     (Solved k x) => pure ()
     (Unsolved (l,c) k xs) => do
+      -- should just print, but it's too subtle in the sea of messages
       -- putStrLn "ERROR at (\{show l}, \{show c}): Unsolved meta \{show k}"
       throwError $ E (l,c) "Unsolved meta \{show k}"
 
@@ -71,21 +71,24 @@ processDecl (Data nm ty cons) = do
   -- It seems like the FC for the errors are not here?
   ctx <- get
   tyty <- check (mkCtx ctx.metas) ty VU
-  -- TODO check tm is VU or Pi ending in VU
+  -- FIXME we need this in scope, but need to update
-  -- Maybe a pi -> binders function
-  -- TODO we're putting in axioms, we need constructors
-  -- for each constructor, check and add
   modify $ claim nm tyty
   ctx <- get
-  for_ cons $ \x => case x of
+  cnames <- for cons $ \x => case x of
       -- expecting tm to be a Pi type
       (TypeSig nm' tm) => do
           ctx <- get
           -- TODO check pi type ending in full tyty application
+          -- TODO count arity
           dty <- check (mkCtx ctx.metas) tm VU
-          modify $ claim nm' dty
+          modify $ defcon nm' 0 nm dty
-      _ => throwError $ E (0,0) "expected TypeSig"
+          pure nm'
-
+      _ => throwError $ E (0,0) "expected constructor declaration"
+  -- TODO check tm is VU or Pi ending in VU
+  -- Maybe a pi -> binders function
+  -- TODO we're putting in axioms, we need constructors
+  -- for each constructor, check and add
+  modify $ deftype nm tyty cnames
   pure ()
   where
     checkDeclType : Tm -> M ()

src/Lib/Syntax.idr

@@ -25,7 +25,7 @@ data Pattern
 
 -- could be a pair, but I suspect stuff will be added?
 public export
-data CaseAlt = MkAlt Pattern Raw
+data CaseAlt = MkAlt Raw Raw
 
 data Raw : Type where
   RVar : (nm : Name) -> Raw
@@ -113,6 +113,7 @@ Show Pattern where
   show PatWild = "PatWild"
   show (PatLit x) = foo ["PatLit" , show x]
 
+covering
 Show CaseAlt where
   show (MkAlt x y)= foo ["MkAlt", show x, assert_total $ show y]
 

src/Lib/TopContext.idr

@@ -28,6 +28,16 @@ public export
 claim : String -> Tm -> TopContext -> TopContext
 claim name ty = { defs $= (MkEntry name ty Axiom ::) }
 
+
+public export
+deftype : String -> Tm -> List String -> TopContext -> TopContext
+deftype name ty cons = { defs $= (MkEntry name ty (TCon cons) :: )}
+
+public export
+defcon : String -> Nat -> String -> Tm -> TopContext -> TopContext
+defcon cname arity tyname ty = { defs $= (MkEntry cname ty (DCon arity tyname) ::) }
+
+
 -- TODO update existing, throw, etc.
 
 public export

src/Lib/Types.idr

@@ -231,12 +231,12 @@ record MetaContext where
 
 
 public export
-data Def = Axiom | TCon (List String) | DCon Nat | Fn Tm
+data Def = Axiom | TCon (List String) | DCon Nat String | Fn Tm
 
 Show Def where
   show Axiom = "axiom"
   show (TCon strs) = "TCon \{show strs}"
-  show (DCon k) = "DCon \{show k}"
+  show (DCon k tyname) = "DCon \{show k} \{show tyname}"
   show (Fn t) = "Fn \{show t}"
 
 ||| entry in the top level context