Proofs as Programs

Authors:
Joseph L. Bates;Robert L. Constable
Affiliations:
-;-
Venue:
Proofs as Programs
Year:
1983

Citing 0
Cited 3

Data types are values

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Type Theory of PL/CV3

ACM Transactions on Programming Languages and Systems (TOPLAS)
Interactive proof checking

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

The significant intellectual cost of programming is for problem solving and explaining and not for coding. Yet, programming systems offer mechanical assistance exclusively with the coding process. Here we describe an implemented program development system, called PRL (``pearl''''), that provides automated assistance with the hard part. The program and its explanation are seen as formal objects in a constructive logic of the data domains. These formal explanations can be executed at various stages of completion. The most incomplete explanations resemble applicative programs, the most complete are formal proofs.