{"size": 300, "ext": "scrbl", "max_stars_repo_path": "scribblings/Unification.scrbl", "max_stars_repo_name": "Hectarea1996/unification", "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "scribblings/Unification.scrbl", "max_issues_repo_name": "Hectarea1996/unification", "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "scribblings/Unification.scrbl", "max_forks_repo_name": "Hectarea1996/unification", "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null}
{"max_stars_count": null, "max_issues_count": null, "max_forks_count": null, "avg_line_length": 33.3333333333, "max_line_length": 110, "alphanum_fraction": 0.8133333333}
#lang scribble/manual

#lang scribble/manual
@(require (for-label racket))

@title{Unification}

Unification is an algorithm for solving symbolic equations problems. Given two expressions and some variables,
the unification looks for values that can match the given variables to satisfy the equation.