Abstract
This paper introduces a new formulation of the computational paradigm based on proof-construction in terms of proof-nets. It shows the relevance of this paradigm, thus formulated, to capture some of the fundamental mechanisms of distributed computation (and in particular, transaction mechanisms), which are familiar concepts of middleware infrastructures. It therefore constitutes a first step in the direction of the definition of a steady conceptual framework in which to formalise and study various middleware notions, which, until now, have essentially been studied through ad-hoc and diverse formalisms.
Due to space constraints, the proofs of the technical results of this paper have been skipped. They were reviewed with the initially submitted version of the paper and are available from the author.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic 51 (1991) 125–157
Miller, D.: Forum: A multiple-conclusion specification logic. Theoretical Computer Science 165 (1996) 201–232
Andreoli, J.M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2 (1992)
Girard, J.Y.: Linear logic. Theoretical Computer Science 50 (1987) 1–102
Miller, D.: An overview of linear logic programming (2002) To appear in a book on linear logic, edited by Thomas Ehrhard, Jean-Yves Girard, Paul Ruet, and Phil Scott. Cambridge University Press.
Andreoli, J.M., Pagani, D., Pacull, F., Pareschi, R.: Multiparty negotiation for dynamic distributed object services. Science of Computer Programming 31 (1998) 179–203
Danos, V., Regnier, L.: The structure of multiplicatives. Archive for Mathematical Logic 28 (1989) 181–203
Andreoli, J.M.: Focussing and proof construction. Annals of Pure and Applied Logic 107 (2001) 131–163
Harland, J., Pym, D.: Resource-distribution via boolean constraints. ACM Transactions on Computational Logic (2002) to appear.
Hodas, J., Miller, D.: Logic programming in a fragment of intuitionistic linear logic. Information and Computation 110 (1994) 327–365
Girard, J.Y.: Proof-nets: the parallel syntax for proof-theory. In Ursini, A., Agliano, P., eds.: Logic and Algebra. Marcel Dekker (1996)
Laurent, O.: Polarized proof-nets: Proof-nets for lc. In: Proc. of Typed Lambda Calculi and Applications’ 99, L’Aquila, Italy (1999)
Galmiche, D., Notin, J.M.: Proof-search and proof nets in mixed linear logic. Electronic Notes in Theoretical Computer Science 37 (2000)
Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann (1993)
Jajodia, S., Kerschberg, L., eds.: Advanced Transaction Models and Architectures. Kluwer Academic (1997)
Andreoli, J.M., Arregui, D., Pacull, F., Riviere, M., Vion-Dury, J.Y., Willamowski, J.: Clf/mekano: a framework for building virtual-enterprise applications. In: Proc. of Enterprise Distributed Object Computing Conference, Manheim, Germany, IEEE Computer Society Press (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andreoli, J.M. (2002). Focussing Proof-Net Construction as a Middleware Paradigm. In: Voronkov, A. (eds) Automated Deduction—CADE-18. CADE 2002. Lecture Notes in Computer Science(), vol 2392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45620-1_39
Download citation
DOI: https://doi.org/10.1007/3-540-45620-1_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43931-8
Online ISBN: 978-3-540-45620-9
eBook Packages: Springer Book Archive