Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Mathematica: a system for doing mathematics by computer
Mathematica: a system for doing mathematics by computer
Programming in the 1990s: an introduction to the calculation of programs
Programming in the 1990s: an introduction to the calculation of programs
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
A logical approach to discrete math
A logical approach to discrete math
The Definition of Standard ML
Untyped lambda-Calculus with Relative Typing
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
An Overview of Rewrite Rule Laboratory (RRL)
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
IMPS: An Interactive Mathematical Proof System
Proceedings of the 10th International Conference on Automated Deduction
CAPSL Interface for the NRL Protocol Analyzer
ASSET '99 Proceedings of the 1999 IEEE Symposium on Application - Specific Systems and Software Engineering and Technology
On Unifying Some Cryptographic Protocol Logics
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
The maple symbolic computation system
ACM SIGSAM Bulletin
Hi-index | 0.00 |
Watson is a general-purpose system for formal reasoning. It is an interactive equational higher-order theorem prover. The higher-order logic supported by the prover is distinctive in being type free (it is a safe variant of Quine's iNF). Watson allows the development of automated proof strategies, which are represented and stored by the prover in the same way as theorems. The mathematical foundations of the prover and the way these are presented to a user are discussed. The paper also contains discussions of experiences with the prover and relations of the prover to other systems.