Fully abstract translations between functional languages

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Samson Abramsky, The lazy lambda calculus, Research topics in functional programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	2	Bard Bloom. Can LCF be topped? In 3~d Syrup. Logic in Compuler Science, pages 282-295. IEEE, 1988.
	3	Bard Bloom, Can LCF be topped ? Flat lattice models of typed &lgr;-calculus, Information and Computation, v.87 n.1-2, p.264-301, July/August 1990 [doi>10.1016/0890-5401(90)90064-O]
	4	Bard Bloom and Jon G. Riecke. LCF should be lifted. In Teodor Rus, editor, Proc. Conf. Algebraic Methodology and Software Technology, pages 133-136. Department of Computer Science, University of Iowa, 1989.
	5	Stavros S. Cosmadakis, Albert R. Meyer, and Jon G. Riecke. Completeness for typed lazy inequalities (preliminary report). In 5th Syrup. Logic in Computer Science, pages 312-320. IEEE, 1990.
	6	M. Felleisen, On the expressive power of programming languages, Proceedings of the third European symposium on programming on ESOP '90, p.134-151, May 1990, Copenhagen, Denmark
	7	Albert Meyer , Jon G. Riecke, Continuations may be unreasonable, Proceedings of the 1988 ACM conference on LISP and functional programming, p.63-71, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62685]
	8	Robin Milner. Fully abstract models of the typed lambda calculus. Theoretical Computer Sci., 4:1- 22, 1977.
	9	John C. Mitchell. Lisp is not universal (summary). Unpublished manuscript, August 1986.
	10	E. Moggi, Computational lambda-calculus and monads, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.14-23, June 1989, Pacific Grove, California, United States
	11	Chih-Hao Luke Ong. Fully abstract models of the lazy lambda calculus. In 29TM Symp. Foundations of Computer Science, pages 368-376. IEEE, 1988.
	12	Chih-Hao Luke Ong. The Lazy Lambda Calculus: An Investigation into the Foundations of Functional Programming. PhD thesis, Imperial College, University of London, 1988.
	13	Gordon D. Plotkin. Call-by-name, cull-by-value and the )~-calculus. Theoretical Computer Sci., 1:125-159, 1975.
	14	Gordon D. Plotkin. LCF considered as a programming language. Theoretical Compuler Sci., 5:223- 257, 1977.
	15	Gordon D. Plotkin. Notes on completeness of the full continuous type hierarchy. Unpublished manuscript, MIT, November 1982.
	16	John C. Reynolds, On the Relation between Direct and Continuation Semantics, Proceedings of the 2nd Colloquium on Automata, Languages and Programming, p.141-156, July 29-August 02, 1974
	17	:Ion G. Riecke. Should a function continue? Master's thesis, Dept. Electrical Engineering ~z Computer Sci., Massachusetts Institute of Technology, January 1989. Supervised by A.R. Meyer.
	18	Jon G. Riecke, A complete and decidable proof system for call-by-value equalities, Proceedings of the seventeenth international colloquium on Automata, languages and programming, p.20-31, July 1990, Warwick University, England
	19	V.Yu. Sazonov. Expressibility of functions in D. Scott's LCF language. Algebra i Logika, 15:308- 330, 1976. (Russian).
	20	Helmut Schwichtenberg. Complexity of normalization in the pure typed lambda-calculus. In A.S. Troelstra and D. van Dalen, editors, The L.E.J. Brouwer Centenary Symposium, pages 453-457. North Holland, 1982.
	21	Dana Scott. A type theoretical alternative to CUCH, ISWIM, OWHY. Oxford University, unpublished manuscript, 1969.
	22	Kurt Sieber, Relating full abstraction results for different programming languages, Proceedings of the tenth conference on Foundations of software technology and theoretical computer science, p.373-387, November 1990, Bangalore, India
	23	Dorai Sitaram , Matthias Felleisen, Reasoning with continuations II: full abstraction for models of control, Proceedings of the 1990 ACM conference on LISP and functional programming, p.161-175, June 27-29, 1990, Nice, France [doi>10.1145/91556.91626]
	24	Richard Statman. The typed ,~-calculus is not elementary recursive. Theoretical Computer Coci., 9:73-81, 1979.
	25	Richard Statman. Logical relations in the typed )~-calculus. Information and Control, 65:86-97, 1985.