modeling the binding policies of programming languages
Current tools available to model binding policies are inadequate. To partially remedy this situation, we describe a scheme consisting of three major parts:  a rigorous theoretical framework for addressing binding issues.  a language in which to express binding policies.  a graphic notation in which to easily and clearly express binding policy. Preliminary results on the first two aspects are reported here. Expressions of binding policy written in PASTE, our modeling language, have several advantages over those expressed in English. Among these are the rigor and clarity which a formal statement allows. Comparison between models can pinpoint exact differences in binding policy in a way imprecise English specification of a policy cannot. To demonstrate the utility of our modeling scheme and the current state of PASTE, we model two languages which differ only in binding policy. We show how these differences are clearly expressed through the models.
binding programming languages paste semantic models many-sorted algebras algebraic semantics