less prototype, less bad code implementation of CCHM type theory
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

229 lines
7.2 KiB

  1. {-# LANGUAGE LambdaCase #-}
  2. {-# OPTIONS_GHC -Wno-orphans #-}
  3. {-# LANGUAGE ViewPatterns #-}
  4. {-# LANGUAGE NamedFieldPuns #-}
  5. {-# LANGUAGE CPP #-}
  6. module Syntax.Pretty where
  7. import qualified Data.Map.Strict as Map
  8. import qualified Data.Text.Lazy as L
  9. import qualified Data.Text as T
  10. import Data.Map.Strict (Map)
  11. import Data.Text (Text)
  12. import Presyntax.Presyntax (Plicity(..))
  13. import Prettyprinter.Render.Terminal
  14. import Prettyprinter
  15. import Syntax
  16. instance Pretty Name where
  17. pretty = pretty . getNameText
  18. prettyTm' :: Bool -> Term -> Doc AnsiStyle
  19. prettyTm' implicits = go True 0 where
  20. go t p =
  21. \case
  22. Ref v -> pretty v
  23. Con v -> keyword $ pretty v
  24. PCon _ v -> keyword $ pretty v
  25. Data _ v -> keyword $ pretty v
  26. App Im f x
  27. | implicits -> parenIf (p >= arg_prec) $
  28. go False fun_prec f
  29. <+> braces (go False 0 x)
  30. | otherwise -> go t p f
  31. App Ex f x ->
  32. parenIf (p >= arg_prec) $
  33. go False fun_prec f
  34. <+> group (go False arg_prec x)
  35. Lam Ex v (App Ex f (Ref v')) | v == v' -> instead f
  36. Lam i v t ->
  37. let
  38. getArgs (Lam i v t) =
  39. let (as, b) = getArgs t in ((i, v):as, b)
  40. getArgs (PathIntro _ _ _ (Lam _ v t)) =
  41. let (as, b) = getArgs t in ((Ex, v):as, b)
  42. getArgs t = ([], t)
  43. (as, b) = getArgs (Lam i v t)
  44. in
  45. parenIf (p >= fun_prec) . group $
  46. pretty '\\' <> hsep (map (\(i, v) -> braceIf (i == Im) (pretty v)) as)
  47. <+> arrow
  48. <+> nest 2 (align (go False 0 b))
  49. Pi _ (T.unpack . getNameText -> "_") d r ->
  50. parenIf (p >= fun_prec) $
  51. group (go False dom_prec d)
  52. <> space <> arrow <> sp
  53. <> go t 0 r
  54. Pi i x d r ->
  55. let
  56. c = case r of
  57. Pi _ (getNameText -> x) _ _ | x /= T.pack "_" -> sp
  58. _ -> space <> arrow <> sp
  59. in
  60. parenIf (p >= fun_prec) $
  61. plic i (pretty x <+> colon <+> go False 0 d)
  62. <> c <> go t 0 r
  63. Let binds body ->
  64. parenIf (p >= fun_prec) $
  65. align $ keyword (pretty "let")
  66. <> line
  67. <> indent 2 (prettyBinds False binds)
  68. <> keyword (pretty "in")
  69. <+> go False 0 body
  70. Meta MV{mvName} -> keyword (pretty '?' <> pretty mvName)
  71. Type -> keyword (pretty "Type")
  72. Typeω -> keyword (pretty "Pretype")
  73. Sigma v d r ->
  74. parenIf (p >= fun_prec) . align $
  75. group (parens (pretty v <+> colon <+> go False 0 d))
  76. <+> operator (pretty "*") <+> go False 0 r
  77. Pair a b -> parens $ go False 0 a <> comma <+> go False 0 b
  78. Proj1 a -> parenIf (p >= arg_prec) $ go False 0 a <> keyword (pretty ".1")
  79. Proj2 a -> parenIf (p >= arg_prec) $ go False 0 a <> keyword (pretty ".2")
  80. I -> keyword (pretty "I")
  81. I0 -> keyword (pretty "i0")
  82. I1 -> keyword (pretty "i1")
  83. IAnd x y -> parenIf (p > and_prec) $
  84. go False and_prec x <+> operator (pretty "/\\") <+> go False and_prec y
  85. IOr x y -> parenIf (p > or_prec) $
  86. go False or_prec x <+> operator (pretty "\\/") <+> go False or_prec y
  87. INot x -> operator (pretty "~") <> go False p x
  88. PathP _ x y -> parenIf (p >= arg_prec) $
  89. go False 0 x <+> operator (pretty "") <+> go False 0 y
  90. IElim _a _x _y f i -> instead (App Ex f i)
  91. PathIntro _a _x _y f -> instead f
  92. Partial a p -> apps (con "Partial") [(Ex, a), (Ex, p)]
  93. PartialP a p -> apps (con "PartialP") [(Ex, a), (Ex, p)]
  94. System fs | Map.null fs -> braces mempty
  95. System fs ->
  96. let
  97. face (f, t) = go False 0 f <+> operator (pretty "=>") <+> align (go False 0 t)
  98. in
  99. braces (line <> indent 2 (align (vsep (punctuate comma (map face (Map.toList fs))))) <> line)
  100. Sub a phi u -> apps (con "Sub") [(Ex, a), (Ex, phi), (Ex, u)]
  101. Inc a phi u -> apps (con "inS") [(Im, a), (Im, phi), (Ex, u)]
  102. Ouc a phi u a0 -> apps (con "outS") [(Im, a), (Im, phi), (Im, u), (Ex, a0)]
  103. GlueTy a phi t e -> apps (con "primGlue") [(Ex, a), (Ex, phi), (Ex, t), (Ex, e)]
  104. Glue _a _phi _ty _e t im -> apps (con "glue") [(Ex, t), (Ex, im)]
  105. Unglue _a _phi _ty _e t -> apps (con "unglue") [(Ex, t)]
  106. Comp a phi u a0 -> apps (con "comp") [(Ex, a), (Im, phi), (Ex, u), (Ex, a0)]
  107. HComp a phi u a0 -> apps (con "hcomp") [(Im, a), (Im, phi), (Ex, u), (Ex, a0)]
  108. Case _ t cs ->
  109. let
  110. oneCase (c, 0, l) = go False 0 c <+> operator (pretty "=>") <+> go False 0 l
  111. oneCase (c, i, l) =
  112. let (args, bd) = getLams i l
  113. in go False 0 c <+> hsep (map pretty args) <+> operator (pretty "=>") <+> go False 0 bd
  114. getLams 0 x = ([], x)
  115. getLams n (Lam _ v t) = let (as, b) = getLams (n - 1) t in (v:as, b)
  116. getLams _ x = ([], x)
  117. in
  118. parenIf (p >= fun_prec) $
  119. keyword (pretty "case") <+> go False 0 t <+> keyword (pretty "of")
  120. <> line
  121. <> indent 2 (vsep (map oneCase cs))
  122. EqS _ x y -> parenIf (p >= arg_prec) $
  123. go False 0 x <+> operator (pretty "≡S") <+> go False 0 y
  124. Syntax.Refl _ _ -> keyword (pretty "refl")
  125. Syntax.AxK _ _ bigp pr eq -> apps (con "K_s") [(Ex, bigp), (Ex, pr), (Ex, eq)]
  126. Syntax.AxJ _ _ bigp pr _ eq -> apps (con "J_s") [(Ex, bigp), (Ex, pr), (Ex, eq)]
  127. where
  128. sp | t = softline
  129. | otherwise = space
  130. parenIf p x | p = parens x
  131. | otherwise = x
  132. braceIf p x | p = braces x
  133. | otherwise = x
  134. con x = Con (Bound (T.pack x) 0)
  135. plic = \case
  136. Ex -> parens
  137. Im -> braces
  138. arrow = operator (pretty "->")
  139. instead = go t p
  140. apps :: Term -> [(Plicity, Term)] -> Doc AnsiStyle
  141. apps f xs = instead (foldl (\f (p, x) -> App p f x) f xs)
  142. prettyBinds :: Bool -> [(Name, Term, Term)] -> Doc AnsiStyle
  143. prettyBinds _ [] = mempty
  144. prettyBinds imp ((x, ty, tm):bs) =
  145. pretty x <+> colon <+> align (prettyTm' imp ty)
  146. <> line
  147. <> pretty x <+> equals <+> align (prettyTm' imp tm)
  148. <> line
  149. <> prettyBinds imp bs
  150. showFace :: Bool -> Map Head Bool -> Doc AnsiStyle
  151. showFace imp = hsep . map go . Map.toList where
  152. go (h, b) = parens $ prettyTm' imp (quote (VNe h mempty)) <+> operator (pretty "=") <+> pretty (if b then "i1" else "i0")
  153. prettyVl' :: Bool -> Value -> Doc AnsiStyle
  154. prettyVl' b = prettyTm' b . quote
  155. instance Pretty Term where
  156. pretty = unAnnotate . prettyTm
  157. prettyTm :: Term -> Doc AnsiStyle
  158. prettyTm = prettyTm' printImplicits
  159. instance Pretty Value where
  160. pretty = unAnnotate . prettyVl
  161. prettyVl :: Value -> Doc AnsiStyle
  162. prettyVl = prettyVl' printImplicits
  163. printImplicits :: Bool
  164. #if defined(RELEASE)
  165. printImplicits = False
  166. #else
  167. printImplicits = True
  168. #endif
  169. render :: Doc AnsiStyle -> Text
  170. render = L.toStrict . renderLazy . layoutSmart defaultLayoutOptions
  171. arg_prec, fun_prec, dom_prec, and_prec, or_prec :: Int
  172. dom_prec = succ fun_prec
  173. arg_prec = succ and_prec
  174. and_prec = succ or_prec
  175. or_prec = succ fun_prec
  176. fun_prec = 1
  177. keyword :: Doc AnsiStyle -> Doc AnsiStyle
  178. keyword = annotate (color Magenta)
  179. operator :: Doc AnsiStyle -> Doc AnsiStyle
  180. operator = annotate (color Yellow)