DynBindModel

Motivation:

Eiffels dynamic binding is somewhat more complex than that of other languages. Its structure is still very simple and can be described by giving the relation:

${\gamma }_{:}(\mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E}\times \mathrm{N}\mathrm{A}\mathrm{M}\mathrm{E})\to (\mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E}\to \mathrm{F}\mathrm{E}\mathrm{A}\mathrm{T}\mathrm{U}\mathrm{R}\mathrm{E})$

Relation γ contains both the static and dynamic binding part of the language. In the following feature:

f (a: ANY)
   do
      print (a.out)
   end

The static binding part of call a.out can be decribed as:

$\gamma (\mathrm{A}\mathrm{N}\mathrm{Y}\mapsto \mathrm{o}\mathrm{u}\mathrm{t})$

Namely an evaluation of γ with a tuple containing the static type of the call and the name. The result of this is a function. This function will be evaluated at runtime and yield the right feature according to the dynamic type of a.

In the rest of this text, the we will show how to construct the relation γ based on any given eiffel system.

Some fundamentals

We introduce the operator $>$ as the "ancestor of" and $<$ as "descendant of" operator.

Without loss of generality we can say that any Eiffel system $\mathsf{S}$ is a set of classes $\{C_1,C_2\dots C_n\}$ such that $C_q<C_p$ if $\mathbf{𝐪}<\mathbf{𝐩}$. In practice class $C_1$ will allways be class ANY but this is not of importance here.

The function:

• $\tau :\mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E}\to (\mathrm{N}\mathrm{A}\mathrm{M}\mathrm{E}\to \mathrm{F}\mathrm{E}\mathrm{A}\mathrm{T}\mathrm{U}\mathrm{R}\mathrm{E})$

Yields the features declared in a given class.

• $\eta :\mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E}\to (\mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E}\to (\mathrm{N}\mathrm{A}\mathrm{M}\mathrm{E}\to \mathrm{N}\mathrm{A}\mathrm{M}\mathrm{E}))$

Yields the renamings of the different parent parts by a class:

$\eta \left(D\right)\left(B\right)$ gives the renamings in class D for the inherited class B.

• $\alpha :\mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E}\to \mathrm{P}\mathrm{O}\mathrm{W}\left(\mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E}\right)$

Gives the classes from which a given class inherits:

$\alpha \left(A\right)$ Gives the base classes of the of class A.

• $\sigma :\mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E}\to (\mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E}\to \mathrm{P}\mathrm{O}\mathrm{W}\left(\mathrm{N}\mathrm{A}\mathrm{M}\mathrm{E}\right))$

Gives all the selected feature names of an inherited class of a class.

Furthermore we give the following shortcuts:

• ${\mathsf{\tau }}_{\mathsf{n}}$ for $\tau \left(C_n\right)$
• ${\mathsf{\eta }}_{\mathsf{n},\mathsf{b}}$ for $\eta \left(C_n\right)\left(b\right)$
• ${\mathsf{\alpha }}_{\mathsf{n}}$ for $\alpha \left(C_n\right)$
• ${\mathsf{\sigma }}_{\mathsf{n},\mathsf{b}}$ for $\sigma \left(C_n\right)\left(b\right)$

An example

For the following System:

class B feature f do ... end end

class C inherit B rename f as f1 redefine f1 end feature f1 do ... end end

class D inherit C select f1 end B rename f as f2 redefine f2 end B rename f as f3 redefine f3 end feature f2 do ... end f3 do ... end end

We get:

• $S=\{B,C,D\}$
• $\tau =\{B\mapsto \{f\mapsto B.f\},C\mapsto \{f1\mapsto C.f1\},D\mapsto \{f2\mapsto D.f2,f3\mapsto D.f3\}\}$
• $\eta =\{C\mapsto \{B\mapsto \{f\mapsto f1\}\},D\mapsto \{B\mapsto \{f\mapsto f2,f\mapsto f3\}\}\}$
• $\alpha =\{C\mapsto \left\{B\right\},D\mapsto \{B,C\}\}$
• $\sigma =\{D\mapsto \{C\mapsto \left\{f1\right\}\}\}$

The naming function

In this section the naming function of a system is shown:

Its structure

${\beta }_S:(\mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E}\times \mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E})\to (\mathrm{N}\mathrm{A}\mathrm{M}\mathrm{E}\to \mathrm{N}\mathrm{A}\mathrm{M}\mathrm{E})$

As a helper function we also need function:

${{\beta }_S}^{\prime }:(\mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E}\times \mathrm{T}\mathrm{Y}\mathrm{P}\mathrm{E})\to (\mathrm{N}\mathrm{A}\mathrm{M}\mathrm{E}\leftrightarrow \mathrm{N}\mathrm{A}\mathrm{M}\mathrm{E})$

We will give a recursive definition of ${\mathsf{\beta }}_{\mathsf{S}}$. Meaning that we will give ${\beta }_{\{C_1,\dots C_m\}}$ given that we already now ${\beta }_{\{C_1,\dots C_{m-1}\}}$

This is valid since:

${\beta }_{\left\{C_1\right\}}\subseteq {\beta }_{\{C_1,C_2\}}\subseteq \dots {\beta }_S$

Its definition

We introduce the shurtcut ${\mathsf{S}}_{\mathsf{m}}$ to denote the system $\{C_1\dots C_m\}$

${\beta }_{S_m}(C_q\mapsto C_m)=\{\begin{array}{ll}\mathrm{\varnothing }& \text{if }q>m\\ \mathrm{i}\mathrm{d}\left(\mathrm{d}\mathrm{o}\mathrm{m}\left({\tau }_m\right)\right)\cup \bigcup _{i=1..\mathrm{\infty }}{\beta }_{S_{m-1}}({\alpha }_{m,i},{\alpha }_{m,i})\ll {\eta }_{m,i}& \text{if }q=m\\ {{\beta }_{S_m}}^{\prime }(C_q\mapsto C_m)\ll ({{\beta }_{S_m}}^{\prime }(C_q\mapsto C_m)▹{\sigma }_m)& \text{otherwise }\end{array}$

Where

${{\beta }_{S_m}}^{\prime }(C_q\mapsto C_m)=\bigcup _{i=1..\mathrm{\infty }}{\beta }_{S_{m-1}}(C_q\mapsto {\alpha }_{m,i});(\mathrm{i}\mathrm{d}\left(\mathrm{r}\mathrm{a}\mathrm{n}\left({\beta }_{S_{m-1}}(C_q\mapsto {\alpha }_{m,i})\right)\right)\ll {\eta }_{m,i})$

And:

${{\theta }_{S_m}}^{\prime }(C_q\mapsto C_m)=\bigcup _{i=1..\mathrm{\infty }}{\beta }_{S_{m-1}}(C_q\mapsto {\alpha }_{m,i});(\mathrm{i}\mathrm{d}\left(\mathrm{r}\mathrm{a}\mathrm{n}\left({\beta }_{S_{m-1}}(C_q\mapsto {\alpha }_{m,i})\right)\right)\ll {\eta }_{m,i})$