On Compilation of Higher-Order Concurrent Programs into First Order Programs Preserving Scope Equivalence

Abstract

This paper discusses the expressive power of a graph rewriting model of concurrent processes with higherorder communication. As we reported before, it is difficult to represent the scopes of names using models based on process algebra. Then we presented a model of concurrent systems based on graph rewriting. The model makes it possible to represent the… (More)

Topics

5 Figures and Tables

Cite this paper

@inproceedings{Murakami2011OnCO, title={On Compilation of Higher-Order Concurrent Programs into First Order Programs Preserving Scope Equivalence}, author={Masaki Murakami}, year={2011} }