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.

205 lines
6.6 KiB

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