package mc2

You can search for identifiers within the package.

in-package search v0.2.0

mc2.backend
- Mc2_backend
  - Backend_intf
    
    S
  - Dot
    
    Arg
    
    Default
    
    Make
    
    A
mc2.core
- Mc2_core
  - Actions
  - Atom
    
    Set
    
    Tbl
  - Bound_var
  - Builtins
  - Clause
    
    Set
    
    Tbl
  - Error
  - ID
    
    Map
    
    Set
    
    Smtlib
    
    Tbl
  - Int_map
  - Lemma
    
    TC
  - Plugin
    
    Factory
    
    S
  - Proof
    
    H
  - Service
    
    Key
    
    Registry
  - Solver
    
    Sat_state
    
    Unsat_state
  - Statement
  - Term
    
    Bool
    
    Map
    
    Set
    
    TC
    
    TERM_ALLOC
    
    TERM_ALLOC_OPS
    
    Tbl
    
    Term_allocator
    
    T
    
    Watch1
    
    Watch2
  - Tseitin
    
    Arg
    
    Make
    
    F
    
    S
  - Type
    
    Alloc
    
    T
    
    TC
    
    TY_ALLOC_OPS
  - Value
    
    TC
    
    Tbl
mc2.dimacs
- Mc2_dimacs
  - Plugin_sat
mc2.lra
- Mc2_lra
  - LE
    
    Infix
mc2.propositional
- Mc2_propositional
  - F
mc2.smtlib
- Mc2_smtlib
  - Make
    
    ARG
  - Typecheck
    
    Make
    
    ARG
mc2.uf
- Mc2_uf
mc2.unin_sort
- Mc2_unin_sort

Legend:
Library
Module
Module type
Parameter
Class
Class type

Term printing for DOT

This module defines what functions are required in order to export a proof to the DOT format.

val print_atom : Format.formatter -> Mc2_core.Atom.t -> 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 : 
  Mc2_core.Clause.t ->
  string * string option * (Format.formatter -> unit -> unit) list

val lemma_info : 
  Mc2_core.Clause.t ->
  string * string option * (Format.formatter -> unit -> unit) list

val assumption_info : 
  Mc2_core.Clause.t ->
  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