The efficiency of a parallel program is related to the implementation of its data structures on the distributed (or shared) memory of a specific architecture. This paper describes a declarative approach that may be used to modify the mapping of the program data on a specific architecture. The ideas are developed in the context of a new language called UC and its implementation on the Connection Machine. The paper also contains measurements on sample programs to illustrate the effectiveness of data mappings in improving the execution efficiency of example programs. 1 Introduction In designing parallel languages, software engineering concerns dictate that the language abstract out architectural details and present a simple virtual machine to the programmer. However, experience with programming parallel architectures has indicated that optimal performance can be extracted only by exploiting the communication topology of the architecture such that communication and synchronization costs ...

Tuple pattern based retrieval is a language construct that matches a tuple pattern against a set of tuples to retrieve components of those tuples. This high-level abstraction allows programs to be written more easily and clearly than otherwise. This paper describes a clean and automatic method for transforming tuple pattern based retrievals into efficient implementations. The paper also presents two systems that implement the method, and describes successful experience and experiments in generating efficient implementations for graph algorithms, program analysis, security, and other applications. 1.

Abstract not found

Set-based languages have emerged as a powerful means for expressing not only programs but also requirements, test cases and so on. However, a uniform compilation schema for sets has not yet been completely developed. The present paper tries to overcome this lack using a set-based logic language, SL (set language), as target. The approach is based on an imperative abstract machine, the SAM (set abstract machine). The translation from SL to SAL (SAM assembly language) is described and all the possible optimizations, both at source code level and at assembly code level, are detailed. The potentials for identifying parallel flows of computations are analysed. Several examples of compilations are presented and discussed.

Many data-intensive applications require high-performance data management facilities, but utilize only a small fraction of the power of a general-purpose database system (DBMS). We believe single schema database systems (SSDs), i.e., special-purpose DBMSs that are designed for a single schema and a predeclared set of database operations, are a vital need of today’s software industry. The challenge is to create a technology for economically building high-performance SSDs. SSD research will combine results from object-oriented databases, persistent object stores, module interconnection languages, rule-based optimizers, open-architecture systems, extensible databases, and generic data types. 1

hereby granted, provided that this notice and the reference

Abstract not found

This paper describes our work on extending typed - calculus to accommodate operations with typed, or homogeneous, sets. Functions play a prominent role in describing the semantics of a programming language, and -calculus, as a theory of functions, provides rules for manipulating functions in a purely syntactic manner. We extend typed -calculus with typed sets, and call the extension as Set-Enriched Typed -Calculus, or in short SET -calculus. We show the well-formedness of SET -calculus, and we include the proof of its soundness and completeness. This is part of our work on implementing functional languages with sets. 1 Introduction This paper describes our work on extending typed - calculus to accommodate operations with typed, or homogeneous, sets. We call this extension as Set-Enriched Typed -Calculus, or in short SET -calculus. The functional programming style is closely related to the use of higher-order functions. In particular, it suggests that many function definitions are ...

Essentially all program translators (both source-to-source translators and compilers) operate via transliteration and refimment. The source program is first transliterated into the target language on a statement by statement basis. Various refinements are then applied in order to improve the quality of the output. Although acceptable in many situations, this approach is fundamentally limited in the quality of the output it can produce. In particular, it tends to be insufficiently sensitive to global features of the source program and too sensitive to irrelevant local details.

High-level query constructs help greatly improve the clarity of programs and the productivity of programmers, and are being introduced to increasingly more languages. However, the use of highlevel queries in programming languages can come at a cost to program efficiency, because these queries are expensive and may be computed repeatedly on slightly changed inputs. For efficient computation in practical applications, a powerful method is needed to incrementally maintain query results with respect to updates to query parameters. This paper describes a general and powerful method for automatically generating incremental implementations of high-level queries over objects and sets in object-oriented programs, where a query may contain arbitrary set enumerators, field selectors, and additional conditions. The method can handle any update to object fields and addition and removal of set elements, and generate coordinated maintenance code and invocation mechanisms to ensure that query results are computed correctly and efficiently. Our implementation and experimental results for example queries and updates confirm the effectiveness of the method. Categories and Subject Descriptors D.3.3 [Programming Languages]: Language Constructs and Features—classes and objects;