43 lines
1.3 KiB
C
43 lines
1.3 KiB
C
|
/*
|
||
|
|
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
|
||
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
||
|
|
|
||
|
|
Author: Leonardo de Moura
|
||
|
|
*/
|
||
|
|
#pragma once
|
||
|
|
#include "kernel/expr.h"
|
||
|
|
#include "library/type_context.h"
|
||
|
|
|
||
|
|
namespace lean {
|
||
|
|
namespace blast {
|
||
|
|
|
||
|
|
/** \brief Generalized expressions. It is a mechanism for representing
|
||
|
|
regular expression and universe polymorphic lemmas.
|
||
|
|
|
||
|
|
A universe polymorphic lemma can be converted into a regular expression
|
||
|
|
by instantiating it with fresh universe meta-variables.
|
||
|
|
|
||
|
|
We use the abstraction to provide a uniform API to some of the actions
|
||
|
|
available in blast. */
|
||
|
|
struct gexpr {
|
||
|
|
bool m_univ_poly;
|
||
|
|
expr m_expr;
|
||
|
|
public:
|
||
|
|
gexpr(name const & n):m_univ_poly(true), m_expr(mk_constant(n)) {}
|
||
|
|
gexpr(expr const & e):m_univ_poly(false), m_expr(e) {}
|
||
|
|
|
||
|
|
bool is_universe_polymorphic() const {
|
||
|
|
return m_univ_poly;
|
||
|
|
}
|
||
|
|
|
||
|
|
/** \brief Convert generalized expression into a regular expression.
|
||
|
|
If it is universe polymorphic, we accomplish that by creating
|
||
|
|
meta-variables using \c ctx. */
|
||
|
|
expr to_expr(type_context & ctx) const;
|
||
|
|
|
||
|
|
/** \brief Similar to previous method, but uses \c mk_fresh_uref to
|
||
|
|
create fresh universe meta-variables */
|
||
|
|
expr to_expr() const;
|
||
|
|
};
|
||
|
|
}}
|