/*
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 "runtime/sstream.h"
#include "kernel/kernel_exception.h"
#include "kernel/environment.h"
#include "kernel/instantiate.h"
#include "kernel/abstract.h"
#include "kernel/type_checker.h"
#include "library/util.h"
#include "library/suffixes.h"
#include "library/reducible.h"
#include "library/constants.h"
#include "library/aux_recursors.h"
#include "library/constructions/util.h"

namespace lean {
static void throw_corrupted(name const & n) {
    throw exception(sstream() << "error in '" << g_no_confusion << "' generation, '" << n << "' inductive datatype declaration is corrupted");
}

static declaration mk_no_confusion_type(environment const & env, name const & n) {
    constant_info ind_info = env.get(n);
    inductive_val ind_val    = ind_info.to_inductive_val();
    local_ctx lctx;
    name_generator ngen      = mk_constructions_name_generator();
    unsigned nparams         = ind_val.get_nparams();
    constant_info cases_info = env.get(name(n, g_cases_on));
    names lps                = cases_info.get_lparams();
    level  plvl              = mk_univ_param(head(lps));
    levels ilvls             = lparams_to_levels(tail(lps));
    level rlvl               = plvl;
    expr ind_type            = instantiate_type_lparams(ind_info, ilvls);
    /* All inductive datatype parameters and indices are arguments */
    buffer<expr> args;
    ind_type = to_telescope(env, lctx, ngen, ind_type, args, some(mk_implicit_binder_info()));
    ind_type = type_checker(env, lctx).whnf(ind_type);
    if (!is_sort(ind_type) || args.size() < nparams)
        throw_corrupted(n);
    level ind_lvl            = sort_level(ind_type);
    unsigned nindices        = ind_val.get_nindices();
    lean_assert(nindices == args.size() - nparams);
    /* Create inductive datatype */
    expr I = mk_app(mk_constant(n, ilvls), args);
    /* Add (P : Type) */
    expr P = lctx.mk_local_decl(ngen, "P", mk_sort(plvl), mk_binder_info());
    args.push_back(P);
    /* Add v1 and v2 elements of the inductive type */
    expr v1 = lctx.mk_local_decl(ngen, "v1", I, mk_binder_info());
    expr v2 = lctx.mk_local_decl(ngen, "v2", I, mk_binder_info());
    args.push_back(v1);
    args.push_back(v2);
    expr R = mk_sort(rlvl);
    expr Pres = P;
    name no_confusion_type_name{n, g_no_confusion_type};
    expr no_confusion_type_type = lctx.mk_pi(args, R);
    /* Create type former */
    buffer<expr> type_former_args;
    for (unsigned i = nparams; i < nparams + nindices; i++)
        type_former_args.push_back(args[i]);
    type_former_args.push_back(v1);
    expr type_former = lctx.mk_lambda(type_former_args, R);
    /* Create cases_on */
    levels clvls   = levels(mk_succ(rlvl), ilvls);
    expr cases_on  = mk_app(mk_app(mk_constant(cases_info.get_name(), clvls), nparams, args.data()), type_former);
    cases_on       = mk_app(cases_on, nindices, args.data() + nparams);
    expr cases_on1 = mk_app(cases_on, v1);
    expr cases_on2 = mk_app(cases_on, v2);
    expr t1        = type_checker(env, lctx).infer(cases_on1);
    expr t2        = type_checker(env, lctx).infer(cases_on2);
    buffer<expr> outer_cases_on_args;
    unsigned idx1 = 0;
    while (is_pi(t1)) {
        buffer<expr> minor1_args;
        expr minor1 = to_telescope(env, lctx, ngen, binding_domain(t1), minor1_args);
        expr curr_t2  = t2;
        buffer<expr> inner_cases_on_args;
        unsigned idx2 = 0;
        while (is_pi(curr_t2)) {
            buffer<expr> minor2_args;
            expr minor2 = to_telescope(env, lctx, ngen, binding_domain(curr_t2), minor2_args);
            if (idx1 != idx2) {
                // infeasible case, constructors do not match
                inner_cases_on_args.push_back(lctx.mk_lambda(minor2_args, Pres));
            } else {
                if (minor1_args.size() != minor2_args.size())
                    throw_corrupted(n);
                buffer<expr> rtype_hyp;
                // add equalities
                for (unsigned i = 0; i < minor1_args.size(); i++) {
                    expr lhs      = minor1_args[i];
                    expr rhs      = minor2_args[i];
                    expr lhs_type = lctx.get_type(lhs);
                    if (!type_checker(env, lctx).is_prop(lhs_type)) {
                        expr rhs_type = lctx.get_type(rhs);
                        level l       = sort_level(type_checker(env, lctx).ensure_type(lhs_type));
                        expr h_type;
                        if (type_checker(env, lctx).is_def_eq(lhs_type, rhs_type)) {
                            h_type = mk_app(mk_constant(get_eq_name(), levels(l)), lhs_type, lhs, rhs);
                        } else {
                            h_type = mk_app(mk_constant(get_heq_name(), levels(l)), lhs_type, lhs, rhs_type, rhs);
                        }
                        name lhs_user_name = lctx.get_local_decl(lhs).get_user_name();
                        rtype_hyp.push_back(lctx.mk_local_decl(ngen, lhs_user_name.append_after("_eq"), h_type, mk_binder_info()));
                    }
                }
                inner_cases_on_args.push_back(lctx.mk_lambda(minor2_args, mk_arrow(lctx.mk_pi(rtype_hyp, P), Pres)));
            }
            idx2++;
            curr_t2 = binding_body(curr_t2);
        }
        outer_cases_on_args.push_back(lctx.mk_lambda(minor1_args, mk_app(cases_on2, inner_cases_on_args)));
        idx1++;
        t1 = binding_body(t1);
    }
    expr no_confusion_type_value = lctx.mk_lambda(args, mk_app(cases_on1, outer_cases_on_args));
    return mk_definition_inferring_unsafe(env, no_confusion_type_name, lps, no_confusion_type_type, no_confusion_type_value,
                                          reducibility_hints::mk_abbreviation());
}

extern "C" LEAN_EXPORT object * lean_mk_no_confusion_type(object * env, object * n) {
    return catch_kernel_exceptions<declaration>([&]() { return mk_no_confusion_type(environment(env), name(n, true)); });
}

declaration mk_no_confusion(environment const & env, name const & n) {
    local_ctx lctx;
    name_generator ngen                  = mk_constructions_name_generator();
    constant_info ind_info               = env.get(n);
    inductive_val ind_val                = ind_info.to_inductive_val();
    unsigned nparams                     = ind_val.get_nparams();
    constant_info no_confusion_type_info = env.get(name{n, g_no_confusion_type});
    constant_info cases_info             = env.get(name(n, g_cases_on));
    names lps                            = no_confusion_type_info.get_lparams();
    levels ls                            = lparams_to_levels(lps);
    expr ind_type                        = instantiate_type_lparams(ind_info, tail(ls));
    level ind_lvl                        = get_datatype_level(env, ind_type);
    expr no_confusion_type_type          = instantiate_type_lparams(no_confusion_type_info, ls);
    buffer<expr> args;
    expr type = no_confusion_type_type;
    type = to_telescope(lctx, ngen, type, args, some(mk_implicit_binder_info()));
    lean_assert(args.size() >= nparams + 3);
    unsigned nindices = args.size() - nparams - 3; // 3 is for P v1 v2
    expr range        = mk_app(mk_constant(no_confusion_type_info.get_name(), ls), args);
    expr P            = args[args.size()-3];
    expr v1           = args[args.size()-2];
    expr v2           = args[args.size()-1];
    expr v_type       = lctx.get_type(v1);
    level v_lvl       = sort_level(type_checker(env, lctx).ensure_type(v_type));
    expr eq_v         = mk_app(mk_constant(get_eq_name(), levels(v_lvl)), v_type);
    expr H12          = lctx.mk_local_decl(ngen, "h12", mk_app(eq_v, v1, v2), mk_binder_info());
    args.push_back(H12);
    name no_confusion_name{n, g_no_confusion};
    expr no_confusion_ty = lctx.mk_pi(args, range);
    // The gen proof is of the form
    //   (fun H11 : v1 = v1, cases_on Params (fun Indices v1, no_confusion_type Params Indices P v1 v1) Indices v1
    //        <for-each case>
    //        (fun H : (equations -> P), H (refl) ... (refl))
    //        ...
    //   )

    // H11 is for creating the generalization
    expr H11          = lctx.mk_local_decl(ngen, "h11", mk_app(eq_v, v1, v1), mk_binder_info());
    // Create the type former (fun Indices v1, no_confusion_type Params Indices P v1 v1)
    buffer<expr> type_former_args;
    for (unsigned i = nparams; i < nparams + nindices; i++)
        type_former_args.push_back(args[i]);
    type_former_args.push_back(v1);
    buffer<expr> no_confusion_type_args;
    for (unsigned i = 0; i < nparams + nindices; i++)
        no_confusion_type_args.push_back(args[i]);
    no_confusion_type_args.push_back(P);
    no_confusion_type_args.push_back(v1);
    no_confusion_type_args.push_back(v1);
    expr no_confusion_type_app = mk_app(mk_constant(no_confusion_type_info.get_name(), ls), no_confusion_type_args);
    expr type_former = lctx.mk_lambda(type_former_args, no_confusion_type_app);
    // create cases_on
    levels clvls   = ls;
    expr cases_on  = mk_app(mk_app(mk_constant(cases_info.get_name(), clvls), nparams, args.data()), type_former);
    cases_on       = mk_app(mk_app(cases_on, nindices, args.data() + nparams), v1);
    expr cot       = type_checker(env, lctx).infer(cases_on);

    while (is_pi(cot)) {
        buffer<expr> minor_args;
        expr minor = to_telescope(env, lctx, ngen, binding_domain(cot), minor_args);
        lean_assert(!minor_args.empty());
        expr H  = minor_args.back();
        expr Ht = lctx.get_type(H);
        buffer<expr> refl_args;
        while (is_pi(Ht)) {
            buffer<expr> eq_args;
            expr eq_fn = get_app_args(binding_domain(Ht), eq_args);
            if (const_name(eq_fn) == get_eq_name()) {
                refl_args.push_back(mk_app(mk_constant(get_eq_refl_name(), const_levels(eq_fn)), eq_args[0], eq_args[2]));
            } else {
                refl_args.push_back(mk_app(mk_constant(get_heq_refl_name(), const_levels(eq_fn)), eq_args[0], eq_args[1]));
            }
            Ht = binding_body(Ht);
        }
        expr pr  = mk_app(H, refl_args);
        cases_on = mk_app(cases_on, lctx.mk_lambda(minor_args, pr));
        cot = binding_body(cot);
    }
    expr gen = cases_on;
    gen = lctx.mk_lambda(H11, gen);
    // Now, we use gen to build the final proof using eq.rec
    //
    //  eq.ndrec InductiveType v1 (fun (a : InductiveType), v1 = a -> no_confusion_type Params Indices v1 a) gen v2 H12 H12
    //
    level eq_rec_l1 = head(ls);
    expr eq_rec = mk_app(mk_constant(get_eq_ndrec_name(), {eq_rec_l1, v_lvl}), v_type, v1);
    // create eq_rec type_former
    //    (fun (a : InductiveType), v1 = a -> no_confusion_type Params Indices v1 a)
    expr a   = lctx.mk_local_decl(ngen, "a",   v_type, mk_binder_info());
    expr H1a = lctx.mk_local_decl(ngen, "h1a", mk_app(eq_v, v1, a), mk_binder_info());
    // reusing no_confusion_type_args... we just replace the last argument with a
    no_confusion_type_args.pop_back();
    no_confusion_type_args.push_back(a);
    expr no_confusion_type_app_1a = mk_app(mk_constant(no_confusion_type_info.get_name(), ls), no_confusion_type_args);
    expr rec_type_former = lctx.mk_lambda(a, lctx.mk_pi(H1a, no_confusion_type_app_1a));
    // finalize eq_rec
    eq_rec = mk_app(mk_app(eq_rec, rec_type_former, gen, v2, H12), H12);
    //
    expr no_confusion_val = lctx.mk_lambda(args, eq_rec);
    return mk_definition_inferring_unsafe(env, no_confusion_name, lps, no_confusion_ty, no_confusion_val,
                                          reducibility_hints::mk_abbreviation());
}

extern "C" LEAN_EXPORT object * lean_mk_no_confusion(object * env, object * n) {
    return catch_kernel_exceptions<declaration>([&]() { return mk_no_confusion(environment(env), name(n, true)); });
}
}
