Abstract
Due to its ability to handle resources in a finely controlled way, linear logic is being adopted as a foundation of several logic programming and specification languages in which some notions of state can be modelled. In particular, some of these were proposed with the main motivation of allowing the specification of concurrent systems: such systems incorporate small subsets of linear logic or have operational interpretations that exclude the “don't know” search behaviour expected from a logic programming language. On the other hand, systems incorporating larger subsets of linear logic must pay their expressiveness with a greater operational complexity. In this paper we present {ie150-01}, a simple language combining in a uniform way the reduction and state-oriented style of specification expected from a concurrent process calculus, with the more declarative and relational style of specification usual in logic programming. We will also show that {ie150-02} is an expressive language both as a logic programming and as a process specification language.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.-M. Andreoli. Logic programming with focusing proofs in linear logic. J. of Logic and Computation, 2(3):297–347, 1992.
J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9, 1991.
Luís Caires. A language for the logical specification of processes and relations. In Draft. Available at http://www-ctp.di.fct.unl.pt/~lcaires/papers/lc.dvi.gz, 1996.
Iliano Cervesato, J. Hodas, and F. Pfenning. Efficient resource management for linear logic proof search. In R. Dyckhoff and Peter Schroeder-Heister, editors, Proc. Fifth Intl. Workshop on Extensions of Logic Programming, pages 67–81, 1996.
Iliano Cervesato and Frank Pfenning. A linear logical framework. In Proc. Eleventh IEEE Symp. Logic in Computer Science, 1996.
J. Harland and M. Winikoff. Implementation and development issues for the linear logic programming language Lygon. In Proc. of the Eighteenth Australian Computer Science Conference, 1995.
J. S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. J. Information and Computation, 110(2):327–365, 1994.
J.Y. Girard, Linear logic. Theoretical Computer Science, 50:1–102, 1987.
N. Kobayashi and A. Yonezawa. Asynchronous communication model based on linear logic. Formal Aspects of Computing, 7(2):113–149, 1995.
P. Lincoln and V. Saraswat. Higher-order, linear, concurrent constraint programming. Unpublished manuscript, 1993.
D. Miller. A multiple-conclusion specification logic. Theoretical Computer Science, (To appear, draft of January 3, 1996. Available from ftp.cis.upenn.edu).
D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation, 1(4):497–536, 1991.
D. Miller. The π-calculus as a theory in linear logic: preliminary results. In E. Lamma and P. Mello, editors, Proc. of the Workshop on Extensions of Logic Programming, pages 242–264, 1992.
D. Miller. A survey of linear logic programming. Computational Logic, 2(2), 1995.
D. Miller and G. Nadathur. Higher-order logic programming. In Proc. of the Third International Conference on Logic Programming, pages 448–462, 1986.
D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proof as a foundation for logic programming. Annals of Pure and Applied Logic, (51):125–157, 1991.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Milner. Functions as processes. J. Computer and System Sciences, 17(3), 1992.
R. Milner. The polyadic π-calculus: A tutorial. Mathematical Structures in Computer Science, 2(2):119–142, 1992.
U. Montanari and Pistore. Concurrent semantics for the π-calculus. Electronic Notes on Theoretical Computer Science, 1, 1995.
L. Monteiro. Distributed logic: a logical system for specifying concurrency. In TR CIUNL-5.81, Departamento de Informática, Universidade Nova de Lisboa, 1891, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caires, L. (1996). A language for the logical specification of processes and relations. In: Hanus, M., Rodríguez-Artalejo, M. (eds) Algebraic and Logic Programming. ALP 1996. Lecture Notes in Computer Science, vol 1139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61735-3_10
Download citation
DOI: https://doi.org/10.1007/3-540-61735-3_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61735-8
Online ISBN: 978-3-540-70672-4
eBook Packages: Springer Book Archive