A denotational (static) semantics method for defining Ada context conditions

  • Jørgen Bundgaard
  • Lennart Schultz
Part II: A Formal Definition Of Ada
Part of the Lecture Notes in Computer Science book series (LNCS, volume 98)


This paper outlines a denotational semantics like method for defining the statically decideable context conditions that Ada programs must satisfy. The resulting definition illustrates representational & operational abstraction by — in contrast to conventional attribute/affix grammar methods — not referring to any compiler realization.


Abstract Syntax Array Type Access Type Program Text Package Body 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Jørgen Bundgaard
  • Lennart Schultz

There are no affiliations available

Personalised recommendations