Advertisement

An experiment with "Edinburgh LCF"

  • Jacek Leszczylowski
Thursday Morning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 87)

Keywords

Inference Rule Theorem Prover Induction Rule Primitive Function Structural Induction 
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.

Bibliography

  1. [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. [2]
    R.Bird, "Programs and Machines; and introduction to the theory of computation", Wiley (1976).Google Scholar
  3. [3]
    A.Blikle, "Assertion Programming", Proc. 8th MFCS Symposium, Olomouc, Czechoslovakia, (1979).Google Scholar
  4. [4]
    R.S. Boyer, J S. Moore, "A Computational Logic", Academic Press, New York (1979).Google Scholar
  5. [5]
    W.H. Burge, "Recursive Programming Techniques", Addison-Wesley, Reading, Mass. (1975).Google Scholar
  6. [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. [7]
    C.Cartwright, private communication.Google Scholar
  8. [8]
    A.Cohn, "High level proof in LCF", Proc. 4th Workshop on Automa ted deduction, Austin, Texas (1979).Google Scholar
  9. [9]
    A.Cohn, "Remarks on Machine Proof", 1980, manuscriptGoogle Scholar
  10. [10]
    M.Gordon, R.Milner, C.Wadsworth, "Edinburgh LCF", Springer-Verlag, (1979).Google Scholar
  11. [11]
    L.S. van Benthem Jutting, "Checking Landau's ‘GRUNDLAGEN’ in the AUTOMATH system", thesis, Tech.Hogeschule, Eidhoven, The Netherlands (1977).Google Scholar
  12. [12]
    F.W. von Henke, "Recursive data types and program structures", Internal report, GMD, Bonn (1976).Google Scholar
  13. [13]
    J.Leszczylowski, "Theory of FP systems in EDINBURGH LCF", Internal Report,Comp.Sci.Dep.,Univ.of Edinburgh, (1980)Google Scholar
  14. [14]
    R.Milner, "A theory of type polymorphism in programming", Journal of Computer and System Sciences 17 (1978).Google Scholar
  15. [15]
    R.Milner, "LCF: a way of doing proofs with a machine", Proc.8th MFCS Symposium, Olomouc, Czechoslovakia (1979).Google Scholar
  16. [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. [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. [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. [19]
    S.Zilles, "Algebraic specification of data types", Computation Structures Group Memo 119. M.I.T. (1974).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Jacek Leszczylowski
    • 1
  1. 1.Institute of Computer SciencePolish Academy of SciencesWarszawaPoland

Personalised recommendations