Banach R., "MONSTR V --- Transitive Coercing Semantics and the Church-Rosser Property", submitted to Information and Computation, 1996.  Home/Search   Document Details and Download   Summary   Related Articles

.... such node (per rewrite rule) is a potentially puzzling feature bearing in mind that the graph rewriting formalism has been used traditionally as an implementation framework for declarative (functional, logic) languages; and although it does not prohibit us from reasoning rigorously about MONSTR ([4,5,6]) one would ideally like to have some greater insight into this slightly exotic feature. This is provided by diverse examples of its use. In the context of implementing concurrent logic languages via MONSTR ( 9] this feature enables a convenient implementation of the commit operator. A more ....

....turns out that this is possible, but the theoretical analysis that proves it to be the case is rather lengthy, and would distort the balance of this more implementation oriented paper unduly. We content ourselves with pointing out the main idea, and will present the full theory in another place ([6]) In the typed translation, at any particular moment, every stateholder (say S) in the graph, has at most one parent which is a function node (say F) for which S occurs in F s stateholder position, and such that the rule for F and S does not just reactivate F s matched nodes, or merely resuspend ....

[Article contains additional citation context not shown here]

Banach R., "MONSTR V --- Transitive Coercing Semantics and the Church-Rosser Property", submitted to Information and Computation, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC