Rippling

Est. 2026

84/100· Exercise Caution

Overview:In computer science, more particularly in automated theorem proving, rippling is a group of meta-level heuristics, developed primarily in the Mathematical Reasoning Group in the School of Informatics at the University of Edinburgh, and most commonly used to guide inductive proofs in automated theorem proving systems. Rippling may be viewed as a restricted form of rewrite system, where special object level annotations are used to ensure fertilization upon the completion of rewriting, with a measure decreasing requirement ensuring termination for any set of rewrite rules and expression.Read on Wikipedia ↗

Take Action on Rippling

View Open Jobs Prepare Interview Negotiate Offer Layoff Risk Compare Find Connections

Hiring Velocity

Stable

Momentum

Remote Policy

Hybrid

Flexibility

Culture Score

N/A

Satisfaction

About

In computer science, more particularly in automated theorem proving, rippling is a group of meta-level heuristics, developed primarily in the Mathematical Reasoning Group in the School of Informatics at the University of Edinburgh, and most commonly used to guide inductive proofs in automated theorem proving systems. Rippling may be viewed as a restricted form of rewrite system, where special object level annotations are used to ensure fertilization upon the completion of rewriting, with a measure decreasing requirement ensuring termination for any set of rewrite rules and expression.

Wikipedia