An interactive semantics of logic programming

Theory and Practice of Logic Programming

Volumn 1, Issue 6, 2001, Pages 647-690

  Bruni, Roberto ^a   Montanari, Ugo ^a   Rossi, Francesca ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85008579674     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068401000035     Document Type: Article

References (54)

1. Bernstein, K. (1998) A congruence theorem for structured operational semantics of higher-order languages. Proceedings of LICS'98, 13th Annual IEEE Symposium on Logic In Computer Science, pp. 153–164. IEEE Press.
2. Berry, G. and Boudol, G. (1992) The chemical abstract machine. Theoret. Comput. Sci., 96 (1): 217–248.
3. Best, E., de Boer, S. and Palamidessi, C. (1997) Partial order and SOS semantics for linear constraint programs. Proceedings of Coordination’97, 2nd International Conference on Coordination Languages and Models: Lecture Notes in Computer Science 1282, pp. 256–273. Springer-Verlag.
4. Bloom, B., Istrail, S. and Meyer, A. R. (1995) Bisimulation can't be traced. J. ACM, 42 (1): 232–268.
5. Bossi, A., Gabbrielli, M., Levi, G. and Meo, M. C. (1994a) A compositional semantics for logic programs. Theoret. Comput. Sci., 122(1–2): 3–47.
6. Bossi, A., Gabbrielli, M., Levi, G. and Martelli, M. (1994b) The s-semantics approach: Theory and applications. J. Logic Programming, 19/20: 149–197.
7. Brogi, A., Lamma, E. and Mello, P. (1992) Compositional model-theoretic semantics for logic programs. New Generation Computing, 11 (1): 1–21.
8. Bruni, R. (1999) Tile logic for synchronized rewriting of concurrent systems. PhD thesis, Computer Science Department, University of Pisa.
9. Bruni, R. and Montanari, U. (1999) Cartesian closed double categories, their lambda-notation, and the pi-calculus. Proceedings of LICS'99, 14th Annual IEEE Symposium on Logic In Computer Science, pp. 246–265. IEEE
10. Press. Bruni, R. and Montanari, U. (2000) Zero-safe nets: Comparing the collective and individual token approaches. Inform. & Comput., 156: 46–89.
11. Bruni, R., Meseguer, J. and Montanari, U. (1998) Process and term tile logic. Technical report SRI-CSL-98–06, SRI International. (Also Technical Report TR-98–09, Computer Science Department, University of Pisa.)
12. Bruni, R., Meseguer, J. and Montanari, U. (1999) Executable tile specifications for process calculi. In: Finance, J.-P. (editor), Proceedings of FASE'99, Fundamental Approaches to Software Engineering: Lecture Notes in Computer Science 1577, pp. 60–76. Springer-Verlag.
13. Bruni, R., de Frutos-Escrig, D., Marti-Oliet, N. and Montanari, U. (2000a) Bisimilarity congruences for open terms and term graphs via tile logic. In: Palamidessi, C. (editor), Proceedings of Concur 2000, 11th International Conference on Concurrency Theory: Lecture Notes in Computer Science 1877, pp. 259–274. Springer-Verlag.
14. Bruni, R., Montanari, U. and Sassone, V. (2000b) Open ended systems, dynamic bisimulation and tile logic. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P. D. and Ito, T. (editors), Proceedings of IFIP TCS 2000, IFIP International Conference on Theoretical Computer Science: Lecture Notes in Computer Science 1872, pp. 440–456. Springer-Verlag.
15. Bruni, R., Meseguer, J. and Montanari, U. (2001) Symmetric monoidal and cartesian double categories as a semantic framework for tile logic. Math. Struct, in Comput. Sci. To appear.
16. Burstall, R. M. and Rydeheard, D. E. (1985) A categorical unification algorithm. In: Abramsky, S., Pitt, D., Poigne, A. and Rydeheard, D. (editors), Proceedings of Workshop on Category Theory and Computer Programming: Lecture Notes in Computer Science 240, pp. 493–505. Springer-Verlag.
17. Cattani, G. L., Leifer, J. J. and Milner, R. (2000) Contexts and embeddings for a class of action graphs. Technical report 496, Computer Laboratory, University of Cambridge.
18. Corradini, A. and Montanari, U. (1992) An algebraic semantics for structured transition systems and its application to logic programs. Theoret. Comput. Sci., 103: 51–106.
19. De Nicola, R. and Hennessy, M. (1984) Testing equivalences for processes. Theoret. Comput. Sci., 34: 83–133.
20. De Simone, R. (1985) Higher level synchronizing devices in MEIJE-SCCS. Theoret. Comput. Sci., 37: 245–267.
21. Ehresmann, E. (1963a) Categories structurèes: I—II. Annales école normal superieur, 80: 349–426.
22. Ehresmann, E. (1963b) Categories structurèes: III. Cahiers de topologie ed geometrie différentielle, 5.
23. Emden van, M. H. and Kowalski, R. A. (1976) The semantics of predicate logic as a programming language. J. ACM, 23 (4): 733–742.
24. Falaschi, M., Levi, G. and Palamidessi, C. (1984) A synchronization logic: Axiomatics and formal semantics of generalized horn clauses. Inform. & Control, 60(1–3): 36–69.
25. Falaschi, M., Levi, G., Martelli, M. and Palamidessi, C. (1989) Declarative modeling of the operational behavior of logic languages. Theoret. Comput. Sci., 69 (3): 289–318.
26. Ferrari, G. L. and Montanari, U. (2000) Tile formats for located and mobile systems. Inform. & Comput., 156 : 173–235.
27. Friihwirth, T. W. (1995) Constraint handling rules. In: Podelski, A. (editor), Constraint Programming: Basics and Trends: Lecture Notes in Computer Science 910, pp. 90–107. Springer-Verlag.
28. Gadducci, F. and Montanari, U. (1996) Rewriting rules and CCS. Proceedings of WRLA'96,1st Workshop on Rewriting Logic and its Applications: Electronic Notes in Theoretical Computer Science 4. Elsevier.
29. Gadducci, F. and Montanari, U. (2000) The tile model. In: Plotkin, G., Stirling, C. and Tofte, M. (editors), Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press. (Also Technical Report TR-27/96, Dipartimento di Informatica, Università di Pisa, 1996.)
30. Gaifman, H. and Shapiro, E. (1989) Fully abstract compositional semantics for logic programs. Proceedings of POPL'89, pp. 134–142. ACM.
31. Goguen, J. (1989) What is unification? a categorical view of substitution, equation and solution. In: Nivat, M. and Ait-Kaci, H. (editors), Resolution of Equations in Algebraic Structures, pp. 217–261. Academic Press.
32. Groote, J. F. and Vaandrager, F. (1992) Structured operational semantics and bisimulation as a congruence. Inform. & Comput., 100 : 202–260.
33. Jaffar, J. and Maher, M. J. (1994) Constraint logic programming: A survey. J. Logic Programming, 19/20: 503–581.
34. Larsen, K. G. and Xinxin, L. (1990) Compositionality through an operational semantics of contexts. In: Paterson, M. S. (editor), Proceedings of ICALP'90, 17th International Colloquium on Automata, Languages and Programming: Lecture Notes in Computer Science 443, pp. 526–539. Springer Verlag.
35. Lawvere, F. W. (1963) Functorial semantics of algebraic theories. Proc. National Academy of Science, 50 : 869–872.
36. Leifer, J. J. and Milner, R. (2000) Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (editor), Proceedings of Concur 2000, 11th International Conference on Concurrency Theory: Lecture Notes in Computer Science 1877, pp. 243–258. Springer-Verlag.
37. Lloyd, J. W. (1987) Foundations of Logic Programming. Springer-Verlag.
38. MacLane, S. (1971) Categories for the Working Mathematician. Springer-Verlag.
39. Mancarella, P. and Pedreschi, D. (1987) An algebra of logic programs. In: Kowalski, R. A. and Bowen, K. (editors), Proceedings of ICLP'88, 5th International Conference on Logic Programming, pp. 1006–1023. MIT Press.
40. Marriott, K. and Stuckey, P.J. (1998) Programming with Constraints: An introduction. MIT Press.
41. Meseguer, J. (1992) Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci., 96 : 73–155.
42. Meseguer, J. and Montanari, U. (1998) Mapping tile logic into rewriting logic. In: Parisi-Presicce, F. (editor), Proceedings of WADT'97, 12th Workshop on Recent Trends in Algebraic Development Techniques: Lectecture Notes in Computer Science 1376, pp. 62–91. Springer-Verlag.
43. Miller, D. (1995) Lambda prolog: An introduction to the language and its logic. (Available at http://www.cse.psu.edu/~dale/lProlog/docs.html.)
44. Miller, D. and Nadathur, G. (1998) Higher-order logic programming. In: Gabbay, D. M., Hogger, C. J. and Robinson, J. A. (editors), Handbook of Logics for Artificial Intelligence and Logic Programming, 5 : 499–590 Clarendon Press.
45. Milner, R. (1980) A Calculus of Communicating Systems: Lecture Notes in Computer Science 92. Springer-Verlag.
46. Milner, R. (1992) The polyadic pi-calculus (abstract). In: Cleaveland, R. (editor), Proceedings of Concur '92, 3rd International Conference on Concurrency Theory: Lecture Notes in Computer Science 630, pp. 499–590. Springer-Verlag.
47. Milner, R. (1996) Calculi for interaction. Acta Inform., 33 (8): 707–737.
48. Montanari, U. and Sassone, V. (1992) Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae, 16 : 171–196.
49. Montanari, U. and Talcott, C. (1998) Can actors and 7t-agents live together? Proceedings of HOOTS'98, 2nd Workshop on Higher Order Operational Techniques in Semantics. Electronic Notes in Theoretical Computer Science 10. Elsevier.
50. Park, D. (1981) Concurrency and automata on infinite sequences. Proceedings of gth G-I Conference: Lectecture Notes in Computer Science 104, pp. 167–183. Springer-Verlag.
51. Plotkin, G. (1981) A structural approach to operational semantics. Technical reptort DAIMI FN-19, Aarhus University, Computer Science Department.
52. Rensink, A. (2000) Bisimilarity of open terms. Inform. & Comput., 156 : 345–385.
53. Saraswat, V. A. (1989) Concurrent constraint logic programming. PhD thesis, Carnegie-Mellon University.
54. Sewell, P. (1998) From rewrite rules to bisimulation congruences. In: Sangiorgi, D. and de Simone, R. (edirors), Proceedings of Concur'98: Lecture Notes in Computer Science 1466, pp. 269–284. Springer-Verlag.