From CML to its Process Algebra

[1]  Matthias Felleisen,et al.  A Syntactic Approach to Type Soundness , 1994, Inf. Comput..

[2]  Flemming Nielson,et al.  Constraints for Polymorphic Behaviours of Concurrent ML , 1994, CCL.

[3]  Flemming Nielson,et al.  Higher-order concurrent programs with finite communication topology (extended abstract) , 1994, POPL '94.

[4]  Kim G. Larsen,et al.  The Fork Calculus , 1993, Nord. J. Comput..

[5]  Davide Sangiorgi,et al.  A Theory of Bisimulation for the pi-Calculus , 1993, CONCUR.

[6]  Flemming Nielson,et al.  From CML to Process Algebras (Extended Abstract) , 1993, CONCUR.

[7]  Mourad Debbabi,et al.  A Coherent Type System for a Concurrent, Functional and Imperative Programming Language , 1993, AMAST.

[8]  Peter E. Lauer,et al.  Functional Programming, Concurrency, Simulation and Automated Reasoning , 1993, Lecture Notes in Computer Science.

[9]  Christoph Crasemann,et al.  πλ-Kalküle für Prozesse und Funktionen , 1993 .

[10]  John H. Reppy.  Concurrent ML: Design, Application and Semantics , 1993, Functional Programming, Concurrency, Simulation and Automated Reasoning.

[11]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[12]  Flemming Nielson,et al.  Two-level functional languages , 1992, Cambridge tracts in theoretical computer science.

[13]  Pierre Jouvelot,et al.  The type and effect discipline , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[14]  Robin Milner,et al.  A semantics for ML concurrency primitives , 1992, POPL '92.

[15]  Giuseppe Castagna,et al.  A calculus for overloaded functions with subtyping , 1992, LFP '92.

[16]  John H. Reppy,et al.  Higher-Order Concurrency , 1992 .

[17]  Marko C. J. D. van Eekelen,et al.  Concurrent Clean , 1991, PARLE.

[18]  Luca Cardelli,et al.  A semantic basis for quest , 1990, Journal of Functional Programming.

[19]  John H. Reppy,et al.  CML: A Higher-Order Concurrent Language , 1991, PLDI.

[20]  Bent Thomsen,et al.  Calculi for higher order communicating systems , 1990 .

[21]  Robin Milner,et al.  Definition of standard ML , 1990 .

[22]  Flemming Nielson,et al.  The Typed lambda-Calculus with First-Class Processes , 1989, PARLE.

[23]  Bent Thomsen,et al.  A calculus of higher order communicating systems , 1989, POPL '89.

[24]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[25]  Chris Reade,et al.  Elements of functional programming , 1989, International computer science series.

[26]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[27]  David K. Gifford,et al.  Polymorphic effect systems , 1988, POPL '88.

[28]  Matthias Felleisen,et al.  Control operators, the SECD-machine, and the λ-calculus , 1987, Formal Description of Programming Concepts.

[29]  Mariangiola Dezani-Ciancaglini,et al.  A new type assignment for λ-terms , 1978, Arch. Math. Log..