标题： 将代数分层分解带入连接式函数语言 显示英文标题

标题： Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages

摘要： 编程语言往往会随时间推移越来越多地引入理论计算机科学中的概念。 然而，编程与纯粹数学之间仍存在差距。 并非所有理论成果都实现了其潜在的应用。 有限状态自动机的代数分解（Krohn-Rhodes理论）为任何计算设备构建了一个由更简单组件组成的模拟分层结构。 这些分解提供了理解和控制计算过程的方法，但到目前为止，应用仅限于理论研究。 在这里，我们研究如何将代数分解应用于编程语言。 我们利用最近将代数理论推广到范畴层次（从半群到半群oid）的结果，并与拼接函数式编程语言的特殊类别进行工作。 作为半群oid分解的第一个应用，我们开始设计一个具有显式半群oid表示的编程语言家族。 显示英文摘要

摘要： Programming languages tend to evolve over time to use more and more concepts from theoretical computer science. Still, there is a gap between programming and pure mathematics. Not all theoretical results have realized their promising applications. The algebraic decomposition of finite state automata (Krohn-Rhodes Theory) constructs an emulating hierarchical structure from simpler components for any computing device. These decompositions provide ways to understand and control computational processes, but so far the applications were limited to theoretical investigations. Here, we study how to apply algebraic decompositions to programming languages. We use recent results on generalizing the algebraic theory to the categorical level (from semigroups to semigroupoids) and work with the special class of concatenative functional programming languages. As a first application of semigroupoid decompositions, we start to design a family of programming languages with an explicit semigroupoid representation.