The qnu and qnuK calculi, name capture and control (Extended Abstract)
Résumé
We introduce a pithy calculus obtained by splitting the lambda binder of the lambda-calculus into two constructions : a pure binder nu, à la pi-calculus, and a combinator for beta-reduction. This splitting allows a powerful -- yet controlled -- rebinding mechanism. Using the same splitting with continuations allows the expression of both local and global exceptions in the same clean calculus. We also exhibit a typing system with variable initialisation and exception handling analysis.