|
Dami, Laurent, A Lambda-Calculus for Dynamic Binding, Theoretical Computer Science, 1997
Dynamic binding is a runtime lookup operation which extracts values corresponding to some "names" from some "environments" ... Many situations related with flexible software assembly involve dynamic binding: first-class modules, mobile code, object-oriented message passing. This paper proposes Lambda-N, a compact extension of the lambda-calculus to model dynamic binding, where variables are labelled by names, and where arguments are passed to functions along named channels. The resulting formalism preserves familiar properties of the lambda-calculus, has a Curry-style type inference system, and has a formal notion of compatibility for reasoning about extensible environments...
(via comp.lang.functional)
There's also an implementation of these ideas in the language HOP, and a number of other resources (including Dami's thesis) in here.
Posted to theory by Bryn Keller on 12/27/02; 11:03:31 AM
|
|
A Lambda Calculus for Dynamic Binding
