Internal program extraction in the calculus of inductive constructions
Based on the Calculus of Constructions extended with inductive definitions we present a Theory of Specifications with rules for simultaneously constructing programs and their correctness proofs. The theory contains types for representing specifications, whose corresponding notion of implementation i...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | report |
| Published: |
2002
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.12008/3487 |
| Tags: |
No Tags, Be the first to tag this record!
|
| Summary: | Based on the Calculus of Constructions extended with inductive definitions we present a Theory of Specifications with rules for simultaneously constructing programs and their correctness proofs. The theory contains types for representing specifications, whose corresponding notion of implementation is that of a pair formed by a program and a correctness proof. The rules of the theory are sych that in implementations the program parts appear mixed together with the proof parts. A reduction relation performs the task of separating programs from proofs. Consequently, every implementation computes to a pair composed of a program and a proof of its correctness, and so the program extraction procedure is immediate. |
|---|