trait TacticCommands extends AnyRef

Source
TacticCommands.scala
Linear Supertypes
Known Subclasses
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TacticCommands
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from TacticCommands toany2stringadd[TacticCommands] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (TacticCommands, B)
    Implicit
    This member is added by an implicit conversion from TacticCommands toArrowAssoc[TacticCommands] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def allL(terms: Expr*): ForallLeftTactic

    Applies the ForallLeft tactic to the current subgoal: The goal

    Applies the ForallLeft tactic to the current subgoal: The goal

    ∀x1,...,∀xn.A, Γ :- Δ

    is reduced to

    A[x1\t1,...,xn\tn], ∀x1,...,∀xn.A, Γ :- Δ.

    This will only work if there is exactly one universal formula in the antecedent!

    terms

    The terms t1,...,tn.

  7. def allL(applyToLabel: String, terms: Expr*): ForallLeftTactic

    Applies the ForallLeft tactic to the current subgoal: The goal

    Applies the ForallLeft tactic to the current subgoal: The goal

    ∀x1,...,∀xn.A, Γ :- Δ

    is reduced to

    A[x1\t1,...,xn\tn], ∀x1,...,∀xn.A, Γ :- Δ.

    applyToLabel

    The label of the formula ∀x1,...,∀xn.A.

    terms

    The terms t1,...,tn.

  8. def allR: ForallRightTactic

    Applies the ForallRight tactic to the current subgoal: The goal

    Applies the ForallRight tactic to the current subgoal: The goal

    Γ :- Δ, ∀x.A

    is reduced to

    Γ :- Δ, A.

    This will only work if there is exactly one universal formula in the succedent!

  9. def allR(applyToLabel: String): ForallRightTactic

    Applies the ForallRight tactic to the current subgoal: The goal

    Applies the ForallRight tactic to the current subgoal: The goal

    Γ :- Δ, ∀x.A

    is reduced to

    Γ :- Δ, A.

    applyToLabel

    The label of the formula ∀x.A.

  10. def allR(eigenVariable: Var): ForallRightTactic

    Applies the ForallRight tactic to the current subgoal: The goal

    Applies the ForallRight tactic to the current subgoal: The goal

    Γ :- Δ, ∀x.A

    is reduced to

    Γ :- Δ, A[x\α].

    This will only work if there is exactly one universal formula in the succedent!

    eigenVariable

    The variable α.

  11. def allR(applyToLabel: String, eigenVariable: Var): ForallRightTactic

    Applies the ForallRight tactic to the current subgoal: The goal

    Applies the ForallRight tactic to the current subgoal: The goal

    Γ :- Δ, ∀x.A

    is reduced to

    Γ :- Δ, A[x\α].

    applyToLabel

    The label of the formula ∀x.A.

    eigenVariable

    The variable α.

  12. def anaInd(implicit ctx: Context): Tactic[Unit]
  13. def anaIndG(implicit ctx: Context): Tactic[Unit]
  14. def analyticInduction(implicit ctx: MutableContext): AnalyticInductionTactic
  15. def andL: AndLeftTactic

    Applies the AndLeft tactic to the current subgoal: The goal

    Applies the AndLeft tactic to the current subgoal: The goal

    A ∧ B, Γ :- Δ

    is reduced to

    A, B, Γ :- Δ.

    This will only work if there is exactly one conjunctive formula in the antecedent!

  16. def andL(applyToLabel: String): AndLeftTactic

    Applies the AndLeft tactic to the current subgoal: The goal

    Applies the AndLeft tactic to the current subgoal: The goal

    A ∧ B, Γ :- Δ

    is reduced to

    A, B, Γ :- Δ.

    applyToLabel

    The label of the formula A ∧ B.

  17. def andR: AndRightTactic

    Applies the AndRight tactic to the current subgoal: The goal

    Applies the AndRight tactic to the current subgoal: The goal

    Γ :- Δ, A ∧ B

    is reduced to

    Γ :- Δ, A and Γ :- Δ, B.

    This will only work if there is exactly one conjunctive formula in the succedent!

  18. def andR(applyToLabel: String): AndRightTactic

    Applies the AndRight tactic to the current subgoal: The goal

    Applies the AndRight tactic to the current subgoal: The goal

    Γ :- Δ, A ∧ B

    is reduced to

    Γ :- Δ, A and Γ :- Δ, B.

    applyToLabel

    The label of the formula A ∧ B.

  19. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  20. def axiomBot: BottomAxiomTactic

    Applies the BottomAxiom tactic to the current subgoal: A subgoal of the form ⊥, Γ :- Δ will be closed.

  21. def axiomLog: LogicalAxiomTactic

    Applies the LogicalAxiom tactic to the current subgoal: A subgoal of the form A, Γ :- Δ, A will be closed.

  22. def axiomRefl: ReflexivityAxiomTactic

    Applies the ReflexivityAxiom tactic to the current subgoal: A subgoal of the form Γ :- Δ, s = s will be closed.

  23. def axiomTop: TopAxiomTactic

    Applies the TopAxiom tactic to the current subgoal: A subgoal of the form Γ :- Δ, ⊤ will be closed.

  24. def by: TacticBlockArgument[Tactic[Unit]]

    by { tac1; tac2; ...; tacn } solves the first goal using the provided tactic block, and fails otherwise

  25. def cases(lemma: String, terms: Expr*)(implicit ctx: Context): Tactic[Unit]
  26. def casesW(label: String, lemma: String, terms: Expr*)(implicit ctx: Context): Tactic[Unit]
  27. def chain(h: String): ChainTactic
  28. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  29. def cut(label: String, cutFormula: Formula): CutTactic

    Applies the Cut tactic to the current subgoal: The goal

    Applies the Cut tactic to the current subgoal: The goal

    Γ :- Δ

    is reduced to

    Γ :- Δ, C and C, Γ :- Δ.

    label

    The label of C.

    cutFormula

    The formula C.

  30. def decompose: Tactic[Unit]

    Decomposes the current subgoal by applying all "simple" rules as often as possible.

    Decomposes the current subgoal by applying all "simple" rules as often as possible. These rules are: - ¬:l and ¬:r - ∧:l - ∨:r - →:r - ∀:r - ∃:l

  31. def destruct(label: String): Tactic[Any]
  32. def ensuring(cond: (TacticCommands) => Boolean, msg: => Any): TacticCommands
    Implicit
    This member is added by an implicit conversion from TacticCommands toEnsuring[TacticCommands] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  33. def ensuring(cond: (TacticCommands) => Boolean): TacticCommands
    Implicit
    This member is added by an implicit conversion from TacticCommands toEnsuring[TacticCommands] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  34. def ensuring(cond: Boolean, msg: => Any): TacticCommands
    Implicit
    This member is added by an implicit conversion from TacticCommands toEnsuring[TacticCommands] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  35. def ensuring(cond: Boolean): TacticCommands
    Implicit
    This member is added by an implicit conversion from TacticCommands toEnsuring[TacticCommands] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  36. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  37. def eql(eq: String, fm: String): EqualityTactic

    Applies the Equality tactic to the current subgoal: Given an equation s = t and a formula A, some occurrences of s in A are replaced by t or vice versa.

    Applies the Equality tactic to the current subgoal: Given an equation s = t and a formula A, some occurrences of s in A are replaced by t or vice versa. The exact behavior can be controlled with additional commands:

    - fromLeftToRight: Occurrences of s will be replaced by t. - fromRightToLeft: Occurrences of t will be replaced by s. - yielding(f): The tactic will attempt to replace occurences in such a way that the end result is f.

    If neither fromLeftToRight nor fromRightToLeft is used, the direction of replacement needs to be unambiguous, i.e. s and t may not both occur in A.

    eq

    The label of s = t.

    fm

    The label of A.

  38. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  39. def escargot(implicit ctx: MutableContext): ResolutionProverTactic

    Calls escargot on the current subgoal.

  40. def escrgt(implicit ctx: Context): Tactic[Unit]
  41. def exL: ExistsLeftTactic

    Applies the ExistsLeft tactic to the current subgoal: The goal

    Applies the ExistsLeft tactic to the current subgoal: The goal

    ∃x.A, Γ :- Δ

    is reduced to

    A, Γ :- Δ.

    This will only work if there is exactly one existential formula in the antecedent!

  42. def exL(applyToLabel: String): ExistsLeftTactic

    Applies the ExistsLeft tactic to the current subgoal: The goal

    Applies the ExistsLeft tactic to the current subgoal: The goal

    ∃x.A, Γ :- Δ

    is reduced to

    A, Γ :- Δ.

    applyToLabel

    The label of the formula ∃x.A.

  43. def exL(eigenVariable: Var): ExistsLeftTactic

    Applies the ExistsLeft tactic to the current subgoal: The goal

    Applies the ExistsLeft tactic to the current subgoal: The goal

    ∃x.A, Γ :- Δ

    is reduced to

    A[x\α], Γ :- Δ.

    This will only work if there is exactly one existential formula in the antecedent!

    eigenVariable

    The variable α.

  44. def exL(applyToLabel: String, eigenVariable: Var): ExistsLeftTactic

    Applies the ExistsLeft tactic to the current subgoal: The goal

    Applies the ExistsLeft tactic to the current subgoal: The goal

    ∃x.A, Γ :- Δ

    is reduced to

    A[x\α], Γ :- Δ.

    applyToLabel

    The label of the formula ∃x.A.

    eigenVariable

    The variable α.

  45. def exR(terms: Expr*): ExistsRightTactic

    Applies the ExistsRight tactic to the current subgoal: The goal

    Applies the ExistsRight tactic to the current subgoal: The goal

    Γ :- Δ, ∃x1...∃xn.A

    is reduced to

    Γ :- Δ, ∃x1...∃xn.A, A[x1\t1,...,xn\tn].

    This will only work if there is exactly one existential formula in the succedent!

    terms

    The terms t1,...,tn.

  46. def exR(applyToLabel: String, terms: Expr*): ExistsRightTactic

    Applies the ExistsRight tactic to the current subgoal: The goal

    Applies the ExistsRight tactic to the current subgoal: The goal

    Γ :- Δ, ∃x1...∃xn.A

    is reduced to

    Γ :- Δ, ∃x1...∃xn.A, A[x1\t1,...,xn\tn].

    applyToLabel

    The label of the formula ∃x1...∃xn.A.

    terms

    The terms t1,...,tn.

  47. def fail: Tactic[Nothing] { def apply(proofState: gapt.proofs.gaptic.ProofState): scala.util.Left[gapt.proofs.gaptic.TacticFailure,Nothing] }

    Tactic that immediately fails.

  48. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  49. def foTheory(implicit ctx: Context): Tactic[Unit]

    Solves the current subgoal as a first-order consequence of the background theory.

    Solves the current subgoal as a first-order consequence of the background theory. This closes the goal.

    ctx

    A gapt.proofs.context.Context. The current subgoal must be contained in its background theory.

  50. def focus(indexOfSubGoal: OpenAssumptionIndex): FocusTactic

    Moves the specified goal to the front of the goal list.

    Moves the specified goal to the front of the goal list.

    indexOfSubGoal

    The index of the goal.

  51. def focus(indexOfSubGoal: Int): FocusTactic

    Moves the specified goal to the front of the goal list.

    Moves the specified goal to the front of the goal list.

    indexOfSubGoal

    The index of the goal.

  52. def forget(pred: (String, Formula) => Boolean): Tactic[Unit]
  53. def forget(ls: String*): Tactic[Unit]

    Lets you "forget" a sequence of formulas, i.e.

    Lets you "forget" a sequence of formulas, i.e. the tactics version of the weakening rule. The formulas with labels L1,...,Ln will be removed from the current goal.

    ls

    The labels L1,...,Ln.

  54. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from TacticCommands toStringFormat[TacticCommands] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  55. def forwardChain(lemma: String, target: TacticApplyMode = UniqueFormula, substitution: Map[Var, Expr] = Map()): ForwardChain

  56. def generalize(vs: Var*): Tactic[Unit]
  57. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  58. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  59. def haveInstance(formula: Formula, polarity: Polarity): Tactic[String]

    Instantiates prenex quantifiers to obtain a formula in a given polarity.

  60. def haveInstances(sequent: HOLSequent): Tactic[Sequent[String]]
  61. def impL: ImpLeftTactic

    Applies the ImpLeft tactic to the current subgoal: The goal

    Applies the ImpLeft tactic to the current subgoal: The goal

    A → B, Γ :- Δ

    is reduced to

    Γ :- Δ, A and B, Γ :- Δ.

    This will only work if there is exactly one implicative formula in the antecedent!

  62. def impL(applyToLabel: String): ImpLeftTactic

    Applies the ImpLeft tactic to the current subgoal: The goal

    Applies the ImpLeft tactic to the current subgoal: The goal

    A → B, Γ :- Δ

    is reduced to

    Γ :- Δ, A and B, Γ :- Δ.

    applyToLabel

    The label of the formula A → B.

  63. def impR: ImpRightTactic

    Applies the ImpRight tactic to the current subgoal: The goal

    Applies the ImpRight tactic to the current subgoal: The goal

    Γ :- Δ, A → B

    is reduced to

    A, Γ :- Δ, B.

    This will only work if there is exactly one implicative formula in the succedent!

  64. def impR(applyToLabel: String): ImpRightTactic

    Applies the ImpRight tactic to the current subgoal: The goal

    Applies the ImpRight tactic to the current subgoal: The goal

    Γ :- Δ, A → B

    is reduced to

    A, Γ :- Δ, B.

    applyToLabel

    The label of the formula A → B.

  65. def include(labels: String*)(implicit ctx: Context, dummyImplicit: DummyImplicit): Tactic[Unit]
  66. def include(names: Expr*)(implicit ctx: Context): Tactic[Unit]
  67. def include(label: String, proof: LKProof): Tactic[Unit]

    Uses an LKProof as a lemma.

    Uses an LKProof as a lemma.

    If proof ends in Γ :- φ, then the current goal

    Γ, Π :- Λ

    is reduced to

    Γ, Π, φ :- Λ

    label

    the label for φ in the subgoal

    proof

    The proof to insert as a lemma by a cut.

  68. def induction(on: Var, label: String)(implicit ctx: Context): InductionTactic

    Applies the Induction tactic to the current subgoal: The goal

    Applies the Induction tactic to the current subgoal: The goal

    Γ, :- Δ, ∀x.A

    is reduced to n new subgoals, where n is the number of constructors of the type of x.

    label

    The label of the formula ∀x.A.

    ctx

    A gapt.proofs.context.Context. It must contain an inductive definition of the type of x.

  69. def induction(on: Var)(implicit ctx: Context): InductionTactic

    Applies the Induction tactic to the current subgoal: The goal

    Applies the Induction tactic to the current subgoal: The goal

    Γ, :- Δ, ∀x.A

    is reduced to n new subgoals, where n is the number of constructors of the type of x.

    This will only work if there is exactly one universal formula in the succedent!

    ctx

    A gapt.proofs.context.Context. It must contain an inductive definition of the type of x.

  70. def insert(proof: LKProof): InsertTactic

    Inserts an LKProof for the current subgoal.

    Inserts an LKProof for the current subgoal.

    proof

    The proof to be inserted. Its end-sequent must subsume the current goal.

  71. def introUnivsExcept(i: Int): Tactic[Unit]
  72. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  73. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  74. def negL: NegLeftTactic

    Applies the NegLeft tactic to the current subgoal: The goal

    Applies the NegLeft tactic to the current subgoal: The goal

    ¬A, Γ :- Δ

    is reduced to

    Γ :- Δ, A.

    This will only work if there is exactly one negated formula in the antecedent!

  75. def negL(applyToLabel: String): NegLeftTactic

    Applies the NegLeft tactic to the current subgoal: The goal

    Applies the NegLeft tactic to the current subgoal: The goal

    ¬A, Γ :- Δ

    is reduced to

    Γ :- Δ, A.

    applyToLabel

    The label of the formula ¬A.

  76. def negR: NegRightTactic

    Applies the NegRight tactic to the current subgoal: The goal

    Applies the NegRight tactic to the current subgoal: The goal

    Γ :- Δ, A

    is reduced to

    A, Γ :- Δ.

    This will only work if there is exactly one negated formula in the succedent!

  77. def negR(applyToLabel: String): NegRightTactic

    Applies the NegRight tactic to the current subgoal: The goal

    Applies the NegRight tactic to the current subgoal: The goal

    Γ :- Δ, ¬A

    is reduced to

    A, Γ :- Δ.

    applyToLabel

    The label of the formula ¬A.

  78. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  79. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  80. def now: Tactic[Unit]
  81. def orL: OrLeftTactic

    Applies the OrLeft tactic to the current subgoal: The goal

    Applies the OrLeft tactic to the current subgoal: The goal

    A ∨ B, Γ :- Δ

    is reduced to

    A, Γ :- Δ and B, Γ :- Δ.

    This will only work if there is exactly one disjunctive formula in the antecedent!

  82. def orL(applyToLabel: String): OrLeftTactic

    Applies the OrLeft tactic to the current subgoal: The goal

    Applies the OrLeft tactic to the current subgoal: The goal

    A ∨ B, Γ :- Δ

    is reduced to

    A, Γ :- Δ and B, Γ :- Δ.

    applyToLabel

    The label of the formula A ∨ B.

  83. def orR: OrRightTactic

    Applies the OrRight tactic to the current subgoal: The goal

    Applies the OrRight tactic to the current subgoal: The goal

    Γ :- Δ, A ∨ B

    is reduced to

    Γ :- Δ, A, B.

    This will only work if there is exactly one disjunctive formula in the succedent!

  84. def orR(applyToLabel: String): OrRightTactic

    Applies the OrRight tactic to the current subgoal: The goal

    Applies the OrRight tactic to the current subgoal: The goal

    Γ :- Δ, A ∨ B

    is reduced to

    Γ :- Δ, A, B.

    applyToLabel

    The label of the formula A ∨ B.

  85. def prop: Tactic[Unit]

    Calls the builtin tableau prover on the current subgoal.

    Calls the builtin tableau prover on the current subgoal. If the goal is a tautology, a proof will automatically be found and inserted.

  86. def prover9(implicit ctx: MutableContext): ResolutionProverTactic

    Calls prover9 on the current subgoal.

  87. def quasiprop: Tactic[Unit]
  88. def ref(proofName: String)(implicit ctx: Context): ProofLinkTactic

    Applies the LogicalAxiom tactic to the current subgoal: A subgoal of the form A, Γ :- Δ, A will be closed.

  89. def refl: ReflexivityAxiomTactic

    Synonym for axiomRefl.

  90. def renameLabel(oldLabel: String): RenameTactic

    Changes the provided label.

    Changes the provided label. Syntax:

    renameLabel("foo") to "bar"
    oldLabel

    The label to be renamed.

  91. def repeat[T](t: Tactic[T]): RepeatTactic[T]

    Repeats a tactical until it fails.

    Repeats a tactical until it fails.

    t

    A tactical.

  92. def resolutionProver(prover: Prover)(implicit ctx: MutableContext): ResolutionProverTactic
  93. def revert(hyps: String*): Tactic[Unit]
  94. def rewrite: RewriteTactic

    Rewrites the formula specified by target using (possibly universally quantified) equations.

    Rewrites the formula specified by target using (possibly universally quantified) equations.

    rewrite.many ltr "equation1" in "target"
    rewrite.many ltr ("equation1", "eq2") rtl ("eq3", "eq4") in "target" subst (hov"x" -> le"f(f(c))")

    ltr: rewrite left-to-right using this equation rtl: rewrite right-to-left using this equation many: rewrite as long as possible (default is to only rewrite once)

  95. def simp(implicit ctx: Context): SimpTactic
  96. def skip: Tactic[Unit]

    Does nothing.

  97. def subst(hyps: String*): Tactic[Unit]
  98. def subst1(hyp: String): SubstTactic
  99. def subst1: SubstTactic
  100. def substAll: Tactic[Unit]
  101. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  102. def theory(implicit ctx: Context): Tactic[Unit]

    Declares the current subgoal as a theory axiom, i.e.

    Declares the current subgoal as a theory axiom, i.e. a sequent that is contained in the background theory. This closes the goal.

    ctx

    A gapt.proofs.context.Context. The current subgoal must be contained in its background theory.

  103. def toString(): String
    Definition Classes
    AnyRef → Any
  104. def trace(implicit sig: BabelSignature): Tactic[Unit]
  105. def treeGrammarInduction(implicit ctx: Context): TreeGrammarInductionTactic
  106. def trivial: Tactic[Unit]

    Attempts to apply the tactics axiomTop, axiomBot, axiomRefl, and axiomLog.

  107. def unfold(definitions: String*)(implicit ctx: Context): UnfoldTacticHelper

    Replaces a defined constant with its definition.

    Replaces a defined constant with its definition. Syntax:

    unfold("def1", "def2",...,"defn") in ("label1", "label2",...,"labelk")

    NB: This will only replace the first definition it finds in each supplied formula. If you want to unfold all definitions, use repeat.

    definitions

    The definitions def1,...,defn.

    ctx

    A gapt.proofs.context.Context. The definitions you want to unfold need to be present in ctx.

  108. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  109. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  110. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  111. object currentGoal extends Tactical1[OpenAssumption] with Product with Serializable

    Retrieves the current subgoal.

Deprecated Value Members

  1. def sorry: Tactic[Unit]

    Leaves a hole in the current proof by inserting a dummy proof of the empty sequent.

    Leaves a hole in the current proof by inserting a dummy proof of the empty sequent.

    Annotations
    @deprecated
    Deprecated

    (Since version the dawn of time) Proof not finished!

  2. def [B](y: B): (TacticCommands, B)
    Implicit
    This member is added by an implicit conversion from TacticCommands toArrowAssoc[TacticCommands] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromTacticCommands to any2stringadd[TacticCommands]

Inherited by implicit conversion StringFormat fromTacticCommands to StringFormat[TacticCommands]

Inherited by implicit conversion Ensuring fromTacticCommands to Ensuring[TacticCommands]

Inherited by implicit conversion ArrowAssoc fromTacticCommands to ArrowAssoc[TacticCommands]

Ungrouped