Let me show how you represent binding operators in l-calculus. So, let's look at first-order syntax of say l-calculus. Well, l-calculus would be normally in first order syntax, it would be just l could be a way of binding a variable and a term But here you have a big overhead, one must deal with alpha equivalents, with capture avoiding substitution, with regeneration of fresh names.

---