Results 1 
7 of
7
Compiling polymorphism using intensional type analysis
 In Symposium on Principles of Programming Languages
, 1995
"... The views and conclusions contained in this document are those of the authors and should not be interpreted as ..."
Abstract

Cited by 260 (18 self)
 Add to MetaCart
The views and conclusions contained in this document are those of the authors and should not be interpreted as
NuprlLight: An implementation framework for higherorder logics
 IN 14TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION
, 1997
"... Recent developments in higherorder logics and theorem prover design have led to an ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
Recent developments in higherorder logics and theorem prover design have led to an
A conservative look at term deduction systems with variable binding
, 1995
"... We set up a formal framework to describe term deduction systems, such as transition system speci cations in the style of Plotkin, and conditional term rewriting systems. This framework has the power to express manysortedness, general binding mechanisms and substitutions, among other notions such as ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We set up a formal framework to describe term deduction systems, such as transition system speci cations in the style of Plotkin, and conditional term rewriting systems. This framework has the power to express manysortedness, general binding mechanisms and substitutions, among other notions such as negative premises and unary predicates on terms. The framework is used to present a conservativity format in operational semantics, which states sufficient criteria to ensure that the extension of a transition system specification with new rules does not affect the behaviour of the original terms. Furthermore, we showhowgeneral theorems in structured operational semantics can be transformed into results in conditional term rewriting. We apply this approach to the conservativity theorem, which yields a result that is useful in the field of abstract data types.
Fast Tacticbased Theorem Proving
 TPHOLs 2000, LNCS 1869
, 2000
"... Theorem provers for higherorder logics often use tactics to implement automated proof search. Tactics use a generalpurpose metalanguage to implement both generalpurpose reasoning and computationally intensive domainspecific proof procedures. The generality of tactic provers has a performance pe ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Theorem provers for higherorder logics often use tactics to implement automated proof search. Tactics use a generalpurpose metalanguage to implement both generalpurpose reasoning and computationally intensive domainspecific proof procedures. The generality of tactic provers has a performance penalty; the speed of proof search lags far behind specialpurpose provers. We present a new modular proving architecture that significantly increases the speed of the core logic engine.
Decidability Extracted: Synthesizing ``CorrectbyConstruction'' Decision Procedures from Constructive Proofs
, 1998
"... The topic of this thesis is the extraction of efficient and readable programs from formal constructive proofs of decidability. The proof methods employed to generate the efficient code are new and result in clean and readable Nuprl extracts for two nontrivial programs. They are based on the use of ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The topic of this thesis is the extraction of efficient and readable programs from formal constructive proofs of decidability. The proof methods employed to generate the efficient code are new and result in clean and readable Nuprl extracts for two nontrivial programs. They are based on the use of Nuprl's set type and techniques for extracting efficient programs from induction principles. The constructive formal theories required to express the decidability theorems are of independent interest. They formally circumscribe the mathematical knowledge needed to understand the derived algorithms. The formal theories express concepts that are taught at the senior college level. The decidability proofs themselves, depending on this material, are of interest and are presented in some detail. The proof of decidability of classical propositional logic is relative to a semantics based on Kleene's strong threevalued logic. The constructive proof of intuitionistic decidability presented here is the first machine formalization of this proof. The exposition reveals aspects of the Nuprl tactic collection relevant to the creation of readable proofs; clear extracts and efficient code are illustrated in the discussion of the proofs.
Intuitionisitic Tableau Extracted
 In Proceedings of International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX’99), volume 1617 of LNAI
, 1999
"... . This paper presents a formalization of a sequent presentation of intuitionisitic propositional logic and proof of decidability.The proof is implemented in the Nuprl system and the resulting proof object yields a "correctbyconstruction" program for deciding intuitionisitc propositional sequents. ..."
Abstract
 Add to MetaCart
. This paper presents a formalization of a sequent presentation of intuitionisitic propositional logic and proof of decidability.The proof is implemented in the Nuprl system and the resulting proof object yields a "correctbyconstruction" program for deciding intuitionisitc propositional sequents. The extracted program turns out to be an implementation of the tableau algorithm. If the argument to the resulting decision procedure is a valid sequent, a formal proof of that fact is returned, otherwise a counterexample in the form of a Kripke Countermodel is returned. The formalization roughly follows Aitken, Constable and Underwood's presentation in [1] but a number of adjustments and corrections have been made to ensure the extracted program is clean( no noncomputational junk) and efficient. 1