RT Journal Article
T1 MIZ-PR: A theorem prover for polymorphic and recursive functions
A1 Leach Albert, Javier
A1 Nieva Soto, Susana
PB Springer Verlag
SN 0302-9743
YR 1992
FD 1992
LK https://hdl.handle.net/20.500.14352/57756
UL https://hdl.handle.net/20.500.14352/57756
NO 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.
DS Docta Complutense
RD 8 may 2024