Efficient resource management for linear logic proof search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1050, Issue , 1996, Pages 67-81

  Cervesato, Iliano ^a   Hodas, Joshua S ^b   Pfenning, Frank ^a  

^a Carnegie Mellon University   (United States)

^b HARVEY MUDD COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; LINEAR ALGEBRA; LOGIC PROGRAMMING; NATURAL RESOURCES MANAGEMENT; PROBLEM ORIENTED LANGUAGES; PROLOG (PROGRAMMING LANGUAGE); RESOURCE ALLOCATION; SEMANTICS;

HEREDITARY HARROP FORMULAS; LINEAR LOGIC PROGRAMMING LANGUAGES; LINEAR LOGIC PROOF; LOGIC LANGUAGES; NON DETERMINISM; OPERATIONAL SEMANTICS; RESOURCE MANAGEMENT; RESOURCE MANAGEMENT SYSTEMS;

COMPUTER CIRCUITS;

EID: 84955602644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60983-0_5     Document Type: Conference Paper

References (13)

1. Jean-Marc Andreoli and Remo Pareschi. Linear Objects: Logical Processes with Built-in Inheritance. New Generation Computing 9:3-4, 1991.
2. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1-101, 1987.
3. James Harland and David Pym. The uniform proof-theoretic foundation of linear logic programming. In Proceedings of the International Logic Programming Symposium, San Diego, California, October 1991, V. Saraswat and K. Ueda, eds., pp. 304-318.
4. James Harland and Michael Winikoff. Deterministic resource management for the linear logic programming language Lygon. Technical Report TR 94/23, Melbourne University, Department of Computer Science, 1994.
5. Joshua S. Hodas, Logic Programming in Intuitionistic Linear Logic: Theory, Design, and Implementation, Ph.D. Dissertation from University of Pennsylvania, Department of Computer and Information Science, May 1994. Available electronically at http://www.cs.hmc.edu/~hodas/papers/.
6. Joshua S. Hodas and Dale Miller. Logic Programming in a Fragment of Linear Logic. Journal of Information and Computation, 110(2):327-365, 1994.
7. Keehang Kwon. Towards a Verified Abstract Machine for a Logic Programming Language with a Notion of Scope. PhD thesis, Department of Computer Science, Duke University, December 1994. Available as Technical Report CS-1994-36.
8. Timothy G. Lindholm and Richard A. O'Keefe. Efficient Implementation of a Defensible Semantics for Dynamic Prolog Code. Proceedings of the Fourth International Conference on Logic Programming, J.L. Lassez, ed., pp 21-39, MIT Press 1987.
9. Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. In P. Schröder-Heister editor, Proceedings of the International Workshop on Proof-Theoretical Extensions of Logic Programming, pages 253-281, Tübingen, Germany, 1989, Springer-Verlag LNAI 475.
10. Dale Miller. A Multiple-Conclusion Meta-Logic. Proceedings of the 1994 Symposium on Logics in Computer Science, S. Abramsky, ed., pp. 272-281.
11. Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic, 51:125-157, 1991.
12. Gopalan Nadathur, Bharat Jayaraman, and Keehang Kwon. Scoping constructs in logic programming: Implementation problems and their solution. Technical Report CS-1994-35, Department of Computer Science, Duke University, October 1994. To appear in Journal of Logic Programming.
13. Frank Pfenning. Elf: A meta-language for deductive systems. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, pages 811-815, Nancy, France, June 1994. Springer-Verlag LNAI 814. System abstract.