Polytypic unification

Authors:
Patrik Jansson;Johan Jeuring
Affiliations:
Computing Science, Chalmers University of Technology, S-412 96 Göteborg, Sweden;Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands
Venue:
Journal of Functional Programming
Year:
1998

Citing 6
Cited 13

Unification: a multidisciplinary survey

ACM Computing Surveys (CSUR)
Basic category theory for computer scientists

Basic category theory for computer scientists
Polytypic pattern matching

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
PolyP—a polytypic programming language extension

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Polytypic Programming

Advanced Functional Programming, Second International School-Tutorial Text

Generic unification via two-level types and parameterized modules

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Type-Indexed Data Types

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
N-axioms parallel unification

Fundamenta Informaticae - Concurrency specification and programming
A tutorial on the universality and expressiveness of fold

Journal of Functional Programming
Type-indexed data types

Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Two-level types and parameterized modules

Journal of Functional Programming
Prufrock: a framework for constructing polytypic theorem provers

Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
A lightweight approach to datatype-generic rewriting

Proceedings of the ACM SIGPLAN workshop on Generic programming
Generic programming with fixed points for mutually recursive datatypes

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Monadic constraint programming

Journal of Functional Programming
A lightweight approach to datatype-generic rewriting

Journal of Functional Programming
Datatype-Generic reasoning

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
N-axioms Parallel Unification

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 parametrised on the type of the terms, and shows how to use polytypism to obtain a unification algorithm that works for all regular term types.