package logtk

  1. Overview
  2. Docs
Core types and algorithms for logic

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (4)

Authors

  1. S
    Simon Cruanes
  2. P
    Petar Vukmirovic
  3. A
    Alexander Bentkamp
  4. S
    Sophie Tourret
  5. V
    Visa Nummelin

Maintainers

  1. S
    simon.cruanes.2.17@m4x.org

Sources

2.1.tar.gz
md5=e72de75e9f0f87da9e6e8c0a4d4c89f9
sha512=81becfc9badd686ab3692cd9312172aa4c4e3581b110e81770bb01e0ffbc1eb8495d0dd6d43b98f3d06e6b8c8a338174c13ebafb4e9849a3ddf89f9a3a72c287

doc/logtk.proofs/Logtk_proofs/LLTerm/Form/index.html

Module LLTerm.Form

type t = term
type view = private
  1. | True
  2. | False
  3. | Or of t list
  4. | And of t list
  5. | Not of t
  6. | Equiv of t * t
  7. | Xor of t * t
  8. | Imply of t * t
  9. | Atom of t
  10. | Eq of t * t
  11. | Neq of t * t
  12. | Int_pred of Logtk_arith.Z.t linexp * Int_op.t
  13. | Rat_pred of Logtk_arith.Q.t linexp * Rat_op.t
  14. | Forall of {
    1. ty_var : ty;
    2. body : t;
    }
  15. | Exists of {
    1. ty_var : ty;
    2. body : t;
    }
val view : t -> view
val true_ : t
val false_ : t
val eq : t -> t -> t
val neq : t -> t -> t
val not_ : t -> t
val and_ : t list -> t
val or_ : t list -> t
val imply : t -> t -> t
val equiv : t -> t -> t
val xor : t -> t -> t
val int_pred : Linexp_int.t -> Int_op.t -> t
val rat_pred : Linexp_rat.t -> Rat_op.t -> t
val forall : ty_var:ty -> t -> t
val exists : ty_var:ty -> t -> t