Decoding choice encodings

Information and Computation

Volumn 163, Issue 1, 2000, Pages 1-59

  Nestmann, Uwe ^a   Pierce, Benjamin C ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; DIFFERENTIATION (CALCULUS); MATHEMATICAL OPERATORS; SEMANTICS;

ASYNCHRONOUS MESSAGES;

ENCODING (SYMBOLS);

EID: 0034716048     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2868     Document Type: Article

References (67)

1. Amadio, R. M., Castellani, I., and Sangiorgi, D. (1998), On bisimulations for the asynchronous π-calculus, Theoret. Comput. Sci. 195, 291-324.
2. [An extended abstract appeared in Proceedings of CONCUR '96, Lecture Notes in Computer Science, Vol. 1119, pp. 147-162, Springer-Verlag, Berlin]
3. Arun-Kumar, S., and Hennessy, M. (1992), An efficiency preorder for processes, Acta Inform. 29, 737-760.
4. Amadio, R. M. Leth, L., and Thomsen, B. (1995), From a concurrent λ-calculus to the π-calculus, in "Proceedings of FCT'95" (H. Reichel, Ed.), Lecture Notes in Computer Science, Vol. 965, pp. 106-115, Springer-Verlag, Berlin. Full version as Technical Report ECRC-95-18.
5. Amadio, R. M. (1993), On the reduction of CHOCS bisimulation to π-calculus bisimulation, in "Proceedings of CONCUR'93" (E. Best, Ed.), Lecture Notes in Computer Science, Vol. 715, pp. 112-126, Springer-Verlag. Extended version as Rapport de Recherche, INRIA-Lorraine, 1993.
6. Amadio, R. M. (Feb. 1994), "Translating Core Facile," Technical Report ECRC-94-3, European Computer-Industry Research Centre, München.
7. Busi, N., and Gorrieri, R. (1995), Distributed conflicts in communicating systems, in "Object-Based Models and Languages for Concurrent Systems" (P. Ciancarini, O. Nierstrasz, and A. Yonezawa, Eds.), Lecture Notes in Computer Science, Vol. 924, pp. 49-65, Springer-Verlag, Berlin.
8. Boudol, G. (May 1992), Asynchrony and the π-Calculus (Note), Rapport de Recherche, 1702, INRIA, Sophia-Antipolis.
9. Buth, K.-H. (1994), Simulation of SOS definitions with term rewriting systems, in "Proceedings of ESOP'94" (D. Sannella, Eds.), Lecture Notes in Computer Science, Vol. 788, pp. 150-164, Springer-Verlag, Berlin.
10. Fournet, C., and Gonthier, G. (1996), The reflexive chemical abstract machine and the join-calculus, in "Proceedings of POPL'96" (J. G. Steele, Ed.), pp. 372-385, Assoc. Comput. Mach., New York.
11. Gammelgaard, A. (Dec. 1991), "Constructing Simulations Chuk by Chunk," Internal Report, DAIMI IR-106, Computer Science Department, Aarhus University. Part of the authors' Ph.D. thesis, Simulation Techniques, available as Report DAIMI-379.
12. Glabbeek, R. (1993), The linear time-branching time spectrum II: The semantics of sequential systems with silent moves (Extended Abstract), in "Proceedings of CONCUR'93" (E. Best, Ed.), Lecture Notes in Computer Science, Vol. 715, pp. 66-81, Springer-Verlag, Berlin.
13. Gladstein, D. (Dec. 1994), "Compiler Correctness for Concurrent Languages," Ph.D. thesis, Northeastern University.
14. Honda, K. (1992), "Two Bisimilarities in v-Calculus," CS Report 92-002, Keio University. Revised on March 31, 1993.
15. Honda, K., and Tokoro, M. (July 1991), An object for asynchronous communication, in "Proceedings of ECOOP'91" (P. America, Ed.), Lecture Notes in Computer Science, Vol. 512, pp. 133-147, Springer-Verlag, Berlin.
16. Honda, K., and Tokoro, M. (1992), On asynchronous communication semantics, in "Object-Based Concurrent Computing 1991" (M. Tokoro, O. Nierstrasz, and P. Wegner, Eds.), Lecture Notes in Computer Science, Vol. 612, pp. 21-51, Springer-Verlag, Berlin.
17. Honda, K., and Yoshida, N. (1994), Combinatory representation of mobile processes, in "Proceedings of POPL'94," pp. 348-360, Assoc. Comput. Mach., New York.
18. Honda, K., and Yoshida, N. (1994), Replication in concurrent combinators, in "Proceedings of TACS'94" (M. Hagiya and J. C. Mitchell, Eds.), Lecture Notes in Computer Science, Vol. 789, pp. 786-805, Springer-Verlag, Berlin.
19. Honda, K., and Yoshida, N. (1995), On reduction-based process semantics, in "Theoret. Comput. Sci.," Vol. 1522, pp. 437-486. [An extract appeared in Proceedings of FS TTC'93, LNCS 761]
20. Jones, C. (1993), A pi-calculus semantics for an object-based design notation, in "Proceedings of CONCUR'93" (E. Best, Ed.), Lecture Notes in Computer Science, Vol. 715, pp. 158-172, Springer-Verlag, Berlin.
21. Knabe, F. (1993), A distributed protocol for channel-based communication with choice, Comput. Artificial Intell. 12, 475-490.
22. Lavatelli, C. (Sept. 1993), "Non-deterministic Lazy λ-Calculus vs. π-Calculus," Technical Report LIENS-93-15, Ecole Normale Supérieure, Paris.
23. Li, W. (Jan. 1983), "An Operational Approach to Semantics and Translation for Concurrent Programming Languages," Ph.D. thesis, LFCS, University of Edinburgh. [Report CST-20-83]
24. Li, B. Z. (1994), A π-calculus specification of Prolog, in "Proceedings of ESOP" (D. Sannella, Ed.), Lecture Notes in Computer Science, Vol. 788, pp. 379-393, Springer-Verlag, Berlin.
25. Leth, L., and Thomsen, B. (1995), Some facile chemistry, Formal Aspects Comput. 7, 314-328. [A Previous Version appeared as ECRC-Report ECRC-92-14]
26. Millington, M. (Aug. 1987), "Theories of Translation Correctness for Concurrent Programming Languages," Ph.D. thesis, LFCS, University of Edinburgh. [Report CST-46-87]
27. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ.
28. Milner, R. (1992), Functions as processes, J. Math. Structures Comput. Sci. 2, 119-141.
29. [Previous version as Rapport de Recherche 1154, INRIA Sophia-Antipolis, 1990, and in Proceedings of ICALP'91, Lecture Notes in Computer Science, Vol. 443]
30. Milner, R. (1993), The polyadic π-calculus: A tutorial, in "Logic and Algebras of Specification" (F. L. Bauer, W. Brauer, and H. Schwichtenberg, Eds.), Series F: Computer and System Sciences, Vol. 94, NATO Advanced Study Institute, Springer-Verlag, Berlin. [Available as Technical Report ECS-LFCS-91-180, University of Edinburgh, October 1991]
31. Mitchell, K. (July 1986), "Implementations of Process Synchronisation and their Analysis," Ph.D. thesis, LFCS, University of Edinburgh.
32. Montanari, U., and Pistore, M. (1995), Concurrent semantics for the π-calculus, in "Proceedings of MFPD'95" (S. Brookes, M. Main, A. Melton, and M. Mislove, Eds.), ENTCS, Vol. 1, Elsevier Science, Amsterdam.
33. Milner, R., Parrow, J., and Walker, D. (1992), A calculus of mobile processes, Part I/II, Inform. and Comput. 100, 1-77.
34. Milner, R., and Sangiorgi, D. (1992), Barbed Bisimulation, in "Proceedings of ICALP'92" (W. Kuich, Eds.), Lecture Notes in Computer Science, Vol. 623, pp. 685-695, Springer-Verlag, Berlin.
35. Montanari, U., and Sassone, V. (1992), Dynamic congruence vs. progressing bisimulation for CCS, Fund. Inform. XVI, 171-199.
36. Nestmann, U. (November 1996), "On Determinacy and Nondeterminacy in Concurrent Programming," Ph.D. thesis, Technische Fakultät, Universität Erlangen. Arbeitsbericht IMMD-29(14).
37. Nestmann, U. (1997), What is a "good" encoding of guarded choice? in "Proceedings of EXPRESS'97" (C. Palamidessi and J. Parrow, Eds.), ENTCS, Vol. 7, Elsevier Science, Amsterdam.
38. [Full version as report BRICS-RS-99-43, Universities of Aalborg and Arhus, Denmark, 1997. Revised version accepted for Inform. and Comput. 156, 287-319.]
39. Niehren, J. (1996), Functional computation as concurrent computation, in "Proceedings of POPL'96," Assoc. Comput., New York, 333-343. [Full version as Research Report RR-95-14, DFKI Saarbrücken]
40. Odersky, M. (January 22,1995), Applying π: Towards a basis for concurrent imperative programming, in "Proceedings of SIPL'95" (U. S. Reddy, Eds.), ACM/SIGPLAN, pp. 95-108, University of Illinois at Urbana-Champaign. [Available as Technical Report UIUCDS-R-95-1900]
41. Odersky, M. (1995), Polarized name passing, in "Proceedings of FSTTCS'95" (P. S. Thiagarajan, Ed.), Lecture Notes in Computer Science, Vol. 1026, pp. 324-337, Springer-Verlag.
42. Oostrom, V., and Raamsdonk, F. (1994), Comparing combinatory reduction systems and higher-order rewrite systems, in "Proceedings of HOA'93" (J. Heering, K. Meinke, B. Möller, and T. Nipkow, Eds.), Lecture Notes in Computer Science, Vol. 816, pp. 276-304, Springer-Verlag, Berlin.
43. Palamidessi, C. (1997), Comparing the expressive power of the synchronous and the asynchronous π-calculus, in "Proceedings of POPL'97," pp. 256-265, Assoc. Comput. Mach., New York.
44. Parrow, J. (2000), Trios in concert, in "Proof, Language and Interaction: Essays in Honour of Robin Milner" (G. Plotkin, C. Stirling, and M. Tofte, Eds.), MIT Press, Cambridge, MA.
45. Priese, L. (1978), On the concept of simulation in asynchronous, concurrent systems, in "Progress in Cybernetics and Systems Research," Vol. VII, pp. 82-82, Hemisphere Dubl. [Proceedings of EMCSR (1978, Linz, Öosterreich)]
46. Parrow, J., and Sjödin, P. (1992), Multiway synchronization verified with coupled simulation, in "Proceedings of CONCUR'92" (R. Cleaveland, Ed.), Lecture Notes in Computer Science, Vol. 630, pp. 518-533, Springer-Verlag, Berlin.
47. Parrow, J., and Sjödin, P. (1994), The complete axiomatization of cs-Congruence, in "Proceedings of STACS'94" (P. Enjalbert, E. W. Mayr, and K. W. Wagner, Eds.), Lecture Notes in Computer Science, Vol. 775, pp. 557-568, Springer-Verlag, Berlin.
48. Pierce, B. C., and Turner, D. N. (1995), Concurrent objects in a process calculus, in "Proceedings of TPPP'94" (T. Ito and A. Yonezawa, Eds.), Lecture Notes in Computer Science, Vol. 907, pp. 187-215, Springer-Verlag, Berlin.
49. Pierce, B. C., and Turner, D. N. (2000), Pict: A programming language based on the pi-calculus, in "Proof, Language and Interaction: Essays in Honour of Robin Milner" (G. Plotkin, C. Stirling, and M. Tofte, Eds.), MIT Press, Cambridge, MA.
50. Ross, B., (1993), A π-calculus semantics of logical variables and unification, in "Proceedings of First North American Process Algebra Workshop, Stony Brook, 1992" (S. Purushothaman and A. Zwarico, Eds.), Workshops in Computing, pp. 216-230, Springer-Verlag, Berlin.
51. Sangiorgi, D. (1993), From π-calculus to higher-order π-calculus - and back, in "Proceedings of TAPSOFT'93" (M.-C. Gaudel and J.-P. Jouannaud, Eds.), Lecture Notes in Computer Science, Vol. 668, pp. 151-166, Springer-Verlag, Berlin.
52. Sangiorgi, D. (1994), An investigation into functions as processes, in "Proceedings of MFPS'93" (S. Brookes, M. Main, A. Melton, and D. Schmidt, Eds.), Lecture Notes in Computer Science, Vol. 802, pp. 143-159, Springer-Verlag, Berlin.
53. Sangiorgi, D. (1994), The lazy lambda calculus in a concurrency scenario, Inform. and Comput. 111, 120-131. [An extended abstract appeared in Proceedings of LICS '92]
54. Singiorgi, D. (1995), "Lazy Functions and Mobile Processes," Rapport de Recherche RR-2515, INRIA, Sophia-Antipolis.
55. Sangiorgi, D. (1995), On the bisimulation proof method, in "Proceedings of MFCS'95" (J. Wiedemann and P. Hájek, Eds.), Lecture Notes in Computer Science, Vol. 969, pp. 479-488, Springer-Verlag, Berlin.
56. Sangiorgi, D. (1996), π-calculus, internal mobility and agent-passing calculi, Theoret. Comput. Sci. 167, 235-275. [Also as Rapport de Recherche RR-2539, INRIA Sophia-Antipolis, 1995. Extracts of parts of the material contained in this paper be found in Proceedings of TAPSOFT'95 and ICALP'95]
57. Smolka, G. (1994), A foundation for higher-order concurrent constraint programming, in "Proceedings 1st International Conference of Constraints in Computational Logics" (J.-P. Jouannaud, Eds.), Lecture Notes in Computer Science, Vol. 845, pp. 50-72, Springer-Verlag, Berlin. [Available as Research Report RR-94-16 from DFKI Kaiserslautern]
58. Thomsen, B. (1993), Plain CHOCS. A second generation calculus for higher order processes, Acta Inform. 30, 1-59.
59. Thomsen, B. (1995), A theory of higher order communicating systems, Inform. and Comput. 116, 38-57.
60. Vaandrager, F. (1990), Process algebra semantics of POOL, in "Application of Process Algebra" (J. Baeten, Ed.), pp. 173-236, Cambridge University Press, Cambridge, UK. [Earlier version: CWI-Reports CS-R8629]
61. Victor, B., Parrow, J. (1996), Constraints as processes, in "Proceedings of CONCUR'96" (U. Montanari and V. Sassone, Eds.), Lecture Notes in Computer Science, Vol. 1119, pp. 389-405, Springer-Verlag, Berlin.
62. Walker, D. (1990), Bisimulation and divergence, Inform. and Comput. 85, 202-241. [An extended abstract appeared in the Proceedings of LICS' 88]
63. Walker, D. (1991), π-calculus semantics of object-oriented programming languages, in "Proceedings of TACS'91" (T. Ito and A. Meyer, Eds.), Lecture Notes in Computer Science, Vol. 526, pp. 532-547, Springer-Verlag, Berlin.
64. Walker, D. (1991), Some results on the π-calculus, in "Theory, Languages, and Architecture" (A. Yonezawa and T. Ito, Eds.), Lecture Notes in Computer Science, Vol. 491, pp. 21-35, Springer-Verlag, Berlin.
65. Walker, D. (1993), Process calculus and parallel object-oriented programming languages, in "Parallel Computers: Theory and Practice" (P. Tvrdik, T. Casavant, and F. Plasil, Eds.), pp. 369-390, Computer Society Press, New York. [Available as Research Report CS-RR-242, Department of Computer Science, University of Warwick]
66. Walker, D. (1994), Algebraic proofs of properties of objects, in "Proceedings of ESOP'94" (D. Sannella, Eds.), Lecture Notes in Computer Science, Vol. 788, pp. 501-516, Springer-Verlag, Berlin.
67. Walker, D. (1995), Objects in the π-calculus, Inform. and Comput. 116, 253-271.