Milner, R., Action calculi II: ß-nets with boxes and replication, Internal report, Laboratory for Foundations of Computer Science, Dept. of Computer Science, University of Edinburgh, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
From Term Rewriting to Generalised Interaction Nets - Fernández, Mackie (1996) (1 citation) (Correct)
.... higher order rewrite systems like combinatory reduction systems (the reverse direction, i.e. coding interaction nets as combinatory reduction systems was studied in [2] ML (including exceptions and I O) threads in CML, process calculi (such as the calculus [13] and an understanding of nets [14]) equational rewriting, and narrowing (for the encoding of logic programming) This would provide a common basis where we can study models and implementations of systems, for example the combination of calculus with term rewriting systems. Acknowledgement. The work of Ian Mackie was funded by ....
R. Milner. Action calculi II: ß-nets with boxes and replication. Technical report, LFCS, Department of Computer Science, University of Edinburgh, 1993.
Action Structures and the Pi Calculus - Milner Self-citation (Milner) (Correct)
No context found.
Milner, R., Action calculi II: ß-nets with boxes and replication, Internal report, Laboratory for Foundations of Computer Science, Dept. of Computer Science, University of Edinburgh, 1993.
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