Skip to search formSkip to main contentSkip to account menu

Nuprl

Known as: JohnMarkOckerbloom/Nuprl 
Nuprl is a proof development system, providing computer-mediated analysis and proofs of formal mathematical statements, and tools for software… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
The Intuitionistic Logic Theorem Proving (ILTP) library provides a platform for testing and benchmarking automated theorem… 
2006
2006
With the standard inference rule set for Nuprl, the type Atom cannot be proved either to be finite or infinite, despite the fact… 
2006
2006
Syntax : Syntax represented as data, similar to concrete syntax, except that irrelevant features are abstracted away. For this… 
2004
2004
Theorem provers for higher-order logics often use tactics to implement automated proof search. Often some basic tactics are… 
2003
2003
Abstract : A key decision in the development of high assurance software is that of choosing a formal methods tool. This paper… 
Review
1999
Review
1999
Isabelle and NuPRL are two theorem proving environments that are written in different dialects of ML using different formula… 
1997
1997
In order to use Nuprl system as a programming language with built-in verification one has to improve the efficiency of the… 
1996
1996
Logical Frameworks are one way to provide generic theorem provers. This paper describes another method using loose semantics. In… 
Review
1994
Review
1994
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences…