Results 1 -
9 of
9
HOL Light: A tutorial introduction
- Proceedings of the First International Conference on Formal Methods in Computer-Aided Design (FMCAD’96), volume 1166 of Lecture Notes in Computer Science
, 1996
"... HOL Light is a new version of the HOL theorem prover. While retaining the reliability and programmability of earlier versions, it is more elegant, lightweight, powerful and automatic; it will be the basis for the Cambridge component of the HOL-2000 initiative to develop the next generation of HOL th ..."
Abstract
-
Cited by 52 (9 self)
- Add to MetaCart
HOL Light is a new version of the HOL theorem prover. While retaining the reliability and programmability of earlier versions, it is more elegant, lightweight, powerful and automatic; it will be the basis for the Cambridge component of the HOL-2000 initiative to develop the next generation of HOL theorem provers. HOL Light is written in CAML Light, and so will run well even on small machines, e.g. PCs and Macintoshes with a few megabytes of RAM. This is in stark contrast to the resource-hungry systems which are the norm in this field, other versions of HOL included. Among the new features of this version are a powerful simplifier, effective first order automation, simple higher-order matching and very general support for inductive and recursive definitions.
Gradual computerisation/formalisation of mathematical texts into Mizar
- From Insight to Proof: Festschrift in Honour of Andrzej Trybulec
"... Abstract. We explain in this paper the gradual computerisation process of an ordinary mathematical text into more formal versions ending with a fully formalised Mizar text. The process is part of the MathLang–Mizar project and is divided into a number of steps (called aspects). The first three aspec ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
Abstract. We explain in this paper the gradual computerisation process of an ordinary mathematical text into more formal versions ending with a fully formalised Mizar text. The process is part of the MathLang–Mizar project and is divided into a number of steps (called aspects). The first three aspects (CGa, TSa and DRa) are the same for any MathLang–TP project where TP is any proof checker (e.g., Mizar, Coq, Isabelle, etc). These first three aspects are theoretically formalised and implemented and provide the mathematician and/or TP user with useful tools/automation. Using TSa, the mathematician edits his mathematical text just as he would use L ATEX, but at the same time he sees the mathematical text as it appears on his paper. TSa also gives the mathematician easy editing facilities to help assign to parts of the text, grammatical and mathematical roles and to relate different parts through a number of mathematical, rethorical and structural relations. MathLang would then automatically produce CGa and DRa versions of the text, checks
First Order Logic in Practice
- In Proc. FTP
, 1997
"... Now, although interactive provers may require manual guidance, it's desirable to provide quite high levels of automation so that the user avoids the tedious filling in of trivial details. Indeed, the most effective recent systems such as PVS do provide quite powerful automation for special theories ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Now, although interactive provers may require manual guidance, it's desirable to provide quite high levels of automation so that the user avoids the tedious filling in of trivial details. Indeed, the most effective recent systems such as PVS do provide quite powerful automation for special theories felt to be particularly important in practice, e.g. linear arithmetic and propositional tautology checking. But what about the automation of pure, typically first order, logic? There have been attempts since at least SAM [4] to harness automation of pure logic in interactive systems. Yet a common view today is that automation of theories like linear arithmetic is far more significant in practice.
VSDITLU: a verifiable symbolic definite integral table look-up
, 1999
"... We present a verifiable symbolic de nite integral table lookup: a system which matches a query, comprising a definite integral with parameters and side conditions, against an entry in a verifiable table and uses a call to a library of facts about the reals in the theorem prover PVS to aid in the tra ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
We present a verifiable symbolic de nite integral table lookup: a system which matches a query, comprising a definite integral with parameters and side conditions, against an entry in a verifiable table and uses a call to a library of facts about the reals in the theorem prover PVS to aid in the transformation of the table entry into an answer. Our system is able to obtain correct answers in cases where standard techniques implemented in computer algebra systems fail. We present the full model of such a system as well as a description of our prototype implementation showing the efficacy of such a system: for example, the prototype is able to obtain correct answers in cases where computer algebra systems [CAS] do not. We extend upon Fateman's web-based table by including parametric limits of integration and queries with side conditions.
Computer Theorem Proving in Math
"... We give an overview of issues surrounding computerverified theorem proving in the standard pure-mathematical context. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We give an overview of issues surrounding computerverified theorem proving in the standard pure-mathematical context.
Digitisation, Representation and Formalisation Digital Libraries of Mathematics
"... Abstract. One of the main tasks of the mathematical knowledge management community must surely be to enhance access to mathematics on digital systems. In this paper we present a spectrum of approaches to solving the various problems inherent in this task, arguing that a variety of approaches is both ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. One of the main tasks of the mathematical knowledge management community must surely be to enhance access to mathematics on digital systems. In this paper we present a spectrum of approaches to solving the various problems inherent in this task, arguing that a variety of approaches is both necessary and useful. The main ideas presented are about the differences between digitised mathematics, digitally represented mathematics and formalised mathematics. Each has its part to play in managing mathematical information in a connected world. Digitised material is that which is embodied in a computer file, accessible and displayable locally or globally. Represented material is digital material in which there is some structure (usually syntactic in nature) which maps to the mathematics contained in the digitised information. Formalised material is that in which both the syntax and semantics of the represented material, is automatically accessible. Given the range of mathematical information to which access is desired, and the limited resources available for managing that information, we must ensure that these resources are applied to digitise, form representations of or formalise, existing and new mathematical information in such a way as to extract the most benefit from the least expenditure of resources. We also analyse some of the various social and legal issues which surround the practical tasks. 1
Towards the Mechanical Verification of Textbook Proofs
"... Our goal is to implement a program for the machine verification of textbook proofs. We study the task from both the linguistics and automated reasoning perspective and give an in-depth analysis for a sample textbook proof. We propose a framework for natural language proof understanding that extends ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Our goal is to implement a program for the machine verification of textbook proofs. We study the task from both the linguistics and automated reasoning perspective and give an in-depth analysis for a sample textbook proof. We propose a framework for natural language proof understanding that extends and integrates state-of-the-art technologies from Natural Language Processing (Discourse Representation Theory) and Automated Reasoning (Proof Planning) in a novel and promising way, having the potential to initiate progress in both of these disciplines.

