Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10118869 | Annals of Pure and Applied Logic | 2005 | 19 Pages |
Abstract
Systems of explicit mathematics provide an axiomatic framework for representing programs and proving properties of them. We introduce such a system with a new form of power types using a monotone power type generator. These power types allow us to model impredicative overloading. This is a very general form of type dependent computation which occurs in the study of object-oriented programming languages. We also present a set-theoretic interpretation for monotone power types. Thus establishing the consistency our system of explicit mathematics.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Thomas Studer,