Difficulty of Programming

Constructive proof: given a theorem &forall x &exist y P(x,y) , prove it by constructing a y that satisfies the theorem.

specification &rarr theorem &rarr proof &rarr program

Contents    Page-10    Prev    Next    Page+10    Index