package alba
Alba compiler
Install
Dune Dependency
Authors
Maintainers
Sources
0.4.4.tar.gz
sha256=4817038301d3e45bac9edf7e6f2fc8bf0a6d78e76e02ad7ea33ef69bcc17df3b
md5=25234357587126685d64f16236167937
doc/src/alba.albalib/build_problem.ml.html
Source file build_problem.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358
open Fmlib open Alba_core type pos = Position.t type range = pos * pos type type_in_context = Build_context.type_in_context type description = | Overflow | No_name | Incomplete_type of type_in_context | Cannot_infer_bound | Not_a_function of type_in_context list | Wrong_type of (type_in_context * type_in_context) list | Wrong_base of type_in_context list * type_in_context list | Ambiguous of type_in_context list | Name_violation of string * string (* case, kind *) | Ambiguous_definition | Wrong_parameter_count of int | Wrong_parameter_name of string | Wrong_parameter_type of Term.typ * Gamma.t | Missing_inductive_type | No_inductive_type | Duplicate_inductive | Duplicate_constructor | Wrong_type_constructed of Term.typ * Gamma.t | Negative | Nested_negative of Inductive.t * int * Gamma.t | Not_positive of Term.typ * Gamma.t | Not_yet_implemented of string type t = range * description module Print (P: Pretty_printer.SIG) = struct module PP = Term_printer.Pretty (Gamma) (P) module PPInd = Print_inductive.Make (Gamma) (P) let type_or_types (l: 'a list): P.t = match l with | [_] -> P.wrap_words "the type" | _ :: _ :: _ -> P.wrap_words "one of the types" | _ -> assert false (* Illegal call! *) let typ (holes: int list) (tp: Term.typ) (gamma: Gamma.t): P.t = let tp = PP.print tp gamma in let open P in match holes with | [] -> tp | _ -> let holes = char '[' <+> list_separated (char ',' <+> group space) (List.map (fun level -> let v = Gamma.variable_at_level level gamma and vtp = Gamma.type_at_level level gamma in PP.print v gamma <+> char ':' <+> char ' ' <+> PP.print vtp gamma) holes) <+> char ']' in tp <+> nest 4 ( cut <+> string "unknown: " <+> holes) let type_list (lst: type_in_context list): P.t = let open P in nest 4 (list_separated cut (List.map (fun (holes, tp, gamma) -> (typ holes tp gamma)) lst)) let wrong_type (reqs: type_in_context list) (acts: type_in_context list) : P.t = let open P in wrap_words "I was expecting a term which has" <+> group space <+> type_or_types reqs <+> cut <+> cut <+> type_list reqs <+> cut <+> cut <+> wrap_words "and the highlighted term has" <+> group space <+> type_or_types acts <+> cut <+> cut <+> type_list acts <+> cut <+> cut let description (descr: description): P.t = let open P in match descr with | Overflow -> wrap_words "The number does not fit into a machine word" <+> cut | No_name -> string "I cannot find this name or operator" <+> cut | Cannot_infer_bound -> wrap_words "I cannot infer a type for this variable" <+> cut | Incomplete_type tp -> wrap_words "I cannot infer a complete type of the expression. \ Only the incomplete type" <+> cut <+> cut <+> type_list [tp] <+> cut <+> cut <+> wrap_words "This usually happens if I cannot infer the types \ of some bound variables." <+> cut | Not_a_function lst -> assert (lst <> []); wrap_words "I was expecting a function which can be applied to \ arguments. But the expression has" <+> group space <+> type_or_types lst <+> cut <+> cut <+> type_list lst <+> cut <+> cut <+> wrap_words "which is not a function type." <+> cut | Wrong_type lst -> assert (lst <> []); let reqs, acts = List.split lst in wrong_type reqs acts | Wrong_base (reqs, acts) -> wrong_type reqs acts | Ambiguous types -> wrap_words "This term is ambiguous. It can have the following types." <+> cut <+> cut <+> type_list types <+> cut <+> cut <+> wrap_words "Please give me more type information to infer a unique type." <+> cut | Name_violation (case, kind) -> if case = "Upper" then wrap_words "This identifier must not start with an upper case letter. \ Identifiers starting with upper case letters are allowed \ only for types and type constructors. \ The highlighted identifier is a" <+> group space <+> string kind <+> cut else wrap_words "This identifier must not start with a lower case letter. \ Identifiers starting with lower case letters are allowed \ only for object variables, proofs and propositions. \ But the highlighted identifier is a" <+> group space <+> string kind <+> cut | Ambiguous_definition -> wrap_words "There is already a definition with the same name and \ the same signature. Remember that there can be multiple \ definitions with the same name only if they have \ different signatures." <+> cut | Wrong_parameter_count required -> wrap_words "This inductive type is part of an inductive family. \ All members of the family must have" <+> group space <+> string (string_of_int required) <+> group space <+> wrap_words "parameter(s)." <+> cut | Wrong_parameter_name required -> wrap_words "All corresponding parameters of an inductive family must \ have the same name. This parameter should have the name" <+> group space <+> string ("\"" ^ required ^ "\"") <+> cut | Wrong_parameter_type (required, gamma) -> wrap_words "All corresponding parameters of an inductive family must \ have the same type. This parameter should have the type" <+> cut <+> nest 4 ( cut <+> PP.print required gamma ) <+> cut | Missing_inductive_type -> wrap_words "The inductive type has indices. Therefore the constructor \ has to indicate explicitly the type of the object it \ constructs with all parameters and indices. Please add a \ type annotation." <+> cut | No_inductive_type -> wrap_words "This is not an allowed type of an inductive type. A legal \ type of an inductive type must have a form like" <+> cut <+> cut <+> nest 4 ( list_separated cut [ string "Any" ; string "Proposition" ; string "Int -> Int -> Proposition" ] ) <+> cut <+> cut <+> wrap_words "or any type which reduces to one of these forms. \ The final type must be either \"Any\" or \ \"Proposition\"" <+> cut | Duplicate_inductive -> wrap_words "All types of an inductive family must have different \ names." <+> cut | Duplicate_constructor -> wrap_words "All constructors of an inductive type must have different \ names." <+> cut | Wrong_type_constructed (res, gamma) -> wrap_words "All constructors of an inductive type must construct an \ object of the inductive type. The constructed type must have \ the form" <+> cut <+> cut <+> nest 4 (string "I p1 p2 ... i1 i2 ...") <+> cut <+> cut <+> wrap_words "where 'I' is the name of the inductive type, 'p1 p2 ...' \ are the parameters and 'i1 i2 ...' are the indices. However \ the constructed type has the form" <+> cut <+> cut <+> nest 4 (PP.print res gamma) <+> cut <+> cut | Negative -> wrap_words "The constructor does not satisfy the positivity condition. \ One of its argument types is a function type which uses \ an object of some of the inductive types as an argument i.e. \ one of the inductive types appears in a negative position." <+> cut | Nested_negative (ind, iparam, gamma) -> wrap_words "The constructor does not satisfy the nested positivity \ condition. One of its arguments uses an inductive type of \ this definition nested within the inductive type" <+> cut <+> nest 4 ( cut <+> PPInd.print ind gamma ) <+> cut <+> cut <+> wrap_words "as the parameter <" <+> string (Inductive.parameter_name iparam ind) <+> wrap_words "> which does not satisfy the \ positivity condition." <+> cut | Not_positive (typ, gamma) -> wrap_words "The constructor does not satisfy the positivity condition. \ One of its argument types uses an inductive type of the family \ in the positive position:" <+> cut <+> cut <+> nest 4 (PP.print typ gamma) <+> cut <+> cut <+> wrap_words "However it is not used in the correct format." <+> cut | Not_yet_implemented str -> char '<' <+> string str <+> char '>' <+> group space <+> wrap_words "is not yet implemented" let print_with_source (src: string) ((range, desc): t) : P.t = let module P0 = Printer.Make (P) in let open P in P0.print_error_header "TYPE" <+> P0.print_source src range [] <+> description desc <+> cut let print_with_source_lines (lines: string Sequence.t) ((range, desc): t) : P.t = let module P0 = Printer.Make (P) in let open P in P0.print_error_header "TYPE" <+> P0.print_source_lines lines range [] <+> description desc <+> cut end let string_of_problem (src: string) (problem: t): string = let module Pretty_printer = Pretty_printer.Pretty (String_printer) in let module Error_print = Print (Pretty_printer) in String_printer.run ( Pretty_printer.run 0 70 70 (Error_print.print_with_source src problem) )
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>