From c1c2379932437e597e4b1caec2551b51e31ee1ea Mon Sep 17 00:00:00 2001 From: Lukasz Stafiniak Date: Thu, 26 Oct 2023 09:55:28 +0200 Subject: [PATCH] Test KaTeX math rendering --- site/index.html | 55 +++++++++++++++++++++++++++++++++++-------------- 1 file changed, 39 insertions(+), 16 deletions(-) diff --git a/site/index.html b/site/index.html index 02c995c..2e47e34 100644 --- a/site/index.html +++ b/site/index.html @@ -1,21 +1,44 @@ - - A Curious OCaml Book - - - + + A Curious OCaml Book + - - - - -

Curious OCaml

- Curious OCaml -- work in progress. -

Functional Programming 2012-2013

- Functional Programming Course 2012-2013 slides converted to a book format -- conversion cleanup in progress. - - + + + + + + + + +

Curious OCaml

+ Curious OCaml -- work in progress. +

Functional Programming 2012-2013

+ Functional Programming Course 2012-2013 slides converted to a book format -- + conversion cleanup in progress. +

Test math rendering

+

How can we define them? Think in terms of derivation trees: +

+

\frac{\begin{array}{ll} + \frac{\begin{array}{ll} + \frac{\,}{\text{a premise}} & \frac{\,}{\text{another premise}} + \end{array}}{\text{some fact}} & \frac{\frac{\,}{\text{this we have by default}}}{\text{another fact}} + \end{array}}{\text{final conclusion}}

+

Define by providing rules for using the connectives: for example, a + rule \frac{\begin{array}{ll} a & b + \end{array}}{c} matches parts of the tree that have two premises, + represented by variables a and b, and have any + conclusion, represented by + variable c. +

+ + + \ No newline at end of file