Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 1980: 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 pp 170–181Cite as

An experiment with "Edinburgh LCF"

  • Thursday Morning
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 87))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. J. Backus, "Can programming be liberated form the von Neumann style? A functional programming style and its algebra of programs", Comm ACM 21,8 (1978).

    Google Scholar 

  2. R.Bird, "Programs and Machines; and introduction to the theory of computation", Wiley (1976).

    Google Scholar 

  3. A.Blikle, "Assertion Programming", Proc. 8th MFCS Symposium, Olomouc, Czechoslovakia, (1979).

    Google Scholar 

  4. R.S. Boyer, J S. Moore, "A Computational Logic", Academic Press, New York (1979).

    Google Scholar 

  5. W.H. Burge, "Recursive Programming Techniques", Addison-Wesley, Reading, Mass. (1975).

    Google Scholar 

  6. R.M.Burstall, J.A.Goguen, "Putting theories together to make specification",Proc. 5th Intern.Joint Conference on Artificial Intelligence, Cambridge Mass., published by Dept. of Comp. Sci., Carnegie Mellon, (1977).

    Google Scholar 

  7. C.Cartwright, private communication.

    Google Scholar 

  8. A.Cohn, "High level proof in LCF", Proc. 4th Workshop on Automa ted deduction, Austin, Texas (1979).

    Google Scholar 

  9. A.Cohn, "Remarks on Machine Proof", 1980, manuscript

    Google Scholar 

  10. M.Gordon, R.Milner, C.Wadsworth, "Edinburgh LCF", Springer-Verlag, (1979).

    Google Scholar 

  11. L.S. van Benthem Jutting, "Checking Landau's ‘GRUNDLAGEN’ in the AUTOMATH system", thesis, Tech.Hogeschule, Eidhoven, The Netherlands (1977).

    Google Scholar 

  12. F.W. von Henke, "Recursive data types and program structures", Internal report, GMD, Bonn (1976).

    Google Scholar 

  13. J.Leszczylowski, "Theory of FP systems in EDINBURGH LCF", Internal Report,Comp.Sci.Dep.,Univ.of Edinburgh, (1980)

    Google Scholar 

  14. R.Milner, "A theory of type polymorphism in programming", Journal of Computer and System Sciences 17 (1978).

    Google Scholar 

  15. R.Milner, "LCF: a way of doing proofs with a machine", Proc.8th MFCS Symposium, Olomouc, Czechoslovakia (1979).

    Google Scholar 

  16. R.Milner, "Implementation and application of Scott's logic for computable functions", Proc. ACM Conference on Proving Assertions about Programs, SIGPLAN notices (1972).

    Google Scholar 

  17. D. Scott, "Lattice theoretic models for various type-free calculi", Proc. 4th International Congress in Logic, Me thodology and Philosophy of Sciences, Bucharest (1972).

    Google Scholar 

  18. R.A.Wulf, R.L.London, M.Shaw, "Abstraction and verification in ALPHARD: introduction to language and methodology", Carnegie Mellon University, (1976).

    Google Scholar 

  19. S.Zilles, "Algebraic specification of data types", Computation Structures Group Memo 119. M.I.T. (1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Polish Academy of Sciences, PKiN, P.O. Box 22, 00-901, Warszawa, Poland

    Jacek Leszczylowski

Authors
  1. Jacek Leszczylowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Robert Kowalski

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leszczylowski, J. (1980). An experiment with "Edinburgh LCF". In: Bibel, W., Kowalski, R. (eds) 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980. CADE 1980. Lecture Notes in Computer Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10009-1_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-10009-1_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10009-6

  • Online ISBN: 978-3-540-38140-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation