Formal Aspects of Computing

, Volume 5, Issue 2, pp 91–120 | Cite as

An “executable” impredicative semantics for the Ada configuration

  • A. Bucci
  • P. Inverardi
  • S. Martini


We present a translation of Ada configuration constructs, in a higher order, impredicatively typed, functional language (HOTFUL) with subtypes. The aim of this work is to provide an expressive executable semantics for Ada configuration constructs, and to verify the suitability of the chosen HOTFUL for such a task. In particular, we address the practicability of the approach when dealing with the development of a whole complex system, as well as the description of single modular units. After giving the detailed rules for the translation, we compare our approach with what could be obtained selecting a different typed language as “target”, namely the predicative type system of Standard ML.


Ada Configuration Static semantics Type theory 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ada83]
    Ada Reference Manual, ANSI-MIL-STD 1815 A, January 1983.Google Scholar
  2. [AmL86]
    Amadio, R. and Longo, G.: Type-Free Compiling of Parametric Types.IFIP Conf. Formal description of Programming Concepts — III, Ebberup (DK), M. Wirsing (ed.), North Holland, pp. 377–397, 1986.Google Scholar
  3. [Car86]
    Cardelli, L.: A Polymorphic Lambda-Calculus with Type:Type. Report Syst. Res. Center, Dig. Equip. Corp., no. 10, 1986.Google Scholar
  4. [CaW85]
    Cardelli, L. and Wegner, P.: On Understanding Types, Data Abstraction, and Polymorphism.Computing Surveys,17(4), 471–522 (1985).Google Scholar
  5. [Coq86]
    Coquand, T.: An Analysis of Girard's Paradox.IEEE Symp. on Logic in Computer Science 86 (LICS), pp. 227–236, 1986.Google Scholar
  6. [Gir72]
    Girard, J.: Interpretation fonctionelle et elimination des coupures dans l'arithmetique d'ordre superieur, These de Doctorat d'Etat, Paris VII, 1972.Google Scholar
  7. [Har86]
    Harper, R.: Introduction to Standard ML. Laboratory for Foundations of Computer Science, Comp. Sci. Dept., University of Edinburgh, 1986.Google Scholar
  8. [HMM86]
    Harper, R., MacQueen, D. and Milner, R.: Standard ML. Tech. Rep. ECS-LFCS-86-2, Edinburgh, March 1986.Google Scholar
  9. [IMM89]
    Inverardi, P., Martini, S. and Montangero, C.: Is Typechecking Practical for System Configuration?TAPSOFT '89, Barcelona, March 1989, LNCS 352, 257–271, 1989.Google Scholar
  10. [LaB88]
    Lampson, B. and Burstall, R. M.: Pebble, a Kernel Language for Modules and Abstract Data Types.Information and Computation,76, 278–346 (1988).Google Scholar
  11. [Mac85]
    MacQueen, D. B.: Modules for Standard ML.Polymorphism,2 (2) (1985).Google Scholar
  12. [Mac86]
    MacQueen, D. B.: Using Dependent Types to Express Modular Structure.13th ACM Symp. on Principles of Programming Languages, 1986. St. Petersburg Beach, 277–286.Google Scholar
  13. [MiH88]
    Mitchell, J. C. and Harper, R.: The Essence of ML.15th ACM Symp. on Principles of Programming Languages, San Diego, CA, January 1988, 28–46.Google Scholar
  14. [MiP85]
    Mitchell, J. C. and Plotkin, G.: Abstract Types have Existential Types. ACM Transactions on Programming Languages and Systems (TOPLAS), Vol. 10, No. 3, July 1988, 470–502.Google Scholar
  15. [Plo81]
    Plotkin, G.: A Structural Approach to Operational Semantics. DAIMI FN-19, Computer Science Department, Aarhus University, Denmark, September 1981.Google Scholar

Copyright information

© BCS 1993

Authors and Affiliations

  • A. Bucci
    • 1
  • P. Inverardi
    • 2
  • S. Martini
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly
  2. 2.Istituto di Elaborazione dell'Informazione-CNRPisaItaly

Personalised recommendations