Luca Cardelli. Amber and the amber machine. In Guy Cousineau, PierreLouis Curien, and Bernard Robinet, editors, Combinators and Functional Programming Languages, LNCS 242, pages 21-70, 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the low level language. In both cases, the full language available to the user remains very close to the process calculus presentation, and can be given rigorous semantics in a similar style. Analogous extensions could be given for other concurrent uniprocessor programming languages, such as Amber [Car86], Concurrent ML [Rep91] and Concurrent Haskell [JGF96] In the next section we introduce the two calculi informally, discussing our primitives in detail and giving examples of common programming idioms. In x3 and x4 we then present two sample infrastructure algorithms one using a centralised ....

Luca Cardelli. Amber and the amber machine. In Guy Cousineau, PierreLouis Curien, and Bernard Robinet, editors, Combinators and Functional Programming Languages, LNCS 242, pages 21-70, 1986.

....low level language. In both cases, the full language available to the user remains very close to the process calculus presentation, and can be given rigorous semantics in a similar style. Analogous extensions could be given for other concurrent uniprocessor programming languages, such as Amber [Car86] Concurrent ML [Rep91] and Concurrent Haskell [JGF96] In the next section we introduce the two calculi informally, discussing our primitives in detail and giving examples of common programming idioms. In x3 and x4 we then present two sample infrastructure algorithms one using a centralised ....

Luca Cardelli. Amber and the amber machine. In Guy Cousineau, PierreLouis Curien, and Bernard Robinet, editors, Combinators and Functional Programming Languages, LNCS 242, pages 21-70, 1986.

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