Sign inSign in
ConceptSystems & CS

Rule

A transformation of an expression to a logically equivalent expression, divided into transformation rules and implementation rules.
as Andy Pavlo defines itCarnegie Mellon UniversityThe wording closest to all 5 definitions
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Hal Abelson & Gerald Jay Sussman

    MIT · Undergraduate

    Rules serve as the means of abstraction in the logic programming language, allowing compound queries to be named.
    • 23:27Logic Programming, Part 2: MIT 6.001 Structure and Interpretation (1986)
    • 33:23Logic Programming, Part 1
    • 23:30Logic Programming, Part 2 (SICP Lecture 8b)
  • Andy Pavlo

    Carnegie Mellon University · Graduate

    • 23:00Cascades Query Optimizer

Lectures that assume it

8

Connections

23

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

2 lecturers. 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.