Skip to main content

On the Meaning of Focalization

  • Chapter
Ludics, Dialogue and Interaction

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6505))

  • 441 Accesses

Abstract

In this paper, we use Girard’s ludics to analyze focalization, a fundamental property of the proof theory of linear logic. In particular, we show how focalization can be realized interactively thanks to suitable section-retraction pairs between semantical types.

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

Access this chapter

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. Andreoli, J.-M.: Logic Programming with Focusing Proofs in Linear Logic. Journal of Logic and Computation 2(3), 297–347 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Basaldella, M., Faggian, C.: Ludics with Repetitions (Exponentials, Interactive Types and Completeness). In: LICS (2009)

    Google Scholar 

  3. Basaldella, M., Terui, K.: On the meaning of logical completeness. In: Curien, P.-L. (ed.) TLCA 2009. LNCS, vol. 5608, pp. 50–64. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Curien, P.-L.: Introduction to LL and ludics, I & II. In: Advances in Mathematics, China, vol. 34(5), pp. 513–544 (2005); vol. 35(1), pp. 1–44 (2006)

    Google Scholar 

  5. Faggian, C., Piccolo, M.: Ludics is a model for the finitary linear pi-calculus. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol. 4583, pp. 148–162. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Girard, J.-Y.: On the meaning of logical rules I: syntax vs. semantics. In: Berger, U., Schwichtenberg, H. (eds.) Computational Logic, pp. 215–272. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Girard, J.-Y.: On the meaning of logical rules II: multiplicatives and additives. In: Berger, Schwichtenberg (eds.) Foundation of Secure Computation, pp. 183–212 (2000)

    Google Scholar 

  8. Girard, J.-Y.: Locus solum: From the rules of logic to the logic of rules. Mathematical Structures in Computer Science 11, 301–506 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Laurent, O.: Étude de la polarization en logique. PhD thesis, Univ. Aix-Marseille II (2002)

    Google Scholar 

  10. Laurent, O.: A proof of the focalization property of Linear Logic (2004) (unpublished note)

    Google Scholar 

  11. Miller, D., Saurin, A.: From proofs to focused proofs: A modular proof of focalization in linear logic. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 405–419. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Terui, K.: Computational ludics. To appear in Theoretical Computer Science (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Basaldella, M., Saurin, A., Terui, K. (2011). On the Meaning of Focalization. In: Lecomte, A., Tronçon, S. (eds) Ludics, Dialogue and Interaction. Lecture Notes in Computer Science(), vol 6505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19211-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19211-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19210-4

  • Online ISBN: 978-3-642-19211-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics