Further, assume that the simplification operation is to be applied to two terms t and r whose head normal forms have identical binders.
The explicit binders are retained for compatibility with legacy code, and because they are conceptually easier for novice users to understand.
The explicit binders have an additional capability: if one binds all of a function's arguments, a zero-argument functoid (a thunk) is returned.
The key idea is to represent variables and binders of object languages with variables and binders of a metalanguage based on some type-theoretic -calculus.
Moreover, we prove that suitable structural induction and recursion principles over terms with binders and even term contexts are validated by this model.
One source of information is binder's volumes (books comprised of several editions bound together in sets of partbooks according to voice type).
Object variables and binders are implemented by variables and binders in the host language.
We next give a restriction on variable binders.
