P. B. Jackson. The Nuprl Proof Development System. Version 4.1 Reference Manual and User's Guide. Cornell University, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....an important role since it attempts to give a unifying framework to what seems to be a jungle of formalisms for the one who enters for the rst time into the eld of Type Theory. Most modern proof assistants based on the Curry Howard isomorphism such as Alf [11] Coq [3] LEGO [10] or Nuprl [7] implement a formalism which belongs to this family. 2 Despite of this, PTS based formalisms have some practical and theoretical drawbacks, due to the inherent verbosity of their terms, which tends to over 1 Formerly called Generalized Type Systems. 2 In fact, this is only true for the ....

Paul B. Jackson. The Nuprl proof development system, version 4.1 reference manual and user's guide. Technical report, Cornell University, 1994.

....computation. For more than twenty years we have been designing, implementing and applying constructive systems to the formalization of algorithmic mathematics and to modeling and verifying complex computer systems. Our production system, Nuprl [7] has been used in several major applications [15, 5, 14, 1] and has been used to solve dicult problems in mathematics [17, 16, 13] The mathematics formalized in the system have been used to teach computer science and logic courses [8] Many of the questions that arise in an e ort to build a global digital library of mathematics arise also in the formal ....

Paul B. Jackson. The Nuprl Proof Development System, Version 4.1 Reference Manual and User's Guide. Cornell University, Ithaca, NY, February 1994.

....the type for successful application of the substitution. Then the goal is forced to fail and the extracted type information will be used for the original proof. The last improvement allows premises of the current proof goal to be used as waverules if they are in NuPRL s universal formulae format [14]. So second order proofs over universally quantified functions can be established by using the recursive definitions of these functions in the premises as waverules. Many additional improvements have been made for adapting the basic translation approach to the rippling distance strategy. ....

P. Jackson. The NuPRL Proof Development System, Version 4.1. Reference Manual and User's Guide, Cornell University, 1994. 24

....commutativity waverules. 3.3 Integrating the Rippling Distance Strategy into NuPRL In [21] we have integrated an external rippling prover into the NuPRL system which uses the rippling distance strategy with dynamic rule annotations for guiding proof search. The prover is implemented in NuPRL ML [13] and called during a NuPRL proof session via a tactic Ripple. This tactic prepares the proof goal for the prover by applying an appropriate induction scheme and extracting the induction step. After the prover has solved this step case the resulting rippling proof will be translated back into a ....

P. Jackson. NuPRL's Metalanguage ML. Reference Manual and User's Guide, Cornell University, 1994.

....a stack of states. States can be pushed and popped from this stack. They can also be saved and restored as ML values in the program code. Proof states are not stored independently, although they are stored as part of the ML database when the Isabelle image is saved and restored. 3. 4 Nuprl Nuprl [16, 27] is an interactive proof system for constructive mathematics based on Martin Lof s intuitionistic type theory. This type theory is constructive, so when a theorem is proved a constructive witness to its truth can be extracted from the proof. At the user level Nuprl has an X interface, but this ....

Paul Jackson. The Nuprl proof development system, version 4.2 reference manual and user's guide. URL: http://www.cs.cornell.edu/Info/ Projects/NuPrl/manual.with.index/it.html, 1996.

....Douglas J. Howe, T.B. Knoblock, N.P. Mendler, P. Panangaden, James T. Sasaki, and Scott F. Smith. Implementing Mathematics with the Nuprl Development System. Prentice Hall, NJ, 1986. 10] Thierry Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76:95 120, 1988. [11] Y. Coscoy, G. Kahn, and L. Th ery. Extracting text from proofs. In Typed Lambda Calculus and its Applications, volume 902 of Lecture Notes in Computer Science, pages 109 123, 1995. 12] N. G. deBruijn. Set theory with type restrictions. In V.T. Sos A. Jahnal, R. Rado, editor, Infinite and ....

....name relfam. It displays as Relation Family : lt] le] j: eq] ge] gt] Examples include for the standard order relations on the integers Relation Family : i j : i j j: i = j : i j : i j and for the divides and associate relation in a theory of cancellation monoids [11] Relation Family : a p b in g : a b in g j: a g b : a by b in g : If there are no defined order relations associated with an equivalence relation, then there is no need to include the equivalence relation in an order relation family. It is quite permissable (and not infrequent) ....

Paul B. Jackson. The Nuprl Proof Development System, Version 4.1 Reference Manual and User's Guide. Cornell University, Ithaca, NY, February 1994.

....the type for a successful application of the substitution. Then the goal is forced to fail and the extracted type information will be used for the original proof. The last improvement allows premises of the current proof goal to be used as wave rules if they are in NuPRL s universal formula format [16]. So second order proofs over universally quantified functions can be established by using the recursive definitions of these functions in the premises as wave rules. Many additional improvements have been made for adapting the basic translation approach to the rippling distance strategy. ....

P. Jackson. The NuPRL Proof Development System, Version 4.1. Reference Manual and User's Guide, Cornell University, 1994.

....wave rules. 3.3 Integrating the Rippling Distance Strategy into NuPRL In [23] we have described the integration of an external rippling prover into the NuPRL system which uses rippling distance with dynamic rule annotations for guiding a proof search. The prover is implemented in NuPRL ML [15] and called during a NuPRL proof session via a tactic Ripple. This tactic prepares the proof goal for the prover by applying an appropriate induction scheme and extracting the induction step. After the prover has solved this step case the resulting rippling proof will be translated back into a ....

P. Jackson. NuPRL's Metalanguage ML. Reference Manual and User's Guide, Cornell University, 1994.

No context found.

Paul B. Jackson. The Nuprl Proof Development System, Version 4.2 Reference Manual and User's Guide. The PRL Group at Cornell University, 1996.

No context found.

P. B. Jackson. The Nuprl Proof Development System. Version 4.1 Reference Manual and User's Guide. Cornell University, 1994.

No context found.

P. B. Jackson. The Nuprl Proof Development System. Version 4.1 Reference Manual and User's Guide. Cornell University, 1994.

No context found.

Paul B. Jackson. The Nuprl Proof Development System, Version 4.1 Reference Manual and User's Guide. Cornell University, Ithaca, NY, February 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC