Lcf: A way of doing proofs with a machine

  • Robin Milner
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


Boolean Algebra Inference Rule Disjunctive Normal Form Proof Procedure 17th Annual IEEE Symposium 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blikle, A., Specified Programming, ICS PAS Report 333, Inst. of Computer Science, Polish Academy of Sciences, Warsaw, 1978.Google Scholar
  2. 2.
    Burstall, R.M., and Goguen, J.A., Putting theories together to make specifications, Proc. 5th International Joint Conference on Artificial Intelligence, Cambridge Mass., published by Dept. Comp. Sci., Carnegie Mellon, 1045–1058, 1977.Google Scholar
  3. 3.
    Cohn, A., High level proof in LCF, Proc. 4th Workshop on Automated Deduction, Austin, Texas, 73–80, 1979.Google Scholar
  4. 4.
    Constable, R.L., and O'Donnell, M.J., A Programming Logic, Winthrop, 1978.Google Scholar
  5. 5.
    deBruijn, N.G., The mathematical language AUTOMATH, Symposium in Automatic Demonstration, Lecture Notes in Math, Vol. 125, Springer-Verlag, New York, 29–61, 1970.Google Scholar
  6. 6.
    Floyd, R.W., Assigning meanings to programs, Proc. Symposia in Applied Mathematics, Vol. XIX, Amer. Math. Soc., Providence, 19–32, 1967.Google Scholar
  7. 7.
    Giles, D.A., The theory of LISTS in LCF, Report CSR-31-78, Computer Science Dept., Edinburgh University, 1978.Google Scholar
  8. 8.
    Goodstein, R.L., Boolean Algebra, Pergamon Press, Macmillan Company, New York, 1963.Google Scholar
  9. 9.
    Gordon, M., Milner, R., Morris, L., Newey, M. and Wadsworth, C., A metalanguage for interactive proof in LCF, Proc. 5th ACM SIGACT-SIGPLAN Conference on Principles of Programming Languages, Tucson, Arizona, USA, 1978.Google Scholar
  10. 10.
    Gordon, M., Milner, R. and Wadsworth, C., Edinburgh LCF, Report CSR-11-77, Computer Science Dept., Edinburgh University, 1977.Google Scholar
  11. 11.
    Hewitt, C., PLANNER: a language for manipulating models and proving theorems in a robot, AI Memo 168, Project MAC, MIT, Cambridge, Mass., 1970.Google Scholar
  12. 12.
    Hoare, C.A.R., An axiomatic basis for computer programming, Comm. ACM, 12, 576–581, 1969.CrossRefGoogle Scholar
  13. 13.
    Milner, R. and Weyhrauch, R.W., Proving compiler correctness in a mechanized logic, Machine Intelligence 7, ed. B. Meltzer & D.Michie, Edinburgh University Press, 51–72, 1972.Google Scholar
  14. 14.
    Pratt, V.R., Semantical considerations on Floyd-Hoare logic, Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, 109–121, 1976.Google Scholar
  15. 15.
    Rasiowa, H., Algorithmic Logic, Inst. of Computer Science, Polish Academy of Sciences, Warsaw, 1977.Google Scholar
  16. 16.
    Robinson, J.A., A machine-oriented logic based on the resolution principle, JACM, 12, 23–41, 1965.CrossRefGoogle Scholar
  17. 17.
    Scott, D., Data types as lattices, SIAM J. Computing, 5, 1976, 522–587.CrossRefGoogle Scholar
  18. 18.
    Scott, D. and Strachey, C., Towards a mathematical semantics for computer languages, Proc. Symposium on Computers and Automata, Vol.21, Microwave Research Inst. Symposia Series, Polytech. Inst. of Brooklyn, New York, 19–46, 1971.Google Scholar
  19. 19.
    Van Emden, M.H. and Kowalski, R.A., The semantics of predicate logic as a programming language, J.ACM, 23, 733–742, 1976.CrossRefGoogle Scholar
  20. 20.
    Weyhrauch, R.W., Prolegomena to a theory of formal reasoning, Memo AIM-315, Computer Science Dept., Stanford University, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Robin Milner
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghEdinburghScotland

Personalised recommendations