2f699fa53a
Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
35 lines
2 KiB
C++
35 lines
2 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 "kernel/expr.h"
|
|
#include "kernel/expr_sets.h"
|
|
namespace lean {
|
|
class parser;
|
|
void check_atomic(name const & n);
|
|
void check_in_section_or_context(parser const & p);
|
|
bool is_root_namespace(name const & n);
|
|
name remove_root_prefix(name const & n);
|
|
/** \brief Return the levels in \c ls that are defined in the section. */
|
|
levels collect_section_levels(level_param_names const & ls, parser & p);
|
|
/** \brief Collect local (section) constants occurring in type and value, sort them, and store in section_ps */
|
|
void collect_section_locals(expr const & type, expr const & value, parser const & p, buffer<expr> & section_ps);
|
|
/** \brief Copy the local parameters to \c section_ps, then sort \c section_ps (using the order in which they were declared). */
|
|
void sort_section_params(expr_struct_set const & locals, parser const & p, buffer<expr> & section_ps);
|
|
list<expr> locals_to_context(expr const & e, parser const & p);
|
|
/** \brief Fun(locals, e), but also propagate \c e position to result */
|
|
expr Fun(buffer<expr> const & locals, expr const & e, parser & p);
|
|
/** \brief Pi(locals, e), but also propagate \c e position to result */
|
|
expr Pi(buffer<expr> const & locals, expr const & e, parser & p);
|
|
/** \brief Similar to Fun(locals, e, p), but the types are marked as 'as-is' (i.e., they are not processed by the elaborator. */
|
|
expr Fun_as_is(buffer<expr> const & locals, expr const & e, parser & p);
|
|
/** \brief Similar to Pi(locals, e, p), but the types are marked as 'as-is' (i.e., they are not processed by the elaborator. */
|
|
expr Pi_as_is(buffer<expr> const & locals, expr const & e, parser & p);
|
|
/** \brief Create the resultant universe level using the levels computed during introduction rule elaboration */
|
|
level mk_result_level(environment const & env, buffer<level> const & r_lvls);
|
|
/** \brief Return true if \c u occurs in \c l */
|
|
bool occurs(level const & u, level const & l);
|
|
}
|