Skip to main content
SpringerLink
Log in

A Logical Calculus for Modelling Interferences

  • Conference paper
Theoretical Aspects of Computing – ICTAC 2007 (ICTAC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4711))

Included in the following conference series:

  • 394 Accesses

Abstract

A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal with multisequent structures and has the cut-elimination property. Extensions are proposed that give first results concerning our objectives.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Girard, J.Y.: Linear logic. Theoretical Computer Science 50, 1–102 (1987)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Laurent, O.: Syntax vs. semantics: a polarized approach. Theoretical Computer Science 343(1-2), 177–206 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Girard, J.Y.: Locus solum. Mathematical Structures in Computer Science 11, 301–506 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Curien, P.L., Faggian, C.: L-nets, strategies and proof-nets. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 167–183. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Giamberardino, P.D., Faggian, C.: Jump from parallel to sequential proofs: Multiplicatives. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 319–333. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Cervesato, I., Hodas, J.S., Pfenning, F.: Efficient resource management for linear logic proof search. In: Herre, H., Dyckhoff, R., Schroeder-Heister, P. (eds.) ELP 1996. LNCS, vol. 1050, pp. 67–81. Springer, Heidelberg (1996)

    Google Scholar 

  8. O’Hearn, P.W., Pym, D.J.: The logic of bunched implications. Bulletin of Symbolic Logic 5(2), 215–244 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Guglielmi, A.: A system of interaction and structure. ACM Transactions on Computational Logic 8(1) (2007)

    Google Scholar 

  10. Fouqueré, C.: A Sequent Calculus for Modelling Interferences. Technical report, LIPN, Université Paris 13 (2007), http://hal.archives-ouvertes.fr/hal-00156386/en/

  11. Lafont, Y.: Soft linear logic and polynomial time. Theoretical Computer Science 318(1-2), 163–180 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIPN – UMR7030, CNRS – Université Paris 13, 99 av. J-B Clément, F–93430 Villetaneuse, France

    Christophe Fouqueré

Authors
  1. Christophe Fouqueré
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Cliff B. Jones Zhiming Liu Jim Woodcock

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fouqueré, C. (2007). A Logical Calculus for Modelling Interferences. In: Jones, C.B., Liu, Z., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2007. ICTAC 2007. Lecture Notes in Computer Science, vol 4711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75292-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75292-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75290-5

  • Online ISBN: 978-3-540-75292-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation