Programming Methodology Group. Department of Computer Sciences. Chalmers; University of Technology and University of Goteborg
SVM HeaderParse 0.2
S-412 96 Goteborg, Sweden
SVM HeaderParse 0.1
. 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  and explained with this name for instance in the paper , reflects this explanation. Constructively, to rely on such impredicative methods is somewhat unsatisfactory (see fo...