Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
level, making it Absal-compatible. Two examples: untyped and typed. This proposal is particularly interesting because of its nice normalization properties. EAL is not only strongly normalizing, but its complexity is predictable, even for the untyped language. Because of that, a type theory based on