Preview
Unable to display preview. Download preview PDF.
9 References
Boehm, H., A. Demers and J. Donahue. An Informal Description of Russell. Technical Report. Computer Science Department. Cornell University, 1980.
Boehm, H. A logic for the Russell Programming Language. Ph.D. Thesis. Cornell University, 1983. [To appear as a University of Washington technical report.]
Burstall, R., B. Lampson, this volume.
de Bruign, N. G., A Survey of the Project AUTOMATH. Essays on Combinatory Logic, Lambda Calculus and Formalism. ed. Hindly, J. R. and J. P. Seldin, Academic Press, 1980, pp 589–606.
Constable, R. L. and J. L. Bates, The Nearly Ultimate PRL. Technical Report, Cornell University, TR-83-551, January 84.
Constable, R. L. and D. R. Zlatin. The Type Theory of PL/CV3, TOPLAS 6, i, January 1984, pp. 94–112. [First appeared as a Cornell University technical report in 1979.]
Curry, H. B., Combinatory Logic Voll II., North Holland, 1971.
Demers, A. and J. Donahue. The Semantics of Russell: An Exercise in Abstract Data Types. Technical Report. Computer Science Department, Cornell University, 1980.
Demers, A. and J. Donahue. Making Variables Abstract: an Equational Theory for Russell, Proceedings Tenth Annual Principles of Programming Languages Symposium, 1983.
Donahue, J. On the Semantics of "Data Type." SIAM J. Computing 8: 4 (November 1979), pp. 546–560.
Gordon, M. H., R. Milner. C. P. Wadsworth. Edinburgh LCF. Springer Verlag LNCS. Vol. 78, 1979. Chapter 2.
MacQueen, D., R. Sethi. A semantic model of Types for Applicative Languages. Proceedings 1982 ACM Symposium on Lisp and Functional Programming, 1982, pp 243–252.
MacQueen, D., G. Plotkin, R. Sethi. An Ideal Model for Recursive Polymorphic Types. Proceedings Eleventh Annual Principles of Programming Languages Symposum, 1984.
Martin-Löf, P. "Constructive Logic and Computer Programming", 6th International Congress for Logic, Method and Phil. of Science, North-Holland, Amsterdam, 1982.
Milner, R. A Proposal for Standard ML. Draft. November 1983. Polymorphism. No. 3, Jan 1984.
Plotkin, G. D., A Structural Approach to Operational Semantics. Technical Report. Computer Science Department. Aarhus University, 1981.
Plotkin, G. D., An Operational Semantics for CSP. Technical Report, Department of Computer Science, University of Edinburgh. 1982.
Plotkin, G. D., Post-graduate course notes. Department of Computer Science, University of Edinburgh, 1983.
Reynolds, J. C., Types, Abstraction and Parametric Polymorphism, IFIP 83, Elsevier Science Publishers B.V. (North-Holland), 1983, pp. 513–523.
Stenlund, S. Combinators. Lambda Terms and Proof Theory. D. Reidel, Dordrecht, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hook, J.G. (1984). Understanding Russell a first attempt. In: Kahn, G., MacQueen, D.B., Plotkin, G. (eds) Semantics of Data Types. SDT 1984. Lecture Notes in Computer Science, vol 173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13346-1_3
Download citation
DOI: https://doi.org/10.1007/3-540-13346-1_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13346-9
Online ISBN: 978-3-540-38891-3
eBook Packages: Springer Book Archive