Abstract
The Tag-Frame system of resource management [1] reunited two divergent threads of linear logic programming research by achieving the efficient proof search behaviour of abstract systems, such as [2], while using a low-level tag-based approach, as in [3], suitable for specifying an abstract machine. However, Tag-Frame relies on set operations which are linear in the size of the sets, and is not as efficient, in general, as it could be. We present a new tag-based derivation system which relies solely on low-level concepts to implement efficient resource management, where most linear time operations have been replaced by constant time ones. Though motivated and informed by the Tag-Frame system, we derive our system directly from, and prove its correctness with respect to the system of Cervesato et al. [2]. An abstract machine based on the new system has been implemented by Tamura and Banbara, and its performance compared to their previous machine.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hodas, J., López, P., Polakow, J., Stoilova, L., Pimentel, E.: A tag-frame system of resource management for proof search in linear-logic programming. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 167–182. Springer, Heidelberg (2002)
Cervesato, I., Hodas, J.S., Pfenning, F.: Efficient resource management for linear logic proof search. Theoretical Computer Science 232, 133–163 (2000)
Hodas, J.S., Watkins, K., Tamura, N., Kang, K.S.: Efficient implementation of a linear logic programming language. In: JICSLP 1998, pp. 145–149. IEEE Computer Society Press, Los Alamitos (1998)
Andreoli, J.M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2, 297–347 (1992)
Pym, D., Harland, J.: A uniform proof-theoretic investigation of linear logic programming. Journal of Logic and Computation 4, 175–207 (1994)
Hodas, J.S., Miller, D.: Logic programming in a fragment of intuitionistic linear logic. Information and Computation 110, 327–365 (1994)
Girard, J.Y.: Linear logic. Theoretical Computer Science 50, 1–102 (1987)
Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic 51, 125–157 (1991)
Hodas, J.S.: Logic Programming in Intuitionistic Linear Logic: Theory, Design and Implementation. PhD thesis, University of Pennsylvania, Department of Computer and Information Science (1994)
Miller, D., Nadathur, G.: Higher-order logic programming. In: Shapiro, E. (ed.) Proceedings of the Third International Logic Programming Conference, London, pp. 448–462 (1986)
López, P., Pimentel, E.: Resource management in linear logic proof search revisited. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS (LNAI), vol. 1705, pp. 304–319. Springer, Heidelberg (1999)
Banbara, M., Tamura, N.: Compiling resources in a linear logic programming language. In: Sagonas, K. (ed.) JICSLP 1998 Post Conference Workshop on Implementation Technologies for Programming Languages based on Logic, pp. 32–45 (1998)
Tamura, N., Kaneda, Y.: Extension of wam for a linear-logic programming language. In: Ida, T., Ohori, A., Takeichi, M. (eds.) Second Fuji InternationalWorkshop on Functional and Logic Programming, pp. 33–50. World Scientific, Singapore (1996)
Hodas, J.S., Tamura, N.: lolliCOP - a linear logic encoding of a lean connectionmethod theorem prover for first-order classical logic. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 670–684. Springer, Heidelberg (2001)
Polakow, J.: Linearity constraints as bounded intervals in linear logic programming. In: Proceedings of LRPP 2004, Turku, Finland (2004)
Cervesato, I.: Proof-theoretic foundation of compilation in logic programming languages. In: Jaffar, J. (ed.) JICSLP 1998, Manchester, UK, pp. 115–129. MIT Press, Cambridge (1998)
Tamura, N., Banbara, M.: Llp-tf: an abstract machine for lolli based on tag-framefast (2004), http://bach.istc.kobe-u.ac.jp/llp/tf.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López, P., Polakow, J. (2005). Implementing Efficient Resource Management for Linear Logic Programming. In: Baader, F., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32275-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-32275-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25236-8
Online ISBN: 978-3-540-32275-7
eBook Packages: Computer ScienceComputer Science (R0)