From fef7ca1d5f11027326df3e5baab1d91b505714c4 Mon Sep 17 00:00:00 2001 From: Cassie Jones Date: Thu, 20 Feb 2020 23:23:11 +0100 Subject: [PATCH] You don't spell "unify" as "uninfy" --- posts/2020/syntactic-unification.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/posts/2020/syntactic-unification.md b/posts/2020/syntactic-unification.md index 7e3466d..1b20268 100644 --- a/posts/2020/syntactic-unification.md +++ b/posts/2020/syntactic-unification.md @@ -9,7 +9,7 @@ summary: "Last year I tried implementing syntactic unification and got completel --- Syntactic unification is the process of trying to find an assignment of variables that makes two terms the same. -For example, attempting to unify the terms in the equation `(X, Y) = (1, 2)` would give the substitution `{X: 1, Y: 2}`, but if we tried to uninfy `(X, X) = (1, 2)` it would fail since one variable can't be equal to two different values. +For example, attempting to unify the terms in the equation `(X, Y) = (1, 2)` would give the substitution `{X: 1, Y: 2}`, but if we tried to unify `(X, X) = (1, 2)` it would fail since one variable can't be equal to two different values. Unification is used to implement two things I'm very interested in: type systems, and logic programming languages. Earlier last year I tried implementing unification in order to make a toy Prolog, and I got completely stuck on the algorithms. -- 2.43.2