variant.ur 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145
  1. fun read [r ::: {Unit}] [t ::: Type] (fl : folder r) (r : $(mapU t r)) (v : variant (mapU {} r)) : t =
  2. match v
  3. (@fold [fn r => r' :: {Unit} -> [r ~ r'] => $(mapU t (r ++ r')) -> $(mapU ({} -> t) r)]
  4. (fn [nm :: Name] [u::_] [us::_] [[nm] ~ us] (cs : r' :: {Unit} -> [us ~ r'] => $(mapU t (us ++ r')) -> _) [r'::_] [[nm = u] ++ us ~ r'] r =>
  5. {nm = fn () => r.nm} ++ cs [[nm = u] ++ r'] r)
  6. (fn [r'::_] [[] ~ r'] _ => {}) fl [[]] ! r)
  7. fun write [r ::: {Unit}] [t ::: Type] (fl : folder r) (r : $(mapU t r)) (v : variant (mapU {} r)) (x : t) : $(mapU t r) =
  8. match v
  9. (@fold [fn r => r' :: {Unit} -> [r ~ r'] => $(mapU t (r ++ r')) -> $(mapU ({} -> $(mapU t (r ++ r'))) r)]
  10. (fn [nm :: Name] [u::_] [us::_] [[nm] ~ us]
  11. (cs : r' :: {Unit} -> [us ~ r'] => $(mapU t (us ++ r')) -> $(mapU ({} -> $(mapU t (us ++ r'))) us))
  12. [r'::_] [[nm = u] ++ us ~ r'] r =>
  13. {nm = fn () => r -- nm ++ {nm = x}} ++ cs [[nm = u] ++ r'] r)
  14. (fn [r'::_] [[] ~ r'] _ => {}) fl [[]] ! r)
  15. fun search [r] [t] (f : variant (mapU {} r) -> option t) (fl : folder r) : option t =
  16. @fold [fn r => r' :: {Unit} -> [r ~ r'] => (variant (mapU {} (r ++ r')) -> option t) -> option t]
  17. (fn [nm :: Name] [u ::_] [r ::_] [[nm] ~ r]
  18. (acc : r' :: {Unit} -> [r ~ r'] => (variant (mapU {} (r ++ r')) -> option t) -> option t)
  19. [r' ::_] [[nm] ++ r ~ r'] f' =>
  20. case f' (make [nm] {}) of
  21. None => acc [[nm] ++ r'] f'
  22. | v => v)
  23. (fn [r' ::_] [[] ~ r'] _ => None) fl [[]] ! f
  24. fun find [r] (f : variant (mapU {} r) -> bool) (fl : folder r) : option (variant (mapU {} r)) =
  25. @search (fn v => if f v then Some v else None) fl
  26. fun test [nm :: Name] [t ::: Type] [ts ::: {Type}] [[nm] ~ ts] (fl : folder ([nm = t] ++ ts))
  27. (v : variant ([nm = t] ++ ts)) : option t =
  28. match v ({nm = Some}
  29. ++ (@map0 [fn t' => t' -> option t] (fn [t' :: Type] _ => None) fl -- nm))
  30. fun testLess [nm :: Name] [t ::: Type] [ts ::: {Type}] [[nm] ~ ts] (fl : folder ts) (v : variant ([nm = t] ++ ts)) : option t =
  31. match v ({nm = Some}
  32. ++ @map0 [fn t' => t' -> option t] (fn [t' :: Type] _ => None) fl)
  33. fun weaken [r1 ::: {Type}] [r2 ::: {Type}] [r1 ~ r2] (fl : folder r1) (v : variant r1) : variant (r1 ++ r2) =
  34. match v
  35. (@fold [fn r => r' :: {Type} -> [r ~ r'] => $(map (fn t => t -> variant (r ++ r')) r)]
  36. (fn [nm :: Name] [t ::_] [r ::_] [[nm] ~ r] (acc : r' :: {Type} -> [r ~ r'] => $(map (fn t => t -> variant (r ++ r')) r)) [r'::_] [[nm = t] ++ r ~ r'] =>
  37. {nm = make [nm]} ++ acc [[nm = t] ++ r'])
  38. (fn [r'::_] [[] ~ r'] => {}) fl [r2] !)
  39. fun eq [r] (fl : folder r) (v1 : variant (mapU {} r)) (v2 : variant (mapU {} r)) : bool =
  40. match v1
  41. (@fold [fn r => r' :: {Unit} -> [r ~ r'] => folder (r ++ r') -> variant (mapU {} (r ++ r')) -> $(mapU ({} -> bool) r)]
  42. (fn [nm ::_] [u ::_] [r ::_] [[nm] ~ r]
  43. (acc : r' :: {Unit} -> [r ~ r'] => folder (r ++ r') -> variant (mapU {} (r ++ r')) -> $(mapU ({} -> bool) r))
  44. [r' ::_] [[nm] ++ r ~ r'] (fl' : folder ([nm] ++ r ++ r')) v =>
  45. {nm = fn () => Option.isSome (@test [nm] ! (@Folder.mp fl') v)}
  46. ++ @acc [[nm] ++ r'] ! fl' v)
  47. (fn [r' ::_] [[] ~ r'] _ _ => {}) fl [[]] ! fl v2)
  48. fun fold [r] [t] (fl : folder r) (f : variant (mapU {} r) -> t -> t) : t -> t =
  49. @Top.fold [fn r => r' :: {Unit} -> [r ~ r'] => (variant (mapU {} (r ++ r')) -> t -> t) -> t -> t]
  50. (fn [nm :: Name] [u ::_] [r ::_] [[nm] ~ r]
  51. (acc : r' :: {Unit} -> [r ~ r'] => (variant (mapU {} (r ++ r')) -> t -> t) -> t -> t)
  52. [r' ::_] [[nm] ++ r ~ r'] f' acc' =>
  53. f' (make [nm] {}) (acc [[nm] ++ r'] f' acc'))
  54. (fn [r' ::_] [[] ~ r'] _ x => x) fl [[]] ! f
  55. fun mp [r ::: {Unit}] [t ::: Type] (fl : folder r) (f : variant (mapU {} r) -> t) : $(mapU t r) =
  56. @Top.fold [fn r => r' :: {Unit} -> [r ~ r'] => (variant (mapU {} (r ++ r')) -> t) -> $(mapU t r)]
  57. (fn [nm :: Name] [u ::_] [r ::_] [[nm] ~ r]
  58. (acc : r' :: {Unit} -> [r ~ r'] => (variant (mapU {} (r ++ r')) -> t) -> $(mapU t r))
  59. [r' ::_] [[nm] ++ r ~ r'] f' =>
  60. {nm = f' (make [nm] {})} ++ acc [[nm] ++ r'] f')
  61. (fn [r' ::_] [[] ~ r'] _ => {}) fl [[]] ! f
  62. fun foldR [tr] [r] [t] (fl : folder r) (f : variant (mapU {} r) -> tr -> t -> t) (record : $(mapU tr r)) : t -> t =
  63. @Top.foldUR [tr] [fn r => r' :: {Unit} -> [r ~ r'] => (variant (mapU {} (r ++ r')) -> tr -> t -> t) -> t -> t]
  64. (fn [nm :: Name] [r ::_] [[nm] ~ r] (v : tr)
  65. (acc : r' :: {Unit} -> [r ~ r'] => (variant (mapU {} (r ++ r')) -> tr -> t -> t) -> t -> t)
  66. [r' ::_] [[nm] ++ r ~ r'] f' acc' =>
  67. f' (make [nm] {}) v (acc [[nm] ++ r'] f' acc'))
  68. (fn [r' ::_] [[] ~ r'] _ x => x) fl record [[]] ! f
  69. fun appR [m] (_ : monad m) [tr] [r] (fl : folder r) (f : variant (mapU {} r) -> tr -> m {}) (record : $(mapU tr r)) : m {} =
  70. @foldR fl (fn var this acc => f var this; acc) record (return ())
  71. fun mapR [tr] [t] [r] (fl : folder r) (f : variant (mapU {} r) -> tr -> t) (record : $(mapU tr r)) : $(mapU t r) =
  72. @Top.fold [fn r => r' :: {Unit} -> [r ~ r'] => (variant (mapU {} (r ++ r')) -> tr -> t) -> $(mapU tr r) -> $(mapU t r)]
  73. (fn [nm :: Name] [u ::_] [r ::_] [[nm] ~ r]
  74. (acc : r' :: {Unit} -> [r ~ r'] => (variant (mapU {} (r ++ r')) -> tr -> t) -> $(mapU tr r) -> $(mapU t r))
  75. [r' ::_] [[nm] ++ r ~ r'] f' vs =>
  76. {nm = f' (make [nm] {}) vs.nm} ++ acc [[nm] ++ r'] f' (vs -- nm))
  77. (fn [r' ::_] [[] ~ r'] _ _ => {}) fl [[]] ! f record
  78. fun destrR [K] [f :: K -> Type] [fr :: K -> Type] [t ::: Type]
  79. (f : p :: K -> f p -> fr p -> t)
  80. [r ::: {K}] (fl : folder r) (v : variant (map f r)) (r : $(map fr r)) : t =
  81. match v
  82. (@Top.mp [fr] [fn p => f p -> t]
  83. (fn [p] (m : fr p) (v : f p) => f [p] v m)
  84. fl r)
  85. fun destr2R [K] [f1 :: K -> Type] [f2 :: K -> Type] [fr :: K -> Type] [t ::: Type]
  86. (f : p :: K -> f1 p -> f2 p -> fr p -> t)
  87. [r ::: {K}] (fl : folder r) (v1 : variant (map f1 r)) (v2 : variant (map f2 r)) (r : $(map fr r)) : option t =
  88. match v1
  89. (@Top.foldR [fr] [fn r => others :: {K} -> [others ~ r] =>
  90. folder (r ++ others)
  91. -> variant (map f2 (r ++ others))
  92. -> $(map (fn p => f1 p -> option t) r)]
  93. (fn [nm ::_] [p ::_] [r ::_] [[nm] ~ r] (meta : fr p)
  94. (acc : others :: {K} -> [others ~ r] =>
  95. folder (r ++ others)
  96. -> variant (map f2 (r ++ others))
  97. -> $(map (fn p => f1 p -> option t) r))
  98. [others :: {K}] [others ~ [nm = p] ++ r]
  99. (fl : folder ([nm = p] ++ r ++ others))
  100. (v2 : variant (map f2 ([nm = p] ++ r ++ others))) =>
  101. {nm = fn x1 => match v2
  102. ({nm = fn x2 => Some (f [p] x1 x2 meta)}
  103. ++ (@map0 [fn p => f2 p -> option t] (fn [p' ::_] _ => None) fl -- nm))}
  104. ++ @acc [[nm = p] ++ others] ! fl v2)
  105. (fn [others ::_] [others ~ []] _ _ => {})
  106. fl r [[]] ! fl v2)
  107. fun testEq [K] [f :: K -> Type] [nm :: Name] [t ::: K] [ts ::: {K}] [r ::: {K}] [[nm] ~ ts]
  108. (pf : Eq.eq r ([nm = t] ++ ts)) (fl : folder r) (v : variant (map f r)) : option (f t) =
  109. @test [nm] ! (@Folder.mp (@Eq.cast pf [folder] fl))
  110. (Eq.cast pf [fn r => variant (map f r)] v)
  111. fun makeEq [K] [f :: K -> Type] [nm :: Name] [t ::: K] [ts ::: {K}] [r ::: {K}] [[nm] ~ ts]
  112. (pf : Eq.eq r ([nm = t] ++ ts)) (x : f t) : variant (map f r) =
  113. Eq.cast (Eq.sym pf) [fn r => variant (map f r)] (make [nm] x)
  114. con variantMake ts' ts = $(map (fn t => t -> variant ts') ts)
  115. con mkLabelsAccum r = s :: {Type} -> [r ~ s] => variantMake (r ++ s) r
  116. fun mkLabels [ts ::: {Type}] (fl : folder ts) : variantMake ts ts
  117. = @Top.fold [mkLabelsAccum]
  118. (fn [nm::_] [v::_] [r::_] [[nm] ~ r]
  119. (k : mkLabelsAccum r)
  120. [s::_] [[nm = v] ++ r ~ s] => k [[nm = v] ++ s] ++ {nm = make [nm]})
  121. (fn [s::_] [[] ~ s] => {}) fl [[]] !
  122. con type_case ts t a = (a -> variant ts) -> a -> t
  123. fun declareCase [ts] [t] [a] (f : (a -> variant ts) -> a -> t) : type_case ts t a = f
  124. fun typeCase [ts] [t] (v : variant ts) (dstrs : $(map (type_case ts t) ts)) (fl : folder ts) : t
  125. (* Ur/Web not clever enough to calculate these folders, it seems *)
  126. = match v (@Record.ap [fn a => a -> variant ts] [fn a => a -> t] fl dstrs (@mkLabels fl))