Affiliation:
1. Dipartimento di Informatica, Università di Pisa, Corso Italia, n. 40 I-56125, Pisa, Italy
2. Istituto di Elaborazione dell'Informazione-CNR, Pisa, Italy
Abstract
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science,Software
Reference15 articles.
1. Ada Reference Manual ANSI-MIL-STD 1815 A January 1983.
2. 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.
3. Cardelli L.: A Polymorphic Lambda-Calculus with Type:Type. Report Syst. Res. Center Dig. Equip. Corp. no. 10 1986.
4. On understanding types, data abstraction, and polymorphism
5. Coquand T.: An Analysis of Girard's Paradox. IEEE Symp. on Logic in Computer Science 86 (LICS) pp. 227–236 1986.