Parsing and Generation Based on Typed Lambda Calculus and Datalog

作为一种统一的解析和生成方法，主要研究人员之前开发了一种方法，可以减少在Datalog中生成lambda术语的语法到查询求值的识别问题。这适用于lambda项上的“上下文无关”语法--lambda项被限制为“几乎线性的”lambda项。这种方法已经扩展到输入不只是单个的lambda项，而是由“确定性”数据库表示的一组lambda项的情况。这允许减少对数据记录的“作为交集生成”的问题。

As a uniform approach to parsing and generation, the principal investigator had previously developed a method of reducing the recognition problem for grammars generating lambda-terms to query evaluation in Datalog. This applies to "context-free" grammars on lambda-terms restricted to "almost linear" lambda-terms. This method has been extended to the case where the input is not just a single lambda-term, but a set of lambda-terms represented by a "deterministic" database. This allows the reduction of the problem of "generation as intersection" to Datalog.