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

  _  __   __   __    _____     ______   _    _   
 | |/ //  \ \\/ //  |__  //   /_   _// | \  / || 
 | ' //    \ ` //     / //     -| ||-  |  \/  || 
 | . \\     | ||     / //__    _| ||_  | .  . || 
 |_|\_\\    |_||    /_____||  /_____// |_|\/|_|| 
 `-` --`    `-`'    `-----`   `-----`  `-`  `-`