This paper presents how we can model different control operations on different parallel implementations of declarative programming languages. We use a program analysis method based on Attribute Grammar dependency graphs. With this analysis we can discern a large part of the control of such languages which we can specify in a programmable way. The remain control part is forming a non-programmable layer which is following the restrictions of the underlying hardware architecture of each implementation. The method can help towards the automation of the development of modern declarative programming languages.
展开▼
