package logtk
Core types and algorithms for logic
Install
Dune Dependency
Authors
Maintainers
Sources
2.1.tar.gz
md5=e72de75e9f0f87da9e6e8c0a4d4c89f9
sha512=81becfc9badd686ab3692cd9312172aa4c4e3581b110e81770bb01e0ffbc1eb8495d0dd6d43b98f3d06e6b8c8a338174c13ebafb4e9849a3ddf89f9a3a72c287
doc/logtk.proofs/Logtk_proofs/LLProof/index.html
Module Logtk_proofs.LLProof
Low Level Proofs
Low level proofs, intended for mechanical proof checking.
Instantiations (substitutions) are explicit because that should make the job of the checker easier.
NOTE: this is still uncooked, and will probably change.
val section : Logtk.Util.Section.t
type term = Logtk.TypedSTerm.t
type ty = term
type form = term
type inst = term list
Instantiate some binder with the following terms. Order matters.
type tag = Logtk.Proof.tag
val id : t -> int
val pp_step : step CCFormat.printer
val pp_parent : parent CCFormat.printer
val pp_id : t CCFormat.printer
val pp_res : t CCFormat.printer
val pp : t CCFormat.printer
Print only this step
val pp_dag : t CCFormat.printer
Print the whole DAG
val pp_inst : inst CCFormat.printer
val hash : t -> int
val by_def : Logtk.ID.t -> form -> t
val define : Logtk.ID.t -> form -> t
Checking steps
val pp_check_res : check_res CCFormat.printer
Printing
module Tbl : CCHashtbl.S with type key = t
module Dot : sig ... end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page