Lamping discovered an optimal graph-reduction implementation of the λ-calculus. Simultaneously, Girard invented the geometry of interaction, a mathematical foundation for operational semantics. In this paper, we connect and explain the geometry of interaction and Lamping's graphs. The geometry of interaction provides a suitable semantic basis for explaining and improving Lamping's system. On the other hand, graphs similar to Lamping's provide a concrete representation of the geometry of interaction. Together, they offer a new understanding of computation, as well as ideas for efficient and correct implementations.
机译:关于λ对称性和PDE约简
机译:PELCR:最佳Lambda微积分减少的并行环境
机译:确定B(Lambda)和B(Lambda)几何形状的基数
机译:Nyquist平面中基于遗传算法的改进次优模型约简,用于通过遗传规划最优提取PID和PIlambdaDi控制器的调节规则
机译:使用lambda-geometry改进了全局路由。
机译:选择无几何和基于几何的三载波歧义度分辨率的最佳组合信号的理论和经验综合方法
机译:最优Lambda约化的几何