28 lines
1.4 KiB
C++
28 lines
1.4 KiB
C++
/*
|
|
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
Author: Leonardo de Moura
|
|
*/
|
|
#pragma once
|
|
#include "library/tactic/tactic.h"
|
|
|
|
namespace lean {
|
|
/** \brief Function for elaborating expressions nested in tactics.
|
|
Some tactics contain nested expression (aka pre-terms) that need to be elaborated.
|
|
*/
|
|
typedef std::function<pair<expr, constraints>(goal const &, name_generator const &, expr const &)> elaborate_fn;
|
|
|
|
/** \brief Try to elaborate expression \c e using the elaboration function \c elab. The elaboration is performed
|
|
with respect to (local context of) the first goal in \c s. The constraints generated during elaboration
|
|
are solved using the higher-order unifier. When solving the constraints any postponed constraint in \c s
|
|
is also considered. Only the first solution returned by the unifier is considered.
|
|
If the whole process succeeds, then the elaborated expression is returned, and the proof state is updated.
|
|
The following fields in the name generator may be updated: name-generator and substitution.
|
|
|
|
If the proof state has no goal, the elaboration or unifier fails, then none is returned and the proof state
|
|
is not modified.
|
|
*/
|
|
optional<expr> elaborate_with_respect_to(environment const & env, io_state const & ios, elaborate_fn const & elab,
|
|
proof_state & s, expr const & e);
|
|
}
|