Results 1 
6 of
6
tps: A theorem proving system for classical type theory
 Journal of Automated Reasoning
, 1996
"... This is a description of TPS, a theorem proving system for classical type theory (Church’s typed λcalculus). TPS has been designed to be a general research tool for manipulating wffs of first and higherorder logic, and searching for proofs of such wffs interactively or automatically, or in a comb ..."
Abstract

Cited by 71 (6 self)
 Add to MetaCart
This is a description of TPS, a theorem proving system for classical type theory (Church’s typed λcalculus). TPS has been designed to be a general research tool for manipulating wffs of first and higherorder logic, and searching for proofs of such wffs interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction proofs. Examples of theorems which TPS can prove completely automatically are given to illustrate certain aspects of TPS’s behavior and problems of theorem proving in higherorder logic. 7
TPS: A TheoremProving System for Classical Type Theory
, 1996
"... . This is description of TPS, a theoremproving system for classical type theory (Church's typed #calculus). TPS has been designed to be a general research tool for manipulating wffs of first and higherorder logic, and searching for proofs of such wffs interactively or automatically, or in a comb ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
. This is description of TPS, a theoremproving system for classical type theory (Church's typed #calculus). TPS has been designed to be a general research tool for manipulating wffs of first and higherorder logic, and searching for proofs of such wffs interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction proofs. Examples of theorems that TPS can prove completely automatically are given to illustrate certain aspects of TPS's behavior and problems of theorem proving in higherorder logic. AMS Subject Classification: 0304, 68T15, 03B35, 03B15, 03B10. Key words: higherorder logic, type theory, mating, connection, expansion proof, natural deduction. 1. Introduction TPS is a theoremproving system for classical type theory ## (Church's typed #calculus [20]) which has been under development at Carnegie Mellon University for a number years. This paper gives a general...
Graphical Effects in Learning Logic: Reasoning, Representation and Individual Differences
"... Hyperproof is a computer program created by Barwise and Etchemendy for teaching logic using multimodal graphical and sentential methods, inspired by their theories of heterogeneous reasoning (Barwise and Etchemendy 1994). Elsewhere, we have proposed a theory of the cognitive impact of assigning info ..."
Abstract

Cited by 15 (10 self)
 Add to MetaCart
Hyperproof is a computer program created by Barwise and Etchemendy for teaching logic using multimodal graphical and sentential methods, inspired by their theories of heterogeneous reasoning (Barwise and Etchemendy 1994). Elsewhere, we have proposed a theory of the cognitive impact of assigning information to different modalities (Stenning and Oberlander 1992). Our view is that where diagrams are advantageous, it is becausethey enforce the representation of information, leading to weak expressiveness, thereby facilitating inference. The present study tests and develops these claims by comparing the effects of teaching undergraduate logic classes using Hyperproof and a control syntactic teaching method. Results indicate that there is significant transfer from the logic courses to logical and analytical reasoning problems. There are also significant interactions between theoretically motivated precourse aptitude measuresand teaching method; the interactions influence postcoursereasoning...
ETPS: A System to Help Students Write Formal Proofs
 Journal of Automated Reasoning
, 2002
"... ETPS (Educational Theorem Proving System) is a program which logic students can use to write formal proofs in rstorder logic or higherorder logic. It enables students to concentrate on the essential logical problems involved in proving theorems, and automatically checks the proofs. ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
ETPS (Educational Theorem Proving System) is a program which logic students can use to write formal proofs in rstorder logic or higherorder logic. It enables students to concentrate on the essential logical problems involved in proving theorems, and automatically checks the proofs.
TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory
 Higher Order Logic Theorem Proving and Its Applications: 6th International Workshop, HUG '93, volume 780 of Lecture Notes in Computer Science
, 1994
"... This is a demonstration of TPS, a theorem proving system for classical type theory (Church's typed lcalculus). TPS can be used interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This is a demonstration of TPS, a theorem proving system for classical type theory (Church's typed lcalculus). TPS can be used interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction proofs. CATEGORY: Demonstration 1. Introduction This presentation is a demonstration of TPS, a theorem proving system for classical type theory (Church's typed 3 lcalculus [14]) which has been under development at Carnegie Mellon University for a number of years. TPS is based on an approach to automated theorem proving called the mating method [2], which is essentially the same as the connection method developed independently by Bibel [13]. The mating method does not require reduction to clausal form. TPS handles two sorts of proofs, natural deduction proofs and expansion proofs. Natural deduction proofs are humanreadable formal proofs. An example of such a proof which was produced aut...
Microsoft Corporation,
"... Teaching and learning formal programming language theory is hard, in part because it’s easy to make mistakes and hard to find them. Proof assistants can help check proofs, but their learning curve is too steep to use in most classes, and is a barrier to researchers too. In this paper we present SASy ..."
Abstract
 Add to MetaCart
Teaching and learning formal programming language theory is hard, in part because it’s easy to make mistakes and hard to find them. Proof assistants can help check proofs, but their learning curve is too steep to use in most classes, and is a barrier to researchers too. In this paper we present SASyLF, an LFbased proof assistant specialized to checking theorems about programming languages and logics. SASyLF has a simple design philosophy: language and logic syntax, semantics, and metatheory should be written as closely as possible to the way it is done on paper. We describe how we designed the SASyLF syntax to be accessible to students learning type theory, and how students can understand its semantics directly in terms of the theory they are taught in class. SASyLF can express proofs typical of an introductory graduate type theory course. SASyLF proofs are generally very explicit, but its builtin support for variable binding provides substitution properties for free and avoids awkward variable encodings. We describe preliminary experience teaching with SASyLF.