Framework for binding operators
Binding appears in logic, programming and concurrency, e.g. it appears in Lambda Calculus, say the λ-abstraction. However, the binding in Lambda Calculus is <i>unary</i>. Certainly, we can generalize the idea of unary binding to an arbitrary finite numbers of binding. Algebraically, we c...
| Main Author: | |
|---|---|
| Published: |
University of Edinburgh
1991
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.662607 |