Towards a concurrent semantics based analysis of CC and CLP

F. Bueno, M. García Banda, and M. Hermenegildo. Compile-time Optimizations and Analysis Requirements for CC Programs. Technical Report CLIP6/93.0, T.U. of Madrid (UPM), July 1993.Google Scholar

F. Bueno, M. García Banda, M. Hermenegildo, U. Montanari, and F. Rossi. From Eventual to Atomic and Locally Atomic CC Programs: A Concurrent Semantics. In Fourth International Conference on Algebraic and Logic Programming, Springer-Verlag LNCS, September, 1994. To appear.Google Scholar

F. Bueno and M. Hermenegildo. An Automatic Translation Scheme from Prolog to the Andorra Kernel Language. In International Conference on Fifth Generation Computer Systems, pages 759–769. Institute for New Generation Computer Technology (ICOT), June 1992.Google Scholar

A. Colmerauer. An Introduction to Prolog III. CACM, 28(4):412–418, 1990.Google Scholar

J. S. Conery. The And/Or Process Model for Parallel Interpretation of Logic Programs. PhD thesis, The University of California At Irvine, 1983. Technical Report 204.Google Scholar

S.K. Debray. QD-Janus: A Sequential Implementation of Janus in Prolog. Technical Report, University of Arizona, 1993.Google Scholar

M. García de la Banda, M. Hermenegildo, and K. Marriott. Independence in Constraint Logic Programs. In International Logic Programming Symposium. MIT Press, Boston, MA, October 1993.Google Scholar

D. DeGroot. Restricted AND-Parallelism. In International Conference on Fifth Generation Computer Systems, pages 471–478. Tokyo, November 1984.Google Scholar

M. Hermenegildo. Towards CI AO-Prolog — A Parallel Concurrent Constraint System. In Workshop on the Principles and Practice of Constraint Programming, LNCS, Springer-Verlag, 1994.Google Scholar

M. Hermenegildo and F. Rossi. Strict and Non-Strict Independent And-Parallelism in Logic Programs: Correctness, Efficiency, and Compile-Time Conditions. Journal of Logic Programming, 1993. To appear.Google Scholar

J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In ACM Symp. Principles of Programming Languages, pages 111–119. ACM, 1987.Google Scholar

S. Janson and S. Haridi. Programming Paradigms of the Andorra Kernel Language. In International Logic Programming Symposium, pages 167–183. MIT Press, 1991.Google Scholar

Andy King and Paul Soper. Schedule Analysis of Concurrent Logic Programs. In Joint International Conference and Symposium on Logic Programming, pages 478–492, Washington, USA, 1992. The MIT Press.Google Scholar

K. Marriott and P. Stuckey. The 3 R's of Optimizing Constraint Logic Programs: Refinement, Removal, and Reordering. In 19th. Annual ACM Conf. on Principles of Programming Languages. ACM, 1992.Google Scholar

U. Montanari and F. Rossi. True-concurrency in Concurrent Constraint Programming. In International Symposium on Logic Programming, pages 694–716, San Diego, USA, 1991. The MIT Press.Google Scholar

U. Montanari and F. Rossi. Contextual Occurence Nets and Concurrent. Constraint Programming. Technical report, U. of Pisa, Computer Science Department, Corso Italia 40, 56100 Pisa, Italy, May 1993.Google Scholar

L. Naish. Parallelizing NU-Prolog. In International Conference and Symposium on Logic Programming, pages 1546–1564, August, 1988. The MIT Press.Google Scholar

Francesca Rossi. Constraints and Concurrency. PhD thesis, Universita di Pisa, April 1993.Google Scholar

V. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie Mellon, Pittsburgh, 1989. School of Computer Science.Google Scholar

E.Y. Shapiro, editor. Concurrent Prolog: Collected Papers. MIT Press, Cambridge MA, 1987.Google Scholar

P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.Google Scholar