Connection graphs

Abstract

When thinking about programming languages, it is important to choose an appropriate abstract machine model. Such an abstract model serves to modularize the programming language problem into two pieces: translation of some high level language into the language of the abstract machine, and implemention of the abstract machine on real hardware. This paper presents connection graph grammars as an abstract model for parallel computation.