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 di#erent 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...
We study the type inference problem for a system with type classes as in the functional programming ...
AbstractWe describe how to embed a simple typed functional logic programming language in Haskell. Th...
Abstract Functional dependencies are a popular and useful extension to Haskell style type classes. ...
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell’s c...
We present a first order functional programming language with user defined overloading and subtyping...
This article presents a type system based on the Damas-Milner system [DM82], that supports overloadi...
AbstractThis article explores the use of types constrained by the definition of functions of given t...
We describe the implementation of a type checker for the functional programming language Haskell tha...
Static typing is one of the most prominent techniques in the design of programming languages for mak...
AbstractThis paper describes a general theory of overloading based on a system of qualified types. T...
AbstractThis article presents a type system for context-dependent overloading, based on the notion o...
We study the type inference problem for a system with type classes as in the functional programming ...
© 2017 ACM. Functional dependencies are a popular extension to Haskell's typeclass system because t...
Functional dependencies provide for a relational specification of user-programmable type improvement...
One of the most novel features in the functional programming language Haskell is the system of type ...
We study the type inference problem for a system with type classes as in the functional programming ...
AbstractWe describe how to embed a simple typed functional logic programming language in Haskell. Th...
Abstract Functional dependencies are a popular and useful extension to Haskell style type classes. ...
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell’s c...
We present a first order functional programming language with user defined overloading and subtyping...
This article presents a type system based on the Damas-Milner system [DM82], that supports overloadi...
AbstractThis article explores the use of types constrained by the definition of functions of given t...
We describe the implementation of a type checker for the functional programming language Haskell tha...
Static typing is one of the most prominent techniques in the design of programming languages for mak...
AbstractThis paper describes a general theory of overloading based on a system of qualified types. T...
AbstractThis article presents a type system for context-dependent overloading, based on the notion o...
We study the type inference problem for a system with type classes as in the functional programming ...
© 2017 ACM. Functional dependencies are a popular extension to Haskell's typeclass system because t...
Functional dependencies provide for a relational specification of user-programmable type improvement...
One of the most novel features in the functional programming language Haskell is the system of type ...
We study the type inference problem for a system with type classes as in the functional programming ...
AbstractWe describe how to embed a simple typed functional logic programming language in Haskell. Th...
Abstract Functional dependencies are a popular and useful extension to Haskell style type classes. ...