1. Games and full completeness for multiplicative linear logic;Abramsky;J. Symbolic Logic,1994
2. Full abstraction for PCF;Abramsky,1994
3. Stable models of typed lambda-calculi;Berry,1978
4. Modèles complètement adéquats et stables des lambda-calculs typés;Berry,1979
5. Sequential algorithms on concrete data structures;Berry;Theoret. Comput. Sci.,1982