Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

114

ENTCS
2000

60views more ENTCS 2000»

Writing Constructive Proofs Yielding Efficient Extracted Programs

15 years 2 months ago

Writing Constructive Proofs Yielding Efficient Extracted Programs

Download www.nuprl.org

The NuPRL system [3] was designed for interactive writing of machine

Aleksey Nogin

Real-time Traffic

Algorithm | ENTCS 2000 | Nuprl | NuPRL Automata Library |

claim paper

Related Content

» Moving ProofsAsPrograms into Practice

» Implementing Real Numbers With RZ

» Building Certified Static Analysers by Modular Construction of Wellfounded Lattices

» Small bisimulations for reasoning about higherorder imperative programs

» ContinuationPassing C compiling threads to events through continuations

» Metaprogramming with names and necessity

» A Dependent Set Theory

» More On Implicit Syntax

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	ENTCS
Authors	Aleksey Nogin

Comments (0)