In this talk, we will present Harrington's forcing proof of the Halpern-Läuchli Theorem and extensions to coding trees representing Fraïssé limits of free amalgamation (and certain strong amalgamation) classes with the Ramsey property. We will discuss several versions of such forcings and their various applications to infinite structural Ramsey theory.
