Explicit mathematics: power types and overloading

Systems of explicit mathematics provide an axiomatic framework to represent programs and to prove 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 concistency our system of explicit mathematics.

• Type: Journal
• Year: 2005
• Where: APAL
• Authors: Thomas Studer
• Keywords: APAL 2005, Explicit Mathematics, Monotone Power Types, Power Types