Uniform confluence in concurrent computation

Journal of Functional Programming

Volumn 10, Issue 5, 2000, Pages 453-499

  Niehren, Joachim ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346007447     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796800003762     Document Type: Article

References (49)

1. Abadi, M., Cardelli, L., Curien, P.-L. and Lévy, J.-J. (1991) Explicit substitutions. J. Functional Programming, 1(4), 375-416.
2. Ariola, Z. M. and Felleisen, M. (1997) The call-by-need lambda calculus. J. Functional Programming, 7(3).
3. Ariola, Z. M., Felleisen, M., Maraist, J., Odersky, M. and Wadler, P. (1995) A call-by-need lambda calculus. ACM Symposium on Principles of Programming Languages, pp. 233-246.
4. Armstrong, J., Williams, R., Virding, M. and Wikstroem, C. (1996) Concurrent Programing in Erlang. Prentice-Hall. 2nd ed.
5. Arvind, Nikhil, R. S. and Pingali, K. K. (1989) I-structures: data-structures for parallel computing. ACM Trans. Programming Languages and Systems, 4(11), 598-632.
6. Asperti, A. (1997) P = NP, up to sharing. Dipartimento di Scienze dell'Informatizione, Bologna. (Available at ftp://ftp.cs.unibo.it/pub/asperti/pnp.ps.gz.)
7. Barendregt, H. P. (1981) The lambda calculus. Its syntax and semantics. Studies in Logic and the Foundations of Mathematics, vol. 103. Elsevier.
8. Boudol, G. (1992) Asynchrony and the π-calculus (note). Rapport de Recherche 1702. INRIA, Sophia Antipolis, France.
9. th International Conference on Concurrency Theory, pp. 238-252.
10. Dershowitz, N. and Jouannaud, J.-P. (1990) Rewrite systems. Vol. B, pp. 243-320. MIT Press.
11. Fournet, C. and Gonthier, G. (1996) The Reflexive CHAM and the Join-Calculus. 23rd ACM Symposium on Principles of Programming Languages, pp. 372-385.
12. Fournet, C. and Maranget, L. (1997) Join Calculus Language. INRIA Rocquencourt, http://pauillac.inria.fr/join.
13. Honda, K. and Tokoro, M. (1991) An object calculus for asynchronous communication. In: America, P. (ed.), European Conference on Object-Oriented Programming, pp. 133-147. Lecture Notes in Computer Science 512, Springer-Verlag.
14. Huet, G. (1980) Confluent reductions: Abstract properties and applications to term rewriting systems. J. ACM, 27(4), 797-821.
15. Jeffrey, A. (1994) A fully abstract semantics for concurrent graph reduction. IEEE Symposium on Logic in Computer Science, pp. 82-91.
16. Klop, J. W. (1987) Term rewriting systems: A tutorial. Bulletin of the European Association on Theoretical Computer Science, 32, 143-182.
17. Kobayashi, N., Pierce, B. and Turner, D. N. (1996) Linearity and the pi-calculus. ACM Symposium on Principles of Programming Languages, pp. 358-371.
18. Launchbury, J. (1993) A natural semantics for lazy evaluation. ACM Symposium on Principles of Programming Languages, pp. 144-154.
19. Maher, M. J. (1987) Logic semantics for a class of committed-choice programs. In: Lassez, J.-L. (ed.), 4th International Conference on Logic Programming, pp. 858-876.
20. Maraist, J., Odersky, M., Turner, D. and Wadler, P. (1995) Call-by-name, call-by-value, call-by-need, and the linear lambda calculus. 11th International Conference on the Mathematical Foundations of Programming Semantics.
21. Maraist, J., Odersky, M. and Wadler, P. (1998) The call-by-need lambda calculus. J. Functional Programming, 8(3), 275-317.
22. Maranget, L. (1990) Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems. ACM Symposium on Principles of Programming Languages, pp. 255-269.
23. Maranget, L. (1992) La Stategie Ṗaresseuse. Thèse doctorale, Université Paris VII.
24. Milner, R. (1991) The polyadic π-calculus: A tutorial ECS-LFCS Report Series 91-180. Laboratory for Foundations of Computer Science, University of Edinburgh.
25. Milner, R. (1992) Functions as processes. J. Mathematical Structures in Computer Science, 2(2), 119-141.
26. Moran, A. and Sands, D. (1999) Improvement in a lazy context: An operational theory of call-by-need. 26th ACM Symposium on Principles of Programming Languages, pp. 43-56.
27. Nestmann, U. (1996) On Determinacy and Nondeterminacy in Concurrent Programming. Dissertation, technische Fakultät, Universität Erlangen.
28. Nestmann, U. and Pierce, B. (1996) Decoding choice encodings. In: Montanari, U. and Sassone, V. (eds.), 7th International Conference on Concurrency Theory: Lecture Notes in Computer Science 1119, pp. 179-194.
29. Niehren, J. (1994) Funktionale Berechnung in einem uniform nebenläufigen Kalkül mit logischen Variablen. Dissertation, Universität des Saarlandes, Saarbrücken.
30. Niehren, J. (1996) Functional computation as concurrent computation. 23th ACM Symposium on Principles of Programming Languages, pp. 333-343.
31. Niehren, J. (1999) Uniform confluence in concurrent computation, unabridged. Technical report, Programming Systems Lab, Universität des Saarlandes, Saarbrücken. (Available at http://www.ps.uni-sb.de/Papers/abstracts/Uniform:99.html.)
32. Niehren, J. and Müller, M. (1995) Constraints for Free in Concurrent Computation. In: Kanchanasut, K. and Lévy, J.-J. (eds.), Asian Computing Science Conference: Lecture Notes in Computer Science 1023, pp. 171-186.
33. Niehren, J. and Smolka, G. (1994) A confluent relational calculus for higher-order programming with constraints. 1st International Conference on Constraints in Computational Logics: Lecture Notes in Computer Science 845, pp. 89-104.
34. Philippou, A. and Walker, D. (1997) On confluence in the π-calculus. International Conference on Automata, Languages, and Programming: Lecture Notes in Computer Science 1256, pp. 314-324. Springer-Verlag.
35. Pierce, B. C. and Turner, D. N. (1997) Pict: A Programming Language Based on the Pi-Calculus. Milner Festschrift. MIT Press.
36. Pingali, K. K. (1987) Lazy Evaluation and the Logic Variable. Technical report, Cornell University. Proceedings of the Institute on Declarative Programming.
37. Plotkin, G. D. (1975) Call-by-name, call-by-value and the λ-calculus. J. Theor. Comput. Sci., 1, 125-159.
38. Purushothaman, S. and Seaman, J. (1992) An adequate operational semantics of sharing in lazy evaluation. European Symposium on Programming: Lecture Notes in Computer Science 582. Springer-Verlag.
39. Reppy, J. H. (1992) Concurrent ML: Design, Application and Semantics. Functional Programming, Concurrency, Simulation and Automated Reasoning: Lecture Notes in Computer Science 693, pp. 165-198. Springer-Verlag.
40. Sangiorgi, D. (1996) A Theory of Bisimulation for π-Calculus. Acta Informatica, 33.
41. Sangiorgi, D. (1997) The name discipline of uniform receptiveness. International Conference on Automata, Languages, and Programming, pp. 303-313.
42. Saraswat, V. A., Rinard, M. and Panangaden, P. (1991) Semantic foundations of concurrent constraint programming. ACM Symposium on Principles of Programming Languages, p. 333-352.
43. Smolka, G. (1994) A foundation for concurrent constraint programming. 1st International Conference on Constraints in Computational Logics: Lecture Notes in Computer Science 845, pp. 50-72. Springer-Verlag.
44. Smolka, G. (1995) The Oz programming model. In: van Leeuwen, J. (ed.), Computer Science Today: Lecture Notes in Computer Science 1000, pp. 324-343.
45. Smolka et al. (1995) The Oz Programming System. Programming Systems Lab, Universität des Saarlandes. (Available at www.mozart-oz.de.)
46. Thomsen, B., Leth, L., Prasad, S., Kuo, T.-M., Kramer, A., Knabe, F. and Giacalone, A. (1993) Facile Antigua release programming guide. Technical Report ECRC-93-20. ECRC, European Computer-Industry Research Centre.
47. Turner, D. N. (1996) The polymorphic pi-calculus: Theory and implementation. PhD thesis, University of Edinburgh. (Available as LFCS report ECS-LFCS-96-345.)
48. Victor, B. and Parrow, J. (1996) Constraints as Processes. In: Montanari, U. and Sassone, V. (eds.), 7th International Conference on Concurrency Theory: Lecture Notes in Computer Science 1119, p. 389-405.
49. Yoshida, N. (1993) Optimal reduction in weak λ-calculus with shared environments. ACM Conference on Functional Programming Languages and Computer Architecture.