Efficient logic variables for distributed computing

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 3, 1999, Pages 569-626

  Haridi, Seif ^a   Van Roy, Peter ^b   Brand, Per ^a   Mehl, Michael ^c   Scheidhauer, Ralf ^d   Smolka, Gert ^e  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^c DEUTSCHE TELEKOM LABORATORIES   (Germany)

^d IDS SCHEER AG   (Germany)

^e SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED ALGORITHMS; LOGIC VARIABLES;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; DATA REDUCTION; FORMAL LOGIC; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; SEMANTICS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0004392517     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/319301.319347     Document Type: Article

References (63)

1. ALFORD, M. W., LAMPORT, L., AND MULLERY, G. P. 1985. Lecture Notes in Computer Science, vol. 190. Springer Verlag, Chapter 2. Basic Concepts, in Distributed Systems-Methods and Tools for Specification, An Advanced Course.
2. ALOUINI, I. AND VAN ROY, P. 1999. Le protocole réparti de Distributed Oz (in French). In Colloque Francophone sur l'Ingénierie des Protocoles (CFIP 99). 283-298.
3. ARMSTRONG, J., WILLIAMS, M., WIKSTRÖM, C., AND VIRDING, R. 1996. Concurrent Programming in Erlang. Prentice-Hall, Englewood Cliffs, N.J.
4. ARVIND AND THOMAS, R. E. 1980. I-Structures: An efficient data type for functional languages. Tech. Rep. 210, MIT, Laboratory for Computer Science.
5. BAL, H. E., STEINER, J. G., AND TANENBAUM, A. S. 1989. Programming languages for distributed computing systems. ACM Comput. Surv. 21, 3 (Sept.), 261-322.
6. BRAND, P., VAN ROY, P., COLLET, R., AND KLINTSKOG, E. 1999. Formal definition and correctness of a reliable mobile-state protocol for constructing fault-tolerant applications. In preparation.
7. CARDELLI, L. 1995. A language with distributed scope. ACM Trans. Comput. Syst. 8, 1 (Jan.), 27-59.
8. CHOW, R. AND JOHNSON, T. 1997. Distributed Operating Systems and Algorithms. Addison-Wesley, San Francisco, Calif.
9. COLMERAUER, A. 1982. Prolog and Infinite Trees. Academic Press. In Logic Programming, Keith L. Clark and Sten-Åke Tarnlund, eds.
10. COURCELLE, B. 1983. Fundamental properties of infinite trees. Theoretical Computer Science 25, 95-169.
11. DFKI Oz 1998. DFKI Oz version 2.0. Available at http://www.ps.uni-sb.de.
12. DIAZ, M., RUBIO, B., AND TROYA, J. M. 1997. DRL: A distributed real-time logic language. Comput. Lang. 23, 2-4, 87-120.
13. DUCHIER, D., KORNSTAEDT, L., SCHULTE, C., AND SMOLKA, G. 1998. A Higher-order Module Discipline with Separate Compilation, Dynamic Linking, and Pickling. Tech. rep., Programming Systems Lab, DFKI and Universität des Saarlandes. DRAFT.
14. FOSTER, I. 1988. Parallel implementation of Parlog. In International Conference on Parallel Processing. IEEE Computer Society, 9-16.
15. FUJISE, T., CHIKAYAMA, T., ROKUSAWA, K., AND NAKASE, A. 1994. KLIC: A portable implementation of KL1. In Fifth Generation Computing Systems (FGCS '94). 66-79.
16. GOSLING, J., JOY, B., AND STEELE, G. 1996. The Java Language Specification. Addison-Wesley. Available at http://www.javasoft.com.
17. GUDEMAN, D. 1993. Representing type information in dynamically typed languages. Tech. Rep. TR93-27, University of Arizona, Department of Computer Science. Sept.
18. HALSTEAD, R. H. 1985. MultiLisp: A language for concurrent symbolic computation. ACM Trans. Program. Lang. Syst. 7, 4 (Oct.), 501-538.
19. HARIDI, S. 1981. Logic programming based on a natural deduction system. Ph.D. thesis, Royal Institute of Technology, Stockholm.
20. HARIDI, S. AND FRANZÉN, N. 1999. Tutorial of Oz. Tech. rep. In Mozart documentation, available at http://www.mozart-oz.org.
21. HARIDI, S. AND SAHLIN, D. 1984. Efficient implementation of unification of cyclic structures. Ellis Horwood Limited. In Implementations of Prolog, J. A. Campbell, ed.
22. HARIDI, S., VAN ROY, P., BRAND, P., AND SCHULTE, C. 1998. Programming languages for distributed applications. New Generation Computing 16, 3 (May), 223-261.
23. HARIDI, S., VAN ROY, P., AND SMOLKA, G. 1997. An overview of the design of Distributed Oz. In the 2nd International Symposium on Parallel Symbolic Computation (PASCO 97). ACM.
24. HENZ, M. 1997a. Objects for Concurrent Constraint Programming. The Kluwer International Series in Engineering and Computer Science, vol. 426. Kluwer Academic Publishers, Boston.
25. HENZ, M. 1997b. Objects in Oz. Ph.D. thesis, Universität des Saarlandes, Fachbereich Informatik, Saarbrücken, Germany.
26. IANNUCCI, R. A. 1990. Parallel Machines: Parallel Machine Languages. The Emergence of Hybrid Dataflow Computer Architectures. Kluwer, Dordrecht, the Netherlands.
27. ICHIYOSHI, N., MIYAZAKI, T., AND TAKI, K. 1987. A distributed implementation of Flat GHC on the Multi-PSI. In 4th International Conference on Logic Programming. MIT Press, 257-275.
28. JAFFAR, J. AND MAHER, M. 1994. Constraint logic programming: A survey. J. Log. Prog. 19/20, 503-581.
29. LAMMA, E., MELLO, P., STEFANELLI, C., AND VAN HENTENRYCK, P. 1997. Improving distributed unification through type analysis. In Euro-Par '97 Parallel Processing. Lecture Notes in Computer Science, vol. 1300. Springer-Verlag, 1181-1190.
30. LEA, D. 1997. Concurrent Programming in Java. Addison-Wesley.
31. LEUNG, H.-F. 1993. Distributed Constraint Logic Programming. Series in Computer Science, vol. 41. World Scientific, Singapore.
32. LEUNG, H.-F. AND CLARK, K. L. 1996. Constraint satisfaction in distributed concurrent logic programming. J. Symbolic Computation 21, 699-714.
33. LLOYD, J. 1987. Foundations of Logic Programming, Second Edition. Springer-Verlag.
34. MARTELLI, A. AND MONTANARI, U. 1982. An efficient unification algorithm. ACM Trans. Program. Lang. Syst. 4, 2 (Apr.), 258-282.
35. MEHL, M. 1999. The Oz virtual machine - records, transients, and deep guards. Ph.D. thesis, Technische Fakultät der Universität des Saarlandes.
36. MEHL, M., SCHULTE, C., AND SMOLKA, G. 1998. Futures and by-need synchronization for Oz.
37. MEHLHORN, K. AND TSAKALIDIS, A. 1990. Data structures. In Handbook of Theoretical Computer Science - Volume A: Algorithms and Complexity, J. van Leeuwen, Ed. Elsevier MIT Press, 301-341.
38. MOZART CONSORTIUM. 1999. The Mozart programming system (Oz 3). Available at http://www.mozart-oz.org.
39. OTTE, R., PATRICK, P., AND ROY, M. 1996. Understanding CORBA: The Common Object Request Broker Architecture. Prentice-Hall PTR, Upper Saddle River, N.J.
40. PLAINFOSSÉ, D. AND SHAPIRO, M. 1995. A survey of distributed garbage collection techniques. In the International Workshop on Memory Management. Lecture Notes in Computer Science, vol. 986. Springer-Verlag, Berlin, 211-249.
41. PODELSKI, A. AND SMOLKA, G. 1997. Situated simplification. Theoretical Computer Science 173, 209-233.
42. ROBINSON, J. A. 1965. A machine-oriented logic based on the resolution principle. J. ACM 12, 23-41.
43. ROKUSAWA, K., NAKASE, A., AND CHIKAYAMA, T. 1996. Distributed memory implementation of KLIC. New Generation Computing 14, 3, 261-280.
44. SARASWAT, V. A. 1993. Concurrent Constraint Programming. MIT Press.
45. SCHULTE, C. 1997. Programming constraint inference engines. In Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming, G. Smolka, Ed. Lecture Notes in Computer Science, vol. 1330. Springer-Verlag, Schloß Hagenberg, Austria, 519-533.
46. SHAPIRO, E. 1989. The family of concurrent logic programming languages. ACM Comput. Surv. 21, 3 (Sept.), 413-510.
47. SMOLKA, G. 1995. The Oz programming model. In Computer Science Today. Lecture Notes in Computer Science, vol. 1000. Springer-Verlag, Berlin, 324-343.
48. SMOLKA, G. 1996. Problem solving with constraints and programming. ACM Computing Surveys 28, 4es (Dec.). Electronic Section.
49. SMOLKA, G. 1998. Concurrent constraint programming based on functional programming. In Programming Languages and Systems, C. Hankin, Ed. Lecture Notes in Computer Science, vol. 1381. Springer-Verlag, Lisbon, Portugal, 1-11.
50. SMOLKA, G., SCHULTE, C., AND VAN ROY, P. 1995. PERDIO - Persistent and distributed programming in Oz. BMBF project proposal. Available at http://www.ps.uni-sb.de.
51. STROUSTRUP, B. 1997. The C++ Programming Language, Third Edition. Addison-Wesley.
52. SUN MICROSYSTEMS. 1997. The Remote Method Invocation Specification. Available at http://www.javasoft.com.
53. SUNDSTRÖM, A. 1998. Comparative study between Oz 3 and Java. Tech. rep., Uppsala University and Swedish Institute of Computer Science. July.
54. TAYLOR, A. 1991. High-performance Prolog implementation. Ph.D. thesis, Basser Department of Computer Science, University of Sydney.
55. TEL, G. 1994. An Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, United Kingdom.
56. VAN ROY, P. 1994. 1983-1993: The wonder years of sequential Prolog implementation. J. Log. Prog. 19/20, 385-441.
57. VAN ROY, P. 1999. On the separation of concerns in distributed programming: Application to distribution structure and fault tolerance in Mozart. In International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications (PDSIA 99). Tohoku University, Sendai, Japan.
58. VAN ROY, P., BRAND, P., HARIDI, S., AND COLLET, R. 1999. A lightweight reliable object migration protocol. Lecture Notes in Computer Science, vol. 1686. Springer Verlag.
59. VAN ROY, P., HARIDI, S., AND BRAND, P. 1999. Distributed programming in Mozart - A tutorial introduction. Tech. rep. In Mozart documentation, available at http://www.mozart-oz.org.
60. VAN ROY, P., HARIDI, S., BRAND, P., SMOLKA, G., MEHL, M., AND SCHEIDHAUER, R. 1997. Mobile objects in Distributed Oz. ACM Trans. Program. Lang. Syst. 19, 5 (Sept.), 804-851.
61. VEEN, A. H. 1986. Dataflow machine architecture. ACM Comput. Surv. 18, 4 (Dec.), 365-396.
62. WARREN, D. H. D. 1977. Applied logic-its use and implementation as a programming tool. Ph.D. thesis, University of Edinburgh. Reprinted as Technical Note 290, SRI International.
63. WIKSTRÖM, C. 1994. Distributed programming in Erlang. In the 1st International Symposium on Parallel Symbolic Computation (PASCO 94). World Scientific, Singapore, 412-421.