Partial Objects in the Calculus of Constructions

Partial Objects in the Calculus of Constructions (1991)

by Philippe Audebaud

Citations:

18 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Partial Objects in the Calculus of Constructions	SVM HeaderParse 0.1
AUTHOR NAME	Philippe Audebaud	user correction - Legacy Corrections
ABSTRACT	Our purpose is to provide a typed framework for working with non terminating computations. The basic system is the Calculus of Constructions. It is extended using an original idea proposed by R.Constable and S.F.Smith and and implemented in Nuprl. From the computational point of view we get an equivalent of Kleene's theorem for partial recursive functions over the integers within an index-free setting. A larger class of algebraic types is dened. Logical aspects need more examination. But we already give a syntactic way for dealing with partial and total objects, leading to the notion of generic proof. 1 Introduction The Calculus of Constructions (CC for short) [8], [9] is a typed high-order functional calculus which provides a nice formalism for constructive proofs in natural deduction style. It can also be seen as a high-level functional programming language. Since F! is embeddable in it, we already know that any fonction over integers is denable on Nat (C : P rop)C ! (C ! C) !...	user correction - Legacy Corrections
YEAR	1991	user correction - Legacy Corrections
CITATIONS	4 found	ParsCit 1.0