2013-07-23 18:31:31 +00:00
|
|
|
/*
|
|
|
|
Copyright (c) 2013 Microsoft Corporation. All rights reserved.
|
|
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
|
|
|
|
Author: Leonardo de Moura
|
|
|
|
*/
|
|
|
|
#pragma once
|
2013-09-13 10:35:29 +00:00
|
|
|
#include "kernel/expr.h"
|
2013-07-23 18:31:31 +00:00
|
|
|
namespace lean {
|
2013-07-26 19:27:55 +00:00
|
|
|
/**
|
|
|
|
\brief Return true iff \c e constains a free variable <tt>(var i)</tt> s.t. \c i in <tt>[low, high)</tt>.
|
|
|
|
\pre low < high
|
|
|
|
*/
|
2013-12-13 01:47:11 +00:00
|
|
|
bool has_free_var(expr const & e, unsigned low, unsigned high);
|
2014-02-16 21:36:46 +00:00
|
|
|
/** \brief Return true iff \c e contains the free variable <tt>(var i)</tt>. */
|
2013-12-13 01:47:11 +00:00
|
|
|
bool has_free_var(expr const & e, unsigned i);
|
2014-01-14 22:36:14 +00:00
|
|
|
|
2013-07-26 19:27:55 +00:00
|
|
|
/**
|
2013-12-11 23:49:32 +00:00
|
|
|
\brief Lower the free variables >= s in \c e by \c d. That is, a free variable <tt>(var i)</tt> s.t.
|
2013-09-13 01:25:38 +00:00
|
|
|
<tt>i >= s</tt> is mapped into <tt>(var i-d)</tt>.
|
2013-07-26 19:27:55 +00:00
|
|
|
|
2013-12-11 23:49:32 +00:00
|
|
|
\pre s >= d
|
2014-01-01 11:02:41 +00:00
|
|
|
\pre !has_free_var(e, s-d, s, menv)
|
2013-07-26 19:27:55 +00:00
|
|
|
*/
|
2013-12-13 01:47:11 +00:00
|
|
|
expr lower_free_vars(expr const & e, unsigned s, unsigned d);
|
|
|
|
expr lower_free_vars(expr const & e, unsigned d);
|
2013-07-30 08:39:29 +00:00
|
|
|
|
2014-02-16 21:36:46 +00:00
|
|
|
/** \brief Lift free variables >= s in \c e by d. */
|
2013-12-13 01:47:11 +00:00
|
|
|
expr lift_free_vars(expr const & e, unsigned s, unsigned d);
|
|
|
|
expr lift_free_vars(expr const & e, unsigned d);
|
2013-07-23 18:31:31 +00:00
|
|
|
}
|