Sciweavers

85
Voted
ENTCS
2000
60views more  ENTCS 2000»
15 years 4 hour ago
Writing Constructive Proofs Yielding Efficient Extracted Programs
The NuPRL system [3] was designed for interactive writing of machine
Aleksey Nogin
96
Voted
JAPLL
2006
79views more  JAPLL 2006»
15 years 4 days ago
Innovations in computational type theory using Nuprl
For twenty years the Nuprl ("new pearl") system has been used to develop software systems and formal theories of computational mathematics. It has also been used to expl...
Stuart F. Allen, Mark Bickford, Robert L. Constabl...
93
Voted
TPHOL
1996
IEEE
15 years 4 months ago
Importing Mathematics from HOL into Nuprl
Nuprl and HOL are both tactic-based interactive theorem provers for higher-order logic, and both have been used in many substantial applications over the last decade. However, the ...
Douglas J. Howe
91
Voted
KBSE
1997
IEEE
15 years 4 months ago
Moving Proofs-As-Programs into Practice
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
James L. Caldwell
95
Voted
CADE
2000
Springer
15 years 4 months ago
The Nuprl Open Logical Environment
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-sc...
Stuart F. Allen, Robert L. Constable, Richard Eato...