Monadic concurrent linear logic programming

PPDP'05 - Proceedings of the Seventh ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 2005, Issue , 2005, Pages 35-46

  Löpez, Pablo ^a   Pfenning, Frank ^b   Polakow, Jeff ^c   Watkins, Kevin ^b  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

Committed choice concurrent logic programming; Linear logic; Operational semantics

Indexed keywords

ALGORITHMS; ASYNCHRONOUS SEQUENTIAL LOGIC; COMPUTER PROGRAMMING LANGUAGES; CONCURRENCY CONTROL; LOGIC PROGRAMMING; SEMANTICS;

COMMITTED CHOICE CONCURRENT LOGIC PROGRAMMING; CONCURRENT LOGICAL FRAMEWORK (CLF); LINEAR LOGIC; OPERATIONAL SEMANTICS;

LINEAR PROGRAMMING;

EID: 33744908423     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1069774.1069778     Document Type: Conference Paper

References (32)

1. J.-M. Andreoli. Logic programming with focusing proofs in linear logic, Journal of Logic and Computation, 2(3):297-347, 1992.
2. J.-M. Andreoli and R. Pareschi. LO and behold! Concurrent structured processes. In OOPSLA/ECOOP '90: Proceedings on object-oriented programming systems, languages, and applications, pages 44-56, Ottawa, Canada, 1990. ACM Press.
3. Y. Bekkers and P. Tarau. Monadic constructs for logic programming. In J.Lloyd, editor, Proceedings of the International Symposium on Logic Programming (ILPS'95), pages 51-65, Portland, Oregon, Dec. 1995. MIT Press.
4. M. Bozzano, G. Delzanno, and M. Martelli. Model checking linear logic specifications. Theory and Practice of Logic Programming, 4(5-6):573-619, 2004.
5. I. Cervesato, F. Pfenning, D. Walker, and K. Watkins. A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, 2002. Revised May 2003.
6. M. Fairtlough and M. Mendler. Propositional lax logic. Information and Computation, 137(1):1-33, Aug. 1997.
7. T. Frühwirth. Theory and practice of constraint handling rules, Journal of Logic Programming, 37(1-3):95-138, Oct. 1998. Special Issue on Constraint Logic Programming.
8. H. Ganzinger and D. A. McAllester. A new nieta-complexity theorem for bottom-up logic programs. In T. K.Coré, A.Leitsch, editor, Proceedings of the first International joint Conference on ArAutomated Reasoning (IJCAR'01), pages 514-528, Siena Italy, June 2001. Springer-Verlag LNCS 2083.
9. H. Ganzinger and D. A. McAllester. Logical algorithms. In PStuckey, editor, Proceedings of the 18th International Conference on Logic Programming, pages 209-223, Copenhagen, Denmark, July 2002. Springer-Verlag LNCS 2401.
10. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
11. R. H. Halstead. Multilisp: A language for parallel symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501-539, Oct. 1985.
12. J. Harland, D. Pym, and M. Winikoff. Forward and backward chaining in linear logic. In D. Galmiche, editor, Proceedings of the Workshop on Type-Theoretic Languages: Proof Search and Semantics, volume 37 of Electronic Notes in Theoretical Computer Science, Pittsburgh, Pennsylvania, June 2000. Elsevier Science.
13. J. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2):327-365, 1994.
14. N. Kobayashi and A. Yonezawa. Typed higher-order concurrent linear logic programming. Technical Report 94-12, Department of Information Science, University of Tokyo, July 1994.
15. P. López and J. Polakow. Implementing efficient resource management for linear logic programming. In F. Baader and A. Voronkov, editors, Eleventh International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR'04), pages 528-543, Montevideo, Uruguay, Mar. 2005. Springer-Verlag LNAI 3452.
16. D. A. McAllester. On the complexity analysis of static analyses, Journal of the ACM, 49(4):512-537, 2002.
17. R. McGrail. Monads and Control in Logic Programming. PhD thesis, Wesleyan University, 1997.
18. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification, Journal of Logic and Computation, 1(4):497-536, 1991.
19. D. Miller. Forum: A multiple-conclusion specification logic. Theoretical Computer Science, 165(1):201-232, 1996.
20. D. Miller and G. Nadathur. Higher-order logic programming. In E. Shapiro, editor, Proceedings of the Third International Logic Programming Conference., pages 448-462, London, June 1986.
21. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157, 1991.
22. R. Milner. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, 1999.
23. E. Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
24. F. Pfenning. Substructural operational semantics and linear destination-passing style. In W.-N. Chin, editor, Proceedings of the 2nd Asian Symposium on Programming Languages and Systems (APLAS'04), page 196, Taipei, Taiwan, Nov. 2004. Springer-Verlag LNCS 3302.
25. F. Pfenning and R. Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-540, 2001.
26. D. Pym and J. Harland. A uniform proof-theoretic investigation of linear logic programming, Journal of Logic and Computation, 4(2):175-207, April 1994.
27. I. Ramakrishnan, R. Sekar, and A. Voronkov. Term indexing. In Handbook of Automated Reasoning, vol. 2, pages 1853-1965. Elsevier Science and MIT Press, 2001.
28. E. Y. Shapiro. The family of concurrent logic programming languages. ACM Computing Surveys, 21(3):413-510, Sept. 1989.
29. P. Wadler. The essence of functional programming. In Conference Record of the 19th Symposium on Principles of Programming Languages, pages 1-14, Albuquerque, Jan. 1992. ACM Press.
30. K. Watkins, I. Cervesato, F. Pfenning, and D. Walker. A concurrent logical framework I: Judgments and properties. Technical Report CMU-CS-02-101, Department of Computer Science, Carnegie Mellon University, 2002. Revised May 2003.
31. K. Watkins, I. Cervesato, F. Pfenning, and D. Walker. A concurrent logical framework: The propositional fragment. In S. Berardi, M. Coppo, and F. Damiani, editors, Types for Proofs and Programs, pages 355-377. Springer-Verlag LNCS 3085,2004.
32. Revised selected papers from the Third International Workshop on Types for Proofs and Programs, Torino, Italy, April 2003.