diff options
| author | michelou <michelou@epfl.ch> | 2003-07-16 11:06:34 +0000 |
|---|---|---|
| committer | michelou <michelou@epfl.ch> | 2003-07-16 11:06:34 +0000 |
| commit | 8ddba4ddedd0e92745f05a856e3de8483da4f301 (patch) | |
| tree | fd57c0fde4bdb2d9ec1819ac08db89af1b2f8736 /doc | |
| parent | 08ba2872c4c078fccaee6da60f937a85ec6a0b2f (diff) | |
| download | scala-8ddba4ddedd0e92745f05a856e3de8483da4f301.tar.gz scala-8ddba4ddedd0e92745f05a856e3de8483da4f301.tar.bz2 scala-8ddba4ddedd0e92745f05a856e3de8483da4f301.zip | |
corrected typos
Diffstat (limited to 'doc')
| -rw-r--r-- | doc/reference/examples.bib | 2 | ||||
| -rw-r--r-- | doc/reference/examples.verb.tex | 4 | ||||
| -rw-r--r-- | doc/reference/rationale-chapter.verb.tex | 2 |
3 files changed, 4 insertions, 4 deletions
diff --git a/doc/reference/examples.bib b/doc/reference/examples.bib index efdb03db74..a0bbd57115 100644 --- a/doc/reference/examples.bib +++ b/doc/reference/examples.bib @@ -11,7 +11,7 @@ @InProceedings{ odersky-et-al:fool10, author = {Martin Odersky and Vincent Cremet and Christine R\"ockl and Matthias Zenger}, - title = {A Nominal Theory of Ojects with Dependent Types}, + title = {A Nominal Theory of Objects with Dependent Types}, booktitle = {Proc. FOOL 10}, year = 2003, month = jan, diff --git a/doc/reference/examples.verb.tex b/doc/reference/examples.verb.tex index 8aed1941c6..081bd73dcb 100644 --- a/doc/reference/examples.verb.tex +++ b/doc/reference/examples.verb.tex @@ -922,7 +922,7 @@ def sumReciprocals(a: int, b: int): double = sum(x: int => 1.0/x, a, b); Often, the Scala compiler can deduce the parameter type(s) from the context of the anonymous function. In this case, they can be omitted. For instance, in the case of \verb@sumInts@, \verb@sumCubes@ and -verb@sumReciprocals@, one knows from the type of +\verb@sumReciprocals@, one knows from the type of \verb@sum@ that the first parameter must be a function of type \verb@int => double@. Hence, the parameter type \verb@int@ is redundant and may be omitted: @@ -2427,7 +2427,7 @@ abstract class List[+a] { \end{verbatim} \verb@List@ is an abstract class, so one cannot define elements by calling the empty \verb@List@ constructor (e.g. by -\verb@new List). The class has a type parameter \verb@a@. It is +\verb@new List@). The class has a type parameter \verb@a@. It is co-variant in this parameter, which means that \verb@List[S] <: List[T]@ for all types \verb@S@ and \verb@T@ such that \verb@S <: T@. The class is situated in the package diff --git a/doc/reference/rationale-chapter.verb.tex b/doc/reference/rationale-chapter.verb.tex index 666e20753b..5187663f1e 100644 --- a/doc/reference/rationale-chapter.verb.tex +++ b/doc/reference/rationale-chapter.verb.tex @@ -106,7 +106,7 @@ cases where static typing is too restrictive. Module systems of functional languages such as SML or Caml excel in abstraction; they allow very precise control over visibility of names and types, including the ability to partially abstract over types. By -contrast, object-oriented languages excell in composition; they offer +contrast, object-oriented languages excel in composition; they offer several composition mechanisms lacking in module systems, including inheritance and unlimited recursion between objects and classes. Scala unifies the notions of object and module, of module signature |