56 lines
2.7 KiB
Text
56 lines
2.7 KiB
Text
----------------------------------------------------------------------------------------------------
|
|
-- Copyright (c) 2014 Microsoft Corporation. All rights reserved.
|
|
-- Released under Apache 2.0 license as described in the file LICENSE.
|
|
-- Author: Leonardo de Moura
|
|
----------------------------------------------------------------------------------------------------
|
|
|
|
import data.string data.num
|
|
-- This is just a trick to embed the 'tactic language' as a
|
|
-- Lean expression. We should view 'tactic' as automation
|
|
-- that when execute produces a term.
|
|
-- tactic.builtin is just a "dummy" for creating the
|
|
-- definitions that are actually implemented in C++
|
|
inductive tactic : Type :=
|
|
builtin : tactic
|
|
|
|
namespace tactic
|
|
-- Remark the following names are not arbitrary, the tactic module
|
|
-- uses them when converting Lean expressions into actual tactic objects.
|
|
-- The bultin 'by' construct triggers the process of converting a
|
|
-- a term of type 'tactic' into a tactic that sythesizes a term
|
|
definition and_then (t1 t2 : tactic) : tactic := builtin
|
|
definition or_else (t1 t2 : tactic) : tactic := builtin
|
|
definition append (t1 t2 : tactic) : tactic := builtin
|
|
definition interleave (t1 t2 : tactic) : tactic := builtin
|
|
definition par (t1 t2 : tactic) : tactic := builtin
|
|
definition fixpoint (f : tactic → tactic) : tactic := builtin
|
|
definition repeat (t : tactic) : tactic := builtin
|
|
definition at_most (t : tactic) (k : num) : tactic := builtin
|
|
definition discard (t : tactic) (k : num) : tactic := builtin
|
|
definition focus_at (t : tactic) (i : num) : tactic := builtin
|
|
definition try_for (t : tactic) (ms : num) : tactic := builtin
|
|
definition now : tactic := builtin
|
|
definition assumption : tactic := builtin
|
|
definition eassumption : tactic := builtin
|
|
definition state : tactic := builtin
|
|
definition fail : tactic := builtin
|
|
definition id : tactic := builtin
|
|
definition beta : tactic := builtin
|
|
definition apply {B : Type} (b : B) : tactic := builtin
|
|
definition unfold {B : Type} (b : B) : tactic := builtin
|
|
definition exact {B : Type} (b : B) : tactic := builtin
|
|
definition trace (s : string) : tactic := builtin
|
|
precedence `;`:200
|
|
infixl ; := and_then
|
|
notation `!` t:max := repeat t
|
|
-- [ t_1 | ... | t_n ] notation
|
|
notation `[` h:100 `|` r:(foldl 100 `|` (e r, or_else r e) h) `]` := r
|
|
-- [ t_1 || ... || t_n ] notation
|
|
notation `[` h:100 `||` r:(foldl 100 `||` (e r, par r e) h) `]` := r
|
|
definition try (t : tactic) : tactic := [ t | id ]
|
|
notation `?` t:max := try t
|
|
definition repeat1 (t : tactic) : tactic := t ; !t
|
|
definition focus (t : tactic) : tactic := focus_at t 0
|
|
definition determ (t : tactic) : tactic := at_most t 1
|
|
|
|
end tactic
|