Functional logic overloading

Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conceptually predicates on types in standard Haskell, they are type functions in our approach. Thus, we can base type inference on the evaluation of functional logic programs. Functional logic programming provides a solid theoretical foundation for type functions and, at the same time, allows for programmable overloading resolution strategies by choosing different evaluation strategies for functional logic programs. Type inference with type functions is an instance of type inference with constrained types, where the underlying constraint system is defined by a functional logic program. We have designed a variant of Haskell which supports our approach to overloading, and implemented a prototype frontend for the language.

• Type: Conference
• Year: 2002
• Where: POPL
• Authors: Matthias Neubauer, Peter Thiemann, Martin Gasbichler, Michael Sperber
• Keywords: Functional Logic, Functional Logic Programs, POPL 2002, Programming Languages, Solid Theoretical Foundation