组合器在串联/隐性编程语言中的作用
What exact role do higher-order combinators (or function producers) hold in concatenative and tacit programming?
Is there another way to implement a concatenative programming language rather than directly manipulating the stack?
How tight is the relation between the combinators mentioned and Schonfinkel's combinatory logic?
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（2）
是的。 Enchilada 语言基于术语重写。
Yes. The Enchilada language is based on term rewriting.
在我对 “向我解释连接语言”的回答中就像我是一个 8 岁的孩子一样” 我认为使用“连接”这个词来描述编程语言是没有用的。这个区域似乎是曼弗雷德·冯·图恩的私人游乐场。
对于什么构成连接语言没有真正的定义，也没有支持连接语言思想的成熟理论。由于该概念尚未真正定义，因此不可能对组合器的作用提供明确的解释。
您可能更愿意花时间研究更成熟的主题，例如组合逻辑、SK 组合器、lambda 演算和图约简机。如果你从更实用的角度对无点编程感兴趣，APL、Forth 和 PostScript 都非常值得学习。
In my answer to "Explain Concatenative languages to me like I’m an 8 year old" I argued that it is not useful to use the word "concatenative" to describe programming languages. This area appears to be a private playground for Manfred von Thun.
There is no real definition of what constitutes a concatenative language, and there is no mature theory underlying the idea of a concatenative language. Because the concept is not really defined, it is impossible to provide a definitive explanation of the role of combinators.
You might prefer to spend your time studying more well-established topics such as combinatory logic, SK combinators, lambda calculus, and graph-reduction machines. If you are interested in point-free programming from a more pragmatic perspective, APL, Forth, and PostScript are all well worth studying.