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.

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