Text this: A probabilistic forest-to-string model for language generation from typed lambda calculus expressions

  ______    ______    ______    _____    ______   
 /_   _//  /_   _//  /_   _//  |  ___|| |      \\ 
   | ||     -| ||-     | ||    | ||__   |  --  // 
  _| ||     _| ||_    _| ||    | ||__   |  --  \\ 
 /__//     /_____//  /__//     |_____|| |______// 
 `--`      `-----`   `--`      `-----`  `------`