DynBindModel - Revision history

Manus at 10:11, 11 April 2007

2007-04-11T10:11:04Z

2007-01-29T17:06:20Z

‎Some shortcuts

2007-01-29T17:06:03Z

‎Some shortcuts

2007-01-29T17:05:36Z

‎The full example

2007-01-29T16:58:27Z

‎The full example

2007-01-29T16:57:29Z

‎Definition of the naming function

2007-01-28T23:37:39Z

‎A model for an Eiffel System

2007-01-28T23:17:41Z

‎The direct inheritance function

2007-01-28T19:40:55Z

2007-01-28T19:37:36Z

‎No undefine or redefine

@@ Line 1: / Line 1: @@
 [[Category:ECMA]]
-{{Warning|'''Warning''': Article under development}}
+{{UnderConstruction}}
 Author: Matthias Konrad

@@ Line 226: / Line 226: @@
 *<math>\alpha_{n}\,</math> for <math>\alpha \left( C_n \right) </math>
 *<math>\sigma_{n, b}\,</math> for <math>\sigma \left( C_n \right) \left( b \right) </math>
-*<math>S_m</math> for <math>\left\{ C_1 \ldots C_m \right\}</math>
+*<math>S_m\,</math> for <math>\left\{ C_1 \ldots C_m \right\}</math>
 ====The full example====

@@ Line 226: / Line 226: @@
 *<math>\alpha_{n}\,</math> for <math>\alpha \left( C_n \right) </math>
 *<math>\sigma_{n, b}\,</math> for <math>\sigma \left( C_n \right) \left( b \right) </math>
 ====The full example====

@@ Line 269: / Line 269: @@
 <math>
     C = \left\{ 1 \mapsto A, 2 \mapsto B, 3 \mapsto D \right\}
 </math>

@@ Line 269: / Line 269: @@
 <math>
     C = \left\{ 1 \mapsto A, 2 \mapsto B, 3 \mapsto D \right\}
 </math>

@@ Line 326: / Line 326: @@
 |}
 ====Definition of the naming function====
 The naming function <math>\beta_S\,</math> is defined recursively. Meaning, that <math>\beta_{S_m }</math> is defined based on <math>\beta_{ S_{m-1}}</math>.

@@ Line 134: / Line 134: @@
 <math>\tau =
 \left\{
-    A \mapsto \left\{ f1 \mapsto \underline{A.f1}, g1 \mapsto \underline{A.g1} \right\},
+    A \mapsto \left\{ f_1 \mapsto \underline{A.f_1}, g_1 \mapsto \underline{A.g_1} \right\},
-    B \mapsto \left\{ f2 \mapsto \underline{B.f2}, g2 \mapsto \underline{B.g2} \right\},
+    B \mapsto \left\{ f_2 \mapsto \underline{B.f_2}, g_2 \mapsto \underline{B.g_2} \right\},
-    D \mapsto \left\{ f1 \mapsto \underline{D.f1}, g1 \mapsto \underline{D.g1} \right\}
+    D \mapsto \left\{ f_1 \mapsto \underline{D.f_1}, g_1 \mapsto \underline{D.g_1} \right\}
 \right\}
 </math>

@@ Line 142: / Line 142: @@
 ====The direct inheritance function====
 Eiffel classes can inherit from each other. This is described by the function <math>\alpha\,</math>:
 <math>\alpha : \mbox{TYPE} \rightarrow \mathbb{P} \left( \mbox{TYPE} \right)</math>
 For the example system:

@@ Line 4: / Line 4: @@
 Related articles:
 *Haskel module that implements the model: [[DynBindModelHaskell]]
 ===Motivation:===

@@ Line 197: / Line 197: @@
 ====No undefine or redefine====
-Undefine and redefine are not represented in this model. Redefine is not relevant for the semantics.
+Undefine and redefine are not represented in this model. The latter is generally not relevant for the semantics.
 ====The order====