package logtk
Core types and algorithms for logic
Install
Dune Dependency
Authors
Maintainers
Sources
2.0.tar.gz
md5=7a8e57388083ed763d12d18324c8a086
sha512=5c5ac312ada6b42907d1e91e349454a8375f7bf8165d3459721a40b707a840a3d6b3dc968a66f1040cb4de7aedf5c1c13f3e90b51337eae5ea6de41651d7bd63
doc/logtk.proofs/Logtk_proofs/LLTerm/index.html
Module Logtk_proofs.LLTerm
Terms For Proofs
type var = t Logtk.HVar.t
module Int_op : sig ... end
module Rat_op : sig ... end
type view =
| Type
| Const of Logtk.ID.t
| App of t * t
(*curried application
*)| Arrow of t * t
(*functional arrow
*)| Var of var
(*bound var
*)| Bind of {
binder : Logtk.Binder.t;
ty_var : t;
body : t;
}
| AppBuiltin of Logtk.Builtin.t * t list
| Ite of t * t * t
| Int_pred of Z.t linexp * Int_op.t
| Rat_pred of Q.t linexp * Rat_op.t
type term = t
type ty = t
module type LINEXP = sig ... end
linear expressions
module Linexp_int : LINEXP with type num = Z.t
module Linexp_rat : LINEXP with type num = Q.t
val hash : t -> int
val is_type : t -> bool
val t_type : ty
val const : ty:ty -> Logtk.ID.t -> t
val bind : ty:ty -> Logtk.Binder.t -> ty_var:ty -> t -> t
val app_builtin : ty:ty -> Logtk.Builtin.t -> t list -> t
val builtin : ty:ty -> Logtk.Builtin.t -> t
val int_pred : Linexp_int.t -> Int_op.t -> t
val rat_pred : Linexp_rat.t -> Rat_op.t -> t
val bool : ty
val pp : t CCFormat.printer
val pp_inner : t CCFormat.printer
module Form : sig ... end
module Conv : sig ... end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page