Experience using an intermediate compiler target language for parallel machines

The generalised computational model of term graph rewriting systems (TGRSs) has been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional functional programming ones to the (concurrent) logic programming ones and various a...

Full description

Saved in:
Bibliographic Details
Published in:Microprocessors and microsystems Vol. 20; no. 9; pp. 511 - 520
Main Author: Papadopoulos, George A.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.05.1997
Subjects:
Compiler target languages
Intermediate representations
Language embeddings
Parallel and distributed computing
Term graph rewriting systems
Parallel and distributed computing
Compiler target languages
Term graph rewriting systems
Intermediate representations
Language embeddings
ISSN:0141-9331, 1872-9436
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The generalised computational model of term graph rewriting systems (TGRSs) has been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional functional programming ones to the (concurrent) logic programming ones and various amalgamations of them, to (concurrent) object-oriented ones. More recently, the relationship between TGRSs and process calculi (such as the π-calculus) as well as linear logic has also been explored. In this paper we describe our experience in using the intermediate compiler target language Dactl based on TGRSs for mapping a variety of programming paradigms of the aforementioned types onto it. In particular, we concentrate on some of the issues that we feel have played an important role in our work (in, say, affecting performance, etc.), the aim being to derive a list of features that we feel every language model which intends to be used as an intermediate representation between (concurrent) high-level languages and (parallel) computer architectures must have.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0141-9331
1872-9436
DOI:10.1016/S0141-9331(96)01123-4