From 77517d634c3c9f97689517c5c9e56dfe721eb588 Mon Sep 17 00:00:00 2001 From: Mylloon Date: Thu, 14 Mar 2024 15:23:39 +0100 Subject: [PATCH] fix small typos --- README.md | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index 005c65c..64146e3 100644 --- a/README.md +++ b/README.md @@ -22,8 +22,7 @@ for functional programming. ## Aim of the project -The [third lecture] -(https://gaufre.informatique.univ-paris-diderot.fr/Bernardi/pfa-2324/tree/master/week03) +The [third lecture](https://gaufre.informatique.univ-paris-diderot.fr/Bernardi/pfa-2324/tree/master/week03) describes two algorithms: the first one transforms any given program into a system of equations, and the second one is a unification algorithm that solves @@ -38,7 +37,7 @@ To realise this project you will have to implement the following modules: - [ ] `val apply`, which applies a syntactic substitution to a type - [ ] `val compose`, which computes the substitution obtained composing two given substitutions. -1. [unifcation](./lib/unification.ml) +1. [unification](./lib/unification.ml) You must implement at least: - [ ] `val unify` which given two type `t1` and `t2`, @@ -75,7 +74,7 @@ Do it asap. The final implementation must be in your fork by the -** 30th of April 2024, 23h59 ** +**30th of April 2024, 23h59** Any code pushed to your fork after that time will be ignored.