Linear unification

M.S. Paterson; Mark N. Wegman

doi:10.1145/800113.803646

STOC 1976

Conference paper

03 May 1976

Linear unification

Download paper

Abstract

A unification algorithm is described which tests a set of expressions for unifiability and which requires time and space which are only linear in the size of the input.

Conference paper

SUMMARIZING GRAPHS BY REGULAR EXPRESSIONS.

Mark N. Wegman

POPL 1983

Conference paper

Efficient method of computing static single assignment form

Ron Cytron, Jeanne Ferrante, et al.

POPL 1989

Conference paper

CONSTANT PROPAGATION WITH CONDITIONAL BRANCHES.

Mark N. Wegman, F. Kenneth Zadeck

POPL 1985

Conference paper

Universal classes of hash functions

J. Lawrence Carter, Mark N. Wegman

STOC 1977

View all publications

Abstract

Related

SUMMARIZING GRAPHS BY REGULAR EXPRESSIONS.

Efficient method of computing static single assignment form

CONSTANT PROPAGATION WITH CONDITIONAL BRANCHES.

Universal classes of hash functions