diff options
author | Antoine Gourlay <antoine@gourlay.fr> | 2014-09-15 12:02:12 +0200 |
---|---|---|
committer | Antoine Gourlay <antoine@gourlay.fr> | 2014-09-17 13:39:17 +0200 |
commit | bca19f35103c4ff1205e1c8054eb3f803217a18b (patch) | |
tree | 17d4d6b9d8c457fd3698196a5ae98c622d6e2ad4 /spec/07-implicit-parameters-and-views.md | |
parent | 6e1916212e10e2797867ec2b38d71b004f7bcb62 (diff) | |
download | scala-bca19f35103c4ff1205e1c8054eb3f803217a18b.tar.gz scala-bca19f35103c4ff1205e1c8054eb3f803217a18b.tar.bz2 scala-bca19f35103c4ff1205e1c8054eb3f803217a18b.zip |
spec: fix latex formatting all over the place
Two things worth mentioning:
- `\em` and `emph` are not supported by MathJax,
- and things like `\mathcal{C}_0` require escaping the `_`,
otherwise markdown sees it as the beginning of `_some string_`.
It doesn't happen without the closing bracket in front, e.g. in `b_0`.
Diffstat (limited to 'spec/07-implicit-parameters-and-views.md')
-rw-r--r-- | spec/07-implicit-parameters-and-views.md | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/spec/07-implicit-parameters-and-views.md b/spec/07-implicit-parameters-and-views.md index 1a4d70409c..e07adc9e82 100644 --- a/spec/07-implicit-parameters-and-views.md +++ b/spec/07-implicit-parameters-and-views.md @@ -203,14 +203,14 @@ the type: - For a singleton type, $\mathit{ttcs}(p.type) ~=~ \mathit{ttcs}(T)$, provided $p$ has type $T$; - For a compound type, `$\mathit{ttcs}(T_1$ with $\ldots$ with $T_n)$` $~=~ \mathit{ttcs}(T_1) \cup \ldots \cup \mathit{ttcs}(T_n)$. -The _complexity_ $\mathit{complexity}(T)$ of a core type is an integer which also depends on the form of +The _complexity_ $\operatorname{complexity}(T)$ of a core type is an integer which also depends on the form of the type: -- For a type designator, $\mathit{complexity}(p.c) ~=~ 1 + \mathit{complexity}(p)$ -- For a parameterized type, $\mathit{complexity}(p.c[\mathit{targs}]) ~=~ 1 + \Sigma \mathit{complexity}(\mathit{targs})$ -- For a singleton type denoting a package $p$, $\mathit{complexity}(p.type) ~=~ 0$ -- For any other singleton type, $\mathit{complexity}(p.type) ~=~ 1 + \mathit{complexity}(T)$, provided $p$ has type $T$; -- For a compound type, `$\mathit{complexity}(T_1$ with $\ldots$ with $T_n)$` $= \Sigma\mathit{complexity}(T_i)$ +- For a type designator, $\operatorname{complexity}(p.c) ~=~ 1 + \operatorname{complexity}(p)$ +- For a parameterized type, $\operatorname{complexity}(p.c[\mathit{targs}]) ~=~ 1 + \Sigma \operatorname{complexity}(\mathit{targs})$ +- For a singleton type denoting a package $p$, $\operatorname{complexity}(p.type) ~=~ 0$ +- For any other singleton type, $\operatorname{complexity}(p.type) ~=~ 1 + \operatorname{complexity}(T)$, provided $p$ has type $T$; +- For a compound type, `$\operatorname{complexity}(T_1$ with $\ldots$ with $T_n)$` $= \Sigma\operatorname{complexity}(T_i)$ ###### Example |