R. Milner. The polyadic ß-calculus: a tutorial. LFCS Report ECS-LFCS-91-180, University of Edinburgh, October 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Higher-Order, Linear, Concurrent Constraint Programming - Saraswat, Lincoln (1992) (24 citations) (Correct)
....and use higher order expressions. Related work. The desire for a clean, higher order, indeterminate language framework is a long standing one, both within theoretical and applied areas in concurrency. Perhaps the most well developed body of work related to this paper is that on the calculus [MPW89,Mil90,Mil91]. A primary reason for the interestingness of constraint languages is the notion of constraint based communication, which subsumes the notion of mobility of communication channels. It seemed clear to us, therefore, that there should be simple variants of cc languages which exhibit the ....
R. Milner. The polyadic ß-calculus: a tutorial. LFCS Report ECS-LFCS-91-180, University of Edinburgh, October 1991.
Continuations, Functions and Jumps - Thielecke (1999) (Correct)
....at all. In the C example, the type of p, void(char) was transformed into void(char,void(void) This may make it clearer that we can translate the where notation we used for CPS not only into the calculus, but into a more primitive calculus without functions. Specifically, Milner s calculus [8] and its descendants depend on this aspect of continuations for their ability to encode functions as processes [9, 2, 16] In such a process interpretation of continuations, we would read the jump f x 1 : x n as send the values x 1 : x n on channel f . The binding where fx 1 : ....
Robin Milner. The polyadic ß-calculus: A tutorial. LFCS Report ECS-LFCS-91-180, LFCS, University of Edinburgh, October 1991.
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