Nothing Special   »   [go: up one dir, main page]

skip to main content
Volume 13, Issue 1Jan. 1991
Reflects downloads up to 22 Nov 2024Bibliometrics
Skip Table Of Content Section
article
Open Access
Linking programs incrementally

Linking is traditionally a batch process that resolves cross-references between object modules and run-time libraries to produce a stand-alone executable image. Because most program changes only involve a small part of the program, we have implemented an ...

article
Open Access
Compilation of functional languages by program transformation

One of the most important issues concerning functional languages is the efficiency and the correctness of their implementation. We focus on sequential implementations for conventional von Neumann computers. The compilation process is described in terms ...

article
Open Access
Automatic transformation of series expressions into loops

The benefits of programming in a functional style are well known. In particular, algorithms that are expressed as compositions of functions operating on sequences/vectors/streams of data elements are easier to understand and modify than equivalent ...

article
Open Access
The concurrent language, Shared Prolog

Shared Prolog is a new concurrent logic language. A Shared Prolog system is composed of a set of parallel agents that are Prolog programs extended by a guard mechanism. The programmer controls the granularity of parallelism, coordinating communication ...

article
Open Access
Wait-free synchronization

A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free ...

article
Open Access
Efficient construction of LR(k) states and tables

A new method for building LR(k) states and parsing tables is presented. The method aims at giving a feasible construction of a collection of LR(k) parsing tables, especially when k > 1. for nontrivial grammars. To this purpose, the algorithm first ...

Subjects

Comments

Please enable JavaScript to view thecomments powered by Disqus.