R. Amadio and P. Curien, Domains and Lambda-calculi, 1998.
DOI : 10.1017/CBO9780511983504
URL : https://hal.archives-ouvertes.fr/inria-00070008

G. Berry, Stable models of typed lambda-calculi, Proc. ICALP, p.62, 1978.

G. Berry and P. Curien, Sequential algorithms on concrete data structures, Theoretical Computer Science, vol.20, issue.3, pp.265-321, 1982.
DOI : 10.1016/S0304-3975(82)80002-9
URL : http://doi.org/10.1016/s0304-3975(82)80002-9

R. Cartwright and M. Felleisen, Observable sequentiality and full abstraction, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, 1992.
DOI : 10.1145/143165.143232
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.1024

R. Cartwright, P. Curien, and M. Felleisen, Fully Abstract Semantics for Observably Sequential Languages, Information and Computation, vol.111, issue.2, pp.297-401, 1994.
DOI : 10.1006/inco.1994.1047

P. Curien, On the symmetry of sequentiality, Proceedings of Mathematical Foundations of Programming Semantics, pp.29-71, 1993.
DOI : 10.1007/3-540-58027-1_2

P. Curien, Introduction to Linerar logic and ludics, parts I and II, to appear in Advances of Mathematics, China, available from http

P. Curien, Abstract, Bulletin of Symbolic Logic, vol.802, issue.02, pp.169-180, 2003.
DOI : 10.1016/0304-3975(77)90053-6
URL : https://hal.archives-ouvertes.fr/hal-00155295

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

G. Kahn and G. Plotkin, Concrete domains, Theoretical Computer Science, vol.121, issue.1-2, pp.187-277, 1993.
DOI : 10.1016/0304-3975(93)90090-G

J. Laird, Bistability: An Extensional Characterization of Sequentiality, Proc. Computer Science and Logic 2003, 2003.
DOI : 10.1007/978-3-540-45220-1_30

J. Laird, Locally boolean domains, to appear in Theoretical Computer Science

F. Lamarche, Sequentiality, games and linear logic, Proc. CLICS Workshop, p.397, 1992.