<table>
<tr>
-<td>Scheme (functional part)</td>
-<td>OCaml (functional part)</td>
-<td>C, Java, Pasval<br>
+<td width=30%>Scheme (functional part)</td>
+<td width=30%>OCaml (functional part)</td>
+<td width=30%>C, Java, Pasval<br>
Scheme (imperative part)<br>
OCaml (imperative part)</td>
<tr>
-<td>lambda calculus<br>
+<td width=30%>lambda calculus<br>
combinatorial logic</td>
<tr>
-<td colspan=3>--------- Turing complete ---------</td>
+<td colspan=3>------------------------ Turing complete ---------------------</td>
<tr>
-<td>
-<td>more advanced type systems, such as polymorphic types
-<td>
+<td width=30%>
+<td width=30%>more advanced type systems, such as polymorphic types
+<td width=30%>
<tr>
-<td>
-<td>simply-typed lambda calculus (what linguists mostly use)
-<td>
+<td width=30%>
+<td width=30%>simply-typed lambda calculus (what linguists mostly use)
+<td width=30%>
</table>