package coq

You can search for identifiers within the package.

in-package search v0.2.0

Formal proof management system

Install

Dune Dependency

coq.inria.fr Edit opam file Versions (38)

Authors

T

The Coq development team, INRIA, CNRS, and contributors.

Maintainers

C

coqdev@inria.fr

Sources

coq-8.14.0.tar.gz

sha256=b1501d686c21836302191ae30f610cca57fb309214c126518ca009363ad2cd3c

doc/firstorder_plugin/Firstorder_plugin/Sequent/HP/index.html

Module `Sequent.HP`Source

type t

Type of functional heaps

type elt = Formula.t

Type of elements

val empty : t

The empty heap

val add : elt -> t -> t

add x h returns a new heap containing the elements of h, plus x; complexity $ O(log(n)) $

val maximum : t -> elt

maximum h returns the maximum element of h; raises EmptyHeap when h is empty; complexity $ O(1) $

val remove : t -> t

remove h returns a new heap containing the elements of h, except the maximum of h; raises EmptyHeap when h is empty; complexity $ O(log(n)) $

val iter : (elt -> unit) -> t -> unit

usual iterators and combinators; elements are presented in arbitrary order

val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a