package dolmen
A parser library for automated deduction
Install
Dune Dependency
Authors
Maintainers
Sources
dolmen-0.9.tbz
sha256=003db53854bacc3a33fa55ed69cf79817c10369a4f7c6be944af1dcc36578a0a
sha512=3f8570f41c8c559c2907734efca98eecfc0f28ec3bce9dde500d5777a97391121a89ca66e7135d40b15161fe890d7b40fa53daba83eab0accf71fff136d45c74
doc/src/dolmen.dimacs/ast.ml.html
Source file ast.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
(* This file is free software, part of dolmen. See file "LICENSE" for more information. *) (** AST requirements for the Dimacs format. Dimacs is a very simple format intended to express CNFs (conjunctive normal forms) in the simplest format possible. *) module type Term = sig type t (** The type of terms. *) type location (** The type of locations. *) val atom : ?loc:location -> int -> t (** Make an atom from an non-zero integer. Positive integers denotes variables, and negative integers denote the negation of the variable corresponding to their absolute value. *) end (** Requirements for implementations of Dimacs terms. *) module type Statement = sig type t (** The type of statements for dimacs. *) type term (** The type of dimacs terms. *) type location (** The type of locations. *) val p_cnf : ?loc:location -> int -> int -> t (** Header of a dimacs file. First argument is the number of variables, second is the number of clauses. *) val clause : ?loc:location -> term list -> t (** Make a clause from a list of literals. *) end (** Requirements for implementations of Dimacs statements. *)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>