从紧致化 Lambda-Letrec 项到识别正则表达式进程
From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
AI总结：
本文总结作者在带 letrec 的 lambda 演算项紧致图表示与正则表达式进程图识别两方面的工作，提出通过结构约束图实现项与图、表达式与进程图之间的便捷转换，并展望后续研究方向。
摘要：
作为我在研讨会上报告内容的补充，这篇扩展摘要旨在说明并总结我与合作者在两个不同领域问题上的工作：第一个领域是带有 letrec 的 lambda 演算，这是一种通用计算模型；第二个领域是 Milner 对正则表达式的进程解释，它是有限状态进程的一个真子类。我的报告旨在说明如何将结构约束图这一可行概念中的思想进行迁移：从为带有 letrec 的 lambda 演算中的项寻找紧致图表示的问题，迁移到识别可由正则表达式表示的有限进程图的问题。在这两种情形中，构造结构约束图都是必要的，以便能够在第一种情形下于 lambda 项与项图之间、在第二种情形下于正则表达式与进程图之间方便地来回转换。本文的主要重点是分别为这两个领域提供指向我与合作者工作的指引。次要重点是解释我当前项目的研究方向，并描述从这两个领域的工作中发展出来的、可能具有普遍意义的研究问题。
英文摘要：
As a supplement to my talk at the workshop, this extended abstract motivates and summarizes my work with co-authors on problems in two separate areas: first, in the lambda-calculus with letrec, a universal model of computation, and second, on Milner's process interpretation of regular expressions, a proper subclass of the finite-state processes. The aim of my talk was to motivate a transferal of ideas for workable concepts of structure-constrained graphs: from the problem of finding compact graph representations for terms in the lambda-calculus with letrec to the problem of recognizing finite process graphs that can be expressed by regular expressions. In both cases the construction of structure-constrained graphs was expedient in order to enable to go back and forth easily between, in the first case, lambda-terms and term graphs, and in the second case, regular expressions and process graphs. The main focus here is on providing pointers to my work with co-authors, in both areas separately. A secondary focus is on explaining directions of my present projects, and describing research questions of possibly general interest that have developed out of my work in these two areas.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
