IMPS: An interactive mathematical proof system

@article{Farmer2004IMPSAI,
  title={IMPS: An interactive mathematical proof system},
  author={William M. Farmer and Joshua D. Guttman and F. Javier Thayer},
  journal={Journal of Automated Reasoning},
  year={2004},
  volume={11},
  pages={213-248}
}
IMPS is an interactive mathematical proof system intended as a general-purpose tool for formulating and applying mathematics in a familiar fashion. The logic of IMPS is based on a version of simple type theory with partial functions and subtypes. Mathematical specification and inference are performed relative to axiomatic theories, which can be related to one another via inclusion and theory interpretation. IMPS provides relatively large primitive inference steps to facilitate human control of… 

Figures and Topics from this paper

TPS: A theorem-proving system for classical type theory
TLDR
TPS has been designed to be a general research tool for manipulating wffs of first- and higher-order logic, and searching for proofs of such wFFs interactively or automatically, or in a combination of these modes.
Context Aware Calculation and Deduction
TLDR
This work addresses some aspects of a system architecture for mathematical assistants that integrates calculations and deductions by common infrastructure within the Isabelle theorem proving environment, and is able to implement proof methods that operate on abstract theories and a range of particular theory interpretations.
Theory-Specific Automated Reasoning
TLDR
Set Theory is referred to as the unifying background, and to a specific proof-checker based on a slightly unorthodox formalization of it as an arena for experimentation as a key point of integration in the large-scale computerized proof system.
A guided tour through TYPELAB
This report gives a survey of TYPELAB, a specification and verification environment that integrates interactive proof development and automated proof search. TYPELAB is based on a constructive type
Organizing Numerical Theories Using Axiomatic Type Classes
TLDR
The approach recently adopted for Isabelle uses axiomatic type classes, an established approach to overloading, forAbstract Mathematical reasoning may involve several arithmetic types, including those of the natural, integer, rational, real, and complex numbers.
Formalizing Abstract Algebra in Type Theory with Dependent Records
Our goal is to develop a general formalization of abstract algebra suitable for a general reasoning. One of the most common ways to formalize abstract algebra is to make use of a module system to
A 'Theory' Mechanism for a Proof-Verifier Based on First-Order Set Theory
  • E. Omodeo, J. Schwartz
  • Mathematics, Computer Science
    Computational Logic: Logic Programming and Beyond
  • 2002
TLDR
A version of classical set theory is outlined, designed to assist in proof development, which is indefinitely expansible with function symbols generated by Skolemization and embodies a modularization mechanism named 'theory'.
A realizability interpretation of Church's simple theory of types
TLDR
A realizability interpretation of an intuitionistic version of Church's Simple Theory of Types which can be viewed as a formalization of intuitionistic higher-order logic and includes operators for monotone induction and coinduction and simple realizers for them.
Partiality and recursion in interactive theorem provers – an overview
TLDR
This article reviews several techniques that have been proposed in the literature to simplify the formalization of partial and general recursive functions in interactive theorem provers and classifies them according to their theoretical basis and their practical use.
The Watson Theorem Prover
TLDR
The mathematical foundations of the prover and the way these are presented to a user are discussed, and the development of automated proof strategies are allowed in the same way as theorems.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 61 REFERENCES
A Simple Type Theory with Partial Functions and Subtypes
  • W. Farmer
  • Mathematics, Computer Science
    Ann. Pure Appl. Log.
  • 1993
TLDR
A version of simple type theory, called PF*, in which functions may be partial and types may have subtypes is presented, and it is proved that the axiomatic system is complete with respect to the general models semantics.
HOL: A Proof Generating System for Higher-Order Logic
HOL is a version of Robin Milner’s LCF theorem proving system for higher-order logic. It is currently being used to investigate (1) how various levels of hardware behaviour can be rigorously modelled
An introduction to mathematical logic and type theory - to truth through proof
  • Peter B. Andrews
  • Computer Science, Mathematics
    Computer science and applied mathematics
  • 1986
TLDR
This volume will be of interest to mathematicians, computer scientists, and philosophers in universities, as well as to computer scientists in industry who wish to use higher-order logic for hardware and software specification and verification.
A Partial Functions Version of Church's Simple Theory of Types
  • W. Farmer
  • Mathematics, Computer Science
    J. Symb. Log.
  • 1990
TLDR
This paper presents a version of Church's system called PF in which functions may be partial, and proves that PF is complete with respect to its semantics.
Completeness in the Theory of Types
  • L. Henkin
  • Mathematics, Computer Science
    J. Symb. Log.
  • 1950
TLDR
This proof demonstrates that each formula of the calculus is a formal theorem which becomes a true sentence under every one of a certain intended class of interpretations of the formal system.
Inference rules using local contexts
  • L. Monk
  • Mathematics, Computer Science
    Journal of Automated Reasoning
  • 2004
TLDR
Inference rules that take advantage of localized formulas are presented for sequent calculi in which the left hand side of sequents can be used to accumulate the background assumptions of assertions.
Analytica - A Theorem Prover in Mathematica
TLDR
This paper describes the structure of Analytica and explains the main techniques that it uses to construct proofs and illustrates the power of the theorem prover by several non-trivial examples including the basic properties of the stereographic projection and a series of three lemmas that lead to a proof of Weierstrass''s example of a continuous nowhere differentiable function.
Little Theories
TLDR
It is argued that the little theories approach is a desirable way to formalize mathematics, and it is described how imps, an Interactive Mathematical Proof System, supports it.
Integrating decision procedures into heuristic theorem provers: a case study of linear arithmetic
TLDR
This paper is a case study of how a linear arithmetic procedure was integrated into a heuristic theorem prover, and graphically illustrates the difference between a stand-alone decision procedure and one that is of use to a more powerful theoremProver.
Window Inference In The HOL System
  • J. Grundy
  • Computer Science
    1991., International Workshop on the HOL Theorem Proving System and Its Applications
  • 1991
TLDR
A window inference system can maintain sets of useful theorems and suppositions and be tailored to preserve any reflexive, transitive relation between successive expressions.
...
1
2
3
4
5
...