/* Copyright (c) 2014 Microsoft Corporation. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Author: Leonardo de Moura */ #include #include "util/sstream.h" #include "kernel/type_checker.h" #include "kernel/abstract.h" #include "library/scoped_ext.h" #include "library/aliases.h" #include "library/private.h" #include "library/protected.h" #include "library/placeholder.h" #include "library/locals.h" #include "library/explicit.h" #include "library/coercion.h" #include "frontends/lean/parser.h" #include "frontends/lean/util.h" #include "frontends/lean/class.h" namespace lean { static name g_llevel_curly(".{"); static name g_rcurly("}"); static name g_colon(":"); static name g_assign(":="); static name g_private("[private]"); static name g_protected("[protected]"); static name g_inline("[inline]"); static name g_instance("[instance]"); static name g_coercion("[coercion]"); environment universe_cmd(parser & p) { name n = p.check_id_next("invalid universe declaration, identifier expected"); check_atomic(n); environment env = p.env(); if (in_section_or_context(env)) { p.add_local_level(n, mk_param_univ(n)); } else { name const & ns = get_namespace(env); name full_n = ns + n; env = module::add_universe(env, full_n); if (!ns.is_anonymous()) env = add_level_alias(env, n, full_n); } return env; } bool parse_univ_params(parser & p, buffer & ps) { if (p.curr_is_token(g_llevel_curly)) { p.next(); while (!p.curr_is_token(g_rcurly)) { name l = p.check_id_next("invalid universe parameter, identifier expected"); p.add_local_level(l, mk_param_univ(l)); ps.push_back(l); } p.next(); return true; } else{ return false; } } void update_univ_parameters(buffer & ls_buffer, name_set const & found, parser const & p) { unsigned old_sz = ls_buffer.size(); found.for_each([&](name const & n) { if (std::find(ls_buffer.begin(), ls_buffer.begin() + old_sz, n) == ls_buffer.begin() + old_sz) ls_buffer.push_back(n); }); std::sort(ls_buffer.begin(), ls_buffer.end(), [&](name const & n1, name const & n2) { return p.get_local_level_index(n1) < p.get_local_level_index(n2); }); } static name g_axiom("axiom"); static name g_variable("variable"); static environment declare_var(parser & p, environment env, name const & n, level_param_names const & ls, expr const & type, bool is_axiom, optional const & _bi, pos_info const & pos) { binder_info bi; if (_bi) bi = *_bi; if (in_section_or_context(p.env())) { p.add_local(p.save_pos(mk_local(n, type, bi), pos)); return env; } else { name const & ns = get_namespace(env); name full_n = ns + n; if (is_axiom) { env = module::add(env, check(env, mk_axiom(full_n, ls, type))); p.add_decl_index(full_n, pos, g_axiom, type); } else { env = module::add(env, check(env, mk_var_decl(full_n, ls, type))); p.add_decl_index(full_n, pos, g_variable, type); } if (!ns.is_anonymous()) env = add_expr_alias(env, n, full_n); return env; } } /** \brief If we are in a section, then add the new local levels to it. */ static void update_section_local_levels(parser & p, level_param_names const & new_ls) { if (in_section_or_context(p.env())) { for (auto const & l : new_ls) p.add_local_level(l, mk_param_univ(l)); } } optional parse_binder_info(parser & p) { optional bi = p.parse_optional_binder_info(); if (bi) check_in_section_or_context(p); return bi; } environment variable_cmd_core(parser & p, bool is_axiom) { auto pos = p.pos(); optional bi = parse_binder_info(p); name n = p.check_id_next("invalid declaration, identifier expected"); check_atomic(n); buffer ls_buffer; if (p.curr_is_token(g_llevel_curly) && in_section_or_context(p.env())) throw parser_error("invalid declaration, axioms/parameters occurring in sections cannot be universe polymorphic", p.pos()); optional scope1; if (!in_section_or_context(p.env())) scope1.emplace(p); parse_univ_params(p, ls_buffer); expr type; if (!p.curr_is_token(g_colon)) { buffer ps; auto lenv = p.parse_binders(ps); p.check_token_next(g_colon, "invalid declaration, ':' expected"); type = p.parse_scoped_expr(ps, lenv); type = Pi(ps, type, p); } else { p.next(); type = p.parse_expr(); } p.parse_close_binder_info(bi); level_param_names ls; if (in_section_or_context(p.env())) { ls = to_level_param_names(collect_univ_params(type)); } else { update_univ_parameters(ls_buffer, collect_univ_params(type), p); ls = to_list(ls_buffer.begin(), ls_buffer.end()); } level_param_names new_ls; list ctx = locals_to_context(type, p); std::tie(type, new_ls) = p.elaborate_type(type, ctx); update_section_local_levels(p, new_ls); return declare_var(p, p.env(), n, append(ls, new_ls), type, is_axiom, bi, pos); } environment variable_cmd(parser & p) { return variable_cmd_core(p, false); } environment axiom_cmd(parser & p) { return variable_cmd_core(p, true); } struct decl_modifiers { bool m_is_private; bool m_is_protected; bool m_is_opaque; bool m_is_instance; bool m_is_coercion; decl_modifiers() { m_is_private = false; m_is_protected = false; m_is_opaque = true; m_is_instance = false; m_is_coercion = false; } void parse(parser & p) { while (true) { if (p.curr_is_token(g_private)) { m_is_private = true; p.next(); } else if (p.curr_is_token(g_protected)) { m_is_protected = true; p.next(); } else if (p.curr_is_token(g_inline)) { m_is_opaque = false; p.next(); } else if (p.curr_is_token(g_instance)) { m_is_instance = true; p.next(); } else if (p.curr_is_token(g_coercion)) { m_is_coercion = true; p.next(); } else { break; } } } }; static void check_end_of_theorem(parser const & p) { if (!p.curr_is_command_like()) throw parser_error("':=', '.', command, script, or end-of-file expected", p.pos()); } environment definition_cmd_core(parser & p, bool is_theorem, bool _is_opaque) { auto n_pos = p.pos(); unsigned start_line = n_pos.first; name n = p.check_id_next("invalid declaration, identifier expected"); check_atomic(n); decl_modifiers modifiers; name real_n; // real name for this declaration modifiers.m_is_opaque = _is_opaque; buffer ls_buffer; expr type, value; level_param_names ls; { // Parse universe parameters parser::local_scope scope1(p); parse_univ_params(p, ls_buffer); // Parse modifiers modifiers.parse(p); if (is_theorem && !modifiers.m_is_opaque) throw exception("invalid theorem declaration, theorems cannot be transparent"); if (p.curr_is_token(g_assign)) { auto pos = p.pos(); p.next(); type = p.save_pos(mk_expr_placeholder(), pos); value = p.parse_expr(); } else if (p.curr_is_token(g_colon)) { p.next(); auto pos = p.pos(); type = p.parse_expr(); if (is_theorem && !p.curr_is_token(g_assign)) { check_end_of_theorem(p); value = mk_expr_placeholder(); } else { p.check_token_next(g_assign, "invalid declaration, ':=' expected"); value = p.save_pos(p.parse_expr(), pos); } } else { buffer ps; optional lenv; lenv = p.parse_binders(ps); auto pos = p.pos(); if (p.curr_is_token(g_colon)) { p.next(); type = p.parse_scoped_expr(ps, *lenv); if (is_theorem && !p.curr_is_token(g_assign)) { check_end_of_theorem(p); value = p.save_pos(mk_expr_placeholder(), pos); } else { p.check_token_next(g_assign, "invalid declaration, ':=' expected"); value = p.parse_scoped_expr(ps, *lenv); } } else { type = p.save_pos(mk_expr_placeholder(), p.pos()); p.check_token_next(g_assign, "invalid declaration, ':=' expected"); value = p.parse_scoped_expr(ps, *lenv); } type = Pi(ps, type, p); value = Fun(ps, value, p); } update_univ_parameters(ls_buffer, collect_univ_params(value, collect_univ_params(type)), p); ls = to_list(ls_buffer.begin(), ls_buffer.end()); } unsigned end_line = p.pos().first; if (p.used_sorry()) p.declare_sorry(); environment env = p.env(); if (modifiers.m_is_private) { auto env_n = add_private_name(env, n, optional(hash(p.pos().first, p.pos().second))); env = env_n.first; real_n = env_n.second; } else { name const & ns = get_namespace(env); real_n = ns + n; } if (in_section_or_context(env)) { buffer section_ps; collect_section_locals(type, value, p, section_ps); type = Pi_as_is(section_ps, type, p); value = Fun_as_is(section_ps, value, p); levels section_ls = collect_section_levels(ls, p); for (expr & p : section_ps) p = mk_explicit(p); expr ref = mk_implicit(mk_app(mk_explicit(mk_constant(real_n, section_ls)), section_ps)); p.add_local_expr(n, ref); } expr pre_type = type; expr pre_value = value; level_param_names new_ls; bool found_cached = false; if (p.are_info_lines_valid(start_line, end_line)) { // we only use the cache if the information associated with the line is valid if (auto it = p.find_cached_definition(real_n, pre_type, pre_value)) { optional cd; try { level_param_names c_ls; expr c_type, c_value; std::tie(c_ls, c_type, c_value) = *it; if (is_theorem) cd = check(env, mk_theorem(real_n, c_ls, c_type, c_value)); else cd = check(env, mk_definition(env, real_n, c_ls, c_type, c_value, modifiers.m_is_opaque)); if (!modifiers.m_is_private) p.add_decl_index(real_n, n_pos, p.get_cmd_token(), c_type); env = module::add(env, *cd); found_cached = true; } catch (exception&) {} } } if (!found_cached) { if (is_theorem) { auto type_pos = p.pos_of(type); bool clear_pre_info = false; // we don't want to clear pre_info data until we process the proof. std::tie(type, new_ls) = p.elaborate_type(type, list(), clear_pre_info); check_no_metavar(env, real_n, type, true); ls = append(ls, new_ls); expr type_as_is = p.save_pos(mk_as_is(type), type_pos); if (!p.collecting_info() && p.num_threads() > 1) { // add as axiom, and create a task to prove the theorem p.add_delayed_theorem(env, real_n, ls, type_as_is, value); env = module::add(env, check(env, mk_axiom(real_n, ls, type))); } else { std::tie(type, value, new_ls) = p.elaborate_definition(n, type_as_is, value, modifiers.m_is_opaque); new_ls = append(ls, new_ls); env = module::add(env, check(env, mk_theorem(real_n, new_ls, type, value))); p.cache_definition(real_n, pre_type, pre_value, new_ls, type, value); } } else { std::tie(type, value, new_ls) = p.elaborate_definition(n, type, value, modifiers.m_is_opaque); new_ls = append(ls, new_ls); env = module::add(env, check(env, mk_definition(env, real_n, new_ls, type, value, modifiers.m_is_opaque))); p.cache_definition(real_n, pre_type, pre_value, new_ls, type, value); } if (!modifiers.m_is_private) p.add_decl_index(real_n, n_pos, p.get_cmd_token(), type); } if (real_n != n) env = add_expr_alias_rec(env, n, real_n); if (modifiers.m_is_instance) env = add_instance(env, real_n); if (modifiers.m_is_coercion) env = add_coercion(env, real_n, p.ios()); if (modifiers.m_is_protected) env = add_protected(env, real_n); return env; } environment definition_cmd(parser & p) { return definition_cmd_core(p, false, true); } environment abbreviation_cmd(parser & p) { return definition_cmd_core(p, false, false); } environment theorem_cmd(parser & p) { return definition_cmd_core(p, true, true); } static name g_lparen("("), g_lcurly("{"), g_ldcurly("⦃"), g_lbracket("["); static environment variables_cmd(parser & p) { auto pos = p.pos(); environment env = p.env(); while (true) { optional bi = parse_binder_info(p); buffer ids; while (!p.curr_is_token(g_colon)) { name id = p.check_id_next("invalid parameters declaration, identifier expected"); check_atomic(id); ids.push_back(id); } p.next(); optional scope1; if (!in_section_or_context(p.env())) scope1.emplace(p); expr type = p.parse_expr(); p.parse_close_binder_info(bi); level_param_names ls = to_level_param_names(collect_univ_params(type)); list ctx = locals_to_context(type, p); for (auto id : ids) { // Hack: to make sure we get different universe parameters for each parameter. // Alternative: elaborate once and copy types replacing universes in new_ls. level_param_names new_ls; expr new_type; std::tie(new_type, new_ls) = p.elaborate_type(type, ctx); update_section_local_levels(p, new_ls); new_ls = append(ls, new_ls); env = declare_var(p, env, id, new_ls, new_type, false, bi, pos); } if (!p.curr_is_token(g_lparen) && !p.curr_is_token(g_lcurly) && !p.curr_is_token(g_ldcurly) && !p.curr_is_token(g_lbracket)) break; } return env; } void register_decl_cmds(cmd_table & r) { add_cmd(r, cmd_info("universe", "declare a global universe level", universe_cmd)); add_cmd(r, cmd_info("variable", "declare a new parameter", variable_cmd)); add_cmd(r, cmd_info("axiom", "declare a new axiom", axiom_cmd)); add_cmd(r, cmd_info("definition", "add new definition", definition_cmd)); add_cmd(r, cmd_info("abbreviation", "add new abbreviation (aka transparent definition)", abbreviation_cmd)); add_cmd(r, cmd_info("theorem", "add new theorem", theorem_cmd)); add_cmd(r, cmd_info("variables", "declare new parameters", variables_cmd)); } }