Preview
Unable to display preview. Download preview PDF.
Bibliography
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)
R.Bird, "Programs and Machines; an introduction to the theory of computation", Wiley (1976)
A.Cohn, "High level proof in LCF", Proc. 4th Workshop on Automated deduction, Austin, Texas (1979)
M.Gordon, R.Milner, C.Wadsworth, "EDINBURGH LCF", Springer Verlag 1979
J.LeszczyĆowski, "An experiment with EDINBURGH LCF", Proceedings of Fifth Conference on Automated Deduction, France, (1980)
J. LeszczyĆowski, "Theory of FP systems in EDINBURGH LCF", Internal Report, Computer Science Department, Edinburgh University, Edinburgh, Scotland (1980)
R.Milner, "A theory of type polymorphism in programming", Journal of Computer and System Sciences 17 (1978)
R.Milner, "LCF: a way of doing proofs with a machine", Proceedings of 8th MFCS Symposium, Olomouc, Czechoslovakia (1979)
R.Milner, "Implementation and application of Scott's logic for computable functions", Proc. ACM Conference on Proving assertions about Programs, SIGPLAN Notices (1972)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
LeszczyĆowski, J. (1981). FP systems in edinburgh LCF. In: DĂaz, J., Ramos, I. (eds) Formalization of Programming Concepts. ICFPC 1981. Lecture Notes in Computer Science, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10699-5_112
Download citation
DOI: https://doi.org/10.1007/3-540-10699-5_112
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10699-9
Online ISBN: 978-3-540-38654-4
eBook Packages: Springer Book Archive