论文标题
参数性多态性类型系统与有限控制自动机之间的关系
Ties between Parametrically Polymorphic Type Systems and Finite Control Automata
论文作者
论文摘要
我们介绍了参数多态类型系统的变体与有限控制自动机的变体（例如FSA，PDA，Tree Automata和Turing Machine）之间的对应关系。在此通信中，我们表明，在某些意义上，最近有两个关于自动产生的Fluent API的庆祝结果是最佳的，在研究类型系统上呈现新的结果，制定开放问题以及目前的潜在软件工程应用程序，除了流利的API生成以外，这可能会受益于对类型理论的明智使用。
We present a correspondence and bisimulation between variants of parametrically polymorphic type systems and variants of finite control automata, such as FSA, PDA, tree automata and Turing machine. Within this correspondence we show that two recent celebrated results on automatic generation of fluent API are optimal in certain senses, present new results on the studied type systems, formulate open problems, and present potential software engineering applications, other than fluent API generation, which may benefit from judicious use of type theory.
