## Infinite Objects in Type Theory (0)

### Cached

### Download Links

- [www.tcs.informatik.uni-muenchen.de]
- [www.di.uminho.pt]
- DBLP

### Other Repositories/Bibliography

Citations: | 83 - 2 self |

### BibTeX

@MISC{Coquand_infiniteobjects,

author = {Thierry Coquand},

title = {Infinite Objects in Type Theory},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We show that infinite objects can be constructively understood without the consideration of partial elements, or greatest fixedpoints, through the explicit consideration of proof objects. We present then a proof system based on these explanations. According to this analysis, the proof expressions should have the same structure as the program expressions of a pure functional lazy language: variable, constructor, application, abstraction, case expressions, and local let expressions. 1 Introduction The usual explanation of infinite objects relies on the use of greatest fixed-points of monotone operators, whose existence is justified by the impredicative proof of Tarski's fixed point theorem. The proof theory of such infinite objects, based on the so called co-induction principle, originally due to David Park [21] and explained with this name for instance in the paper [18], reflects this explanation. Constructively, to rely on such impredicative methods is somewhat unsatisfactory (see fo...