This is a preview of subscription content, log in via an institution.
References
Hanus, M. Horn Clause Programs with Polymorphic Types: Semantics and Resolution. TAPSOFT'89, LNCS 352, 225–240, 1989.
Manna, Z. Mathematical Theory of Computation. Mc Graw-Hill, 1974.
Nieva, S. The Reasoner of MIZAR/LOG. Computerized Logic Teaching Bulletin, N. 2(1), 22–35, 1989.
Nieva, S. Una Lógica Computacional con Polimorfismo y Recursión y un Sistema de Deducción Automática basado en ella. Phd. Thesis, Fac. Matemáticas UCM, 1991.
Paulson, L.C. Logic and Computation. Cambridge Univ. Press, 1987.
Prazmowski, K. and Rudnicki, P. MIZAR-MSE Primer and User Guide. Tr 88-11, Univ. of Alberta, Dpt. of Comp. Sci. Edmonton, 1988.
Schmidt, D.A. Denotational Semantics. A Methodology for Language Development. Wm. C. Brown Publishers, 1986.
Scott, D.S. Domains for Denotational Semantics. ICALP'82, LNCS 140, 577–613, 1982.
Trybulec, A. and Blair, H. Computer Aided Reasoning. Logic of Programs LNCS 193, 406–412, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leach, J., Nieva, S. (1992). MIZ-PR: A theorem prover for polymorphic and recursive functions. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013094
Download citation
DOI: https://doi.org/10.1007/BFb0013094
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55727-2
Online ISBN: 978-3-540-47279-7
eBook Packages: Springer Book Archive