Abstract
Recent developments in the categorical foundations of universal algebra have given an impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's representation theorem is then completely natural and leads to a precise Fundamental Theorem showing the essential equivalence between the categorical and more familiar notions.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Braids, Twists, Trace and Duality in Combinatory Algebras;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Clones, closed categories, and combinatory logic;Lecture Notes in Computer Science;2024
3. Modular Models of Monoids with Operations;Proceedings of the ACM on Programming Languages;2023-08-30
4. Why Are Proofs Relevant in Proof-Relevant Models?;Proceedings of the ACM on Programming Languages;2023-01-09
5. On Strictifying Extensional Reflexivity in Compact Closed Categories;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023