自反组合代数
Reflexive combinatory algebras
摘要:
我们引入组合代数的自反性概念。自反性可以被认为是组合模型的迈耶-斯科特公理的一个等式对应物,它确实允许我们建立组合模型的一个等式可定义的对应物。这种新的结构,称为强自反组合代数,承认有限公理化与七个封闭的方程,和结构被证明是完全收缩的组合模型。Lambda代数可以刻画为稳定的强自反组合代数。此外,还从强自反组合代数中构造出了一个λ代数。由此产生的lambda代数的公理化的七个公理的强自反性与稳定性一起被证明是对应的lambda代数的公理化由于Selinger [J.函数编程,12(6),549 - 566,2002]。
英文摘要:
We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable counterpart of combinatory models. This new structure, called strongly reflexive combinatory algebra, admits a finite axiomatisation with seven closed equations, and the structure is shown to be exactly the retract of combinatory models. Lambda algebras can be characterised as strongly reflexive combinatory algebras which are stable. Moreover, there is a canonical construction of a lambda algebra from a strongly reflexive combinatory algebra. The resulting axiomatisation of lambda algebras by the seven axioms for strong reflexivity together with those for stability is shown to correspond to the axiomatisation of lambda algebras due to Selinger [J.Funct.Programming, 12(6), 549--566, 2002].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。