Complutense University Library

MIZ-PR: A theorem prover for polymorphic and recursive functions

Leach Albert, Javier and Nieva Soto, Susana (1992) MIZ-PR: A theorem prover for polymorphic and recursive functions. Lecture Notes in Computer Science, 624 . pp. 481-483. ISSN 0302-9743

Official URL: http://link.springer.com/chapter/10.1007%2FBFb0013094#

View download statistics for this eprint

==>>> Export to other formats



Item Type:Article
Subjects:Sciences > Computer science > Programming languages (Electronic computers)
ID Code:17395
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.

Deposited On:12 Dec 2012 09:19
Last Modified:12 Dec 2012 09:19

Repository Staff Only: item control page