The full version of this announcement is available.
Work on formal semantics of programming languages is an area of intensive research. Several successful approaches exist, and numerous books on the subject have been published. See, e.g., Gunter, Nielson and Nielson, Schmidt, Tennent, or Winskel.
There are a number of formal semantics of real-world programming languages. In order to establish which approach has been used to describe the semantics of which language, we would like to maintain corresponding lists.
We are seeking formal semantics of languages such as SML, Erlang, Haskell, Miranda, Clean, Gofer, Opal, Prolog, C, C++, Smalltalk, Pascal, Cobol, Fortran, Sisal, Modula-2, Oberon, Occam, Lisp, Scheme, Ada, Eiffel, Spark, etc. We are not looking for formal semantics of languages such as PCF, simple `while' languages or xy-`like' languages.
Semantics given in formalisms such as Action, axiomatic, natural, SOS, or denotational semantics, or evolving algebras are welcome.
There will be two lists: (1) one for complete semantics, and (2) the other for formal semantics of significant and large parts of languages, including information on which constructs are not covered. Please submit only semantics that are published or available by ftp or WWW, to ensure public access to the semantics.
The lists (1) and (2) are respectively available. Please send your entries (in the format used in these URL's) to Peter Baumann (E-mail: baumann@ifi.unizh.ch).