Sign inSign in
ConceptSystems & CS

Unifier

A generalization of a pattern matcher that takes two patterns and finds the most general substitution for their variables to satisfy both simultaneously.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

1
  • Hal Abelson & Gerald Jay Sussman

    MIT · Undergraduate

    • 27:33Logic Programming, Part 2 (SICP Lecture 8b)

Connections

4

The lectures that define it or assume it, and the concepts next to it.

Concepts2

Lectures2

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.