Sciweavers

9 search results - page 1 / 2
» Writing Constructive Proofs Yielding Efficient Extracted Pro...
Sort
View
ENTCS
2000
60views more  ENTCS 2000»
13 years 4 months ago
Writing Constructive Proofs Yielding Efficient Extracted Programs
The NuPRL system [3] was designed for interactive writing of machine
Aleksey Nogin
KBSE
1997
IEEE
13 years 8 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
ENTCS
2008
91views more  ENTCS 2008»
13 years 4 months ago
Implementing Real Numbers With RZ
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
Andrej Bauer, Iztok Kavkler
ENTCS
2008
121views more  ENTCS 2008»
13 years 4 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
POPL
2006
ACM
14 years 4 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand