Extending the Calculus of Constructions with Tarski's fix-point theorem
| dc.creator | Bertot, Yves | |
| dc.date | 2006-10-11 | |
| dc.date.accessioned | 2026-07-07T07:27:50Z | |
| dc.date.available | 2026-07-07T07:27:50Z | |
| dc.description | We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to potentially non-terminating functions. This is only possible if we extend the logical framework by adding the axioms that correspond to classical logic. We claim that the extended framework makes it possible to reason about terminating and non-terminating computations and we show that common facilities of the calculus of inductive construction, like program extraction can be extended to also handle the new functions. | |
| dc.identifier | https://arxiv.org/abs/cs/0610055 | |
| dc.identifier | http://arxiv.org/abs/cs/0610055 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/117518 | |
| dc.subject | Logic in Computer Science | |
| dc.title | Extending the Calculus of Constructions with Tarski's fix-point theorem | |
| dc.type | text |