edwinb/Idris2-boot
1
1
Fork 0
mirror of https://github.com/edwinb/Idris2-boot.git synced 2024-11-30 22:05:32 +03:00
Code Issues Projects Releases Wiki Activity

Merge pull request #219 from diakopter/patch-3

Browse Source 
various copyedits
This commit is contained in:
Edwin Brady 2020-03-18 20:34:15 +00:00 committed by GitHub
commit 745c3a4f29
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
docs/proofs/definitional.rst
View File

@ -141,17 +141,17 @@ Definitional and Propositional Equalities
We have seen that we can 'prove' a type by finding a way to construct a term.
In the case of equality types there is only one constructor which is ``Refl``.
We have also seen that each side of the equation does not have to be identical
like '2=2'. It is enough that both sides are *definitionaly equal* like this:
like '2=2'. It is enough that both sides are *definitionally equal* like this:
.. code-block:: idris
onePlusOne : 1+1=2
onePlusOne = Refl
Both sides of this equation nomalise to 2 and so Refl matches and the
Both sides of this equation normalise to 2 and so Refl matches and the
proposition is proved.
We don't have to stick to terms, we can also use symbolic parameters so the
We don't have to stick to terms; we can also use symbolic parameters so the
following type checks:
.. code-block:: idris
@ -159,15 +159,15 @@ following type checks:
varIdentity : m = m
varIdentity = Refl
If a proposition/equality type is not definitionaly equal but is still true
then it is *propositionaly equal*. In this case we may still be able to prove
If a proposition/equality type is not definitionally equal but is still true
then it is *propositionally equal*. In this case we may still be able to prove
it but some steps in the proof may require us to add something into the terms
or at least to take some sideways steps to get to a proof.
Especially when working with equalities containing variable terms (inside
functions) it can be hard to know which equality types are definitionally equal,
in this example ``plusReducesL`` is *definitionally equal* but ``plusReducesR`` is
not (although it is *propositionaly equal*). The only difference between
not (although it is *propositionally equal*). The only difference between
them is the order of the operands.
.. code-block:: idris
@ -207,4 +207,4 @@ definitional equality is built in
Main> 1+1
2
In the following pages we discuss how to resolve propositionaly equalies.
In the following pages we discuss how to resolve propositional equalities.