kind stringclasses 5
values | name stringlengths 1 106 ⌀ | signature stringlengths 5 19.8k | documentation stringlengths 0 21.3k ⌀ | package_name stringclasses 1
value | package_version stringclasses 1
value | module_name stringlengths 1 134 | full_path stringlengths 1 155 |
|---|---|---|---|---|---|---|---|
value | k_app | val k_app : (Mc2_core.ID.t -> Mc2_core.term list -> Mc2_core.term) Mc2_core.Service.Key.t | Service for applying a constant to some arguments. Arguments are:The head function symbolthe list of arguments | earley-ocaml | unknown | Mc2_uf | Mc2_uf.k_app |
value | k_const | val k_const : (Mc2_core.ID.t -> Mc2_core.term) Mc2_core.Service.Key.t | Service for turning a constant into a term | earley-ocaml | unknown | Mc2_uf | Mc2_uf.k_const |
value | k_decl | val k_decl : (Mc2_core.ID.t -> Mc2_core.Type.t list -> Mc2_core.Type.t -> unit) Mc2_core.Service.Key.t | Service for declaring an uninterpreted symbol | earley-ocaml | unknown | Mc2_uf | Mc2_uf.k_decl |
value | plugin | val plugin : Mc2_core.Plugin.Factory.t | null | earley-ocaml | unknown | Mc2_uf | Mc2_uf.plugin |
module | null | module Backend_intf : sig ... end | Backend interface | earley-ocaml | unknown | Mc2_backend | Mc2_backend |
module | null | module Dot : sig ... end | null | earley-ocaml | unknown | Mc2_backend | Mc2_backend |
type | null | type t | The type of proofs. | earley-ocaml | unknown | Mc2_backend.Backend_intf | Mc2_backend.Backend_intf |
value | print | val print : Format.formatter -> t -> unit | A function for printing proofs in the desired format. | earley-ocaml | unknown | Mc2_backend.Backend_intf | Mc2_backend.Backend_intf.print |
module | null | module Default : Arg with type atom := Mc2_core.Atom.t and type hyp := Mc2_core.Clause.t and type lemma := Mc2_core.Clause.t and type assumption := Mc2_core.Clause.t | Provides a reasonnable default to instantiate the Make functor, assuming the original printing functions are compatible with DOT html labels. | earley-ocaml | unknown | Mc2_backend.Dot | Mc2_backend.Dot |
module | null | module Make (A : Arg with type atom := Mc2_core.Atom.t and type hyp := Mc2_core.Clause.t and type lemma := Mc2_core.Clause.t and type assumption := Mc2_core.Clause.t) : S with type t := Mc2_core.Proof.t | Functor for making a module to export proofs to the DOT format. | earley-ocaml | unknown | Mc2_backend.Dot | Mc2_backend.Dot |
type | null | type atom | The type of atomic formuals | earley-ocaml | unknown | Mc2_backend.Dot | Mc2_backend.Dot |
type | null | type hyp | null | earley-ocaml | unknown | Mc2_backend.Dot | Mc2_backend.Dot |
type | null | type lemma | null | earley-ocaml | unknown | Mc2_backend.Dot | Mc2_backend.Dot |
type | null | type assumption | The type of theory-specifi proofs (also called lemmas). | earley-ocaml | unknown | Mc2_backend.Dot | Mc2_backend.Dot |
value | print_atom | val print_atom : Format.formatter -> atom -> unit | Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on). | earley-ocaml | unknown | Mc2_backend.Dot | Mc2_backend.Dot.print_atom |
value | hyp_info | val hyp_info : hyp -> string * string option * (Format.formatter -> unit -> unit) list | null | earley-ocaml | unknown | Mc2_backend.Dot | Mc2_backend.Dot.hyp_info |
value | lemma_info | val lemma_info : lemma -> string * string option * (Format.formatter -> unit -> unit) list | null | earley-ocaml | unknown | Mc2_backend.Dot | Mc2_backend.Dot.lemma_info |
value | assumption_info | val assumption_info : assumption -> string * string option * (Format.formatter -> unit -> unit) list | Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet (rule, color, l), such that:rule is a name for the proof (arbitrary, does not need to be unique, but should rather be desc... | earley-ocaml | unknown | Mc2_backend.Dot | Mc2_backend.Dot.assumption_info |
value | print | val print : Format.formatter -> Mc2_core.Proof.t -> unit | A function for printing proofs in the desired format. | earley-ocaml | unknown | Mc2_backend.Dot.Make | Mc2_backend.Dot.Make.print |
value | print_atom | val print_atom : Format.formatter -> Mc2_core.Atom.t -> unit | Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on). | earley-ocaml | unknown | Mc2_backend.Dot.Make | Mc2_backend.Dot.Make.print_atom |
value | hyp_info | val hyp_info : Mc2_core.Clause.t -> string * string option * (Format.formatter -> unit -> unit) list | null | earley-ocaml | unknown | Mc2_backend.Dot.Make | Mc2_backend.Dot.Make.hyp_info |
value | lemma_info | val lemma_info : Mc2_core.Clause.t -> string * string option * (Format.formatter -> unit -> unit) list | null | earley-ocaml | unknown | Mc2_backend.Dot.Make | Mc2_backend.Dot.Make.lemma_info |
value | assumption_info | val assumption_info : Mc2_core.Clause.t -> string * string option * (Format.formatter -> unit -> unit) list | Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet (rule, color, l), such that:rule is a name for the proof (arbitrary, does not need to be unique, but should rather be desc... | earley-ocaml | unknown | Mc2_backend.Dot.Make | Mc2_backend.Dot.Make.assumption_info |
value | print_atom | val print_atom : Format.formatter -> Mc2_core.Atom.t -> unit | Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on). | earley-ocaml | unknown | Mc2_backend.Dot.Default | Mc2_backend.Dot.Default.print_atom |
value | hyp_info | val hyp_info : Mc2_core.Clause.t -> string * string option * (Format.formatter -> unit -> unit) list | null | earley-ocaml | unknown | Mc2_backend.Dot.Default | Mc2_backend.Dot.Default.hyp_info |
value | lemma_info | val lemma_info : Mc2_core.Clause.t -> string * string option * (Format.formatter -> unit -> unit) list | null | earley-ocaml | unknown | Mc2_backend.Dot.Default | Mc2_backend.Dot.Default.lemma_info |
value | assumption_info | val assumption_info : Mc2_core.Clause.t -> string * string option * (Format.formatter -> unit -> unit) list | Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet (rule, color, l), such that:rule is a name for the proof (arbitrary, does not need to be unique, but should rather be desc... | earley-ocaml | unknown | Mc2_backend.Dot.Default | Mc2_backend.Dot.Default.assumption_info |
type | null | type num = Q.t | null | earley-ocaml | unknown | Mc2_lra | Mc2_lra |
module | null | module LE : sig ... end | null | earley-ocaml | unknown | Mc2_lra | Mc2_lra |
type | null | type op = | Boolean operator | earley-ocaml | unknown | Mc2_lra | Mc2_lra |
value | k_rat | val k_rat : Mc2_core.ty Mc2_core.Service.Key.t | Type of rationals | earley-ocaml | unknown | Mc2_lra | Mc2_lra.k_rat |
value | k_make_const | val k_make_const : (num -> Mc2_core.term) Mc2_core.Service.Key.t | Constant as a term | earley-ocaml | unknown | Mc2_lra | Mc2_lra.k_make_const |
value | k_make_pred | val k_make_pred : (op -> Mc2_lra__.Linexp.t -> Mc2_core.term) Mc2_core.Service.Key.t | Build constraint | earley-ocaml | unknown | Mc2_lra | Mc2_lra.k_make_pred |
value | plugin | val plugin : Mc2_core.Plugin.Factory.t | null | earley-ocaml | unknown | Mc2_lra | Mc2_lra.plugin |
value | set_lra_alt | val set_lra_alt : int -> unit | null | earley-ocaml | unknown | Mc2_lra | Mc2_lra.set_lra_alt |
type | null | type t | Linear expression with rational coefficients and rational-typed terms | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE |
type | null | type num = Q.t | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE |
value | equal | val equal : t -> t -> bool | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.equal |
value | hash | val hash : t -> int | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.hash |
value | pp | val pp : t Mc2_core.Fmt.printer | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.pp |
value | pp_no_paren | val pp_no_paren : t Mc2_core.Fmt.printer | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.pp_no_paren |
value | empty | val empty : t | Empty linear expression | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.empty |
value | zero | val zero : t | Empty linear expressionalias for empty | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.zero |
value | is_const | val is_const : t -> bool | true if the expressions is constant | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.is_const |
value | is_zero | val is_zero : t -> bool | true if the expressions is constant and equal to zero | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.is_zero |
value | add | val add : t -> t -> t | Sum of linear expressions | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.add |
value | diff | val diff : t -> t -> t | Sum of linear expressionsDiff of linear expressions | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.diff |
value | const | val const : num -> t | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.const |
value | as_singleton | val as_singleton : t -> (num * Mc2_core.term) option | no constant, and exactly one term? | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.as_singleton |
value | mem_term | val mem_term : Mc2_core.term -> t -> bool | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.mem_term |
value | add_term | val add_term : num -> Mc2_core.term -> t -> t | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.add_term |
value | remove_term | val remove_term : Mc2_core.term -> t -> t | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.remove_term |
value | get_term | val get_term : Mc2_core.term -> t -> num option | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.get_term |
value | find_term_exn | val find_term_exn : Mc2_core.term -> t -> num | Find value for this term, or Not_found | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.find_term_exn |
value | singleton | val singleton : num -> Mc2_core.term -> t | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.singleton |
value | singleton1 | val singleton1 : Mc2_core.term -> t | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.singleton1 |
value | singleton_term | val singleton_term : t -> Mc2_core.term | asserts the given LE is exatly of the form (1 * x) and returns x * | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.singleton_term |
value | neg | val neg : t -> t | Invert sign | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.neg |
value | mult | val mult : num -> t -> t | Product by constant | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.mult |
value | div | val div : t -> num -> t | div e n is e/n.raises Division_by_zero if n=0 | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.div |
value | simplify | val simplify : t -> t | if e is n·x op 0, then rewrite into sign(n)·x op 0 * | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.simplify |
value | flatten | val flatten : f:(Mc2_core.term -> t option) -> t -> t | flatten f e traverses all terms, and if they are themselves mapped into expressions by f, replaces them by the corresponding expr | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.flatten |
value | terms | val terms : t -> Mc2_core.term Iter.t | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.terms |
value | terms_l | val terms_l : t -> Mc2_core.term list | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.terms_l |
value | as_const | val as_const : t -> num option | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.as_const |
value | eval | val eval : f:(Mc2_core.term -> num option) -> t -> (num * Mc2_core.term list) option | eval e evaluates the expression if all subterms (returned in a list) have a value according to f | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE.eval |
module | null | module Infix : sig ... end | null | earley-ocaml | unknown | Mc2_lra.LE | Mc2_lra.LE |
value | null | val (+..) : t -> t -> t | null | earley-ocaml | unknown | Mc2_lra.LE.Infix | Mc2_lra.LE.Infix |
value | null | val (-..) : t -> t -> t | null | earley-ocaml | unknown | Mc2_lra.LE.Infix | Mc2_lra.LE.Infix |
value | null | val (*..) : num -> t -> t | null | earley-ocaml | unknown | Mc2_lra.LE.Infix | Mc2_lra.LE.Infix |
module | null | module PA = Smtlib_utils.V_2_6.Ast | null | earley-ocaml | unknown | Mc2_smtlib | Mc2_smtlib |
module | null | module Typecheck : sig ... end | null | earley-ocaml | unknown | Mc2_smtlib | Mc2_smtlib |
type | null | type 'a or_error = ('a, string) CCResult.t | null | earley-ocaml | unknown | Mc2_smtlib | Mc2_smtlib |
module | null | module Make (ARG : sig ... end) : sig ... end | null | earley-ocaml | unknown | Mc2_smtlib | Mc2_smtlib |
value | parse | val parse : string -> PA.statement list or_error | null | earley-ocaml | unknown | Mc2_smtlib.Make | Mc2_smtlib.Make.parse |
value | parse_stdin | val parse_stdin : unit -> PA.statement list or_error | null | earley-ocaml | unknown | Mc2_smtlib.Make | Mc2_smtlib.Make.parse_stdin |
value | typecheck | val typecheck : PA.statement list -> Mc2_core.Statement.t list or_error | null | earley-ocaml | unknown | Mc2_smtlib.Make | Mc2_smtlib.Make.typecheck |
value | process_stmt | val process_stmt : ?gc:bool -> ?restarts:bool -> ?pp_cnf:bool -> ?dot_proof:string -> ?pp_model:bool -> ?check:bool -> ?time:float -> ?memory:float -> ?progress:bool -> ?switch:Mc2_core.Util.Switch.t -> Mc2_core.Statement.t -> unit or_error | Process the given statement. | earley-ocaml | unknown | Mc2_smtlib.Make | Mc2_smtlib.Make.process_stmt |
value | solver | val solver : Mc2_core.Solver.t | null | earley-ocaml | unknown | Mc2_smtlib.Make | Mc2_smtlib.Make.solver |
module | null | module Loc = Smtlib_utils.V_2_6.Loc | null | earley-ocaml | unknown | Mc2_smtlib.Typecheck | Mc2_smtlib.Typecheck |
module | null | module PA = Smtlib_utils.V_2_6.Ast | null | earley-ocaml | unknown | Mc2_smtlib.Typecheck | Mc2_smtlib.Typecheck |
module | null | module T = Mc2_core.Term | null | earley-ocaml | unknown | Mc2_smtlib.Typecheck | Mc2_smtlib.Typecheck |
module | null | module Stmt = Mc2_core.Statement | null | earley-ocaml | unknown | Mc2_smtlib.Typecheck | Mc2_smtlib.Typecheck |
type | null | type 'a or_error = ('a, string) CCResult.t | null | earley-ocaml | unknown | Mc2_smtlib.Typecheck | Mc2_smtlib.Typecheck |
module | null | module Make (ARG : sig ... end) : sig ... end | null | earley-ocaml | unknown | Mc2_smtlib.Typecheck | Mc2_smtlib.Typecheck |
value | conv_term | val conv_term : PA.term -> T.t | null | earley-ocaml | unknown | Mc2_smtlib.Typecheck.Make | Mc2_smtlib.Typecheck.Make.conv_term |
value | conv_bool_term | val conv_bool_term : PA.term -> Mc2_core.Atom.t list list | null | earley-ocaml | unknown | Mc2_smtlib.Typecheck.Make | Mc2_smtlib.Typecheck.Make.conv_bool_term |
value | conv_statement | val conv_statement : PA.statement -> Stmt.t list | null | earley-ocaml | unknown | Mc2_smtlib.Typecheck.Make | Mc2_smtlib.Typecheck.Make.conv_statement |
value | solver | val solver : Mc2_core.Solver.t | null | earley-ocaml | unknown | Mc2_smtlib.Typecheck.Make | Mc2_smtlib.Typecheck.Make.solver |
module | null | module F : Mc2_core.Tseitin.S with type atom := Mc2_core.atom | Formulas | earley-ocaml | unknown | Mc2_propositional | Mc2_propositional |
value | k_cnf | val k_cnf : (?simplify:bool -> F.t -> Mc2_core.atom list list) Mc2_core.Service.Key.t | Service for computing CNF | earley-ocaml | unknown | Mc2_propositional | Mc2_propositional.k_cnf |
value | k_fresh | val k_fresh : (unit -> Mc2_core.atom) Mc2_core.Service.Key.t | Service for making fresh terms | earley-ocaml | unknown | Mc2_propositional | Mc2_propositional.k_fresh |
value | plugin | val plugin : Mc2_core.Plugin.Factory.t | Plugin providing boolean terms and the cnf service | earley-ocaml | unknown | Mc2_propositional | Mc2_propositional.plugin |
type | null | type combinator = | null | earley-ocaml | unknown | Mc2_propositional.F | Mc2_propositional.F |
type | null | type id | null | earley-ocaml | unknown | Mc2_propositional.F | Mc2_propositional.F |
type | null | type t = private { | null | earley-ocaml | unknown | Mc2_propositional.F | Mc2_propositional.F |
type | null | and view = | null | earley-ocaml | unknown | Mc2_propositional.F | Mc2_propositional.F |
value | view | val view : t -> view | null | earley-ocaml | unknown | Mc2_propositional.F | Mc2_propositional.F.view |
value | true_ | val true_ : t | The true formula, i.e a formula that is always satisfied. | earley-ocaml | unknown | Mc2_propositional.F | Mc2_propositional.F.true_ |
value | false_ | val false_ : t | The false formula, i.e a formula that cannot be satisfied. | earley-ocaml | unknown | Mc2_propositional.F | Mc2_propositional.F.false_ |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.