package dolmen
A parser library
Install
Dune Dependency
Authors
Maintainers
Sources
dolmen-0.4.1.tar.gz
md5=55a97ff61dd8398e38570272ae7e3964
sha512=83f71037eb568d5449ff2d968cb50a0b105c9712e0bd29497d1f95683698f394860a11d4dee2a2a41163504e395ef068c3974901fca11894d671684fe438fc51
doc/src/dolmen.icnf/ast_iCNF.ml.html
Source file ast_iCNF.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
(* This file is free software, part of dolmen. See file "LICENSE" for more information. *) (** AST requirements for the iCNF format. iCNF is a very simple format intended to express CNFs (conjunctive normal forms) in the simplest format possible. Compared to dimacs, iCNF allows local assumptions, and does not require to declare the number of clauses and formulas. *) 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 iCNF. *) type term (** The type of iCNF terms. *) type location (** The type of locations. *) val clause : ?loc:location -> term list -> t (** Make a clause from a list of literals. *) val assumption : ?loc:location -> term list -> t (** Generate a solve instruction with the given list of assumptions. *) end (** Requirements for implementations of iCNF statements. *)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>