Advertisement

Understanding Russell a first attempt

  • James G. Hook
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 173)

Keywords

Operational Semantic Type Expression Type Assignment Proof Rule Introduction Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9 References

  1. [Boehm 80]
    Boehm, H., A. Demers and J. Donahue. An Informal Description of Russell. Technical Report. Computer Science Department. Cornell University, 1980.Google Scholar
  2. [Boehm 83]
    Boehm, H. A logic for the Russell Programming Language. Ph.D. Thesis. Cornell University, 1983. [To appear as a University of Washington technical report.]Google Scholar
  3. [Burstall]
    Burstall, R., B. Lampson, this volume.Google Scholar
  4. [de Bruijn]
    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.Google Scholar
  5. [Constable 84]
    Constable, R. L. and J. L. Bates, The Nearly Ultimate PRL. Technical Report, Cornell University, TR-83-551, January 84.Google Scholar
  6. [Constable 79]
    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.]Google Scholar
  7. [Curry]
    Curry, H. B., Combinatory Logic Voll II., North Holland, 1971.Google Scholar
  8. [Demers 80]
    Demers, A. and J. Donahue. The Semantics of Russell: An Exercise in Abstract Data Types. Technical Report. Computer Science Department, Cornell University, 1980.Google Scholar
  9. [Demers 83]
    Demers, A. and J. Donahue. Making Variables Abstract: an Equational Theory for Russell, Proceedings Tenth Annual Principles of Programming Languages Symposium, 1983.Google Scholar
  10. [Donahue 79]
    Donahue, J. On the Semantics of "Data Type." SIAM J. Computing 8: 4 (November 1979), pp. 546–560.Google Scholar
  11. [Gordon]
    Gordon, M. H., R. Milner. C. P. Wadsworth. Edinburgh LCF. Springer Verlag LNCS. Vol. 78, 1979. Chapter 2.Google Scholar
  12. [MacQueen 82]
    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.Google Scholar
  13. [MacQueen 84]
    MacQueen, D., G. Plotkin, R. Sethi. An Ideal Model for Recursive Polymorphic Types. Proceedings Eleventh Annual Principles of Programming Languages Symposum, 1984.Google Scholar
  14. [Martin-Löf]
    Martin-Löf, P. "Constructive Logic and Computer Programming", 6th International Congress for Logic, Method and Phil. of Science, North-Holland, Amsterdam, 1982.Google Scholar
  15. [Milner]
    Milner, R. A Proposal for Standard ML. Draft. November 1983. Polymorphism. No. 3, Jan 1984.Google Scholar
  16. [Plotkin 81]
    Plotkin, G. D., A Structural Approach to Operational Semantics. Technical Report. Computer Science Department. Aarhus University, 1981.Google Scholar
  17. [Plotkin 82]
    Plotkin, G. D., An Operational Semantics for CSP. Technical Report, Department of Computer Science, University of Edinburgh. 1982.Google Scholar
  18. [Plotkin 83]
    Plotkin, G. D., Post-graduate course notes. Department of Computer Science, University of Edinburgh, 1983.Google Scholar
  19. [Reynolds]
    Reynolds, J. C., Types, Abstraction and Parametric Polymorphism, IFIP 83, Elsevier Science Publishers B.V. (North-Holland), 1983, pp. 513–523.Google Scholar
  20. [Stenlund]
    Stenlund, S. Combinators. Lambda Terms and Proof Theory. D. Reidel, Dordrecht, 1972.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • James G. Hook
    • 1
  1. 1.University of EdinburghUK

Personalised recommendations