Date: Fri 25 Oct 2002 - 15:55:16 BST
> -----Original Message----- > From: Hubert Baumeister [mailto:firstname.lastname@example.org] > > > > For example, given some program P, I wish to determine it's > meaning. > > To > > do so requires that I have > > a formal semantics, one that is unambiguous and complete in > the sense > > that every sentence constructed > > in the implementation language has only one interpretation in the > > specification language - but that requires > > me to show that the specification language itself is > unambiguous - which > > in general can't be done. > > So what your are saying is, that it is impossible to give a > precise mathematical semantics to > programming language constructs? Correct me if I'm wrong but I believe Modula-2 was specified using VDM.