1. Berry, G., Modèles complètement adéquats et stables des lambda-calculs typés. Thèse de Doctorat d'Etat, Université de Paris VII (1979).
2. Bednarczyk, M.A., Categories of asynchronous systems. PhD in Comp Sc, University of Sussex, report no.1/88 (1988).
3. Berry, G., and Curien, P-L., Sequential algorithms on concrete data structures. TCS vol 20 (1982).
4. Boudol, G., and Castellani,I., On the semantics of concurrency: partial orders and transition systems. Springer Lec Notes in Comp Sc vol 249 (1987).
5. Curien, P-L., Categorical combinators, sequential algorithms and functional programming. Research notes in theoretical comp. sc., Pitman, London (1986).