Constructing Polymorphic Programs with Quotient Types

The efficient representation and manipulation of data is one of the fundamental tasks in the construction of large software systems. Parametric polymorphism has been one of the most successful approaches to date but, as of yet, has not been applicable to programming with quotient datatypes such as unordered pairs, cyclic lists, bags etc. This paper provides the basis for writing polymorphic programs over quotient datatypes by extending our recently developed theory of containers.

• Type: Conference
• Year: 2004
• Where: MPC
• Authors: Michael Abbott, Thorsten Altenkirch, Neil Ghani, Conor McBride
• Keywords: Large Software Systems, Mathematics, MPC 2004, Parametric Polymorphism, Quotient Datatypes