Abstract
We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying an additional condition, which we call logical L-nets, can be sequentialized into traditional tree-like strategies, and vice-versa.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amadio, R., Curien, P.-L.: Domains and Lambda-calculi. Cambridge University Press, Cambridge (1998)
Andreoli, J.-M.: Focussing and proof construction. Annals of Pure and Applied Logic (2001)
Andreoli, J.-M.: Focussing proof-net construction as a middleware paradigm. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, p. 501. Springer, Heidelberg (2002)
Curien, P.-L.: Abstract bohm trees. MSCS 8(6) (1998)
Curien, P.-L.: Introduction to linear logic and ludics, part ii. To appear in Advances of Mathematics, China (2004), Available at http://www.pps.jussieu.fr/curien
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)
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)
Faggian, C., Maurel, F.: Ludics nets, a game model of concurrent interaction. In: Proc. of LICS (Logic in Computer Science), IEEE Computer Society Press, Los Alamitos (2005)
Girard, J.-Y.: Linear logic. Theoretical Computer Science (50), 1–102 (1987)
Girard, J.-Y.: On the meaning of logical rules i: syntax vs. semantics. In: Berger, Schwichtenberg (eds.) Computational logic. NATO series F, vol. 165, pp. 215–272. Springer, Heidelberg (1999)
Girard, J.-Y.: Locus solum. MSCS 11, 301–506 (2001)
Hughes, D., van Glabbeek, R.: Proof nets for unit-free multiplicative-additive linear logic. ACM Transactions on Computational Logic (2005)
Hyland, M., Ong, L.: On full abstraction for PCF. Information and Computation (2000)
Laurent, O.: Etude de la polarisation en logique. PhD thesis (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Curien, PL., Faggian, C. (2005). L-Nets, Strategies and Proof-Nets. In: Ong, L. (eds) Computer Science Logic. CSL 2005. Lecture Notes in Computer Science, vol 3634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538363_13
Download citation
DOI: https://doi.org/10.1007/11538363_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28231-0
Online ISBN: 978-3-540-31897-2
eBook Packages: Computer ScienceComputer Science (R0)