Solving Layout Problems Concurrently With TeX and Java
Résumé
This paper describes a cooperation between Java and TeX in order to lay out texts in a logical way. An optimal solution is found through a binary search applied to TeX runs. Concurrency is used both within Java, with a tree of Java threads corresponding to the structure of the page, and outside Java because external formatting processes are forked. This represents a first step towards the use of concurrency by a domain that has hitherto ignored it.