Thumbnail
Access Restriction
Subscribed

Author Sallenave, Olivier ♦ Ducournau, Roland
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Subtype test ♦ Polymorphic recursion ♦ Type analysis ♦ Generics ♦ Closed-world assumption ♦ Polymorphism
Abstract Low-end embedded systems are still programmed in C and assembly, and adopting high-level languages such as C# should reduce the length of their development cycles. For these systems, code size is a major concern, but run-time efficiency should also be reasonable --- programmers will not migrate to C# unless the overhead compared with C is insignificant. In this paper, we propose a static approach based on whole program optimization for implementing .Net generics in such systems. Indeed, the implementation of run-time generics involves a tradeoff between size and run-time efficiency. In this proposal, generic instances are detected through a generalization of RTA to parametric polymorphism. Also, we propose an implementation scheme which employs code sharing and more effective coercions than boxing. Unlike existing implementation schemes, it is scalable in the number of generic instances without involving boxing and unboxing in a systematic way.
Description Affiliation: Cortus, Montpellier, France and LIRMM -- CNRS and Université Montpellier (Sallenave, Olivier) || LIRMM -- CNRS and Université Montpellier (Ducournau, Roland)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1983-05-01
Publisher Place New York
Journal ACM SIGPLAN Notices (SIGP)
Volume Number 47
Issue Number 5
Page Count 10
Starting Page 11
Ending Page 20


Open content in new tab

   Open content in new tab
Source: ACM Digital Library