A.11 Proposition

 < Free Open Study > 



A.11 Proposition

  1. If S V T = J, then S <: J and T <: J.

  2. 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 > 



Types and Programming Languages
Types and Programming Languages
ISBN: 0262162091
EAN: 2147483647
Year: 2002
Pages: 262

flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net