Writing Constructive Proofs Yielding Efficient Extracted Programs

@article{Nogin2000WritingCP,
  title={Writing Constructive Proofs Yielding Efficient Extracted Programs},
  author={Aleksey Nogin},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2000},
  volume={37},
  pages={1-17}
}
The NuPRL system [3] was designed for interactive writing of machine–checked constructive proofs and for extracting algorithms from the proofs. The extracted algorithms are guaranteed to be correct 1 which makes it possible to use NuPRL as a programming language with built-in verification[1,5,7,8,9,10]. However it turned out that proofs written without algorithmic efficiency in mind often produce very inefficient algorithms — exponential and double-exponential ones for problems that can be… CONTINUE READING

References

Publications referenced by this paper.

=z n - 1) then f n else f i fi = if (f j =z n - 1) then f n else f j fi ` f i = f j |BY MoveToCon l 6 THENM SplitOnCon lITEs THENA Auto

J. L. Bates, R. L. Constable
Journal of Fun tional Programming • 1985

Similar Papers

Loading similar papers…