#![allow(non_snake_case)]
use std::collections::BTreeMap;
use std::fmt;

use dhall_core::context::Context;
use dhall_core::*;
use dhall_generator as dhall;

use crate::expr::*;

type InputSubExpr = SubExpr<X, Normalized<'static>>;
type OutputSubExpr = SubExpr<X, X>;

impl<'a> Typed<'a> {
    pub fn normalize(self) -> Normalized<'a> {
        Normalized(normalize(self.0), self.1, self.2)
    }
    /// Pretends this expression is normalized. Use with care.
    #[allow(dead_code)]
    pub fn skip_normalize(self) -> Normalized<'a> {
        Normalized(
            self.0.unroll().squash_embed(|e| e.0.clone()),
            self.1,
            self.2,
        )
    }
}

fn apply_builtin<N, E>(b: Builtin, args: &[Expr<N, E>]) -> WhatNext<N, E>
where
    N: fmt::Debug + Clone,
    E: fmt::Debug + Clone,
{
    use dhall_core::Builtin::*;
    use dhall_core::ExprF::*;
    use WhatNext::*;
    let (ret, rest) = match (b, args) {
        (OptionalNone, [t, rest..]) => (rc(EmptyOptionalLit(t.roll())), rest),
        (NaturalIsZero, [NaturalLit(n), rest..]) => {
            (rc(BoolLit(*n == 0)), rest)
        }
        (NaturalEven, [NaturalLit(n), rest..]) => {
            (rc(BoolLit(*n % 2 == 0)), rest)
        }
        (NaturalOdd, [NaturalLit(n), rest..]) => {
            (rc(BoolLit(*n % 2 != 0)), rest)
        }
        (NaturalToInteger, [NaturalLit(n), rest..]) => {
            (rc(IntegerLit(*n as isize)), rest)
        }
        (NaturalShow, [NaturalLit(n), rest..]) => {
            (rc(TextLit(n.to_string().into())), rest)
        }
        (ListLength, [_, EmptyListLit(_), rest..]) => (rc(NaturalLit(0)), rest),
        (ListLength, [_, NEListLit(ys), rest..]) => {
            (rc(NaturalLit(ys.len())), rest)
        }
        (ListHead, [_, EmptyListLit(t), rest..]) => {
            (rc(EmptyOptionalLit(t.clone())), rest)
        }
        (ListHead, [_, NEListLit(ys), rest..]) => {
            (rc(NEOptionalLit(ys.first().unwrap().clone())), rest)
        }
        (ListLast, [_, EmptyListLit(t), rest..]) => {
            (rc(EmptyOptionalLit(t.clone())), rest)
        }
        (ListLast, [_, NEListLit(ys), rest..]) => {
            (rc(NEOptionalLit(ys.last().unwrap().clone())), rest)
        }
        (ListReverse, [_, EmptyListLit(t), rest..]) => {
            (rc(EmptyListLit(t.clone())), rest)
        }
        (ListReverse, [_, NEListLit(ys), rest..]) => {
            let ys = ys.iter().rev().cloned().collect();
            (rc(NEListLit(ys)), rest)
        }
        (ListIndexed, [_, EmptyListLit(t), rest..]) => (
            dhall::subexpr!([] : List ({ index : Natural, value : t })),
            rest,
        ),
        (ListIndexed, [_, NEListLit(xs), rest..]) => {
            let xs = xs
                .iter()
                .cloned()
                .enumerate()
                .map(|(i, e)| {
                    let i = rc(NaturalLit(i));
                    dhall::subexpr!({ index = i, value = e })
                })
                .collect();
            (rc(NEListLit(xs)), rest)
        }
        (ListBuild, [a0, g, rest..]) => {
            'ret: {
                // if let App(f2, args2) = g {
                //     if let (Builtin(ListFold), [_, x, rest_inner..]) =
                //         (f2.as_ref(), args2.as_slice())
                //     {
                //         // fold/build fusion
                //         break 'ret (
                //             rc(App(x.clone(), rest_inner.to_vec())),
                //             rest,
                //         );
                //     }
                // };
                let a0 = a0.roll();
                let a1 = shift0(1, &"x".into(), &a0);
                let g = g.roll();
                break 'ret (
                    dhall::subexpr!(
                        g
                        (List a0)
                        (λ(x : a0) -> λ(xs : List a1) -> [ x ] # xs)
                        ([] : List a0)
                    ),
                    rest,
                );
            }
        }
        (OptionalBuild, [a0, g, rest..]) => {
            'ret: {
                // if let App(f2, args2) = g {
                //     if let (Builtin(OptionalFold), [_, x, rest_inner..]) =
                //         (f2.as_ref(), args2.as_slice())
                //     {
                //         // fold/build fusion
                //         break 'ret (
                //             rc(App(x.clone(), rest_inner.to_vec())),
                //             rest,
                //         );
                //     }
                // };
                let a0 = a0.roll();
                let g = g.roll();
                break 'ret (
                    dhall::subexpr!(
                        g
                        (Optional a0)
                        (λ(x: a0) -> Some x)
                        (None a0)
                    ),
                    rest,
                );
            }
        }
        (ListFold, [_, EmptyListLit(_), _, _, nil, rest..]) => {
            (nil.roll(), rest)
        }
        (ListFold, [_, NEListLit(xs), _, cons, nil, rest..]) => (
            xs.iter().rev().fold(nil.roll(), |acc, x| {
                let x = x.clone();
                let acc = acc.clone();
                let cons = cons.roll();
                dhall::subexpr!(cons x acc)
            }),
            rest,
        ),
        // // fold/build fusion
        // (ListFold, [_, App(box Builtin(ListBuild), [_, x, rest..]), rest..]) => {
        //     normalize_whnf(&App(bx(x.clone()), rest.to_vec()))
        // }
        (OptionalFold, [_, NEOptionalLit(x), _, just, _, rest..]) => {
            let x = x.clone();
            let just = just.roll();
            (dhall::subexpr!(just x), rest)
        }
        (OptionalFold, [_, EmptyOptionalLit(_), _, _, nothing, rest..]) => {
            (nothing.roll(), rest)
        }
        // // fold/build fusion
        // (OptionalFold, [_, App(box Builtin(OptionalBuild), [_, x, rest..]), rest..]) => {
        //     normalize_whnf(&App(bx(x.clone()), rest.to_vec()))
        // }
        (NaturalBuild, [g, rest..]) => {
            'ret: {
                // if let App(f2, args2) = g {
                //     if let (Builtin(NaturalFold), [x, rest_inner..]) =
                //         (f2.as_ref(), args2.as_slice())
                //     {
                //         // fold/build fusion
                //         break 'ret (
                //             rc(App(x.clone(), rest_inner.to_vec())),
                //             rest,
                //         );
                //     }
                // };
                let g = g.roll();
                break 'ret (
                    dhall::subexpr!(g Natural (λ(x : Natural) -> x + 1) 0),
                    rest,
                );
            }
        }
        (NaturalFold, [NaturalLit(0), _, _, zero, rest..]) => {
            (zero.roll(), rest)
        }
        (NaturalFold, [NaturalLit(n), t, succ, zero, rest..]) => {
            let fold = rc(Builtin(NaturalFold));
            let n = rc(NaturalLit(n - 1));
            let t = t.roll();
            let succ = succ.roll();
            let zero = zero.roll();
            (dhall::subexpr!(succ (fold n t succ zero)), rest)
        }
        // (NaturalFold, Some(App(f2, args2)), _) => {
        //     match (f2.as_ref(), args2.as_slice()) {
        //         // fold/build fusion
        //         (Builtin(NaturalBuild), [x, rest..]) => {
        //             rc(App(x.clone(), rest.to_vec()))
        //         }
        //         _ => return rc(App(f, args)),
        //     }
        // }
        _ => return DoneAsIs,
    };
    // Put the remaining arguments back and eval again. In most cases
    // ret will not be of a form that can be applied, so this won't go very deep.
    // In lots of cases, there are no remaining args so this cann will just return ret.
    let rest = rest.iter().map(ExprF::roll);
    Continue(rest.fold(ret, |acc, e| rc(ExprF::App(acc, e))).unroll())
}

// #[derive(Debug, Clone)]
// struct ContextualizedSubExpr {
//     ctx: NormalizationContext,
//     expr: SubExpr<X, Normalized<'static>>,
// }
// impl ContextualizedSubExpr {
//     fn normalize_whnf(self) -> WHNF {
//         normalize_whnf(&self.ctx, self.expr)
//     }
//     fn normalize_expr(self) -> OutputSubExpr {
//         normalize_whnf(&self.ctx, self.expr).into_expr(&self.ctx)
//     }
// }

/// A semantic value. This is partially redundant with `dhall_core::Expr`, on purpose. `Expr` should
/// be limited to syntactic expressions: either written by the user or meant to be printed.
/// The rule is the following: we must _not_ construct values of type `Expr` while normalizing or
/// typechecking, but only construct `WHNF`s.
///
/// WHNFs usually store subexpressions unnormalized, to enable lazy normalization. They approximate
/// what's called Weak Head Normal-Form (WHNF). This means that the expression is normalized as
/// little as possible, but just enough to know the first constructor of the normal form. This is
/// identical to full normalization for simple types like integers, but for e.g. a record literal
/// this means knowing just the field names.
#[derive(Debug, Clone)]
enum WHNF {
    Closure(Closure),
    BoolLit(bool),
    NaturalLit(Natural),
    EmptyListLit(NormalizationContext, InputSubExpr),
    NEListLit(Vec<(NormalizationContext, Vec<InputSubExpr>)>),
    RecordLit(NormalizationContext, BTreeMap<Label, InputSubExpr>),
    UnionType(NormalizationContext, BTreeMap<Label, Option<InputSubExpr>>),
    Expr(OutputSubExpr),
}

impl WHNF {
    /// Convert the value back to a (normalized) syntactic expression
    fn normalize_to_expr(self) -> OutputSubExpr {
        match self {
            WHNF::Closure(c) => c.normalize_to_expr(),
            WHNF::BoolLit(b) => rc(ExprF::BoolLit(b)),
            WHNF::NaturalLit(n) => rc(ExprF::NaturalLit(n)),
            WHNF::EmptyListLit(ctx, e) => rc(ExprF::EmptyListLit(
                normalize_whnf(&ctx, e).normalize_to_expr(),
            )),
            WHNF::NEListLit(elts) => rc(ExprF::NEListLit(
                elts.into_iter()
                    .flat_map(|(ctx, vs)| {
                        vs.into_iter().map(move |v| {
                            normalize_whnf(&ctx, v).normalize_to_expr()
                        })
                    })
                    .collect(),
            )),
            WHNF::RecordLit(ctx, kvs) => rc(ExprF::RecordLit(
                kvs.into_iter()
                    .map(|(k, v)| {
                        (k, normalize_whnf(&ctx, v).normalize_to_expr())
                    })
                    .collect(),
            )),
            WHNF::UnionType(ctx, kvs) => rc(ExprF::UnionType(
                kvs.into_iter()
                    .map(|(k, v)| {
                        (
                            k,
                            v.map(|v| {
                                normalize_whnf(&ctx, v).normalize_to_expr()
                            }),
                        )
                    })
                    .collect(),
            )),
            WHNF::Expr(e) => e,
        }
    }

    fn shift0(self, delta: isize, label: &Label) -> Self {
        match self {
            WHNF::Closure(c) => WHNF::Closure(c.shift0(delta, label)),
            WHNF::Expr(e) => WHNF::Expr(shift0(delta, label, &e)),
            WHNF::BoolLit(b) => WHNF::BoolLit(b),
            WHNF::NaturalLit(n) => WHNF::NaturalLit(n),
            WHNF::EmptyListLit(ctx, e) => {
                WHNF::EmptyListLit(ctx, shift0(delta, label, &e))
            }
            WHNF::NEListLit(elts) => WHNF::NEListLit(
                elts.into_iter()
                    .map(|(ctx, vs)| {
                        (
                            ctx,
                            vs.into_iter()
                                .map(|v| shift0(delta, label, &v))
                                .collect(),
                        )
                    })
                    .collect(),
            ),
            WHNF::RecordLit(ctx, kvs) => WHNF::RecordLit(
                ctx,
                kvs.into_iter()
                    .map(|(k, v)| (k, shift0(delta, label, &v)))
                    .collect(),
            ),
            WHNF::UnionType(ctx, kvs) => WHNF::UnionType(
                ctx,
                kvs.into_iter()
                    .map(|(k, v)| (k, v.map(|v| shift0(delta, label, &v))))
                    .collect(),
            ),
        }
    }
}

#[derive(Debug, Clone)]
enum Closure {
    Lam(NormalizationContext, Label, InputSubExpr, InputSubExpr),
    AppliedBuiltin(NormalizationContext, Builtin, Vec<WHNF>),
    UnionConstructor(
        NormalizationContext,
        Label,
        BTreeMap<Label, Option<InputSubExpr>>,
    ),
}

impl Closure {
    /// Apply the closure to a value
    fn app(self, val: WHNF) -> WHNF {
        match self {
            Closure::Lam(ctx, x, _, e) => {
                let ctx2 = ctx.insert(&x, val);
                normalize_whnf(&ctx2, e)
            }
            Closure::AppliedBuiltin(ctx, b, mut args) => {
                args.push(val);
                let args_unrolled: Vec<_> = args
                    .iter()
                    .map(|val| val.clone().normalize_to_expr().unroll())
                    .collect();
                match apply_builtin(b, &args_unrolled).into_value(&ctx) {
                    Some(v) => v,
                    None => {
                        WHNF::Closure(Closure::AppliedBuiltin(ctx, b, args))
                    }
                }
            }
            Closure::UnionConstructor(ctx, l, kts) => {
                let kts = kts
                    .into_iter()
                    .map(|(k, v)| {
                        (
                            k,
                            v.map(|v| {
                                normalize_whnf(&ctx, v).normalize_to_expr()
                            }),
                        )
                    })
                    .collect();
                WHNF::Expr(rc(ExprF::UnionLit(l, val.normalize_to_expr(), kts)))
            }
        }
    }

    /// Convert the closure back to a (normalized) syntactic expression
    fn normalize_to_expr(self) -> OutputSubExpr {
        match self {
            Closure::Lam(ctx, x, t, e) => {
                let ctx2 = ctx.skip(&x);
                rc(ExprF::Lam(
                    x.clone(),
                    normalize_whnf(&ctx, t).normalize_to_expr(),
                    normalize_whnf(&ctx2, e).normalize_to_expr(),
                ))
            }
            Closure::AppliedBuiltin(_ctx, b, args) => {
                if args.is_empty() {
                    rc(ExprF::Builtin(b))
                } else {
                    args.into_iter()
                        .map(|e| e.normalize_to_expr())
                        .fold(rc(ExprF::Builtin(b)), |acc, e| {
                            rc(ExprF::App(acc, e))
                        })
                }
            }
            Closure::UnionConstructor(ctx, l, kts) => {
                let kts = kts
                    .into_iter()
                    .map(|(k, v)| {
                        (
                            k,
                            v.map(|v| {
                                normalize_whnf(&ctx, v).normalize_to_expr()
                            }),
                        )
                    })
                    .collect();
                rc(ExprF::Field(rc(ExprF::UnionType(kts)), l))
            }
        }
    }

    fn shift0(self, delta: isize, label: &Label) -> Self {
        match self {
            Closure::Lam(ctx, x, t, e) => Closure::Lam(
                ctx,
                x,
                shift0(delta, label, &t),
                shift(delta, &V(label.clone(), 1), &e),
            ),
            Closure::AppliedBuiltin(ctx, b, args) => Closure::AppliedBuiltin(
                ctx,
                b,
                args.into_iter().map(|e| e.shift0(delta, label)).collect(),
            ),
            Closure::UnionConstructor(ctx, l, kts) => {
                let kts = kts
                    .into_iter()
                    .map(|(k, v)| (k, v.map(|v| shift0(delta, label, &v))))
                    .collect();
                Closure::UnionConstructor(ctx, l, kts)
            }
        }
    }
}

#[derive(Debug, Clone)]
enum EnvItem {
    Expr(WHNF),
    Skip(usize),
}

#[derive(Debug, Clone)]
struct NormalizationContext(Context<Label, EnvItem>);

impl NormalizationContext {
    fn new() -> NormalizationContext {
        NormalizationContext(Context::new())
    }
    fn insert(&self, x: &Label, e: WHNF) -> NormalizationContext {
        NormalizationContext(self.0.insert(x.clone(), EnvItem::Expr(e)))
    }
    fn skip(&self, x: &Label) -> NormalizationContext {
        NormalizationContext(
            self.0
                .map(|l, e| {
                    use EnvItem::*;
                    match e {
                        Expr(e) => Expr(e.clone().shift0(1, x)),
                        Skip(n) if l == x => Skip(*n + 1),
                        Skip(n) => Skip(*n),
                    }
                })
                .insert(x.clone(), EnvItem::Skip(0)),
        )
    }
    fn lookup(&self, var: &V<Label>) -> WHNF {
        let V(x, n) = var;
        match self.0.lookup(x, *n) {
            Some(EnvItem::Expr(e)) => e.clone(),
            Some(EnvItem::Skip(m)) => {
                WHNF::Expr(rc(ExprF::Var(V(x.clone(), *m))))
            }
            None => WHNF::Expr(rc(ExprF::Var(V(x.clone(), *n)))),
        }
    }
}

// Small enum to help with being DRY
enum WhatNext<'a, N, E> {
    // Recurse on this expression
    Continue(Expr<N, E>),
    // The following expression is the normal form
    Done(Expr<N, E>),
    DoneRefSub(&'a SubExpr<N, E>),
    // The current expression is already in normal form
    DoneAsIs,
}

impl<'a> WhatNext<'a, X, X> {
    fn into_value(self, ctx: &NormalizationContext) -> Option<WHNF> {
        use WhatNext::*;
        match self {
            Continue(e) => Some(normalize_whnf(ctx, e.embed_absurd().roll())),
            Done(e) => Some(reval(ctx, e.roll())),
            DoneRefSub(e) => Some(reval(ctx, e.clone())),
            DoneAsIs => None,
        }
    }
}

fn reval(ctx: &NormalizationContext, expr: OutputSubExpr) -> WHNF {
    match expr.as_ref().embed_absurd() {
        ExprF::Lam(x, t, e) => {
            WHNF::Closure(Closure::Lam(ctx.clone(), x, t, e))
        }
        ExprF::Builtin(b) => {
            WHNF::Closure(Closure::AppliedBuiltin(ctx.clone(), b, vec![]))
        }
        ExprF::BoolLit(b) => WHNF::BoolLit(b),
        ExprF::NaturalLit(n) => WHNF::NaturalLit(n),
        ExprF::EmptyListLit(e) => WHNF::EmptyListLit(ctx.clone(), e),
        ExprF::NEListLit(elts) => WHNF::NEListLit(vec![(ctx.clone(), elts)]),
        ExprF::RecordLit(kvs) => WHNF::RecordLit(ctx.clone(), kvs),
        ExprF::UnionType(kvs) => WHNF::UnionType(ctx.clone(), kvs),
        _ => WHNF::Expr(expr),
    }
}

/// Reduces the imput expression to WHNF. See doc on `WHNF` for details.
fn normalize_whnf(ctx: &NormalizationContext, expr: InputSubExpr) -> WHNF {
    let expr = match expr.as_ref() {
        ExprF::Let(x, _, r, b) => {
            let r = normalize_whnf(ctx, r.clone());
            return normalize_whnf(&ctx.insert(x, r), b.clone());
        }
        ExprF::Lam(x, t, e) => {
            return WHNF::Closure(Closure::Lam(
                ctx.clone(),
                x.clone(),
                t.clone(),
                e.clone(),
            ))
        }
        ExprF::Builtin(b) => {
            return WHNF::Closure(Closure::AppliedBuiltin(
                ctx.clone(),
                *b,
                vec![],
            ))
        }
        ExprF::BoolLit(b) => return WHNF::BoolLit(*b),
        ExprF::NaturalLit(n) => return WHNF::NaturalLit(*n),
        ExprF::EmptyListLit(e) => {
            return WHNF::EmptyListLit(ctx.clone(), e.clone())
        }
        ExprF::NEListLit(elts) => {
            return WHNF::NEListLit(vec![(ctx.clone(), elts.clone())])
        }
        ExprF::RecordLit(kvs) => {
            return WHNF::RecordLit(ctx.clone(), kvs.clone())
        }
        ExprF::UnionType(kvs) => {
            return WHNF::UnionType(ctx.clone(), kvs.clone())
        }
        ExprF::BoolIf(b, e1, e2) => {
            let b = normalize_whnf(ctx, b.clone());
            match b {
                WHNF::BoolLit(true) => return normalize_whnf(ctx, e1.clone()),
                WHNF::BoolLit(false) => return normalize_whnf(ctx, e2.clone()),
                _ => expr,
            }
        }
        _ => expr,
    };

    // Recursively normalize all subexpressions
    let expr: ExprF<WHNF, Label, X, Normalized<'static>> =
        expr.as_ref().map_ref_with_special_handling_of_binders(
            |e| normalize_whnf(ctx, e.clone()),
            |x, e| normalize_whnf(&ctx.skip(x), e.clone()),
            X::clone,
            Normalized::clone,
            Label::clone,
        );

    normalize_last_layer(ctx, expr)
}

/// When all sub-expressions have been (partially) normalized, eval the remaining toplevel layer.
fn normalize_last_layer(
    ctx: &NormalizationContext,
    expr: ExprF<WHNF, Label, X, Normalized<'static>>,
) -> WHNF {
    use dhall_core::BinOp::*;
    use dhall_core::ExprF::*;
    use WhatNext::*;

    let expr = match expr {
        Var(v) => return ctx.lookup(&v),
        Annot(x, _) => return x,
        Note(_, e) => return e,
        App(WHNF::Closure(c), a) => return c.app(a),

        BinOp(BoolAnd, WHNF::BoolLit(true), y) => return y,
        BinOp(BoolAnd, x, WHNF::BoolLit(true)) => return x,
        BinOp(BoolAnd, WHNF::BoolLit(false), _) => return WHNF::BoolLit(false),
        BinOp(BoolAnd, _, WHNF::BoolLit(false)) => return WHNF::BoolLit(false),
        BinOp(BoolOr, WHNF::BoolLit(true), _) => return WHNF::BoolLit(true),
        BinOp(BoolOr, _, WHNF::BoolLit(true)) => return WHNF::BoolLit(true),
        BinOp(BoolOr, WHNF::BoolLit(false), y) => return y,
        BinOp(BoolOr, x, WHNF::BoolLit(false)) => return x,
        BinOp(BoolEQ, WHNF::BoolLit(true), y) => return y,
        BinOp(BoolEQ, x, WHNF::BoolLit(true)) => return x,
        BinOp(BoolNE, WHNF::BoolLit(false), y) => return y,
        BinOp(BoolNE, x, WHNF::BoolLit(false)) => return x,
        BinOp(BoolEQ, WHNF::BoolLit(x), WHNF::BoolLit(y)) => {
            return WHNF::BoolLit(x == y)
        }
        BinOp(BoolNE, WHNF::BoolLit(x), WHNF::BoolLit(y)) => {
            return WHNF::BoolLit(x != y)
        }

        BinOp(NaturalPlus, WHNF::NaturalLit(0), y) => return y,
        BinOp(NaturalPlus, x, WHNF::NaturalLit(0)) => return x,
        BinOp(NaturalTimes, WHNF::NaturalLit(0), _) => {
            return WHNF::NaturalLit(0)
        }
        BinOp(NaturalTimes, _, WHNF::NaturalLit(0)) => {
            return WHNF::NaturalLit(0)
        }
        BinOp(NaturalTimes, WHNF::NaturalLit(1), y) => return y,
        BinOp(NaturalTimes, x, WHNF::NaturalLit(1)) => return x,
        BinOp(NaturalPlus, WHNF::NaturalLit(x), WHNF::NaturalLit(y)) => {
            return WHNF::NaturalLit(x + y)
        }
        BinOp(NaturalTimes, WHNF::NaturalLit(x), WHNF::NaturalLit(y)) => {
            return WHNF::NaturalLit(x * y)
        }

        BinOp(ListAppend, WHNF::EmptyListLit(_, _), y) => return y,
        BinOp(ListAppend, x, WHNF::EmptyListLit(_, _)) => return x,
        BinOp(ListAppend, WHNF::NEListLit(xs), WHNF::NEListLit(ys)) => {
            let xs = xs.into_iter();
            let ys = ys.into_iter();
            return WHNF::NEListLit(xs.chain(ys).collect());
        }

        Field(WHNF::UnionType(ctx, kts), l) => {
            return WHNF::Closure(Closure::UnionConstructor(ctx, l, kts))
        }
        Field(WHNF::RecordLit(record_ctx, mut kvs), l) => {
            match kvs.remove(&l) {
                Some(r) => return normalize_whnf(&record_ctx, r),
                // Return ownership
                None => Field(WHNF::RecordLit(record_ctx, kvs), l),
            }
        }
        // Always simplify `x.{}` to `{}`
        Projection(_, ls) if ls.is_empty() => {
            return WHNF::RecordLit(
                ctx.clone(),
                std::collections::BTreeMap::new(),
            )
        }
        Projection(WHNF::RecordLit(record_ctx, mut kvs), ls) => {
            return WHNF::RecordLit(
                record_ctx,
                ls.into_iter()
                    .filter_map(|l| kvs.remove(&l).map(|x| (l, x)))
                    .collect(),
            )
        }
        Merge(
            WHNF::RecordLit(record_ctx, mut handlers),
            WHNF::Closure(Closure::UnionConstructor(ctor_ctx, l, kts)),
            t,
        ) => match handlers.remove(&l) {
            Some(h) => return normalize_whnf(ctx, h),
            // Return ownership
            None => Merge(
                WHNF::RecordLit(record_ctx, handlers),
                WHNF::Closure(Closure::UnionConstructor(ctor_ctx, l, kts)),
                t,
            ),
        },
        expr => expr,
    };

    let expr: ExprF<Expr<X, X>, Label, X, Normalized<'static>> =
        expr.map_ref_simple(|e| e.clone().normalize_to_expr().unroll());

    let what_next = match &expr {
        Embed(e) => DoneRefSub(&e.0),
        Annot(_, _) => unreachable!(),
        Note(_, _) => unreachable!(),
        Var(_) => unreachable!(),
        Let(_, _, _, _) => unreachable!(),
        Lam(_, _, _) => unreachable!(),
        App(Builtin(_), _) => unreachable!(),
        App(Lam(_, _, _), _) => unreachable!(),
        BoolIf(BoolLit(_), _, _) => unreachable!(),
        // TODO: interpolation
        // TextLit(t) =>
        OldOptionalLit(None, t) => Done(EmptyOptionalLit(t.roll())),
        OldOptionalLit(Some(x), _) => Done(NEOptionalLit(x.roll())),
        BinOp(BoolAnd, BoolLit(_), BoolLit(_)) => unreachable!(),
        BinOp(BoolOr, BoolLit(_), BoolLit(_)) => unreachable!(),
        BinOp(BoolEQ, BoolLit(_), BoolLit(_)) => unreachable!(),
        BinOp(BoolNE, BoolLit(_), BoolLit(_)) => unreachable!(),
        BinOp(NaturalPlus, NaturalLit(_), NaturalLit(_)) => unreachable!(),
        BinOp(NaturalTimes, NaturalLit(_), NaturalLit(_)) => unreachable!(),
        BinOp(TextAppend, TextLit(x), TextLit(y)) => Done(TextLit(x + y)),
        BinOp(ListAppend, EmptyListLit(_), _) => unreachable!(),
        BinOp(ListAppend, _, EmptyListLit(_)) => unreachable!(),
        BinOp(ListAppend, NEListLit(_), NEListLit(_)) => unreachable!(),
        Merge(RecordLit(handlers), UnionLit(l, v, _), _) => {
            match handlers.get(&l) {
                Some(h) => Continue(App(h.clone(), v.clone())),
                None => DoneAsIs,
            }
        }
        Field(RecordLit(_), _) => unreachable!(),
        Field(UnionType(_), _) => unreachable!(),
        Projection(_, ls) if ls.is_empty() => unreachable!(),
        Projection(RecordLit(_), _) => unreachable!(),
        _ => DoneAsIs,
    };

    match what_next.into_value(ctx) {
        Some(e) => e,
        None => reval(
            ctx,
            rc(expr.map_ref_simple(ExprF::roll).map_ref(
                SubExpr::clone,
                X::clone,
                |_| unreachable!(),
                Label::clone,
            )),
        ),
    }
}

/// Reduce an expression to its normal form, performing beta reduction
///
/// `normalize` does not type-check the expression.  You may want to type-check
/// expressions before normalizing them since normalization can convert an
/// ill-typed expression into a well-typed expression.
///
/// However, `normalize` will not fail if the expression is ill-typed and will
/// leave ill-typed sub-expressions unevaluated.
///
fn normalize(e: InputSubExpr) -> OutputSubExpr {
    normalize_whnf(&NormalizationContext::new(), e).normalize_to_expr()
}

#[cfg(test)]
mod spec_tests {
    #![rustfmt::skip]

    macro_rules! norm {
        ($name:ident, $path:expr) => {
            make_spec_test!(Normalization, Success, $name, $path);
        };
    }

    norm!(success_haskell_tutorial_access_0, "haskell-tutorial/access/0");
    norm!(success_haskell_tutorial_access_1, "haskell-tutorial/access/1");
    // norm!(success_haskell_tutorial_combineTypes_0, "haskell-tutorial/combineTypes/0");
    // norm!(success_haskell_tutorial_combineTypes_1, "haskell-tutorial/combineTypes/1");
    // norm!(success_haskell_tutorial_prefer_0, "haskell-tutorial/prefer/0");
    norm!(success_haskell_tutorial_projection_0, "haskell-tutorial/projection/0");


    norm!(success_prelude_Bool_and_0, "prelude/Bool/and/0");
    norm!(success_prelude_Bool_and_1, "prelude/Bool/and/1");
    norm!(success_prelude_Bool_build_0, "prelude/Bool/build/0");
    norm!(success_prelude_Bool_build_1, "prelude/Bool/build/1");
    norm!(success_prelude_Bool_even_0, "prelude/Bool/even/0");
    norm!(success_prelude_Bool_even_1, "prelude/Bool/even/1");
    norm!(success_prelude_Bool_even_2, "prelude/Bool/even/2");
    norm!(success_prelude_Bool_even_3, "prelude/Bool/even/3");
    norm!(success_prelude_Bool_fold_0, "prelude/Bool/fold/0");
    norm!(success_prelude_Bool_fold_1, "prelude/Bool/fold/1");
    norm!(success_prelude_Bool_not_0, "prelude/Bool/not/0");
    norm!(success_prelude_Bool_not_1, "prelude/Bool/not/1");
    norm!(success_prelude_Bool_odd_0, "prelude/Bool/odd/0");
    norm!(success_prelude_Bool_odd_1, "prelude/Bool/odd/1");
    norm!(success_prelude_Bool_odd_2, "prelude/Bool/odd/2");
    norm!(success_prelude_Bool_odd_3, "prelude/Bool/odd/3");
    norm!(success_prelude_Bool_or_0, "prelude/Bool/or/0");
    norm!(success_prelude_Bool_or_1, "prelude/Bool/or/1");
    norm!(success_prelude_Bool_show_0, "prelude/Bool/show/0");
    norm!(success_prelude_Bool_show_1, "prelude/Bool/show/1");
    // norm!(success_prelude_Double_show_0, "prelude/Double/show/0");
    // norm!(success_prelude_Double_show_1, "prelude/Double/show/1");
    // norm!(success_prelude_Integer_show_0, "prelude/Integer/show/0");
    // norm!(success_prelude_Integer_show_1, "prelude/Integer/show/1");
    // norm!(success_prelude_Integer_toDouble_0, "prelude/Integer/toDouble/0");
    // norm!(success_prelude_Integer_toDouble_1, "prelude/Integer/toDouble/1");
    norm!(success_prelude_List_all_0, "prelude/List/all/0");
    norm!(success_prelude_List_all_1, "prelude/List/all/1");
    norm!(success_prelude_List_any_0, "prelude/List/any/0");
    norm!(success_prelude_List_any_1, "prelude/List/any/1");
    norm!(success_prelude_List_build_0, "prelude/List/build/0");
    norm!(success_prelude_List_build_1, "prelude/List/build/1");
    norm!(success_prelude_List_concat_0, "prelude/List/concat/0");
    norm!(success_prelude_List_concat_1, "prelude/List/concat/1");
    norm!(success_prelude_List_concatMap_0, "prelude/List/concatMap/0");
    norm!(success_prelude_List_concatMap_1, "prelude/List/concatMap/1");
    norm!(success_prelude_List_filter_0, "prelude/List/filter/0");
    norm!(success_prelude_List_filter_1, "prelude/List/filter/1");
    norm!(success_prelude_List_fold_0, "prelude/List/fold/0");
    norm!(success_prelude_List_fold_1, "prelude/List/fold/1");
    norm!(success_prelude_List_fold_2, "prelude/List/fold/2");
    norm!(success_prelude_List_generate_0, "prelude/List/generate/0");
    norm!(success_prelude_List_generate_1, "prelude/List/generate/1");
    norm!(success_prelude_List_head_0, "prelude/List/head/0");
    norm!(success_prelude_List_head_1, "prelude/List/head/1");
    norm!(success_prelude_List_indexed_0, "prelude/List/indexed/0");
    norm!(success_prelude_List_indexed_1, "prelude/List/indexed/1");
    norm!(success_prelude_List_iterate_0, "prelude/List/iterate/0");
    norm!(success_prelude_List_iterate_1, "prelude/List/iterate/1");
    norm!(success_prelude_List_last_0, "prelude/List/last/0");
    norm!(success_prelude_List_last_1, "prelude/List/last/1");
    norm!(success_prelude_List_length_0, "prelude/List/length/0");
    norm!(success_prelude_List_length_1, "prelude/List/length/1");
    norm!(success_prelude_List_map_0, "prelude/List/map/0");
    norm!(success_prelude_List_map_1, "prelude/List/map/1");
    norm!(success_prelude_List_null_0, "prelude/List/null/0");
    norm!(success_prelude_List_null_1, "prelude/List/null/1");
    norm!(success_prelude_List_replicate_0, "prelude/List/replicate/0");
    norm!(success_prelude_List_replicate_1, "prelude/List/replicate/1");
    norm!(success_prelude_List_reverse_0, "prelude/List/reverse/0");
    norm!(success_prelude_List_reverse_1, "prelude/List/reverse/1");
    norm!(success_prelude_List_shifted_0, "prelude/List/shifted/0");
    norm!(success_prelude_List_shifted_1, "prelude/List/shifted/1");
    norm!(success_prelude_List_unzip_0, "prelude/List/unzip/0");
    norm!(success_prelude_List_unzip_1, "prelude/List/unzip/1");
    norm!(success_prelude_Natural_build_0, "prelude/Natural/build/0");
    norm!(success_prelude_Natural_build_1, "prelude/Natural/build/1");
    norm!(success_prelude_Natural_enumerate_0, "prelude/Natural/enumerate/0");
    norm!(success_prelude_Natural_enumerate_1, "prelude/Natural/enumerate/1");
    norm!(success_prelude_Natural_even_0, "prelude/Natural/even/0");
    norm!(success_prelude_Natural_even_1, "prelude/Natural/even/1");
    norm!(success_prelude_Natural_fold_0, "prelude/Natural/fold/0");
    norm!(success_prelude_Natural_fold_1, "prelude/Natural/fold/1");
    norm!(success_prelude_Natural_fold_2, "prelude/Natural/fold/2");
    norm!(success_prelude_Natural_isZero_0, "prelude/Natural/isZero/0");
    norm!(success_prelude_Natural_isZero_1, "prelude/Natural/isZero/1");
    norm!(success_prelude_Natural_odd_0, "prelude/Natural/odd/0");
    norm!(success_prelude_Natural_odd_1, "prelude/Natural/odd/1");
    norm!(success_prelude_Natural_product_0, "prelude/Natural/product/0");
    norm!(success_prelude_Natural_product_1, "prelude/Natural/product/1");
    // norm!(success_prelude_Natural_show_0, "prelude/Natural/show/0");
    // norm!(success_prelude_Natural_show_1, "prelude/Natural/show/1");
    norm!(success_prelude_Natural_sum_0, "prelude/Natural/sum/0");
    norm!(success_prelude_Natural_sum_1, "prelude/Natural/sum/1");
    // norm!(success_prelude_Natural_toDouble_0, "prelude/Natural/toDouble/0");
    // norm!(success_prelude_Natural_toDouble_1, "prelude/Natural/toDouble/1");
    // norm!(success_prelude_Natural_toInteger_0, "prelude/Natural/toInteger/0");
    // norm!(success_prelude_Natural_toInteger_1, "prelude/Natural/toInteger/1");
    norm!(success_prelude_Optional_all_0, "prelude/Optional/all/0");
    norm!(success_prelude_Optional_all_1, "prelude/Optional/all/1");
    norm!(success_prelude_Optional_any_0, "prelude/Optional/any/0");
    norm!(success_prelude_Optional_any_1, "prelude/Optional/any/1");
    // norm!(success_prelude_Optional_build_0, "prelude/Optional/build/0");
    // norm!(success_prelude_Optional_build_1, "prelude/Optional/build/1");
    norm!(success_prelude_Optional_concat_0, "prelude/Optional/concat/0");
    norm!(success_prelude_Optional_concat_1, "prelude/Optional/concat/1");
    norm!(success_prelude_Optional_concat_2, "prelude/Optional/concat/2");
    // norm!(success_prelude_Optional_filter_0, "prelude/Optional/filter/0");
    // norm!(success_prelude_Optional_filter_1, "prelude/Optional/filter/1");
    norm!(success_prelude_Optional_fold_0, "prelude/Optional/fold/0");
    norm!(success_prelude_Optional_fold_1, "prelude/Optional/fold/1");
    norm!(success_prelude_Optional_head_0, "prelude/Optional/head/0");
    norm!(success_prelude_Optional_head_1, "prelude/Optional/head/1");
    norm!(success_prelude_Optional_head_2, "prelude/Optional/head/2");
    norm!(success_prelude_Optional_last_0, "prelude/Optional/last/0");
    norm!(success_prelude_Optional_last_1, "prelude/Optional/last/1");
    norm!(success_prelude_Optional_last_2, "prelude/Optional/last/2");
    norm!(success_prelude_Optional_length_0, "prelude/Optional/length/0");
    norm!(success_prelude_Optional_length_1, "prelude/Optional/length/1");
    norm!(success_prelude_Optional_map_0, "prelude/Optional/map/0");
    norm!(success_prelude_Optional_map_1, "prelude/Optional/map/1");
    norm!(success_prelude_Optional_null_0, "prelude/Optional/null/0");
    norm!(success_prelude_Optional_null_1, "prelude/Optional/null/1");
    norm!(success_prelude_Optional_toList_0, "prelude/Optional/toList/0");
    norm!(success_prelude_Optional_toList_1, "prelude/Optional/toList/1");
    norm!(success_prelude_Optional_unzip_0, "prelude/Optional/unzip/0");
    norm!(success_prelude_Optional_unzip_1, "prelude/Optional/unzip/1");
    norm!(success_prelude_Text_concat_0, "prelude/Text/concat/0");
    norm!(success_prelude_Text_concat_1, "prelude/Text/concat/1");
    // norm!(success_prelude_Text_concatMap_0, "prelude/Text/concatMap/0");
    norm!(success_prelude_Text_concatMap_1, "prelude/Text/concatMap/1");
    // norm!(success_prelude_Text_concatMapSep_0, "prelude/Text/concatMapSep/0");
    // norm!(success_prelude_Text_concatMapSep_1, "prelude/Text/concatMapSep/1");
    // norm!(success_prelude_Text_concatSep_0, "prelude/Text/concatSep/0");
    // norm!(success_prelude_Text_concatSep_1, "prelude/Text/concatSep/1");
    // norm!(success_prelude_Text_show_0, "prelude/Text/show/0");
    // norm!(success_prelude_Text_show_1, "prelude/Text/show/1");



    // norm!(success_remoteSystems, "remoteSystems");
    // norm!(success_simple_doubleShow, "simple/doubleShow");
    // norm!(success_simple_integerShow, "simple/integerShow");
    // norm!(success_simple_integerToDouble, "simple/integerToDouble");
    // norm!(success_simple_letlet, "simple/letlet");
    norm!(success_simple_listBuild, "simple/listBuild");
    norm!(success_simple_multiLine, "simple/multiLine");
    norm!(success_simple_naturalBuild, "simple/naturalBuild");
    norm!(success_simple_naturalPlus, "simple/naturalPlus");
    norm!(success_simple_naturalShow, "simple/naturalShow");
    norm!(success_simple_naturalToInteger, "simple/naturalToInteger");
    norm!(success_simple_optionalBuild, "simple/optionalBuild");
    norm!(success_simple_optionalBuildFold, "simple/optionalBuildFold");
    norm!(success_simple_optionalFold, "simple/optionalFold");
    // norm!(success_simple_sortOperator, "simple/sortOperator");
    // norm!(success_simplifications_and, "simplifications/and");
    // norm!(success_simplifications_eq, "simplifications/eq");
    // norm!(success_simplifications_ifThenElse, "simplifications/ifThenElse");
    // norm!(success_simplifications_ne, "simplifications/ne");
    // norm!(success_simplifications_or, "simplifications/or");


    norm!(success_unit_Bool, "unit/Bool");
    norm!(success_unit_Double, "unit/Double");
    norm!(success_unit_DoubleLiteral, "unit/DoubleLiteral");
    norm!(success_unit_DoubleShow, "unit/DoubleShow");
    // norm!(success_unit_DoubleShowValue, "unit/DoubleShowValue");
    norm!(success_unit_FunctionApplicationCapture, "unit/FunctionApplicationCapture");
    norm!(success_unit_FunctionApplicationNoSubstitute, "unit/FunctionApplicationNoSubstitute");
    norm!(success_unit_FunctionApplicationNormalizeArguments, "unit/FunctionApplicationNormalizeArguments");
    norm!(success_unit_FunctionApplicationSubstitute, "unit/FunctionApplicationSubstitute");
    norm!(success_unit_FunctionNormalizeArguments, "unit/FunctionNormalizeArguments");
    norm!(success_unit_FunctionTypeNormalizeArguments, "unit/FunctionTypeNormalizeArguments");
    // norm!(success_unit_IfAlternativesIdentical, "unit/IfAlternativesIdentical");
    norm!(success_unit_IfFalse, "unit/IfFalse");
    norm!(success_unit_IfNormalizePredicateAndBranches, "unit/IfNormalizePredicateAndBranches");
    // norm!(success_unit_IfTrivial, "unit/IfTrivial");
    norm!(success_unit_IfTrue, "unit/IfTrue");
    norm!(success_unit_Integer, "unit/Integer");
    norm!(success_unit_IntegerNegative, "unit/IntegerNegative");
    norm!(success_unit_IntegerPositive, "unit/IntegerPositive");
    // norm!(success_unit_IntegerShow_12, "unit/IntegerShow-12");
    // norm!(success_unit_IntegerShow12, "unit/IntegerShow12");
    norm!(success_unit_IntegerShow, "unit/IntegerShow");
    // norm!(success_unit_IntegerToDouble_12, "unit/IntegerToDouble-12");
    // norm!(success_unit_IntegerToDouble12, "unit/IntegerToDouble12");
    norm!(success_unit_IntegerToDouble, "unit/IntegerToDouble");
    norm!(success_unit_Kind, "unit/Kind");
    norm!(success_unit_Let, "unit/Let");
    norm!(success_unit_LetWithType, "unit/LetWithType");
    norm!(success_unit_List, "unit/List");
    norm!(success_unit_ListBuild, "unit/ListBuild");
    // norm!(success_unit_ListBuildFoldFusion, "unit/ListBuildFoldFusion");
    norm!(success_unit_ListBuildImplementation, "unit/ListBuildImplementation");
    norm!(success_unit_ListFold, "unit/ListFold");
    norm!(success_unit_ListFoldEmpty, "unit/ListFoldEmpty");
    norm!(success_unit_ListFoldOne, "unit/ListFoldOne");
    norm!(success_unit_ListHead, "unit/ListHead");
    norm!(success_unit_ListHeadEmpty, "unit/ListHeadEmpty");
    norm!(success_unit_ListHeadOne, "unit/ListHeadOne");
    norm!(success_unit_ListIndexed, "unit/ListIndexed");
    norm!(success_unit_ListIndexedEmpty, "unit/ListIndexedEmpty");
    norm!(success_unit_ListIndexedOne, "unit/ListIndexedOne");
    norm!(success_unit_ListLast, "unit/ListLast");
    norm!(success_unit_ListLastEmpty, "unit/ListLastEmpty");
    norm!(success_unit_ListLastOne, "unit/ListLastOne");
    norm!(success_unit_ListLength, "unit/ListLength");
    norm!(success_unit_ListLengthEmpty, "unit/ListLengthEmpty");
    norm!(success_unit_ListLengthOne, "unit/ListLengthOne");
    norm!(success_unit_ListNormalizeElements, "unit/ListNormalizeElements");
    norm!(success_unit_ListNormalizeTypeAnnotation, "unit/ListNormalizeTypeAnnotation");
    norm!(success_unit_ListReverse, "unit/ListReverse");
    norm!(success_unit_ListReverseEmpty, "unit/ListReverseEmpty");
    norm!(success_unit_ListReverseTwo, "unit/ListReverseTwo");
    norm!(success_unit_Merge, "unit/Merge");
    norm!(success_unit_MergeEmptyAlternative, "unit/MergeEmptyAlternative");
    norm!(success_unit_MergeNormalizeArguments, "unit/MergeNormalizeArguments");
    norm!(success_unit_MergeWithType, "unit/MergeWithType");
    norm!(success_unit_MergeWithTypeNormalizeArguments, "unit/MergeWithTypeNormalizeArguments");
    norm!(success_unit_Natural, "unit/Natural");
    norm!(success_unit_NaturalBuild, "unit/NaturalBuild");
    // norm!(success_unit_NaturalBuildFoldFusion, "unit/NaturalBuildFoldFusion");
    norm!(success_unit_NaturalBuildImplementation, "unit/NaturalBuildImplementation");
    norm!(success_unit_NaturalEven, "unit/NaturalEven");
    norm!(success_unit_NaturalEvenOne, "unit/NaturalEvenOne");
    norm!(success_unit_NaturalEvenZero, "unit/NaturalEvenZero");
    norm!(success_unit_NaturalFold, "unit/NaturalFold");
    norm!(success_unit_NaturalFoldOne, "unit/NaturalFoldOne");
    norm!(success_unit_NaturalFoldZero, "unit/NaturalFoldZero");
    norm!(success_unit_NaturalIsZero, "unit/NaturalIsZero");
    norm!(success_unit_NaturalIsZeroOne, "unit/NaturalIsZeroOne");
    norm!(success_unit_NaturalIsZeroZero, "unit/NaturalIsZeroZero");
    norm!(success_unit_NaturalLiteral, "unit/NaturalLiteral");
    norm!(success_unit_NaturalOdd, "unit/NaturalOdd");
    norm!(success_unit_NaturalOddOne, "unit/NaturalOddOne");
    norm!(success_unit_NaturalOddZero, "unit/NaturalOddZero");
    norm!(success_unit_NaturalShow, "unit/NaturalShow");
    norm!(success_unit_NaturalShowOne, "unit/NaturalShowOne");
    norm!(success_unit_NaturalToInteger, "unit/NaturalToInteger");
    norm!(success_unit_NaturalToIntegerOne, "unit/NaturalToIntegerOne");
    norm!(success_unit_None, "unit/None");
    norm!(success_unit_NoneNatural, "unit/NoneNatural");
    // norm!(success_unit_OperatorAndEquivalentArguments, "unit/OperatorAndEquivalentArguments");
    norm!(success_unit_OperatorAndLhsFalse, "unit/OperatorAndLhsFalse");
    norm!(success_unit_OperatorAndLhsTrue, "unit/OperatorAndLhsTrue");
    norm!(success_unit_OperatorAndNormalizeArguments, "unit/OperatorAndNormalizeArguments");
    norm!(success_unit_OperatorAndRhsFalse, "unit/OperatorAndRhsFalse");
    norm!(success_unit_OperatorAndRhsTrue, "unit/OperatorAndRhsTrue");
    // norm!(success_unit_OperatorEqualEquivalentArguments, "unit/OperatorEqualEquivalentArguments");
    norm!(success_unit_OperatorEqualLhsTrue, "unit/OperatorEqualLhsTrue");
    norm!(success_unit_OperatorEqualNormalizeArguments, "unit/OperatorEqualNormalizeArguments");
    norm!(success_unit_OperatorEqualRhsTrue, "unit/OperatorEqualRhsTrue");
    norm!(success_unit_OperatorListConcatenateLhsEmpty, "unit/OperatorListConcatenateLhsEmpty");
    norm!(success_unit_OperatorListConcatenateListList, "unit/OperatorListConcatenateListList");
    norm!(success_unit_OperatorListConcatenateNormalizeArguments, "unit/OperatorListConcatenateNormalizeArguments");
    norm!(success_unit_OperatorListConcatenateRhsEmpty, "unit/OperatorListConcatenateRhsEmpty");
    // norm!(success_unit_OperatorNotEqualEquivalentArguments, "unit/OperatorNotEqualEquivalentArguments");
    norm!(success_unit_OperatorNotEqualLhsFalse, "unit/OperatorNotEqualLhsFalse");
    norm!(success_unit_OperatorNotEqualNormalizeArguments, "unit/OperatorNotEqualNormalizeArguments");
    norm!(success_unit_OperatorNotEqualRhsFalse, "unit/OperatorNotEqualRhsFalse");
    // norm!(success_unit_OperatorOrEquivalentArguments, "unit/OperatorOrEquivalentArguments");
    norm!(success_unit_OperatorOrLhsFalse, "unit/OperatorOrLhsFalse");
    norm!(success_unit_OperatorOrLhsTrue, "unit/OperatorOrLhsTrue");
    norm!(success_unit_OperatorOrNormalizeArguments, "unit/OperatorOrNormalizeArguments");
    norm!(success_unit_OperatorOrRhsFalse, "unit/OperatorOrRhsFalse");
    norm!(success_unit_OperatorOrRhsTrue, "unit/OperatorOrRhsTrue");
    norm!(success_unit_OperatorPlusLhsZero, "unit/OperatorPlusLhsZero");
    norm!(success_unit_OperatorPlusNormalizeArguments, "unit/OperatorPlusNormalizeArguments");
    norm!(success_unit_OperatorPlusOneAndOne, "unit/OperatorPlusOneAndOne");
    norm!(success_unit_OperatorPlusRhsZero, "unit/OperatorPlusRhsZero");
    // norm!(success_unit_OperatorTextConcatenateLhsEmpty, "unit/OperatorTextConcatenateLhsEmpty");
    // norm!(success_unit_OperatorTextConcatenateNormalizeArguments, "unit/OperatorTextConcatenateNormalizeArguments");
    // norm!(success_unit_OperatorTextConcatenateRhsEmpty, "unit/OperatorTextConcatenateRhsEmpty");
    norm!(success_unit_OperatorTextConcatenateTextText, "unit/OperatorTextConcatenateTextText");
    norm!(success_unit_OperatorTimesLhsOne, "unit/OperatorTimesLhsOne");
    norm!(success_unit_OperatorTimesLhsZero, "unit/OperatorTimesLhsZero");
    norm!(success_unit_OperatorTimesNormalizeArguments, "unit/OperatorTimesNormalizeArguments");
    norm!(success_unit_OperatorTimesRhsOne, "unit/OperatorTimesRhsOne");
    norm!(success_unit_OperatorTimesRhsZero, "unit/OperatorTimesRhsZero");
    norm!(success_unit_OperatorTimesTwoAndTwo, "unit/OperatorTimesTwoAndTwo");
    norm!(success_unit_Optional, "unit/Optional");
    norm!(success_unit_OptionalBuild, "unit/OptionalBuild");
    // norm!(success_unit_OptionalBuildFoldFusion, "unit/OptionalBuildFoldFusion");
    norm!(success_unit_OptionalBuildImplementation, "unit/OptionalBuildImplementation");
    norm!(success_unit_OptionalFold, "unit/OptionalFold");
    norm!(success_unit_OptionalFoldNone, "unit/OptionalFoldNone");
    norm!(success_unit_OptionalFoldSome, "unit/OptionalFoldSome");
    norm!(success_unit_Record, "unit/Record");
    norm!(success_unit_RecordEmpty, "unit/RecordEmpty");
    norm!(success_unit_RecordProjection, "unit/RecordProjection");
    norm!(success_unit_RecordProjectionEmpty, "unit/RecordProjectionEmpty");
    norm!(success_unit_RecordProjectionNormalizeArguments, "unit/RecordProjectionNormalizeArguments");
    norm!(success_unit_RecordSelection, "unit/RecordSelection");
    norm!(success_unit_RecordSelectionNormalizeArguments, "unit/RecordSelectionNormalizeArguments");
    norm!(success_unit_RecordType, "unit/RecordType");
    norm!(success_unit_RecordTypeEmpty, "unit/RecordTypeEmpty");
    // norm!(success_unit_RecursiveRecordMergeCollision, "unit/RecursiveRecordMergeCollision");
    // norm!(success_unit_RecursiveRecordMergeLhsEmpty, "unit/RecursiveRecordMergeLhsEmpty");
    // norm!(success_unit_RecursiveRecordMergeNoCollision, "unit/RecursiveRecordMergeNoCollision");
    // norm!(success_unit_RecursiveRecordMergeNormalizeArguments, "unit/RecursiveRecordMergeNormalizeArguments");
    // norm!(success_unit_RecursiveRecordMergeRhsEmpty, "unit/RecursiveRecordMergeRhsEmpty");
    // norm!(success_unit_RecursiveRecordTypeMergeCollision, "unit/RecursiveRecordTypeMergeCollision");
    // norm!(success_unit_RecursiveRecordTypeMergeLhsEmpty, "unit/RecursiveRecordTypeMergeLhsEmpty");
    // norm!(success_unit_RecursiveRecordTypeMergeNoCollision, "unit/RecursiveRecordTypeMergeNoCollision");
    // norm!(success_unit_RecursiveRecordTypeMergeNormalizeArguments, "unit/RecursiveRecordTypeMergeNormalizeArguments");
    // norm!(success_unit_RecursiveRecordTypeMergeRhsEmpty, "unit/RecursiveRecordTypeMergeRhsEmpty");
    // norm!(success_unit_RecursiveRecordTypeMergeSorts, "unit/RecursiveRecordTypeMergeSorts");
    // norm!(success_unit_RightBiasedRecordMergeCollision, "unit/RightBiasedRecordMergeCollision");
    // norm!(success_unit_RightBiasedRecordMergeLhsEmpty, "unit/RightBiasedRecordMergeLhsEmpty");
    // norm!(success_unit_RightBiasedRecordMergeNoCollision, "unit/RightBiasedRecordMergeNoCollision");
    // norm!(success_unit_RightBiasedRecordMergeNormalizeArguments, "unit/RightBiasedRecordMergeNormalizeArguments");
    // norm!(success_unit_RightBiasedRecordMergeRhsEmpty, "unit/RightBiasedRecordMergeRhsEmpty");
    norm!(success_unit_SomeNormalizeArguments, "unit/SomeNormalizeArguments");
    norm!(success_unit_Sort, "unit/Sort");
    norm!(success_unit_Text, "unit/Text");
    // norm!(success_unit_TextInterpolate, "unit/TextInterpolate");
    norm!(success_unit_TextLiteral, "unit/TextLiteral");
    norm!(success_unit_TextNormalizeInterpolations, "unit/TextNormalizeInterpolations");
    norm!(success_unit_TextShow, "unit/TextShow");
    // norm!(success_unit_TextShowAllEscapes, "unit/TextShowAllEscapes");
    norm!(success_unit_True, "unit/True");
    norm!(success_unit_Type, "unit/Type");
    norm!(success_unit_TypeAnnotation, "unit/TypeAnnotation");
    norm!(success_unit_UnionNormalizeAlternatives, "unit/UnionNormalizeAlternatives");
    norm!(success_unit_UnionNormalizeArguments, "unit/UnionNormalizeArguments");
    norm!(success_unit_UnionProjectConstructor, "unit/UnionProjectConstructor");
    norm!(success_unit_UnionSortAlternatives, "unit/UnionSortAlternatives");
    norm!(success_unit_UnionType, "unit/UnionType");
    norm!(success_unit_UnionTypeEmpty, "unit/UnionTypeEmpty");
    norm!(success_unit_UnionTypeNormalizeArguments, "unit/UnionTypeNormalizeArguments");
    norm!(success_unit_Variable, "unit/Variable");
}