|
464
|
Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic,” Cambridge
– Gordon, Melham
- 1993
|
|
422
|
Mathematica : A system for doing mathematics by computer
– WOLFRAM
- 1991
|
|
387
|
A Computational Logic Handbook
– Boyer, Moore
- 1988
|
|
177
|
Algorithms for Computer Algebra
– Geddes, Czapor, et al.
- 1992
|
|
154
|
Isabelle: A Generic Theorem Prover, volume 828
– Paulson
|
|
60
|
Theorem proving with real numbers
– Harrison
- 1996
|
|
46
|
A system for computation in algebraic geometry and commutative algebra, available via anonymous ftp from math.uiuc.edu
– Bayer, Stillman
- 1996
|
|
44
|
Enhancing the NuPRL proof development system and applying it to computational abstract algebra
– Jackson
- 1995
|
|
33
|
Extracting text from proofs
– Coscoy, Kahn, et al.
- 1995
|
|
31
|
First Leaves: Tutorial Introduction to Maple
– Char
- 1992
|
|
21
|
The Automation of Reasoning: an Experimenter's Notebook with Otter Tutorial
– Wos
- 1996
|
|
16
|
Constructing recursion operators in intuitionistic type theory
– Paulson
- 1986
|
|
10
|
The Coq Proof Assistant: A Tutorial: Version 6.1
– HUET, KAHN, et al.
- 1997
|
|
3
|
AXIOM: the scientic computation system
– JENKS, SUTOR
- 1992
|
|
3
|
Objective Caml. Available at http://pauillac.inria.fr/ocaml
– Leroy
- 1997
|
|
2
|
Expressing computational complexity in constructive type theory. volume 960 of LNAI
– Constable
- 1994
|
|
2
|
and others, Implementing Mathematics with the Nuprl
– Constable
- 1986
|
|
2
|
Available at ftp://www.inria.fr/safir/pottier/mon
– lemma
- 1996
|
|
1
|
Faug#re. R#solution des syst#mes d'#quations alg#briques
– Charles
- 1994
|
|
1
|
An overview of the MIZAR projet
– Rudnicki
- 1992
|
|
1
|
Natajaran Shankar, and Mandayam Srivas. PVS: Combining speci cation, proof checking, and model checking
– Rushby
- 1996
|
|
