-let rec pp_tactic ~map_unicode_to_tex ~term_pp ~lazy_term_pp =
- let pp_terms = pp_terms ~term_pp in
- let pp_tactics = pp_tactics ~map_unicode_to_tex ~term_pp ~lazy_term_pp in
- let pp_reduction_kind = pp_reduction_kind ~term_pp in
- let pp_tactic_pattern =
- pp_tactic_pattern ~map_unicode_to_tex ~lazy_term_pp ~term_pp in
- let rec pp_tactic =
- function
- (* Higher order tactics *)
- | Do (_, count, tac) ->
- Printf.sprintf "do %d %s" count (pp_tactic tac)
- | Repeat (_, tac) -> "repeat " ^ pp_tactic tac
- | Seq (_, tacs) -> pp_tactics ~sep:"; " tacs
- | Then (_, tac, tacs) ->
- Printf.sprintf "%s; [%s]" (pp_tactic tac)
- (pp_tactics ~sep:" | " tacs)
- | First (_, tacs) ->
- Printf.sprintf "tries [%s]" (pp_tactics ~sep:" | " tacs)
- | Try (_, tac) -> "try " ^ pp_tactic tac
- | Solve (_, tac) ->
- Printf.sprintf "solve [%s]" (pp_tactics ~sep:" | " tac)
- | Progress (_, tac) -> "progress " ^ pp_tactic tac
- (* First order tactics *)
- | Absurd (_, term) -> "absurd" ^ term_pp term
- | Apply (_, term) -> "apply " ^ term_pp term
- | ApplyRule (_, term) -> "apply rule " ^ term_pp term
- | ApplyP (_, term) -> "applyP " ^ term_pp term
- | ApplyS (_, term, params) ->
- "applyS " ^ term_pp term ^ pp_auto_params ~term_pp params
- | AutoBatch (_,params) -> "autobatch " ^
- pp_auto_params ~term_pp params
- | Assumption _ -> "assumption"
- | Cases (_, term, pattern, specs) ->
- Printf.sprintf "cases %s %s%s"
- (term_pp term)
- (pp_tactic_pattern pattern)
- (pp_intros_specs "names " specs)
- | Change (_, where, with_what) ->
- Printf.sprintf "change %s with %s" (pp_tactic_pattern where) (lazy_term_pp with_what)
- | Clear (_,ids) -> Printf.sprintf "clear %s" (pp_hyps ids)
- | ClearBody (_,id) -> Printf.sprintf "clearbody %s" (pp_hyps [id])
- | Constructor (_,n) -> "constructor " ^ string_of_int n
- | Compose (_,t1, t2, times, intro_specs) ->
- Printf.sprintf "compose %s%s %s%s"
- (if times > 0 then string_of_int times ^ " " else "")
- (term_pp t1) (match t2 with None -> "" | Some t2 -> "with "^term_pp t2)
- (pp_intros_specs " as " intro_specs)
- | Contradiction _ -> "contradiction"
- | Cut (_, ident, term) ->
- "cut " ^ term_pp term ^
- (match ident with None -> "" | Some id -> " as " ^ id)
- | Decompose (_, names) ->
- Printf.sprintf "decompose%s"
- (pp_intros_specs "names " (None, names))
- | Demodulate (_, params) -> "demodulate " ^ pp_auto_params ~term_pp params
- | Destruct (_, None) -> "destruct"
- | Destruct (_, Some terms) -> "destruct " ^ pp_terms terms
- | Elim (_, what, using, pattern, specs) ->
- Printf.sprintf "elim %s%s %s%s"
- (term_pp what)
- (match using with None -> "" | Some term -> " using " ^ term_pp term)
- (pp_tactic_pattern pattern)
- (pp_intros_specs "names " specs)
- | ElimType (_, term, using, specs) ->
- Printf.sprintf "elim type %s%s%s"
- (term_pp term)
- (match using with None -> "" | Some term -> " using " ^ term_pp term)
- (pp_intros_specs "names " specs)
- | Exact (_, term) -> "exact " ^ term_pp term
- | Exists _ -> "exists"
- | Fold (_, kind, term, pattern) ->
- Printf.sprintf "fold %s %s %s" (pp_reduction_kind kind)
- (lazy_term_pp term) (pp_tactic_pattern pattern)
- | FwdSimpl (_, hyp, names) ->
- Printf.sprintf "fwd %s%s" hyp (pp_intros_specs "names " (None, names))
- | Generalize (_, pattern, ident) ->
- Printf.sprintf "generalize %s%s" (pp_tactic_pattern pattern)
- (match ident with None -> "" | Some id -> " as " ^ id)
- | Fail _ -> "fail"
- | Fourier _ -> "fourier"
- | IdTac _ -> "id"
- | Intros (_, specs) -> Printf.sprintf "intros%s" (pp_intros_specs "" specs)
- | Inversion (_, term) -> "inversion " ^ term_pp term
- | LApply (_, linear, level_opt, terms, term, ident_opt) ->
- Printf.sprintf "lapply %s%s%s%s%s"
- (if linear then " linear " else "")
- (match level_opt with None -> "" | Some i -> " depth = " ^ string_of_int i ^ " ")
- (term_pp term)
- (match terms with [] -> "" | _ -> " to " ^ pp_terms terms)
- (match ident_opt with None -> "" | Some ident -> " as " ^ ident)
- | Left _ -> "left"
- | LetIn (_, term, ident) ->
- Printf.sprintf "letin %s \\def %s" ident (term_pp term)
- | Reduce (_, kind, pat) ->
- Printf.sprintf "%s %s" (pp_reduction_kind kind) (pp_tactic_pattern pat)
- | Reflexivity _ -> "reflexivity"
- | Replace (_, pattern, t) ->
- Printf.sprintf "replace %s with %s" (pp_tactic_pattern pattern) (lazy_term_pp t)
- | Rewrite (_, pos, t, pattern, names) ->
- Printf.sprintf "rewrite %s %s %s%s"
- (if pos = `LeftToRight then ">" else "<")
- (term_pp t)
- (pp_tactic_pattern pattern)
- (if names = [] then "" else " as " ^ pp_idents names)
- | Right _ -> "right"
- | Ring _ -> "ring"
- | Split _ -> "split"
- | Symmetry _ -> "symmetry"
- | Transitivity (_, term) -> "transitivity " ^ term_pp term
- (* Tattiche Aggiunte *)
- | Assume (_, ident , term) -> "assume" ^ ident ^ ":" ^ term_pp term
- | Suppose (_, term, ident,term1) -> "suppose" ^ term_pp term ^ "(" ^ ident ^ ")" ^ (match term1 with None -> " " | Some term1 -> term_pp term1)
- | Bydone (_, just) -> pp_just ~term_pp just ^ "done"
- | By_just_we_proved (_, just, term1, ident, term2) -> pp_just ~term_pp just ^ "we proved" ^ term_pp term1 ^ (match ident with None -> "" | Some ident -> "(" ^ident^ ")") ^
- (match term2 with None -> " " | Some term2 -> term_pp term2)
- | We_need_to_prove (_, term, ident, term1) -> "we need to prove" ^ term_pp term ^ (match ident with None -> "" | Some ident -> "(" ^ ident ^ ")") ^ (match term1 with None -> " " | Some term1 -> term_pp term1)
- | We_proceed_by_cases_on (_, term, term1) -> "we proceed by cases on" ^ term_pp term ^ "to prove" ^ term_pp term1
- | We_proceed_by_induction_on (_, term, term1) -> "we proceed by induction on" ^ term_pp term ^ "to prove" ^ term_pp term1
- | Byinduction (_, term, ident) -> "by induction hypothesis we know" ^ term_pp term ^ "(" ^ ident ^ ")"
- | Thesisbecomes (_, term) -> "the thesis becomes " ^ term_pp term
- | ExistsElim (_, just, ident, term, ident1, term1) -> pp_just ~term_pp just ^ "let " ^ ident ^ ":" ^ term_pp term ^ "such that " ^ lazy_term_pp term1 ^ "(" ^ ident1 ^ ")"
- | AndElim (_, just, ident1, term1, ident2, term2) -> pp_just ~term_pp just ^ "we have " ^ term_pp term1 ^ " (" ^ ident1 ^ ") " ^ "and " ^ term_pp term2 ^ " (" ^ ident2 ^ ")"
- | RewritingStep (_, term, term1, term2, cont) ->
- (match term with
- | None -> " "
- | Some (None,term) -> "conclude " ^ term_pp term
- | Some (Some name,term) ->
- "obtain (" ^ name ^ ") " ^ term_pp term)
- ^ "=" ^
- term_pp term1 ^
- (match term2 with
- | `Auto params -> pp_auto_params ~term_pp params
- | `Term term2 -> " exact " ^ term_pp term2
- | `Proof -> " proof"
- | `SolveWith term -> " using " ^ term_pp term)
- ^ (if cont then " done" else "")
- | Case (_, id, args) ->
- "case" ^ id ^
- String.concat " "
- (List.map (function (id,term) -> "(" ^ id ^ ": " ^ term_pp term ^ ")")
- args)
- in pp_tactic
-
-and pp_tactics ~map_unicode_to_tex ~term_pp ~lazy_term_pp ~sep tacs =
- String.concat sep
- (List.map (pp_tactic ~map_unicode_to_tex ~lazy_term_pp ~term_pp) tacs)
-
- let pp_search_kind = function
- | `Locate -> "locate"
- | `Hint -> "hint"
- | `Match -> "match"
- | `Elim -> "elim"
- | `Instance -> "instance"
-
-let pp_arg ~term_pp arg =
- let s = term_pp arg in
- if s = "" || (s.[0] = '(' && s.[String.length s - 1] = ')') then
- (* _nice_ heuristic *)
- s
- else
- "(" ^ s ^ ")"
-
-let pp_nmacro = function
- | NCheck (_, term) -> Printf.sprintf "ncheck %s" (CicNotationPp.pp_term term)