On Ada packages, types and task types

Two important uses of Ada packages are analyzed. Namely, for defining abstract data types and for defining task subsystems. Their advantages are only summarized, since they are well known, but the advantages and drawbacks of alternative ways of achieving such purposes are discussed and a uniform style of use is sustained, as well as the need for a specific notation for compound task types.

[1]  Ken Shumate,et al.  Designing large real-time systems with Ada , 1988, CACM.

[2]  Brian A. Wichmann,et al.  Rationale for the design of the Ada programming language , 1979, SIGP.

[3]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[4]  Graham Beech,et al.  Software engineering with ada , 1983 .

[5]  Fernando Orejas,et al.  On unlimited types and reliability of Ada programs , 1984, ALET.

[6]  Albert Llamosí.  Parallel programming through schemes , 1984 .

[7]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.

[8]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[9]  Kjell Nielsen,et al.  A taxonomy of Ada packages , 1988, ALET.

[10]  Martin Wirsing,et al.  Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[11]  A. J. Wellings,et al.  Real-time Ada: outstanding problem areas , 1989, IRTAW '89.

[12]  James H. Morris,et al.  Types are not sets , 1973, POPL.

[13]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[14]  Stephen N. Zilles,et al.  Programming with abstract data types , 1974, SIGPLAN Symposium on Very High Level Languages.

[15]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1: Equations and Initial Semantics , 1985 .