Interactive Observability in Ludics

  • Claudia Faggian
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3142)


In Ludics [7] a proof/program (called design) can be thought of as a black box, to be studied by making it interact with other designs.

We explore what can be recognized interactively in this setting, developing two approaches, which we respectively qualify as dynamic and static. The former consists in studying the geometrical properties of the paths induced by the interaction (normalization), much in the style of the Geometry of Interaction. The latter analyzes statically the properties of a design.


Positive Node Internal Node Positive Action Return Condition Linear Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Curien, P.-L.: Abstract Böhm trees. Mathematical Structures in Computer Science 8(6) (1998)Google Scholar
  2. 2.
    Danos, V., Regnier, L.: Proof-nets and the Hilbert space. In: Girard, J.-Y., Lafont, Y. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Notes Series, vol. 222, Cambridge University Press, Cambridge (1995)Google Scholar
  3. 3.
    Faggian, C.: On the Dynamics of Ludics. A Study of Interaction. PhD thesis, Université Aix-Marseille II (2002)Google Scholar
  4. 4.
    Faggian, C.: Travelling on designs: ludics dynamics. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, p. 427. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Faggian, C., Hyland, M.: Designs, disputes and strategies. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, p. 442. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Faggian, C., Maurel, F.: Ludics on graphs, towards concurrency. draftGoogle Scholar
  7. 7.
    Girard, J.-Y.: Locus solum. Mathematical Structures in Computer Science 11, 301–506 (2001)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Claudia Faggian
    • 1
  1. 1.University of PadovaItaly

Personalised recommendations