Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-25T03:15:24.991Z Has data issue: false hasContentIssue false
  • English
  • Français

Symmetry and Interactivity in Programming

Published online by Cambridge University Press:  15 January 2014

P.-L. Curien
P.-L. Curien*
Affiliation:
PPS (Programmes, Preuves et Systèmes), Equipe Postulante CNRS, Université Paris7, France.E-mail:[email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We recall some of the early occurrences of the notions of interactivity and symmetry in the operational and denotational semantics of programming languages. We suggest some connections with ludics.

Type
Research Article
Information
Bulletin of Symbolic Logic , Volume 9 , Issue 2 , June 2003 , pp. 169 - 180
Copyright
Copyright © Association for Symbolic Logic 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Abramsky, S. and Jagadeesan, R., New foundations for the geometry of interaction, Information and Computation, vol. 111 (1994), no. 1, pp. 53–119.CrossRefGoogle Scholar
[2] Abramsky, S., Jagadeesan, R., and Malacaria, P., Full abstraction for PCF, Information and Computation, vol. 163 (2000), pp. 409–470, (Manuscript circulated since 1994).Google Scholar
[3] Abramsky, S. and McCusker, G., Game semantics, Computational logic (Berger, U. and Schwichtenberg, H., editors), Springer-Verlag, 1999, pp. 1–56.Google Scholar
[4] Amadio, R. and Curien, P.-L., Domains and lambda-calculi, Cambridge University Press, 1998.Google Scholar
[5] Andreoli, J.-M. and Pareschi, R., Linear objects: logical processes with built-in inheritance, New Generation Computing, vol. 9 (1991), no. 3–4, pp. 445–473.Google Scholar
[6] Berry, G. and Curien, P.-L., Sequential algorithms on concrete data structures, Theoretical Computer Science, vol. 20 (1982), pp. 265–321.Google Scholar
[7] Berry, G. and Curien, P.-L., Theory and practice of sequential algorithms: the kernel of the applicative language CDS, Algebraic methods in semantics (Nivat, and Reynolds, , editors), Cambridge University Press, 1985, pp. 35–87.Google Scholar
[8] Cartwright, R., Curien, P.-L., and Felleisen, M., Fully abstract semantics for observably sequential languages, Information and Computation, vol. 111 (1994), no. 2, pp. 297–401.Google Scholar
[9] Coquand, T., A semantics of evidence for classical arithmetic, The Journal of Symbolic Logic, vol. 60 (1995), pp. 325–337.Google Scholar
[10] Curien, P.-L., On the symmetry of sequentiality, Mathematical foundations of programming semantics 1993, Lecture Notes in Computer Science, vol. 802, Springer, 1993, pp. 122–130.Google Scholar
[11] Curien, P.-L. and Herbelin, H., The duality of computation, International conference on functional programming 2000 (Montréal), ACM Press, 2000.Google Scholar
[12] Felscher, W., Dialogues as a foundation of intuitionistic logic, Handbook of philosophical logic, vol. 3, 1986, pp. 341–372.Google Scholar
[13] Girard, J.-Y., Linear logic, Theoretical Computer Science, vol. 50 (1987), pp. 1–102.Google Scholar
[14] Girard, J.-Y., Geometry of interaction I: interpretation of system F, Logic colloquium '88, North Holland, 1989, pp. 221–260.Google Scholar
[15] Girard, J.-Y., Locus solum, Mathematical Structures in Computer Science, (2001).Google Scholar
[16] Griffin, T., A formulae-as-types notion of control, Principles of programming languages 1990, ACM Press, 1990.Google Scholar
[17] Herbelin, H., Séquents qu'on calcule, Thèse de doctorat, Université Paris 7, 1995.Google Scholar
[18] Howard, W., The formulas-as-types notion of construction, Curry Festschrift (Hindley, and Seldin, , editors), Academic Press, 1980, pp. 479–490, (Manuscript circulated since 1969).Google Scholar
[19] Hyland, M. and Ong, L., On full abstraction for PCF, Information and Computation, vol. 163 (2000), pp. 285–408, (Manuscript circulated since 1994).Google Scholar
[20] Kahn, G. and Macqueen, D., Coroutines and networks of parallel processes, Information processing 77, North Holland, 1977, pp. 993–998.Google Scholar
[21] Kleene, S., Recursive functionals and quantifiers of finite types revisited I, II, III, and IV, General recursion theory II (Fenstad, et al., editor), North-Holland, 1978, The Kleene symposium (Barwise et al., editors), North-Holland, 1980; Patras logic symposium, North Holland, 1982; and Symposia in pure mathematics vol. 42, 1985, respectively.Google Scholar
[22] Laird, J., A semantic analysis of control, Ph.D. thesis, University of Edinburgh, 1999.Google Scholar
[23] Lamarche, F., Sequentiality, games and linear logic, manuscript, 1992.Google Scholar
[24] Loader, R., Finitary PCF is undecidable, manuscript, 1996.Google Scholar
[25] Milner, R., Fully abstract models of typed lambda-calculi, Theoretical Computer Science, vol. 4 (1977), pp. 1–23.Google Scholar
[26] Milner, R., Communicating and mobile systems: the πcalculus, Cambridge University Press, 1999.Google Scholar