Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Compilation of Concurrent Declarative Z. M. Ariola, B. C. Massey, M. Sami, and E. Tick
 

Summary: Compilation of Concurrent Declarative
Languages
Z. M. Ariola, B. C. Massey, M. Sami, and E. Tick
University of Oregon
CIS­TR--94--05
March 1994
Abstract
The plethora of concurrent declarative language families, each with subtly different seman­
tics, makes the design and implementation of static analyses for these languages a demanding
task. However, many of the languages share underlying structure, and if this structure can be
exploited, static analysis techniques can be shared across language families. These techniques
can thus provide a common kernel for the implementation of quality compilers for this entire
language class.
The purpose of this paper is to exploit the similarities of non­strict functional and concurrent
logic languages in the design of a common intermediate language (CIL). The CIL is introduced
incrementally, giving at each step the rationale for its extension. As an application, we present, in
CIL form, some state­of­the­art static partitioning algorithms from the literature. This allows us
to ``uncover'' the relative advantages and disadvantages of the analyses, and determine promising
directions for improving static partitioning.
This report is an extended version of a paper appearing in the Proceedings of the ICOT/NSF

  

Source: Ariola, Zena M. - Department of Computer and Information Science, University of Oregon

 

Collections: Computer Technologies and Information Sciences