Articles and notes

• (with G. Berry) Sequential algorithms on concrete data structures, Theoretical Computer Science 20, 265-321 (1982).
• (with G. Berry) Theory and practice of sequential algorithms: the kernel of the applicative language CDS, in `Algebraic methods in semantics', M. Nivat, J. Reynolds eds, Cambridge Univ. Press, 35-87 (1985).
• (with G. Berry and J-J. Lévy) Full abstraction for sequential languages: state of the art, in `Algebraic methods in semantics', M. Nivat, J. Reynolds eds, Cambridge Univ. Press, 89-132 (1985).
• (with G. Cousineau and M. Mauny) The categorical abstract machine, Science of Computer Programming 8, 173-202 (1987).
• Categorical combinators, Information and Control 69 (1-3), 188-254 (1986).
• (with A. Obtulowicz) Partiality, cartesian closedness and toposes, Information and Computation 80 (1), 50-95 (1988).
• Alpha-conversion, conditions on variables and categorical logic, Studia Logica XLVIII (3), 319-360 (1990).
• An abstract framework for environment machines, Theoretical Computer Science 82, 389-402 (1991).
• (with G. Ghelli) Coherence of subsumption, minimum typing and type-cheking in $F_{\leq}$, Mathematical Structures in Computer Science 2(1), 55-91 (1992).
• (with M. Abadi, L. Cardelli, and J.-J. Lévy) Explicit substitutions, Journal of Functional Programming 1(4), 375-416 (1992).
• Sequentiality and full abstraction, in `Applications of Categories in Computer Science', Cambridge Univ. Press (1992).
• Substitution up to isomorphism, Fundamenta Informaticae 19 (1-2), 51-86 (1993).
• (with Giorgio Ghelli) Decidability and confluence of $\beta\eta {\it top}_{\leq}$ reduction in $F_{\leq}$, Information and Computation 109 (1-2), 57-114 (1994).
• (with R. Cartwright and M. Felleisen) Fully abstract models of observably sequential languages, Information and Computation 111 (2), 297-401 (1994).
• (with M. Abadi and L. Cardelli) Formal parametric polymorphism, Boehm Festschrift Volume, TCS 121 (1-2), 9-58 (1993).
• (with T. Hardin) Yet yet a counterexample for $\lambda$+SP, Journal of Functional Programming 4 (1), 113-115 (1994).
• On the symmetry of sequentiality, invited paper, Proceedings of Mathematical Foundations of Programming Semantics 1993, Lecture Notes in Computer Science 802, 29-71 (1994).
• (with R. Di Cosmo) A confluent reduction for the $\lambda$-calculus with surjective pairing and terminal object, Journal of Functional Programming 6(2), 299-327 (1996).
• (with T. Hardin and J.-J. Lévy) Weak and strong confluent calculi of explicit substitutions, JACM 43 (2) (1996).
• (with T. Hardin and A. Rios) Strong normalisation of substitutions, Journal of Logic and Computation 6(6), 799-817 (1996).
• (with G. Plotkin and G. Winskel) Bistructure models of linear logic, Milner Festschrift, MIT Press (1998).
• Abstract Boehm trees, Mathematical Structures in Computer Science 8(6), 559-591(1998).

Books

• Categorical combinators, sequential algorithms and functional programming, Research notes in theoretical computer science, Pitman (1986); second, revised edition, Birkhauser (1993).
• (with R. Amadio) Domains and lambda-calculi, Cambridge Univ. Press (1998) (ABSTRACT).

Some conference papers

• (with Giorgio Ghelli) RTA 91 (Rewriting Techniques and Applications), Como, On confluence of weakly normalizing systems, LNCS 488.
• LICS 92 (Logic in Computer Science), Observable sequential algorithms on concrete data structures, Proc. published by ACM.
• (with M. Abadi and R. Bellucci) TLCA 95 (Typed Lambda-calculus and Applications), Edinburgh, A model for formal parametric polymorphism: A PER interpretation for system $\cal R$, LNCS 902.
• (with H. Herbelin) Third Fuji International Symposium on Functional and Logic Programming, April 1998, Kyoto, Computing with abstract Boehm trees, World Scientific (Singapour).