From Cml to Process Algebras
暂无分享,去创建一个
[1] Flemming Nielson,et al. The Typed lambda-Calculus with First-Class Processes , 1989, PARLE.
[2] Bent Thomsen,et al. A calculus of higher order communicating systems , 1989, POPL '89.
[3] Prateek Mishra,et al. Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming , 1990, ICALP.
[4] Luca Cardelli,et al. A semantic basis for quest , 1990, Journal of Functional Programming.
[5] Bent Thomsen,et al. Calculi for higher order communicating systems , 1990 .
[6] John H. Reppy,et al. CML: A Higher-Order Concurrent Language , 1991, PLDI.
[7] Robin Milner,et al. A semantics for ML concurrency primitives , 1992, POPL '92.
[8] Flemming Nielson,et al. Two-level functional languages , 1992, Cambridge tracts in theoretical computer science.
[9] John H. Reppy,et al. Higher-Order Concurrency , 1992 .
[10] Pierre Jouvelot,et al. The type and effect discipline , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[11] Giuseppe Castagna,et al. A calculus for overloaded functions with subtyping , 1992, LFP '92.
[12] Robin Milner,et al. The Polyadic π-Calculus: a Tutorial , 1993 .
[13] Christoph Crasemann,et al. πλ-Kalküle für Prozesse und Funktionen , 1993 .
[14] Kim G. Larsen,et al. The Fork Calculus , 1993, Nord. J. Comput..