git.iko.soy/Idris-dev
on 9c6ea4a help sign in
Idris-dev/src/Core.hs
163 lines 5.3 kB history raw
1{-# LANGUAGE MultiParamTypeClasses, FunctionalDependencies, DeriveFunctor #-}
3module Core where
5import Control.Monad.State
6import Debug.Trace
8{- The language has:
9 * Full dependent types
10 * A hierarchy of universes, with cumulativity: Set : Set1, Set1 : Set2, ...
11 * Pattern matching letrec binding
12 * (primitive types defined externally)
14 Some technical stuff:
15 * Typechecker is kept as simple as possible
16 - no unification, just a checker for incomplete terms.
17 * We have a simple collection of tactics which we use to elaborate source
18 programs with implicit syntax into fully explicit terms.
19-}
21data Option = SetInSet
22 | CheckConv
23 deriving Eq
25-- RAW TERMS ----------------------------------------------------------------
27-- Names are hierarchies of strings, describing scope (so no danger of
28-- duplicate names, but need to be careful on lookup).
29-- Also MN for machine chosen names
31data Name = UN [String]
32 | MN Int String
33 deriving Eq
35instance Show Name where
36 show (UN [n]) = n
37 show (UN (n:ns)) = show (UN [n]) ++ "." ++ show (UN ns)
38 show (MN i s) = "{" ++ s ++ show i ++ "}"
40data Raw = Var Name
41 | RBind Name (Binder Raw) Raw
42 | RApp Raw Raw
43 | RSet Int
44 deriving Show
46data Binder b = Lam { binderTy :: b }
47 | Pi { binderTy :: b }
48 | Let { binderTy :: b,
49 binderVal :: b }
50 | Hole { binderTy :: b}
51 | Guess { binderTy :: b,
52 binderVal :: b }
53 | PVar { binderTy :: b }
54 deriving (Show, Eq, Functor)
56data RawFun = RawFun { rtype :: Raw,
57 rval :: Raw
58 }
59 deriving Show
61data RDef = RFunction RawFun
62 | RConst Raw
63 deriving Show
65type RProgram = [(Name, RDef)]
67-- WELL TYPED TERMS ---------------------------------------------------------
69data NameType = Ref | DCon Int Int | TCon Int
70 deriving (Show, Eq)
72-- FIXME: Consider changing this to birectional, with type annotations.
74data TT n = P NameType n (TT n) -- embed type
75 | V Int
76 | Bind n (Binder (TT n)) (TT n)
77 | App (TT n) (TT n) -- function, function type, arg
78 | Set Int
79 deriving (Functor, Eq)
81type EnvTT n = [(n, Binder (TT n))]
83bindEnv :: EnvTT n -> TT n -> TT n
84bindEnv [] tm = tm
85bindEnv ((n, b):bs) tm = Bind n b (bindEnv bs tm)
87type Term = TT Name
88type Type = Term
90type Env = EnvTT Name
92-- an environment with de Bruijn indices 'normalised' so that they all refer to
93-- this environment
95newtype WkEnvTT n = Wk (EnvTT n)
96type WkEnv = WkEnvTT Name
98instance Show n => Show (TT n) where
99 show t = showEnv [] t
101showEnv env t = showEnv' env t False
102showEnvDbg env t = showEnv' env t True
104showEnv' env t dbg = se 10 env t where
105 se p env (P nt n t) = show n ++
106 if dbg then "{" ++ show nt ++ " : " ++ se 10 env t ++ "}" else ""
107 se p env (V i) | i < length env = (show $ fst $ env!!i) ++
108 if dbg then "{" ++ show i ++ "}" else ""
109 | otherwise = "!!V " ++ show i ++ "!!"
110 se p env (Bind n b sc) = bracket p 2 $ sb env n b ++ se 10 ((n,b):env) sc
111 se p env (App f a) = bracket p 1 $ se 1 env f ++ " " ++ se 0 env a
112 se p env (Set i) = "Set" ++ show i
114 sb env n (Lam t) = showb env "\\ " " => " n t
115 sb env n (Hole t) = showb env "? " ". " n t
116 sb env n (Pi t) = showb env "(" ") -> " n t
117 sb env n (PVar t) = showb env "! " ". " n t
118 sb env n (Let t v) = showbv env "let " " in " n t v
119 sb env n (Guess t v) = showbv env "?? " " in " n t v
121 showb env op sc n t = op ++ show n ++ " : " ++ se 10 env t ++ sc
122 showbv env op sc n t v = op ++ show n ++ " : " ++ se 10 env t ++ " = " ++
123 se 10 env v ++ sc
125 bracket outer inner str | inner > outer = "(" ++ str ++ ")"
126 | otherwise = str
128-- Check whether a term has any holes in it - impure if so
130pureTerm :: TT n -> Bool
131pureTerm (App f a) = pureTerm f && pureTerm a
132pureTerm (Bind n b sc) = pureBinder b && pureTerm sc where
133 pureBinder (Hole _) = False
134 pureBinder (Guess _ _) = False
135 pureBinder (Let t v) = pureTerm t && pureTerm v
136 pureBinder t = pureTerm (binderTy t)
137pureTerm _ = True
139-- weaken a term by adding i to each de Bruijn index (i.e. lift it over i bindings)
141weakenTm :: Int -> TT n -> TT n
142weakenTm i t = wk i 0 t
143 where wk i min (V x) | x >= min = V (i + x)
144 wk i m (App f a) = App (wk i m f) (wk i m a)
145 wk i m (Bind x b sc) = Bind x (wkb i m b) (wk i (m + 1) sc)
146 wk i m t = t
147 wkb i m t = fmap (wk i m) t
149-- weaken an environment so that all the de Bruijn indices are correct according
150-- to the latest bound variable
152weakenEnv :: EnvTT n -> EnvTT n
153weakenEnv env = wk (length env - 1) env
154 where wk i [] = []
155 wk i ((n, b) : bs) = (n, weakenTmB i b) : wk (i - 1) bs
156 weakenTmB i (Let t v) = Let (weakenTm i t) (weakenTm i v)
157 weakenTmB i (Guess t v) = Guess (weakenTm i t) (weakenTm i v)
158 weakenTmB i t = t { binderTy = weakenTm i (binderTy t) }
160weakenTmEnv :: Int -> EnvTT n -> EnvTT n
161weakenTmEnv i = map (\ (n, b) -> (n, fmap (weakenTm i) b))