Distributed concurrent linear logic programming

Theoretical Computer Science

Volumn 227, Issue 1-2, 1999, Pages 185-220

  Kobayashi, Naoki ^a   Shimizu, Toshihiro ^a   Yonezawa, Akinori ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Concurrency; Distributed computation; Linear logic; Linear logic programming

Indexed keywords

EID: 0141777851     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00052-3     Document Type: Article

References (26)

1. M. Abadi, A.D. Gordon, A calculus for cryptographic protocols: the spi calculus, in: Proc. 4th ACM Conf. on Computer and Communications Security, 1997, pp. 36-47.
2. M. Abadi, A.D. Gordon, Reasoning about cryptographic protocols in the spi calculus, in: Proc. CONCUR'97, Lecture Notes in Computer Science, vol. 1243, Springer, 1997, pp. 59-73.
3. R.M. Amadio, S. Prasad, Localities and failures (extended summary), in: Proc. 14th FST and TCS Conf., FST-TCS'94, Lecture Notes in Computer Science, vol. 880, Springer, Berlin, 1994, pp. 205-216.
4. J.-M. Andreoli, R. Pareschi, Communication as fair distribution of knowledge, in: Proc. ACM SIGPLAN Conf. on Object-Oriented Programming Systems, Languages, and Applications '91, 1991, pp. 212-229.
5. J.-M. Andreoli, R. Pareschi, Linear objects: logical processes with built-in inheritance, New Generation Computing 9 (1991) 445-473.
6. H.E. Bal, J.G. Steiner, A.S. Tanenbaum, Programming languages for distributed computing systems, ACM Computing Surveys 21(3) (1989) 261-322.
7. L. Cardelli, A Language with distributed scope, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 1995, pp. 286-297.
8. L. Cardelli, A. Gordon, Mobile ambients, in: Proc. 1st Internat. Conf. of Foundations of Software Science and Computation Structures (FoSSaCS), Lecture Notes in Computer Science, vol. 1378, Springer, Berlin, 1988, pp. 140-155.
9. C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, D. Rémy, A calculus of mobile agents, in: Proc. CONCUR'96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 406-421.
10. J. Gosling, B. Joy, G. Steel, The Java Language Specification, Addison-Wesley, Reading, MA, 1996.
11. M. Kanovich, T. Ito, Temporal linear logic specifications for concurrent processes, in: Proc. IEEE Symp. on Logic in Computer Science, 1997, pp. 48-57.
12. N. Kobayashi, Concurrent linear logic programming, Ph.D. Thesis, Department of Information Science, University of Tokyo, April 1996.
13. N. Kobayashi, A partially deadlock-free typed process calculus, ACM Trans. Programming Languages Systems, 20(2) (1988). A preliminary summary appeared in Proc. LICS'97, pp. 128-139.
14. N. Kobayashi, A partially deadlock-free typed process calculus, ACM Trans. Programming Languages Systems, 20(2) (1988). A preliminary summary appeared in Proc. LICS'97, pp. 128-139.
15. N. Kobayashi, B.C. Pierce, D.N. Turner, Linearity and the pi-calculus, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, January 1996, pp. 358-371.
16. N. Kobayashi, A. Yonezawa, ACL - a concurrent linear logic programming paradigm, in: Logic Programming: Proc. Internat. Symp., MIT Press, Cambridge, MA, 1993, pp. 279-294.
17. N. Kobayashi, A. Yonezawa, Asynchronous communication model based on linear logic, Formal Aspects of Computing, Springer 7(2) (1995) 113-149.
18. D. Miller, Abstract syntax and logic programming, in: Logic Programming: Proc. 1st and 2nd Russian Conf. on Logic Programming, Lecture Notes in Artificial Intelligence, vol. 592, Springer, Berlin, 1992, pp. 322-337.
19. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, I, II. Inform. Comput. 100 (1992) 1-77.
20. G. Nadathur, D. Miller, Higher-order horn clauses, J. Assoc. Computing Machinery 37(4) (1990) 777-814.
21. R.D. Nicola, M.C.B. Hennessy, Testing equivalence for processes, Theoret. Comput. Sci. 34 (1984) 83-133.
22. M. Okada, Mobile linear logic as a framework for asynchronous and synchronous mobile communication calculi, Tech. Report, Concordia University, February 1993.
23. J. Riely, M. Hennessy, Distributed processes and location failures, Tech. Report 2/97, Department of Computer Science, University of Sussex, 1997.
24. V. Saraswat, P. Lincoln, Higher-order, linear, concurrent constraint programming, Draft, July 1992.
25. T. Sekiguchi, A. Yonezawa, A calculus with code mobility, in: Proc. 2nd IFIP Internat. Conf. on Formal Methods for Open Object-based Distributed Systems, Chapman & Hall, New York, 1997, pp. 21-36.
26. P. Sewell, P.T. Wojciechowski, B.C. Pierce, Location independence for mobile agents, in: Proc. Workshop on Internet Programming Languages, Loyola University, 1998.