A type system for prototyping languages

RAPIDE is a programming language framework designed for the development of large, concurrent, real-time systems by prototyping. The framework consists of a type language and default executable, specification and architecture languages, along with associated programming tools. We describe the main features of the type language, its intended use in a prototyping environment, and rationale for selected design decisions.

[1]  William R. Cook.  Interfaces and specifications for the Smalltalk-80 collection classes , 1992, OOPSLA 1992.

[2]  William R. Cook,et al.  Interfaces and specifications for the Smalltalk-80 collection classes , 1992, OOPSLA.

[3]  William R. Cook,et al.  A Proposal for Making Eiffel Type-Safe , 1989, Comput. J..

[4]  David B. MacQueen.  Using dependent types to express modular structure , 1986, POPL '86.

[5]  David C. Luckham,et al.  Partial orderings of event sets and their application to prototyping concurrent, timed systems , 1993, J. Syst. Softw..

[6]  Mikael Rittri,et al.  Using types as search keys in function libraries , 1989, Journal of Functional Programming.

[7]  Dinesh Katiyar.  Subtyping F-bounded types , 1992 .

[8]  Benjamin C. Pierce,et al.  Bounded quantification is undecidable , 1992, POPL '92.

[9]  William R. Cook,et al.  Inheritance is not subtyping , 1989, POPL '90.

[10]  Xavier Leroy,et al.  Manifest types, modules, and separate compilation , 1994, POPL '94.

[11]  W. Tracz,et al.  An adaptable software architecture for integrated avionics , 1993, Proceedings of the IEEE 1993 National Aerospace and Electronics Conference-NAECON 1993.

[12]  Robin Milner,et al.  Commentary on standard ML , 1990 .

[13]  David Robson,et al.  Smalltalk-80: The Language and Its Implementation , 1983 .

[14]  Bjarne Stroustrup,et al.  The Annotated C++ Reference Manual , 1990 .

[15]  Lawrence Charles Paulson,et al.  ML for the working programmer , 1991 .

[16]  Giuseppe Castagna,et al.  Decidable bounded quantification , 1994, POPL '94.

[17]  Robin Milner,et al.  Definition of standard ML , 1990 .

[18]  Benjamin C. PierceyLFCS.  Decidable Bounded Quantiication , 1994 .

[19]  Mark Lillibridge,et al.  A type-theoretic approach to higher-order modules with sharing , 1994, POPL '94.

[20]  Alan Snyder.  Encapsulation and inheritance in object-oriented programming languages , 1986, OOPSLA 1986.

[21]  S. E. Keene,et al.  A programmer's guide to object-oriented programming in Common LISP , 1988 .

[22]  Bertrand Meyer,et al.  Eiffel: The Language , 1991 .

[23]  Colin Runciman,et al.  Retrieving Reusable Software Components by Polymorphic Type , 1991, J. Funct. Program..

[24]  Henry Ledgard,et al.  Reference Manual for the ADA® Programming Language , 1983, Springer New York.