Partial computations in constructive type theory

Partial computations in constructive type theory (1991)

by Scott F. Smith

Venue:	JOURNAL OF LOGIC AND COMPUTATION
Citations:	7 - 5 self

User correction supplied by mph

Datum	Value	Source
TITLE	Partial computations in constructive type theory	user correction
AUTHOR NAME	Scott F. Smith	user correction
AUTHOR AFFIL	The Johns Hopkins University	user correction
ABSTRACT	Constructive type theory as conceived by Per Martin-Löf has a very rich type system, but partial functions cannot be typed. This also makes it impossible to directly write recursive programs. In this paper a constructive type theory Red is defined which includes a partial type constructor A; objects in the type A may diverge, but if they converge, they must be members of A. A fixed point typing principle is given to allow typing of recursive functions. The extraction paradigm of type theory, whereby programs are automatically extracted from constructive proofs, is extended to allow extraction of fixed points. There is a Scott fixed point induction principle for reasoning about these functions. Soundness of the theory is proven. Type theory becomes a more expressive programming logic as a result.	user correction
YEAR	1991	INFERENCE
VENUE	JOURNAL OF LOGIC AND COMPUTATION	user correction
VENUE TYPE	JOURNAL	INFERENCE
TECH	Technical Report 90-20	INFERENCE
CITATIONS	45 found	ParsCit 1.0