1. Abramsky, S, Ong, C.-H. L. (1993), `Full abstraction in the lazy lambda calculus.’ Information and Computation
105 (2), 159–267.
2. Asperti, A., Longo, G. (1991), Categories, Types and Structures. Foundations of Computing, The MIT Press.
3. Bastonero, O. (1996), Modèle fortement stables du lambda-calcul et résultats d’incomplétude. PhD thesis, Université Paris V II.
4. Bastonero, O., Gouy., X. (To Appear), `Strong stability and the incompleteness of the class of stable models’, Annals of Pure and Applied Logic.
5. Coppo, M., Dezani-Ciancaglini, M.,Zacchi, M. (1987), `Type theories, normal forms and Doo lambda models.’ Information and Control
72 (2), 85–116.