fix small typos
This commit is contained in:
parent
6952cb9be0
commit
77517d634c
1 changed files with 3 additions and 4 deletions
|
@ -22,8 +22,7 @@ for functional programming.
|
||||||
|
|
||||||
## Aim of the project
|
## Aim of the project
|
||||||
|
|
||||||
The [third lecture]
|
The [third lecture](https://gaufre.informatique.univ-paris-diderot.fr/Bernardi/pfa-2324/tree/master/week03)
|
||||||
(https://gaufre.informatique.univ-paris-diderot.fr/Bernardi/pfa-2324/tree/master/week03)
|
|
||||||
describes two algorithms:
|
describes two algorithms:
|
||||||
the first one transforms any given program into a system of
|
the first one transforms any given program into a system of
|
||||||
equations, and the second one is a unification algorithm that solves
|
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 apply`, which applies a syntactic substitution to a type
|
||||||
- [ ] `val compose`, which computes the substitution obtained composing two given substitutions.
|
- [ ] `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:
|
You must implement at least:
|
||||||
|
|
||||||
- [ ] `val unify` which given two type `t1` and `t2`,
|
- [ ] `val unify` which given two type `t1` and `t2`,
|
||||||
|
|
Reference in a new issue