1. A. Appel, D.B. MacQueen, R. Milner, and M. Tofte, Unifying exceptions with constructors in standard ML. Technical Report ECS-LFCS-88-55, Laboratory for Foundations of Computer Science, University of Edinburgh, 1988.
2. F. Barbanera and S. Berardi. Continuations and simple types: a strong normalization result. In Proceedings of the ACM SIGPLAN Workshop on Continuations. Report STAN-CS-92-1426, Stanford University, 1992.
3. F. Barbanera and S. Berardi. Extracting constructive content from classical logic via control-like reductions. In M. Bezem and J.F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 45–59. Lecture Notes in Computer Science, 664, Springer Verlag, 1993.
4. F. Barbanera and S. Berardi. A symmetric lambda-calculus for “classical” program extraction. In M. Hagiya and J.C. Mitchell, editors. Proceedings of the International Symposium on Theretical Aspects of Computer Software, pages 494–515. Lecture Notes in Computer Science, 789, Springer Verlag, 1994.
5. H.P. Barendregt. The lambda calculus, its syntax and semantics. North-Holland, revised edition, 1984.