  We obtain a hypergraph generalisation of the graph blow-up lemma proved by
Komlos, Sarkozy and Szemeredi, showing that hypergraphs with sufficient
regularity and no atypical vertices behave as if they were complete for the
purpose of embedding bounded degree hypergraphs.
