参数多态型系统与有限控制自动机之间的联系
Ties between Parametrically Polymorphic Type Systems and Finite Control Automata
摘要：
给出了参数多态类型系统的变体与有限控制自动机的变体（如FSA、PDA、树自动机和图灵机）之间的对应和互模拟。在此对应关系中，我们表明，最近两个著名的自动生成流畅的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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
