✦ LIBER ✦

Compiling editors

✍ Scribed by L. Apǎteanu; D.A.J. Rand

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 49 KB
Volume: 47
Category: Article
ISSN: 0378-7753
DOI: 10.1016/0378-7753(94)80064-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Compiling distributed applications

✍ A. Cochet-Muchy; J.P. Thomesse 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 555 KB

Compiling almost-whole Java programs

✍ Zoran Budimlić; Ken Kennedy 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

Compiling associativity into logic progr

Compiling associativity into logic programs

✍ D.R. Brough; C.J. Hogger 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

We show how a simple but important class of recursive logic programs can be mechanically transformed to take advantage of the associativity of auxiliary relations. This often results in improved efficiency through the introduction of tail recursion. We give proofs of correctness both for the transfo

Compiler Verification and Compiler Archi

Compiler Verification and Compiler Architecture

✍ Gerhard Goos 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Compiling Pattern Matching by Term Decom

Compiling Pattern Matching by Term Decomposition

✍ Laurence Puel; Ascander Suarez 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 852 KB

Compiling programs for distributed-memor

Compiling programs for distributed-memory multiprocessors

✍ David Callahan; Ken Kennedy 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 962 KB

We describe a new approach to programming distributed-memory computers. Rather than having each node in the system explicitly programmed, we derive an efficient message-passing program from a sequential shared-memory program annotated with directions on how elements of shared arrays are distributed