Skip to main content
SpringerLink
Log in

Proof net semantics of proof search computation

  • Types
  • Conference paper
  • First Online:
Algebraic and Logic Programming (ALP 1997, HOA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1298))

Abstract

We present a sound and complete compositional semantics, structured around certain abstractions of proof nets, for proof-search computation in a linear logic-based language. The model captures the interaction of agents in terms of the actions they engage into and of the dynamic creation of names. The model is adequate for reasoning about a notion of operational equivalence. We will also suggest how a partial order semantics can be derived from the present approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J-M. Andreoli. Logic programming with focusing proofs in linear logic. J. of Logic and Computation, 2(3):297–347, 1992.

    Google Scholar 

  2. Andrea Asperti. Causal dependencies in multiplicative linear logic with MIX. Mathematical Structures in Computer Science, 5(3):351–380, September 1995.

    Google Scholar 

  3. G. Bellin.Subnets of proof-nets in multiplicative linear logic with MIX.In Mathematical Structures in Computer Science, to appear, 1996. Available at ftp://ftp.logique.jussieu.fr/pub/distrib/bellin/mix.ps.gz.

    Google Scholar 

  4. G. Bellin and J.. van de Wiele. Empires and kingdoms in MLL. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 249–270. Cambridge University Press, 1995. London Mathematical Society Lecture Note Series 222, Proceedings of the 1993 Workshop on Linear Logic, Cornell Univesity, Ithaca.

    Google Scholar 

  5. Gianluigi Bellin and Philip Scott. On the π-calculus and linear logic. Theoretical Computer Science, 135:11–65, 1994. Also published as LFCS report ECS-LFCS-92232, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK.

    Google Scholar 

  6. L. Caires. A language for the logical specification of processes and relations. In Michael Hanus, editor, Proceedings of the Algebraic and Logic Programming International Conference, 1996.

    Google Scholar 

  7. L. Caires.A language for the logical specification of processes and relations. Technical Report 6.96, Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia, Departamento de Informática, 1996. Available at http://wwwctp.di.fct.unl.pt/~lcaires/writings/lpi6.96.ps.gz.

    Google Scholar 

  8. L. Caires and L. Monteiro. Proof net semantics of Lπ Technical report, Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia,Departamento de Informática, 1997. Available at http://www-ctp.di.fet.unl.pt/~caires/writings/.

    Google Scholar 

  9. G. L. Cattani and V. Sassone. Higher dimensional transition systems. In Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, pages 55–62. IEEE Computer Society Press, 1996.

    Google Scholar 

  10. Vincent Danos and Laurent Regnier. The structure of multiplicatives. Archive for Mathematical Logic, 26, 1989.

    Google Scholar 

  11. Jean-Yves Girard. Proof-nets: The parallel syntax for proof-theory. In P. Agliano and A. Ursini, editors, Logic and Algebra. Marcel Dekker, New York, 1996.

    Google Scholar 

  12. Alessio Guglielmi. Abstract Logic Programming in Linear Logic—Independence and Causality in a First Order Calculus. PhD thesis, Università di Pisa, 1996.

    Google Scholar 

  13. N. Kobayashi and A. Yonezawa. Asynchronous communication model based on linear logic. Formal Aspects of Computing, 7(2):113–149, 1995.

    Google Scholar 

  14. 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.

    Google Scholar 

  15. D. Miller. Forum: A multiple-conclusion specification logic. Theoretical Computer Science, 165(1):201–232, 30 September 1996.

    Google Scholar 

  16. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, Universidade Nova de Lisboa, 2825, Monte da Caparica, Portugal

    Luís Caires & Luís Monteiro

Authors
  1. Luís Caires
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís Monteiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Hanus Jan Heering Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caires, L., Monteiro, L. (1997). Proof net semantics of proof search computation. In: Hanus, M., Heering, J., Meinke, K. (eds) Algebraic and Logic Programming. ALP HOA 1997 1997. Lecture Notes in Computer Science, vol 1298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027011

Download citation

  • DOI: https://doi.org/10.1007/BFb0027011

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63459-1

  • Online ISBN: 978-3-540-69555-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation