diff options
| author | Son Ho | 2024-05-24 16:32:59 +0200 |
|---|---|---|
| committer | Son Ho | 2024-05-24 16:32:59 +0200 |
| commit | 321263384bb1e6e8bfd08806f35164bdba387d74 (patch) | |
| tree | 04d90b72b7591e380079614a4335e9ca7fe11268 /backends/lean/Base/Arith/Scalar.lean | |
| parent | 765cb792916c1c69f864a6cf59a49c504ad603a2 (diff) | |
| parent | 0baa0519cf477fe1fa447417585960fc811bcae9 (diff) | |
Merge branch 'main' into afromher/recursive_projectors
Diffstat (limited to '')
| -rw-r--r-- | backends/lean/Base/Arith/Scalar.lean | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/backends/lean/Base/Arith/Scalar.lean b/backends/lean/Base/Arith/Scalar.lean index 9441be86..86b2e216 100644 --- a/backends/lean/Base/Arith/Scalar.lean +++ b/backends/lean/Base/Arith/Scalar.lean @@ -38,7 +38,7 @@ elab "scalar_tac_preprocess" : tactic => -- A tactic to solve linear arithmetic goals in the presence of scalars def scalarTac (splitGoalConjs : Bool) : Tactic.TacticM Unit := do - intTac splitGoalConjs scalarTacExtraPreprocess + intTac "scalar_tac" splitGoalConjs scalarTacExtraPreprocess elab "scalar_tac" : tactic => scalarTac false |