Type Classes With More Higher-Order Polymorphism (2002)

Cached

Download Links

by Matthias Neubauer , Peter Thiemann
Venue:In ACM SIGPLAN International Conference on Functional Programming
Citations:5 - 1 self

Active Bibliography

15 Functional logic overloading – Matthias Neubauer, Peter Thiemann, Martin Gasbichler, Michael Sperber - 2002
Constraints for Type Class Extensions – Gerrit Van Den Geest - 2007
53 A theory of overloading – Peter J. Stuckey, Martin Sulzmann, Jeremy Wazny - 2002
5 Making Implicit Parameters Explicit – Atze Dijkstra, S. Doaitse Swierstra - 2005
17 Decidable higher-order unification problems – Christian Prehofer - 1994
On the complexity of Bounded Second-Order Unification and Stratified Context Unification – Jordi Levy A, Manfred Schmidt-schauß B, Mateu Villaret C
13 Object-oriented style overloading for Haskell – Mark Shields, Simon Peyton Jones - 2001
33 On the Undecidability of Second-Order Unification – Jordi Levy, Margus Veanes - 2000
14 Type Classes and Constraint Handling Rules – Kevin Glynn, Peter J. Stuckey, Martin Sulzmann - 2000
Extracting Programs from . . . – Martin Sulzmann - 2006
Beyond Type Classes – Andreas Rossberg, Martin Sulzmann - 2002
A Solution to Haskell’s Multi-Parameter Type Class Dilemma – Carlos Camarão, Rodrigo Ribeiro, Lucília Figueiredo, Cristiano Vasconcellos
Programming Systems – Andreas Rossberg, Martin Sulzmann
3 High-Level ABstractions for Low-Level Programming – Iavor Sotirov Diatchki - 2007
19 Modular Type Classes – Derek Dreyer, Robert Harper, Manuel M.T. Chakravarty
4 THE COMPLEXITY OF MONADIC SECOND-ORDER UNIFICATION ∗ – Jordi Levy, Manfred Schmidt-schauß, Mateu Villaret - 1113
8 Type Inference for Overloading without Restrictions, Declarations or Annotations – Carlos Camarao, Lucília Figueiredo, Belo Horizonte, Ouro Preto - 1999
Object-Oriented Style Overloading for Haskell (Extended Abstract) – Mark Shields, Simon Peyton Jones - 2001
Equational Theory of Context Unification is Hard – Sergei Vorobyov - 1998