Abstract
The FGCS project in Japan did not select Lisp as a kernel language, but a logic programming language like Prolog because of its powerful functions based on unification and its high productivity. The logic programming language itself is based on theorem proving such as SLD resolution. Studies of theorem proving or proof checking play an essential role in the total plans of FGCS in Japan. Computer science has a history of only 40 years, while history of mathematics lasted over 2,000 years. I expect our approach to mechanization of mathematics will bring forth many contributions to FGCS project, for instance, the accumulated knowledge on knowledge, programming and inference.
While there are many systems for automated theorem proving and proof checking (10,11,12,13,14), most of them are stand alone systems and seem to be limited in their aims. In Japan, there were not many studies in the field when we decided to start our project. Now, CAP project started in the FGCS framework, and is planned to become a kernel system of many knowledge processing systems. The CAP-LA system is intended to be the first step to such a system.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. Ida, M.Sato, S.Hayashi, M.Hagiya et al, “Higher Order: its Implication to Programming Languages and Computational Models”, ICOT TM-29, 1983.
ICOT Working Group 5, “Several Aspects on Unification”, ICOT TM-46, 1984.
M. Sato, “Typed Logical Calculus”, TR-85-13, Dept. of Computer Science,Fac. of Science, Univ. of Tokyo, 1985.
M.Sato and T.Sakurai, “Qute: A Functional Language based on Unification”, Proceedings of the International Conference on Fifth Generation Computer Systems, pp157–165, 1984.
A.Kock, Synthetic Differential Geometry, London Mathematical Society Lecture Note Series 51, Cambridge University Press, pp311, 1981.
S.Hayashi, “Towards Automated Synthetic Differential Geometry 1 — basic categorical construction”, ICOT TR-104, 1985.
S.Uchida and T.Yokoi, “Sequential Inference Machine: SIM Progress Report”, ICOT TR-86, 1984.
T.Yokoi and S.Uchida, “Sequential Inference Machine: SIM Its Programming and Operating System”, ICOT TR-87, 1984.
T.Chikayama, “Unique Feature of ESP”, Proceedings of the International Conference of the Fifth Generation Computer System, Tokyo, pp292–298, 1984.
M.J.Gorden, A.J.Milner and C.P.Wadsworth, “Edinburgh LCF”, Lecture Notes in Computer Science,78, Springer, 1979.
J. Ketonen and J.S. Weening, “EKL — An Interactive Proof Checker, User's Reference Manual”, Department of Computer Science, Stanford Univ., 1983.
M.Hagiya and S.Hayashi, “Some Experiments on EKL”, ICOT TM-101, 1985.
A. Tryburec and H. Blair, “Computer Assisted Reasoning with Mizar”, I JCAI' 85, pp26–28, 1985.
N. Shanker, “Towards Mechanical Metamathematics”, Journal of Automated Reasoning, 1, pp407–434, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirose, K. (1986). An approach to proof checker. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016237
Download citation
DOI: https://doi.org/10.1007/BFb0016237
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16783-9
Online ISBN: 978-3-540-39909-4
eBook Packages: Springer Book Archive