Leach Albert, JavierNieva Soto, SusanaVoronkov , Andrei2023-06-202023-06-201992Hanus, 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.3-540-55727-Xhttps://hdl.handle.net/20.500.14352/60589International Conference LPAR '92 St. Petersburg, Russia, July 15–20, 1992 ProceedingsMIZ-PR: A Theorem Prover for Polymorphic and Recursive Functionsbook parthttp://dl.acm.org/citation.cfm?id=758070http://dl.acm.org/dl.cfm?CFID=219986691&CFTOKEN=59343438metadata only access004.8Inteligencia artificial (Informática)1203.04 Inteligencia Artificial