package coq

  1. Overview
  2. Docs
Formal proof management system

Install 

dune-project
 Dependency

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

Authors

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

Maintainers

  1. C
    coqdev@inria.fr

Sources

coq-8.14.1.tar.gz
sha256=3cbfc1e1a72b16d4744f5b64ede59586071e31d9c11c811a0372060727bfd9c3

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

Module Sequent.HPSource

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