diff options
| author | Rob Blanco <robblanco@users.noreply.github.com> | 2017-04-01 19:28:25 +0200 |
|---|---|---|
| committer | Damien Doligez <damien.doligez@inria.fr> | 2017-04-04 11:45:44 +0200 |
| commit | 6f8be23dff29c99ccb11a6757796ba2b9a6ca685 (patch) | |
| tree | 405bbae33baeee73edfa0c0659038e526f956a85 /manual | |
| parent | 6a702d195c6c0475e3e9302e0c1cd007496eeba4 (diff) | |
| download | ocaml-6f8be23dff29c99ccb11a6757796ba2b9a6ca685.tar.gz | |
Fix typo in coreexamples.etex
Diffstat (limited to 'manual')
| -rw-r--r-- | manual/manual/tutorials/coreexamples.etex | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/manual/manual/tutorials/coreexamples.etex b/manual/manual/tutorials/coreexamples.etex index 8657ee4c2b..536e1f7e54 100644 --- a/manual/manual/tutorials/coreexamples.etex +++ b/manual/manual/tutorials/coreexamples.etex @@ -212,7 +212,7 @@ structures. Consider for example the type of binary trees: \begin{caml_example} type 'a btree = Empty | Node of 'a * 'a btree * 'a btree;; \end{caml_example} -This definition reads as follow: a binary tree containing values of +This definition reads as follows: a binary tree containing values of type "'a" (an arbitrary type) is either empty, or is a node containing one value of type "'a" and two subtrees containing also values of type "'a", that is, two "'a btree". |
