Abstract
We propose a typed, higher-order, concurrent linear logic programming called higher-order ACL, which uniformly integrates a variety of mechanisms for concurrent computation based on asynchronous message passing. Higher-order ACL is based on a proof search paradigm according to the principle, proofs as computations, formulas as processes in linear logic. In higher-order ACL, processes as well as functions, and other values can be communicated via messages, which provides high modularity of concurrent programs. Higher-order ACL can be viewed as an asynchronous counterpart of Milner's higher-order, polyadic π-calculus. Moreover, higher-order ACL is equipped with an elegant ML-style type system that ensures (1) well typed programs can never cause type mismatch errors, and (2) there is a type inference algorithm which computes a most general typing for an untyped term. We also demonstrate a power of higher-order ACL by showing several examples of “higher-order concurrent programming.”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Andreoli, J.-M., and R. Pareschi, “Linear Objects: Logical processes with built-in inheritance,” New Generation Computing, vol. 9, pp. 445–473, 1991.
Andreoli, J.-M., and R. Pareschi, “Communication as Fair Distribution of Knowledge,” in Proceedings of OOPSLA '91, pp. 212–229, 1991.
Andreoli, J.-M., R. Pareschi, and T. Castagnetti, “Abstract Interpretation of Linear Logic Programming,” in Proceedings of International Logic Programming Symposium, pp. 315–334, 1993.
Damas, L., and R. Milner, “Principal type-schemes for functional programs,” in Proceedings of ACM SIGACT/SIGPLAN Symposium on Principles of Programming Language, pp. 207–212, 1982.
Gay, S. J., “A Sort Inference Algorithm for the Polyadic π-calculus,” in Proceedings of ACM SIGACT/SIGPLAN Symposium on Principles of Programming Language, pp. 429–438, 1993.
Girard, J.-Y., “Linear Logic,” Theoretical Computer Science, vol. 50, pp. 1–102, 1987.
Gunter, C. A., and J. C. M. (ed.), Theoretical Aspects of Object-Oriented Programming. The MIT Press, 1994.
Hodas, J., and D. Miller, “Logic programming in a fragment of intuitionistic linear logic,” in Proceedings of Sixth Annual Symposium on Logic in Computer Science, pp. 32–42, 1991.
Honda, K., “Types for Dydadic Interaction,” in Proceedings of CONCUR'93, 1993.
Kobayashi, N., “Static Analysis on Communication for Asynchrnous Concurrent Programming Languages.” draft, 1994.
Kobayashi, N., and A. Yonezawa, “Asynchronous Communication Model Based on Linear Logic.” to appear in Journal of Formal Aspects of Computing, Springer-Verlag.
Kobayashi, N., and A. Yonezawa, “Towards Foundations for Concurrent Object-Oriented Programming — Types and Language Design.” submitted.
Kobayashi, N., and A. Yonezawa, “ACL — A Concurrent Linear Logic Programming Paradigm,” in Logic Programming: Proceedings of the 1993 International Symposium, pp. 279–294, MIT Press, 1993.
Kobayashi, N., and A. Yonezawa, “Type-Theoretic Foundations for Concurrent Object-Oriented Programming,” in Proceedings of ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA'94), pp. 31–45, 1994.
Milner, R., “The polyadic π-calculus: a tutorial,” Tech. Rep. ECS-LFCS-91-180, University of Edinburgh, 1991.
Nadathur, G., and F. Pfenning, “The Type System of a Higher-Order Logic Programming Language,” in Types in Logic Programming, pp. 245–283, The MIT Press, 1992.
Nielson, H. R., and F. Nielson, “Higher-Order Concurrent Programs with Finite Communicationn Topology,” in Proceedings of ACM SIGACT/SIGPLAN Symposium on Principles of Programming Language, pp. 84–97, 1994.
Ohori, A., “A Compilation Method for ML-Style Polymorphic Record Calculi,” in Proceedings of ACM SIGACT/SIGPLAN Symposium on Principles of Programming Language, pp. 154–165, 1992.
Pierce, B., and D. Sangiorgi, “Typing and Subtyping for Mobile Processes,” in Proceedings of IEEE Symposium on Logic in Computer Science, pp. 376–385, 1993.
Reppy, J. H., “CML: A Higher-order Concurrent Language,” in Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pp. 293–305, 1991.
Saraswat, V., and P. Lincoln, “Higher-order, linear, concurrent constraint programming,” July 1992. draft.
Shapiro, E., “The Family of Concurrent Logic Programming Languages,” ACM Computing Surveys, vol. 21, no. 3, pp. 413–510, September 1989.
Troelstra, A. S., “Tutorial on Linear Logic,” 1992. Tutorial notes in JICSLP'92.
Vasconcelos, V. T., and K. Honda, “Principal typing schemes in a polyadic π-calculus,” in Proceedings of CONCUR'93, Lecture Notes in Computer Science, pp. 524–538, Springer Verlag, 1993.
Vasconcelos, V. T., and M. Tokoro, “A Typing System for a Calculus of Objects,” in Proceedings of the International Symposium on Object Technologies for Advanced Software, vol. 742 of Lecture Notes in Computer Science, pp. 460–474, Springer Verlag, 1993.
Yonezawa, A., ABCL: An Object-Oriented Concurrent System. MIT Press, 1990.
Yonezawa, A., and M. Tokoro, Object-Oriented Concurrent Programming. The MIT Press, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kobayashi, N., Yonezawa, A. (1995). Higher-order concurrent linear logic programming. In: Ito, T., Yonezawa, A. (eds) Theory and Practice of Parallel Programming. TPPP 1994. Lecture Notes in Computer Science, vol 907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026568
Download citation
DOI: https://doi.org/10.1007/BFb0026568
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59172-6
Online ISBN: 978-3-540-49218-4
eBook Packages: Springer Book Archive