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.15.0.tar.gz

sha256=73466e61f229b23b4daffdd964be72bd7a110963b9d84bd4a86bb05c5dc19ef3

doc/coq-core.interp/NumTok/Signed/index.html

Module `NumTok.Signed`Source

Sourcetype t = sign * Unsigned.t

Sourceval equal : t -> t -> bool

Sourceval is_zero : t -> bool

Sourceval of_nat : UnsignedNat.t -> t

Sourceval of_int : SignedNat.t -> t

Sourceval to_int : t -> SignedNat.t option

Sourceval is_int : t -> bool

Sourceval sprint : t -> string

Sourceval print : t -> Pp.t

sprint and print returns the number as it was parsed, for printing

Sourceval parse_string : string -> t option

Parse the string as a signed Coq number, if possible

Sourceval of_int_string : string -> t

Convert from a string in the syntax of OCaml's int/int64

Sourceval of_string : string -> t

Convert from a string in the syntax of OCaml's string_of_float

Sourceval to_string : t -> string

Returns a string in the syntax of OCaml's float_of_string

Sourceval of_bigint : num_class -> Z.t -> t

Sourceval to_bigint : t -> Z.t option

Convert from and to bigint when the denotation of a bigint

Source

val of_int_frac_and_exponent : 
  SignedNat.t ->
  UnsignedNat.t option ->
  SignedNat.t option ->
  t

Source

val to_int_frac_and_exponent : 
  t ->
  SignedNat.t * UnsignedNat.t option * SignedNat.t option

n, p and q such that the number is n.p*10^q or n.p*2^q pre/postcondition: classify n = classify p, classify q = CDec

Sourceval of_bigint_and_exponent : Z.t -> Z.t exp -> t

Sourceval to_bigint_and_exponent : t -> Z.t * Z.t exp

n and p such that the number is n*10^p or n*2^p

Sourceval classify : t -> num_class

Sourceval is_bigger_int_than : t -> UnsignedNat.t -> bool

Test if an integer whose absolute value is bounded