FP systems in edinburgh LCF
Part of the Lecture Notes in Computer Science book series (LNCS, volume 107)
KeywordsInference Rule Type Operator Induction Rule Theory Kernel Theory List
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.
- J. Backus, "Can programming be liberated from the von Neumann style? A functional programming style and its algebra of programs", Comm ACM 21, 8 (1978)Google Scholar
- R.Bird, "Programs and Machines; an introduction to the theory of computation", Wiley (1976)Google Scholar
- A.Cohn, "High level proof in LCF", Proc. 4th Workshop on Automated deduction, Austin, Texas (1979)Google Scholar
- M.Gordon, R.Milner, C.Wadsworth, "EDINBURGH LCF", Springer Verlag 1979Google Scholar
- J.Leszczyłowski, "An experiment with EDINBURGH LCF", Proceedings of Fifth Conference on Automated Deduction, France, (1980)Google Scholar
- J. Leszczyłowski, "Theory of FP systems in EDINBURGH LCF", Internal Report, Computer Science Department, Edinburgh University, Edinburgh, Scotland (1980)Google Scholar
- R.Milner, "A theory of type polymorphism in programming", Journal of Computer and System Sciences 17 (1978)Google Scholar
- R.Milner, "LCF: a way of doing proofs with a machine", Proceedings of 8th MFCS Symposium, Olomouc, Czechoslovakia (1979)Google Scholar
- 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
© Springer-Verlag Berlin Heidelberg 1981