mirror of
https://github.com/c-cube/sidekick.git
synced 2025-12-11 13:38:43 -05:00
70 lines
3 KiB
OCaml
70 lines
3 KiB
OCaml
(*
|
|
MSAT is free software, using the Apache license, see file LICENSE
|
|
Copyright 2014 Guillaume Bury
|
|
Copyright 2014 Simon Cruanes
|
|
*)
|
|
|
|
(** Dot backend for proofs
|
|
|
|
This module provides functions to export proofs into the dot graph format.
|
|
Graphs in dot format can be used to generates images using the graphviz tool.
|
|
*)
|
|
|
|
module type S = Backend_intf.S
|
|
(** Interface for exporting proofs. *)
|
|
|
|
module type Arg = sig
|
|
(** Term printing for DOT
|
|
|
|
This module defines what functions are required in order to export
|
|
a proof to the DOT format.
|
|
*)
|
|
|
|
type atom
|
|
(** The type of atomic formuals *)
|
|
|
|
type hyp
|
|
type lemma
|
|
type assumption
|
|
(** The type of theory-specifi proofs (also called lemmas). *)
|
|
|
|
val print_atom : Format.formatter -> atom -> unit
|
|
(** Print the contents of the given atomic formulas.
|
|
WARNING: this function should take care to escape and/or not output special
|
|
reserved characters for the dot format (such as quotes and so on). *)
|
|
|
|
val hyp_info : hyp -> string * string option * (Format.formatter -> unit -> unit) list
|
|
val lemma_info : lemma -> string * string option * (Format.formatter -> unit -> unit) list
|
|
val assumption_info : assumption -> string * string option * (Format.formatter -> unit -> unit) list
|
|
(** Generate some information about the leafs of the proof tree. Currently this backend
|
|
print each lemma/assumption/hypothesis as a single leaf of the proof tree.
|
|
These function should return a triplet [(rule, color, l)], such that:
|
|
- [rule] is a name for the proof (arbitrary, does not need to be unique, but
|
|
should rather be descriptive)
|
|
- [color] is a color name (optional) understood by DOT
|
|
- [l] is a list of printers that will be called to print some additional information
|
|
*)
|
|
|
|
end
|
|
|
|
module Default(S : Msat.S) : Arg with type atom := S.atom
|
|
and type hyp := S.clause
|
|
and type lemma := S.clause
|
|
and type assumption := S.clause
|
|
(** Provides a reasonnable default to instantiate the [Make] functor, assuming
|
|
the original printing functions are compatible with DOT html labels. *)
|
|
|
|
module Make(S : Msat.S)(A : Arg with type atom := S.atom
|
|
and type hyp := S.clause
|
|
and type lemma := S.clause
|
|
and type assumption := S.clause) : S with type t := S.proof
|
|
(** Functor for making a module to export proofs to the DOT format. *)
|
|
|
|
module Simple(S : Msat.S)(A : Arg with type atom := S.formula
|
|
and type hyp = S.formula list
|
|
and type lemma := S.lemma
|
|
and type assumption = S.formula) : S with type t := S.proof
|
|
(** Functor for making a module to export proofs to the DOT format.
|
|
The substitution of the hyp type is non-destructive due to a restriction
|
|
of destructive substitutions on earlier versions of ocaml. *)
|
|
|