package coq-lsp
Language Server Protocol native server for Coq
Install
Dune Dependency
Authors
Maintainers
Sources
coq-lsp-0.2.3.9.0.tbz
sha256=8776582dddfe768623870cf540ff6ba1e96a44a36e85db18ab93d238d640f92a
sha512=2837889bf99bfe715bd0e752782211a76a14aac71ed37a4fb784f4f0abe338352c9c6d8caa37daf79c036997add1cb306c523f793625b38709f3b5e245380223
doc/src/coq-lsp.serlib/ser_sorts.ml.html
Source file ser_sorts.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(************************************************************************) (* * The Coq Proof Assistant / The Coq Development Team *) (* v * Copyright INRIA, CNRS and contributors *) (* <O___,, * (see version control and CREDITS file for authors & dates) *) (* VV/ **************************************************************) (* // * This file is distributed under the terms of the *) (* * GNU Lesser General Public License Version 2.1 *) (* * (see LICENSE file for the text of the license) *) (************************************************************************) (************************************************************************) (* SerAPI: Coq interaction protocol with bidirectional serialization *) (************************************************************************) (* Copyright 2016-2019 MINES ParisTech -- License LGPL 2.1+ *) (* Copyright 2019-2023 Inria -- License LGPL 2.1+ *) (* Written by: Emilio J. Gallego Arias and others *) (************************************************************************) open Ppx_sexp_conv_lib.Conv open Ppx_hash_lib.Std.Hash.Builtin open Ppx_compare_lib.Builtin module Univ = Ser_univ type family = [%import: Sorts.family] [@@deriving sexp,yojson,hash,compare] module BijectQVar = struct open Sexplib.Std open Ppx_hash_lib.Std.Hash.Builtin open Ppx_compare_lib.Builtin type t = Sorts.QVar.t type _t = [%import: Sorts.QVar.repr] [@@deriving sexp,yojson,hash,compare] let of_t = Sorts.QVar.repr let to_t = Sorts.QVar.of_repr end module QVar = struct module Self = SerType.Biject(BijectQVar) include Self module Set = Ser_cSet.Make(Sorts.QVar.Set)(Self) end module Quality = struct type constant = [%import: Sorts.Quality.constant] [@@deriving sexp,yojson,hash,compare] module Self = struct type t = [%import: Sorts.Quality.t] [@@deriving sexp,yojson,hash,compare] end include Self module Set = Ser_cSet.Make(Sorts.Quality.Set)(Self) type pattern = [%import: Sorts.Quality.pattern] [@@deriving sexp,yojson,hash,compare] end module PierceSpec = struct type t = Sorts.t type _t = | SProp | Prop | Set | Type of Univ.Universe.t | QSort of QVar.t * Univ.Universe.t [@@deriving sexp,yojson,hash,compare] end include SerType.Pierce(PierceSpec) type relevance = [%import: Sorts.relevance] [@@deriving sexp,yojson,hash,compare] open Sexplib.Std open Ppx_hash_lib.Std.Hash.Builtin open Ppx_compare_lib.Builtin type pattern = [%import: Sorts.pattern] [@@deriving sexp,yojson,hash,compare] module QConstraint = struct type kind = [%import: Sorts.QConstraint.kind] [@@deriving sexp,yojson,hash,compare] type t = [%import: Sorts.QConstraint.t] [@@deriving sexp,yojson,hash,compare] end module QConstraints = Ser_cSet.Make(Sorts.QConstraints)(QConstraint)