Advertisement

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

  • Javier Leach
  • Susana Nieva
System Descriptions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 624)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Han 89]
    Hanus, M. Horn Clause Programs with Polymorphic Types: Semantics and Resolution. TAPSOFT'89, LNCS 352, 225–240, 1989.Google Scholar
  2. [Man 74]
    Manna, Z. Mathematical Theory of Computation. Mc Graw-Hill, 1974.Google Scholar
  3. [Nie 89]
    Nieva, S. The Reasoner of MIZAR/LOG. Computerized Logic Teaching Bulletin, N. 2(1), 22–35, 1989.Google Scholar
  4. [Nie 91]
    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.Google Scholar
  5. [Pau 87]
    Paulson, L.C. Logic and Computation. Cambridge Univ. Press, 1987.Google Scholar
  6. [PR 88]
    Prazmowski, K. and Rudnicki, P. MIZAR-MSE Primer and User Guide. Tr 88-11, Univ. of Alberta, Dpt. of Comp. Sci. Edmonton, 1988.Google Scholar
  7. [Sch 86]
    Schmidt, D.A. Denotational Semantics. A Methodology for Language Development. Wm. C. Brown Publishers, 1986.Google Scholar
  8. [Sco 82]
    Scott, D.S. Domains for Denotational Semantics. ICALP'82, LNCS 140, 577–613, 1982.Google Scholar
  9. [TB 85]
    Trybulec, A. and Blair, H. Computer Aided Reasoning. Logic of Programs LNCS 193, 406–412, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Javier Leach
    • 1
  • Susana Nieva
    • 1
  1. 1.Dpto. de Informática y AutomáticaFac. de Matemáticas U.C.M.MadridSpain

Personalised recommendations