suzanne.soy/racket
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix typo

Browse Source 
s/intensionally/intentionally
This commit is contained in:
Paulo Matos 2019-03-18 23:52:32 +01:00 committed by GitHub
parent 201015a4b6
commit 9a731f45f9
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
pkgs/racket-doc/scribblings/guide/contracts/first-extended-example.scrbl
View File

@ -90,7 +90,7 @@ racket
(and (memq r lov)
(for/and ([v lov]) (>= f@r (f v)))))))]))
]
The @racket[memq] function ensures that @racket[r] is @emph{intensionally equal}
The @racket[memq] function ensures that @racket[r] is @emph{intentionally equal}
@margin-note*{That is, "pointer equality" for those who prefer to think at
the hardware level.} to one of the members of @racket[lov]. Of course, a
moment's worth of reflection shows that it is impossible to make up such a
@ -122,7 +122,7 @@ racket
]
That is, the @racket[memf] function determines the first element of
@racket[lov] whose value under @racket[f] is equal to @racket[r]'s value
under @racket[f]. If this element is intensionally equal to @racket[r],
under @racket[f]. If this element is intentionally equal to @racket[r],
the result of @racket[argmax] is correct.
This second refinement step introduces two problems. First, both conditions