Using many-sorted natural semantics to specify and generate semantic analysis

  • S. Glesner
  • W. Zimmermann
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT)


We present an extension of natural semantics which can be used to describe the static semantics of imperative and object-oriented programming languages. Furthermore we show that the semantic analysis can be generated from these descriptions. As a side-effect, we get a precise definition of which properties of a programming language are statically decidable and which properties can only be checked dynamically during run-time. As an example, we show how a subset of the Java programming language incorporating the full notion of inheritance can be specified within our mechanism.


Natural semantics semantic analysis specification generator imperative and object-oriented programming languages 


  1. [AP94]
    Isabelle Attali and Didier Parigot. Integrating Natural Semantics and Attribute Grammars: the Minotaur System. Technical Report 2339, Institut National de Recherche en Informatique et en Automatique (INRIA), September 1994.Google Scholar
  2. [Att88]
    Isabelle Attali. Compiling Typol with Attribute Grammars. In Pierre Deransart, Bernard Lorho, and Jan Maluszynski, editors, Programming Language Implementation and Logic Programming, 1st International Workshop PLILP′88, pages 252–272, Orléans, France, May 16–18 1988. Springer, Lecture Notes in Computer Science, Vol. 348.Google Scholar
  3. [BCD+88]
    P. Borras, D. Clément, Th. Despeyroux, J. Incerpi, G. Kahn, B. Lang, and V. Pascual. CENTAUR: the system. In Proceedings of the Third Symposium on Software Development Environments (SDE3), ACM Sigsoft ′88, Boston, December 1988. also appears as INRIA research report no. 777, Dec. 1987.Google Scholar
  4. [Des88]
    T. Despeyroux. Typol: a formalism to implement Natural Semantics. INRIA research report 94, INRIA, 1988.Google Scholar
  5. [Gen69]
    G. Gentzen. Investigation into Logical Deduction (Thesis 1935). Reprinted in “The collected papers of Gerhard Gentzen” E. Szabo, North-Holland, Amsterdam, 1969.Google Scholar
  6. [GZ97]
    Sabine Glesner and Wolf Zimmermann. Using Many-Sorted Inference Rules to Generate Semantic Analysis. In Otto Spaniol, editor, Proceedings des Workshops der InformatikGraduiertenkollegs “Promotion tut not: Innovationsmotor Graduiertenkolleg” im Rahmen der GI-Jahrestagung 1997. Verlag der Augustinus Buchhandlung (Aachener Beitrge zur Informatik, Band 21), 1997.Google Scholar
  7. [Kah87]
    Gilles Kahn. Natural Semantics. In Franz-Josef Brandenburg, Guy Vidal-Naquet, and Martin Wirsing, editors, Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science (STACS′87), pages 22–39, Passau, Germany, February 1987. Springer, LNCS 247.Google Scholar
  8. [Mit90]
    John C. Mitchell. Type Systems for Programming Languages, volume B of Handbook of Theoretical Computer Science, chapter 8, pages 365–458. MIT Press/Elsevier Science Publishers B.V., 1990.Google Scholar
  9. [Pet95]
    Mikael Pettersson. Compiling Natural Semantics. PhD thesis, Department of Computer and Information Science, Linköping University, S-581 83 Linköping, Sweden, 1995.Google Scholar
  10. [Pet96]
    Mikael Pettersson. A Compiler for Natural Semantics. In Proceedings of the 6th International Conference on Compiler Construction„ CC′96, Linköping, Sweden, April 1996. Springer, Lecture Notes in Computer Science, Vol. 1060.Google Scholar
  11. [PS94]
    Jens Palsberg and Michael I. Schwartzbach. Object-Oriented Type Systems. Wiley Professional Computing, 1994.Google Scholar
  12. [WG84]
    William M. Waite and Gerhard Goos. Compiler Construction. Springer Verlag, Berlin, New York Inc., 1984.zbMATHCrossRefGoogle Scholar

Copyright information

© IFIP 1998

Authors and Affiliations

  • S. Glesner
    • 1
  • W. Zimmermann
    • 1
  1. 1.Institut für Programmstrukturen und DatenorganisationUniversität KarlsruheKarlsruheGermany

Personalised recommendations