70 lines
3.1 KiB
C++
70 lines
3.1 KiB
C++
/*
|
|
Copyright (c) 2013-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 <utility>
|
|
#include <algorithm>
|
|
#include "util/lua.h"
|
|
#include "util/optional.h"
|
|
#include "util/name_set.h"
|
|
#include "kernel/metavar.h"
|
|
#include "library/tactic/goal.h"
|
|
|
|
namespace lean {
|
|
typedef list<goal> goals;
|
|
class proof_state {
|
|
goals m_goals;
|
|
substitution m_subst;
|
|
name_generator m_ngen;
|
|
constraints m_postponed;
|
|
bool m_relax_main_opaque;
|
|
public:
|
|
proof_state(goals const & gs, substitution const & s, name_generator const & ngen, constraints const & postponed,
|
|
bool relax_main_opaque);
|
|
proof_state(proof_state const & s, goals const & gs, substitution const & subst, name_generator const & ngen,
|
|
constraints const & postponed):
|
|
proof_state(gs, subst, ngen, postponed, s.relax_main_opaque()) {}
|
|
proof_state(proof_state const & s, goals const & gs, substitution const & subst, name_generator const & ngen):
|
|
proof_state(gs, subst, ngen, s.m_postponed, s.m_relax_main_opaque) {}
|
|
proof_state(proof_state const & s, goals const & gs, substitution const & subst):
|
|
proof_state(s, gs, subst, s.m_ngen) {}
|
|
proof_state(proof_state const & s, goals const & gs, name_generator const & ngen):
|
|
proof_state(s, gs, s.m_subst, ngen) {}
|
|
proof_state(proof_state const & s, goals const & gs):
|
|
proof_state(s, gs, s.m_subst) {}
|
|
proof_state(proof_state const & s, name_generator const & ngen, constraints const & postponed):
|
|
proof_state(s.m_goals, s.m_subst, ngen, postponed, s.m_relax_main_opaque) {}
|
|
proof_state(proof_state const & s, name_generator const & ngen):
|
|
proof_state(s, ngen, s.m_postponed) {}
|
|
|
|
goals const & get_goals() const { return m_goals; }
|
|
substitution const & get_subst() const { return m_subst; }
|
|
name_generator const & get_ngen() const { return m_ngen; }
|
|
constraints const & get_postponed() const { return m_postponed; }
|
|
bool relax_main_opaque() const { return m_relax_main_opaque; }
|
|
|
|
/** \brief Return true iff this state does not have any goals left */
|
|
bool is_final_state() const { return empty(m_goals); }
|
|
format pp(formatter const & fmt) const;
|
|
};
|
|
|
|
inline optional<proof_state> some_proof_state(proof_state const & s) { return some(s); }
|
|
inline optional<proof_state> none_proof_state() { return optional<proof_state> (); }
|
|
|
|
proof_state to_proof_state(expr const & meta, expr const & type, substitution const & subst, name_generator ngen,
|
|
bool relax_main_opaque);
|
|
proof_state to_proof_state(expr const & meta, expr const & type, name_generator ngen, bool relax_main_opaque);
|
|
|
|
goals map_goals(proof_state const & s, std::function<optional<goal>(goal const & g)> f);
|
|
io_state_stream const & operator<<(io_state_stream const & out, proof_state const & s);
|
|
|
|
UDATA_DEFS_CORE(goals)
|
|
UDATA_DEFS(proof_state)
|
|
void open_proof_state(lua_State * L);
|
|
|
|
void initialize_proof_state();
|
|
void finalize_proof_state();
|
|
}
|