Bisimilarity for a first-order calculus of objects with subtyping

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	Abadi, M. and L. Cardelli (1994a, June). A semantics of object types. In Proceedings of the 9th IEEE Symposium on Logic in Computer Science, pp. 332-341. IEEE Computer Society Press.
	2	Martín Abadi , Luca Cardelli, A Theory of Primitive Objects - Scond-Order Systems, Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems, p.1-25, April 11-13, 1994
	3	Martín Abadi , Luca Cardelli, A Theory of Primitive Objects - Untyped and First-Order Systems, Proceedings of the International Conference on Theoretical Aspects of Computer Software, p.296-320, April 19-22, 1994
	4	Martín Abadi , Luca Cardelli, An Imperative Object Calculus, Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development, p.471-485, May 22-26, 1995
	5	Samson Abramsky , C.-H. Luke Ong, Full abstraction in the lazy lambda calculus, Information and Computation, v.105 n.2, p.159-267, Aug. 1993 [doi>10.1006/inco.1993.1044]
	6	Gul Agha , Ian A. Mason , Scott F. Smith , Carolyn L. Talcott, Towards a Theory of Actor Computation, Proceedings of the Third International Conference on Concurrency Theory, p.565-579, August 24-27, 1992
	7	V. Breazu-Tannen , C. A. Gunter , A. Scedrov, Computing with coercions, Proceedings of the 1990 ACM conference on LISP and functional programming, p.44-60, June 27-29, 1990, Nice, France [doi>10.1145/91556.91590]
	8	Roy L. Crole , Andrew D. Gordon, A Sound Metalogical Semantics for Input/Output Effects, Selected Papers from the 8th International Workshop on Computer Science Logic, p.339-353, September 25-30, 1994
	9	Felleisen, M. and D. Friedman (1986). Control operators, the SECD-machine, and the h-calculus. In Formal Descmpt#on of Programming Concepts III, pp. 193-217. North-Holland.
	10	Andrew D. Gordon, Functional programming and input/output, Cambridge University Press, New York, NY, 1994
	11	Gordon, A. D. (1995). Bisimilarity as a theory of functional programming. In Eleventh Annual Conference on Mathemahcal Foundations of Programming Semantics, Volume 1 of Electronic Notes #n Theoretical Computer Sczence. Elsevier Science Pubhshers B.V. To appear. Extended version available as BRICS Note NS-95-3, Aarhus University.
	12	Carl A. Gunter , John C. Mitchell, Theoretical aspects of object-oriented programming: types, semantics, and language design, MIT Press, Cambridge, MA, 1994
	13	D. Howe, Equality in lazy computation systems, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.198-203, June 1989, Pacific Grove, California, United States
	14	Cliff B. Jones, A pi-Calculus Semantics for an Object-Based Design Notation, Proceedings of the 4th International Conference on Concurrency Theory, p.158-172, August 23-26, 1993
	15	Mason, I. A., S. F. Smith, and C. L. Talcott (1994). From operational semantics to domain theory. Submitted for publication.
	16	Maung, I. (1993). Simulation, subtyping and substitutability. Technical Report UBC 93/5, Department of Computing, University of Brighton.
	17	Meyer, A. 1#. and S. S. Cosmadakis (1988, July) Semantical paradigms: Notes for an invited lecture. In Proceedings of the 3rd IEEE Symposium on Logic in Computer Sczence, pp. 236-253.
	18	M11ner, R. (1977). Fully abstract models of typed tambdacalculi. Theoretical Computer Sczence #, 1-23.
	19	R. Milner, Communication and concurrency, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	20	Mitchell, J. C., F. Honsell, and K Fisher (1993). A lambda calculus of objects and method specialization. in Proceedings of the E#ghth IEEE Symposzum on Logic in Computer Science, Montreal, pp 26-38.
	21	Morris, J. H. (1968, December). Lambda-Calcutus Models of Programming Languages Ph. D. thesis, MIT.
	22	PaIsberg, J. (1994). Efficient inference of object types. In Proceedings of the 9th IEEE Symposium on Logic zn Computer Science, pp. 186-195.
	23	Pierce, B and D. Sangiorgi (1995). Typing and subtyping for mobile processes. Mathematical Structures m Computer Science. To appear. Summary in Proceed- #ngs of the 8th IEEE Conference on Logic #n Computer Science, pp. 376-385 (1993).
	24	Andrew M. Pitts, Computational Adequacy via "Mixed" Inductive Definitions, Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics, p.72-82, April 07-10, 1993
	25	Plotkin, G. D. (1977). LCF considered as a programming language. Theoretical Computer Science 5, 223-255.
	26	Rees, G. (1994, April). Observational equivalence for a polymorphic tambda calculus. University of Cambridge Computer Laboratory. http://www.cl.cam.ac. uk / users / g dr 11 / e quivalen ce. dvi.
	27	Davide Sangiorgi, The lazy Lambda calculus in a concurrency scenario, Information and Computation, v.111 n.1, p.120-153, May 15 1994 [doi>10.1006/inco.1994.1042]
	28	Stark, I. D. B. (1994, December). Names and H#gher- Order Functions. Ph.D. thesis, University of Cambridge Computer Laboratory.
	29	David Walker, Objects in the &pgr;-calculus, Information and Computation, v.116 n.2, p.253-271, Feb. 1, 1995 [doi>10.1006/inco.1995.1018]