Types and Programming Languages
|
| < Free Open Study > |
|
A.11 Proposition
-
If S V T = J, then S <: J and T <: J.
-
If S ∧ T = M, then M <: S and M <: T.
Proof: By a straightforward induction on the size of a "derivation" of S ∧ T = M or S V T = J (i.e., the number of recursive calls to the definitions of ∧ and V needed to calculate M or J).
|
| < Free Open Study > |
|