Unification, or two-way pattern matching, is the process of solving an equation involving two first-order terms with variables. Unification is used in type inference in many programming languages and in the execution of logic programs. This means that unification algorithms have to be written over and over again for different term types. Many other functions also make sense for a large class of datatypes; examples are pretty printers, equality checks, maps etc. They can be defined by induction on the structure of user-defined datatypes. Implementations of these functions for different datatypes are closely related to the structure of the datatypes. We call such functions polytypic. This paper describes a unification algorithm parametr...
A polytypic program is a program that behaves uniformly over a large class of datatypes. For functio...
The theory and practice of polytypic programming is intimately connected with the initial algebra se...
The higher order unification procedure as formulated by Huet [Hu 75] unifies terms in the simple the...
Unification, or two-way pattern matching, is the process of solving an equation involving two first-...
Unification, or two-way pattern matching, is the process of solving an equation involving two first-...
This report describes what polytypic programming is, a new system for writing polytypic functions, a...
Many algorithms have to be implemented over and over again for different datatypes, either because d...
Many functions have to be written over and over again for different datatypes, either because dataty...
Many functions have to be written over and over again for different datatypes, either because dataty...
This article proposes a new framework for a polytypic extension of functional programming languages....
Rewriting is a typical example of a polytypic function. Given any value of a datatype (an algebra of...
Many functions have to be written over and over again for different datatypes, either because dataty...
A functional polytypic program is one that is parameterised by datatype. Since polytypic functions a...
The theory and practice of polytypic programming is intimately connected with the initial algebra ...
Unification in a polymorphic order-sorted signature differs substantially from the non-polymorphic o...
A polytypic program is a program that behaves uniformly over a large class of datatypes. For functio...
The theory and practice of polytypic programming is intimately connected with the initial algebra se...
The higher order unification procedure as formulated by Huet [Hu 75] unifies terms in the simple the...
Unification, or two-way pattern matching, is the process of solving an equation involving two first-...
Unification, or two-way pattern matching, is the process of solving an equation involving two first-...
This report describes what polytypic programming is, a new system for writing polytypic functions, a...
Many algorithms have to be implemented over and over again for different datatypes, either because d...
Many functions have to be written over and over again for different datatypes, either because dataty...
Many functions have to be written over and over again for different datatypes, either because dataty...
This article proposes a new framework for a polytypic extension of functional programming languages....
Rewriting is a typical example of a polytypic function. Given any value of a datatype (an algebra of...
Many functions have to be written over and over again for different datatypes, either because dataty...
A functional polytypic program is one that is parameterised by datatype. Since polytypic functions a...
The theory and practice of polytypic programming is intimately connected with the initial algebra ...
Unification in a polymorphic order-sorted signature differs substantially from the non-polymorphic o...
A polytypic program is a program that behaves uniformly over a large class of datatypes. For functio...
The theory and practice of polytypic programming is intimately connected with the initial algebra se...
The higher order unification procedure as formulated by Huet [Hu 75] unifies terms in the simple the...