## The Nuprl Open Logical Environment (2000)

### Cached

### Download Links

- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 44 - 16 self |

### BibTeX

@INPROCEEDINGS{Allen00thenuprl,

author = {S. F. Allen and R. L. Constable and R. Eaton and C. Kreitz and L. Lorigo},

title = {The Nuprl Open Logical Environment},

booktitle = {},

year = {2000},

pages = {170--176},

publisher = {Springer Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

The Nuprl system is a framework for reasoning about mathematics and programming. Over the years its design has been substantially improved to meet the demands of large-scale applications. Nuprl LPE, the newest release, features an open, distributed architecture centered around a flexible knowledge base and supports the cooperation of independent formal tools. This paper gives a brief overview of the system and the objectives that are addressed by its new architecture.

### Citations

677 |
Mathematica: A System for Doing Mathematics by Computer
- Wolfram
- 1988
(Show Context)
Citation Context ...everal refiners and evaluators simultaneously, e.g. the Nuprl and MetaPRL [Met] refiners, major systems like HOL, PVS, Ωmega, or SPECWARE [SJ95], decision procedures, first-order provers, Mathematic=-=a [Wol88]-=-, and the Maude [C + 99b] rewrite engine, and to have them cooperate through the library, which stores the formal knowledge required by these tools. It is also possible to run different refiners in pa... |

541 |
Introduction to HOL: A Theorem Proving Environment for Higher Order Logic.” Cambridge
- Gordon, Melham
- 1993
(Show Context)
Citation Context ...ite engines, model checkers, and computer algebra systems have been very successful in their respective areas, but have limited application domains. Proof assistants like Nuprl, Isabelle [Pau90], HOL =-=[GM93], -=-PVS [O + 96], and Ωmega [B + 97] are more general but at a lesser degree of automation. Each of these systems has accumulated a substantial amount of formalized knowledge in its respective formalism... |

187 |
Isabelle: The next 700 theorem provers
- Paulson
- 1990
(Show Context)
Citation Context ...lanners, rewrite engines, model checkers, and computer algebra systems have been very successful in their respective areas, but have limited application domains. Proof assistants like Nuprl, Isabelle =-=[Pau90], -=-HOL [GM93], PVS [O + 96], and Ωmega [B + 97] are more general but at a lesser degree of automation. Each of these systems has accumulated a substantial amount of formalized knowledge in its respecti... |

149 |
Intuitionistic type theory," Bibliopolis
- Martin-Lof
- 1984
(Show Context)
Citation Context ...ed mathematical knowledge as well as for the synthesis, verification, and optimization of software. The original system was based on a significant extension of Martin-Löf’s intuitionistic Type Theo=-=ry [ML84]-=-, which includes formalizations of the fundamental concepts of mathematics, data types, and programming. The system itself supports interactive and tactic-based reasoning, decision procedures, evaluat... |

78 | Building reliable, high-performance communication systems from components - Liu, Kreitz, et al. - 1999 |

75 | Specware: Formal support for composing software
- Srinivas, Jüllig
- 1995
(Show Context)
Citation Context ...rarily many other processes. This allows the user to connect several refiners and evaluators simultaneously, e.g. the Nuprl and MetaPRL [Met] refiners, major systems like HOL, PVS, Ωmega, or SPECWAR=-=E [SJ95]-=-, decision procedures, first-order provers, Mathematica [Wol88], and the Maude [C + 99b] rewrite engine, and to have them cooperate through the library, which stores the formal knowledge required by t... |

38 | Maude as a formal meta-tool - Clavel, Durán, et al. - 1999 |

27 | A proof environment for the development of group communication systems - Kreitz, Hayden, et al. - 1998 |

24 |
The Nuprl proof development system, version 4.2 reference manual and user’s guide
- Jackson
- 1995
(Show Context)
Citation Context ...s to all formalisms that have been translated into Maude. In the current standard configuration, which we call Nuprl 5, the system essentially provides an extended functionality of the Nuprl 4 system =-=[Jac94]-=-. It consists of the library, the Nuprl 5 editor, and the Nuprl 5 refiner. The library contains all the definitions, theorems, inference rules, and tactics of Nuprl 4 as well as the structure objects ... |

14 | Implementing Mathematics with the NuPRL proof development system - al - 1986 |

14 | Hybrid interactive theorem proving using Nuprl and HOL - Felty, Howe - 1997 |

12 | Formal reasoning about communication systems I: Embedding ML into type theory - Kreitz - 1997 |

7 | Automated fast-track reconfiguration of group communication systems. Pages 104–118 of - Kreitz - 1999 |

6 | Importing Isabelle formal mathematics into Nuprl
- Naumov
- 1999
(Show Context)
Citation Context ...Mat]. We are currently working on connecting a variety of external refiners such as a constructive first-order theorem prover [K + 00], the HOL system (via Maude [C + 99a]), Mathematica, and Isabelle =-=[Nau99]-=-. We will also emulate the refiner of Nuprl 3 in order to be able to restore older theories that had not been migrated during the transition to Nuprl 4. 4 Progress and Availability Nuprl LPE is the re... |

4 |
Publishing formal mathematics on the web
- Naumov
- 1998
(Show Context)
Citation Context ...the previous release of Nuprl in order to ensure upward compatibility, as well as valuable extensions for facilitating proof browsing, merging, replaying and accounting. There is also a web front end =-=[Nau98]-=- that allows external users to browse the Nuprl library without having to install the whole system. Inference Engines. The Nuprl 5 inference engine refines proof goals by executing ML code that may in... |

3 | Ωmega: Towards a mathematical assistant - al - 1997 |

2 |
Verifying a logic synthesis tool
- Aagaard, Leeser
- 1993
(Show Context)
Citation Context ...ied knowledge from various domains. Since its first release in 1984 it has been used in increasingly large applications in mathematics and programming, such as verifications of a logic synthesis tool =-=[AL93]-=- and of the SCI cache coherency protocol [How96] as well as the verification and optimization of group communication systems [KHH98,Kre99,L + 99]. Over the years it has turned out that the rapidly gro... |

1 |
Importing mathematics from HOL into NuPRL. Theorem Proving
- Howe
- 1996
(Show Context)
Citation Context ...irst release in 1984 it has been used in increasingly large applications in mathematics and programming, such as verifications of a logic synthesis tool [AL93] and of the SCI cache coherency protocol =-=[How96]-=- as well as the verification and optimization of group communication systems [KHH98,Kre99,L + 99]. Over the years it has turned out that the rapidly growing demands for formal knowledge and tools cann... |

1 | PVS: Combining specification, proof checking and model checking - al - 1996 |